本文整理了Java中java.lang.String.lastIndexOfSupplementary()方法的一些代码示例，展示了String.lastIndexOfSupplementary()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。String.lastIndexOfSupplementary()方法的具体详情如下：
包路径：java.lang.String
类名称：String
方法名：lastIndexOfSupplementary

String.lastIndexOfSupplementary介绍

暂无

代码示例

代码示例来源：origin: robovm/robovm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: robovm/robovm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}

代码示例来源：origin: MobiVM/robovm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: ibinti/bugvm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: ibinti/bugvm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}

代码示例来源：origin: FlexoVM/flexovm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at the end and moves towards the
 * beginning of this string.
 */
public int lastIndexOf(int c) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, Integer.MAX_VALUE);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  for (int i = _offset + _count - 1; i >= _offset; --i) {
    if (_value[i] == c) {
      return i - _offset;
    }
  }
  return -1;
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}

代码示例来源：origin: MobiVM/robovm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}

代码示例来源：origin: FlexoVM/flexovm

/**
 * Returns the last index of the code point {@code c}, or -1.
 * The search for the character starts at offset {@code start} and moves towards
 * the beginning of this string.
 */
public int lastIndexOf(int c, int start) {
  if (c > 0xffff) {
    return lastIndexOfSupplementary(c, start);
  }
  int _count = count;
  int _offset = offset;
  char[] _value = value;
  if (start >= 0) {
    if (start >= _count) {
      start = _count - 1;
    }
    for (int i = _offset + start; i >= _offset; --i) {
      if (_value[i] == c) {
        return i - _offset;
      }
    }
  }
  return -1;
}