java.util.BitSet.wordIndex()方法的使用及代码示例

x33g5p2x  于2022-01-16 转载在 其他  
字(9.1k)|赞(0)|评价(0)|浏览(191)

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

BitSet.wordIndex介绍

[英]Given a bit index, return word index containing it.
[中]给定位索引，返回包含它的单词索引。

代码示例

代码示例来源：origin: jtulach/bck2brwsr

  1. private void initWords(int nbits) {
  2.   words = new long[wordIndex(nbits-1) + 1];
  3. }

代码示例来源：origin: org.apidesign.bck2brwsr/emul

  1. private void initWords(int nbits) {
  2.   words = new long[wordIndex(nbits-1) + 1];
  3. }

代码示例来源：origin: org.apidesign.bck2brwsr/emul

  1. /**
  2.  * Returns the value of the bit with the specified index. The value
  3.  * is {@code true} if the bit with the index {@code bitIndex}
  4.  * is currently set in this {@code BitSet}; otherwise, the result
  5.  * is {@code false}.
  6.  *
  7.  * @param  bitIndex   the bit index
  8.  * @return the value of the bit with the specified index
  9.  * @throws IndexOutOfBoundsException if the specified index is negative
  10.  */
  11. public boolean get(int bitIndex) {
  12.   if (bitIndex < 0)
  13.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  14.   checkInvariants();
  15.   int wordIndex = wordIndex(bitIndex);
  16.   return (wordIndex < wordsInUse)
  17.     && ((words[wordIndex] & (1L << bitIndex)) != 0);
  18. }

代码示例来源：origin: jtulach/bck2brwsr

  1. /**
  2.  * Returns the value of the bit with the specified index. The value
  3.  * is {@code true} if the bit with the index {@code bitIndex}
  4.  * is currently set in this {@code BitSet}; otherwise, the result
  5.  * is {@code false}.
  6.  *
  7.  * @param  bitIndex   the bit index
  8.  * @return the value of the bit with the specified index
  9.  * @throws IndexOutOfBoundsException if the specified index is negative
  10.  */
  11. public boolean get(int bitIndex) {
  12.   if (bitIndex < 0)
  13.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  14.   checkInvariants();
  15.   int wordIndex = wordIndex(bitIndex);
  16.   return (wordIndex < wordsInUse)
  17.     && ((words[wordIndex] & (1L << bitIndex)) != 0);
  18. }

代码示例来源：origin: org.apidesign.bck2brwsr/emul

  1. /**
  2.  * Returns the index of the first bit that is set to {@code false}
  3.  * that occurs on or after the specified starting index.
  4.  *
  5.  * @param  fromIndex the index to start checking from (inclusive)
  6.  * @return the index of the next clear bit
  7.  * @throws IndexOutOfBoundsException if the specified index is negative
  8.  * @since  1.4
  9.  */
  10. public int nextClearBit(int fromIndex) {
  11.   // Neither spec nor implementation handle bitsets of maximal length.
  12.   // See 4816253.
  13.   if (fromIndex < 0)
  14.     throw new IndexOutOfBoundsException("fromIndex < 0: " + fromIndex);
  15.   checkInvariants();
  16.   int u = wordIndex(fromIndex);
  17.   if (u >= wordsInUse)
  18.     return fromIndex;
  19.   long word = ~words[u] & (WORD_MASK << fromIndex);
  20.   while (true) {
  21.     if (word != 0)
  22.       return (u * BITS_PER_WORD) + Long.numberOfTrailingZeros(word);
  23.     if (++u == wordsInUse)
  24.       return wordsInUse * BITS_PER_WORD;
  25.     word = ~words[u];
  26.   }
  27. }

代码示例来源：origin: jtulach/bck2brwsr

  1. /**
  2.  * Returns the index of the first bit that is set to {@code false}
  3.  * that occurs on or after the specified starting index.
  4.  *
  5.  * @param  fromIndex the index to start checking from (inclusive)
  6.  * @return the index of the next clear bit
  7.  * @throws IndexOutOfBoundsException if the specified index is negative
  8.  * @since  1.4
  9.  */
  10. public int nextClearBit(int fromIndex) {
  11.   // Neither spec nor implementation handle bitsets of maximal length.
  12.   // See 4816253.
  13.   if (fromIndex < 0)
  14.     throw new IndexOutOfBoundsException("fromIndex < 0: " + fromIndex);
  15.   checkInvariants();
  16.   int u = wordIndex(fromIndex);
  17.   if (u >= wordsInUse)
  18.     return fromIndex;
  19.   long word = ~words[u] & (WORD_MASK << fromIndex);
  20.   while (true) {
  21.     if (word != 0)
  22.       return (u * BITS_PER_WORD) + Long.numberOfTrailingZeros(word);
  23.     if (++u == wordsInUse)
  24.       return wordsInUse * BITS_PER_WORD;
  25.     word = ~words[u];
  26.   }
  27. }

