org.antlr.runtime.BitSet.growToInclude()方法的使用及代码示例

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

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

BitSet.growToInclude介绍

[英]Grows the set to a larger number of bits.
[中]将集合增长到更大的位数。

代码示例

代码示例来源:origin: io.virtdata/virtdata-lib-realer

  1. /** or this element into this set (grow as necessary to accommodate) */
  2. public void add(int el) {
  3. int n = wordNumber(el);
  4. if (n >= bits.length) {
  5. growToInclude(el);
  6. }
  7. bits[n] |= bitMask(el);
  8. }

代码示例来源:origin: antlr/antlr3

  1. /** or this element into this set (grow as necessary to accommodate) */
  2. public void add(int el) {
  3. int n = wordNumber(el);
  4. if (n >= bits.length) {
  5. growToInclude(el);
  6. }
  7. bits[n] |= bitMask(el);
  8. }

代码示例来源:origin: antlr/antlr3

  1. /** or this element into this set (grow as necessary to accommodate) */
  2. public void add(int el) {
  3. int n = wordNumber(el);
  4. if (n >= bits.length) {
  5. growToInclude(el);
  6. }
  7. bits[n] |= bitMask(el);
  8. }

代码示例来源:origin: com.impetus.fabric/fabric-jdbc-driver-shaded

  1. /** or this element into this set (grow as necessary to accommodate) */
  2. public void add(int el) {
  3. int n = wordNumber(el);
  4. if (n >= bits.length) {
  5. growToInclude(el);
  6. }
  7. bits[n] |= bitMask(el);
  8. }

代码示例来源:origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.antlr-runtime

  1. /** or this element into this set (grow as necessary to accommodate) */
  2. public void add(int el) {
  3. int n = wordNumber(el);
  4. if (n >= bits.length) {
  5. growToInclude(el);
  6. }
  7. bits[n] |= bitMask(el);
  8. }

代码示例来源:origin: com.ning.billing/killbill-osgi-bundles-analytics

  1. /** or this element into this set (grow as necessary to accommodate) */
  2. public void add(int el) {
  3. int n = wordNumber(el);
  4. if (n >= bits.length) {
  5. growToInclude(el);
  6. }
  7. bits[n] |= bitMask(el);
  8. }

相关文章