代码示例来源：origin: junkdog/artemis-odb

  1. private static boolean get(JsArrayInteger array, int bitIndex) {
  2.   // retrieve the bits for the given index
  3.   int word = getWord(array, wordIndex(bitIndex));
  4.   // shift and mask the bit out
  5.   return ((word >>> (bitOffset(bitIndex))) & 1) == 1;
  6. }

代码示例来源：origin: org.apidesign.bck2brwsr/emul

  1. /**
  2.  * Sets the bit at the specified index to {@code true}.
  3.  *
  4.  * @param  bitIndex a bit index
  5.  * @throws IndexOutOfBoundsException if the specified index is negative
  6.  * @since  JDK1.0
  7.  */
  8. public void set(int bitIndex) {
  9.   if (bitIndex < 0)
  10.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  11.   int wordIndex = wordIndex(bitIndex);
  12.   expandTo(wordIndex);
  13.   words[wordIndex] |= (1L << bitIndex); // Restores invariants
  14.   checkInvariants();
  15. }

代码示例来源：origin: jtulach/bck2brwsr

  1. /**
  2.  * Sets the bit at the specified index to {@code true}.
  3.  *
  4.  * @param  bitIndex a bit index
  5.  * @throws IndexOutOfBoundsException if the specified index is negative
  6.  * @since  JDK1.0
  7.  */
  8. public void set(int bitIndex) {
  9.   if (bitIndex < 0)
  10.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  11.   int wordIndex = wordIndex(bitIndex);
  12.   expandTo(wordIndex);
  13.   words[wordIndex] |= (1L << bitIndex); // Restores invariants
  14.   checkInvariants();
  15. }

代码示例来源：origin: jtulach/bck2brwsr

  1. /**
  2.  * Sets the bit specified by the index to {@code false}.
  3.  *
  4.  * @param  bitIndex the index of the bit to be cleared
  5.  * @throws IndexOutOfBoundsException if the specified index is negative
  6.  * @since  JDK1.0
  7.  */
  8. public void clear(int bitIndex) {
  9.   if (bitIndex < 0)
  10.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  11.   int wordIndex = wordIndex(bitIndex);
  12.   if (wordIndex >= wordsInUse)
  13.     return;
  14.   words[wordIndex] &= ~(1L << bitIndex);
  15.   recalculateWordsInUse();
  16.   checkInvariants();
  17. }

代码示例来源：origin: org.apidesign.bck2brwsr/emul

  1. /**
  2.  * Sets the bit specified by the index to {@code false}.
  3.  *
  4.  * @param  bitIndex the index of the bit to be cleared
  5.  * @throws IndexOutOfBoundsException if the specified index is negative
  6.  * @since  JDK1.0
  7.  */
  8. public void clear(int bitIndex) {
  9.   if (bitIndex < 0)
  10.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  11.   int wordIndex = wordIndex(bitIndex);
  12.   if (wordIndex >= wordsInUse)
  13.     return;
  14.   words[wordIndex] &= ~(1L << bitIndex);
  15.   recalculateWordsInUse();
  16.   checkInvariants();
  17. }

代码示例来源：origin: junkdog/artemis-odb

  1. public BitSet(int nbits) {
  2.   this();
  3.   // throw an exception to be consistent
  4.   // but (do we want to be consistent?)
  5.   if (nbits < 0) {
  6.     throw new NegativeArraySizeException("nbits < 0: " + nbits);
  7.   }
  8.   // even though the array's length is loosely kept to that of Sun's
  9.   // "logical
  10.   // length," this might help in some cases where code uses size() to fill
  11.   // in
  12.   // bits after constructing a BitSet, or after having one passed in as a
  13.   // parameter.
  14.   setLengthWords(array, wordIndex(nbits + 31));
  15. }

代码示例来源：origin: junkdog/artemis-odb

  1. private static void clear(JsArrayInteger array, int bitIndex) {
  2.   int index = wordIndex(bitIndex);
  3.   int word = getWord(array, index);
  4.   if (word != 0) {
  5.     // mask the correct bit out
  6.     setWord(array, index, word & ~(1 << (bitOffset(bitIndex))));
  7.   }
  8. }

代码示例来源：origin: org.apidesign.bck2brwsr/emul

  1. /**
  2.  * Sets the bit at the specified index to the complement of its
  3.  * current value.
  4.  *
  5.  * @param  bitIndex the index of the bit to flip
  6.  * @throws IndexOutOfBoundsException if the specified index is negative
  7.  * @since  1.4
  8.  */
  9. public void flip(int bitIndex) {
  10.   if (bitIndex < 0)
  11.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  12.   int wordIndex = wordIndex(bitIndex);
  13.   expandTo(wordIndex);
  14.   words[wordIndex] ^= (1L << bitIndex);
  15.   recalculateWordsInUse();
  16.   checkInvariants();
  17. }

代码示例来源：origin: jtulach/bck2brwsr

  1. /**
  2.  * Sets the bit at the specified index to the complement of its
  3.  * current value.
  4.  *
  5.  * @param  bitIndex the index of the bit to flip
  6.  * @throws IndexOutOfBoundsException if the specified index is negative
  7.  * @since  1.4
  8.  */
  9. public void flip(int bitIndex) {
  10.   if (bitIndex < 0)
  11.     throw new IndexOutOfBoundsException("bitIndex < 0: " + bitIndex);
  12.   int wordIndex = wordIndex(bitIndex);
  13.   expandTo(wordIndex);
  14.   words[wordIndex] ^= (1L << bitIndex);
  15.   recalculateWordsInUse();
  16.   checkInvariants();
  17. }

代码示例来源：origin: junkdog/artemis-odb

  1. private static void set(JsArrayInteger array, int bitIndex) {
  2.   int index = wordIndex(bitIndex);
  3.   array.set(index, getWord(array, index) | (1 << (bitOffset(bitIndex))));
  4. }

代码示例来源：origin: junkdog/artemis-odb

  1. private static void flip(JsArrayInteger array, int bitIndex) {
  2.   // calculate index and offset
  3.   int index = wordIndex(bitIndex);
  4.   int offset = bitOffset(bitIndex);
  5.   // figure out if the bit is on or off
  6.   int word = getWord(array, index);
  7.   if (((word >>> offset) & 1) == 1) {
  8.     // if on, turn it off
  9.     setWord(array, index, word & ~(1 << offset));
  10.   } else {
  11.     // if off, turn it on
  12.     array.set(index, word | (1 << offset));
  13.   }
  14. };

代码示例来源：origin: junkdog/artemis-odb

  1. private static void set(JsArrayInteger array, int fromIndex, int toIndex) {
  2.   int first = wordIndex(fromIndex);
  3.   int last = wordIndex(toIndex);
  4.   int startBit = bitOffset(fromIndex);
  5.   int endBit = bitOffset(toIndex);
  6.   if (first == last) {
  7.     // set the bits in between first and last
  8.     maskInWord(array, first, startBit, endBit);
  9.   } else {
  10.     // set the bits from fromIndex to the next 32 bit boundary
  11.     if (startBit != 0) {
  12.       maskInWord(array, first++, startBit, 32);
  13.     }
  14.     // set the bits from the last 32 bit boundary to the toIndex
  15.     if (endBit != 0) {
  16.       maskInWord(array, last, 0, endBit);
  17.     }
  18.     //
  19.     // set everything in between
  20.     //
  21.     for (int i = first; i < last; i++) {
  22.       array.set(i, 0xffffffff);
  23.     }
  24.   }
  25. }

代码示例来源：origin: junkdog/artemis-odb

  1. public int nextClearBit(int fromIndex) {
  2.   checkIndex(fromIndex);
  3.   int index = wordIndex(fromIndex);
  4.   // special case for first index
  5.   int fromBit = fromIndex - (bitIndex(index));
  6.   int word = getWord(array, index);
  7.   for (int i = fromBit; i < 32; i++) {
  8.     if ((word & (1 << i)) == 0) {
  9.       return (bitIndex(index)) + i;
  10.     }
  11.   }
  12.   // loop through the rest
  13.   while (true) {
  14.     index++;
  15.     word = getWord(array, index);
  16.     if (word != 0xffffffff) {
  17.       return (bitIndex(index)) + Integer.numberOfTrailingZeros(~word);
  18.     }
  19.   }
  20. }

代码示例来源：origin: junkdog/artemis-odb

  1. public int nextSetBit(int fromIndex) {
  2.   checkIndex(fromIndex);
  3.   int index = wordIndex(fromIndex);
  4.   // check the current word
  5.   int word = getWord(array, index);
  6.   if (word != 0) {
  7.     for (int i = bitOffset(fromIndex); i < 32; i++) {
  8.       if ((word & (1 << i)) != 0) {
  9.         return (bitIndex(index)) + i;
  10.       }
  11.     }
  12.   }
  13.   index++;
  14.   // find the next set word
  15.   trimToSize(array);
  16.   index = nextSetWord(array, index);
  17.   if (index == -1) {
  18.     return -1;
  19.   }
  20.   // return the next set bit
  21.   return (bitIndex(index))
  22.       + Integer.numberOfTrailingZeros(array.get(index));
  23. };

内容来源于网络，如有侵权，请联系作者删除！

BitSet

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com