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

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

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

BitSet.orInPlace介绍

暂无

代码示例

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

  1. /** return this | a in a new set */
  2. public BitSet or(BitSet a) {
  3.   if ( a==null ) {
  4.     return this;
  5.   }
  6.   BitSet s = (BitSet)this.clone();
  7.   s.orInPlace(a);
  8.   return s;
  9. }

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

  1. /** return this | a in a new set */
  2. public BitSet or(BitSet a) {
  3.   if ( a==null ) {
  4.     return this;
  5.   }
  6.   BitSet s = (BitSet)this.clone();
  7.   s.orInPlace(a);
  8.   return s;
  9. }

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

  1. /** return this | a in a new set */
  2. public BitSet or(BitSet a) {
  3.   if ( a==null ) {
  4.     return this;
  5.   }
  6.   BitSet s = (BitSet)this.clone();
  7.   s.orInPlace(a);
  8.   return s;
  9. }

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

  1. /** return this | a in a new set */
  2. public BitSet or(BitSet a) {
  3.   if ( a==null ) {
  4.     return this;
  5.   }
  6.   BitSet s = (BitSet)this.clone();
  7.   s.orInPlace(a);
  8.   return s;
  9. }

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

  1. /** return this | a in a new set */
  2. public BitSet or(BitSet a) {
  3.   if ( a==null ) {
  4.     return this;
  5.   }
  6.   BitSet s = (BitSet)this.clone();
  7.   s.orInPlace(a);
  8.   return s;
  9. }

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

  1. /** return this | a in a new set */
  2. public BitSet or(BitSet a) {
  3.   if ( a==null ) {
  4.     return this;
  5.   }
  6.   BitSet s = (BitSet)this.clone();
  7.   s.orInPlace(a);
  8.   return s;
  9. }

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

  1. protected BitSet combineFollows(boolean exact) {
  2.   int top = state._fsp;
  3.   BitSet followSet = new BitSet();
  4.   for (int i=top; i>=0; i--) {
  5.     BitSet localFollowSet = state.following[i];
  6.     /*
  7.     System.out.println("local follow depth "+i+"="+
  8.               localFollowSet.toString(getTokenNames())+")");
  9.      */
  10.     followSet.orInPlace(localFollowSet);
  11.     if ( exact ) {
  12.       // can we see end of rule?
  13.       if ( localFollowSet.member(Token.EOR_TOKEN_TYPE) ) {
  14.         // Only leave EOR in set if at top (start rule); this lets
  15.         // us know if have to include follow(start rule); i.e., EOF
  16.         if ( i>0 ) {
  17.           followSet.remove(Token.EOR_TOKEN_TYPE);
  18.         }
  19.       }
  20.       else { // can't see end of rule, quit
  21.         break;
  22.       }
  23.     }
  24.   }
  25.   return followSet;
  26. }

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

  1. protected BitSet combineFollows(boolean exact) {
  2.   int top = state._fsp;
  3.   BitSet followSet = new BitSet();
  4.   for (int i=top; i>=0; i--) {
  5.     BitSet localFollowSet = state.following[i];
  6.     /*
  7.     System.out.println("local follow depth "+i+"="+
  8.               localFollowSet.toString(getTokenNames())+")");
  9.      */
  10.     followSet.orInPlace(localFollowSet);
  11.     if ( exact ) {
  12.       // can we see end of rule?
  13.       if ( localFollowSet.member(Token.EOR_TOKEN_TYPE) ) {
  14.         // Only leave EOR in set if at top (start rule); this lets
  15.         // us know if have to include follow(start rule); i.e., EOF
  16.         if ( i>0 ) {
  17.           followSet.remove(Token.EOR_TOKEN_TYPE);
  18.         }
  19.       }
  20.       else { // can't see end of rule, quit
  21.         break;
  22.       }
  23.     }
  24.   }
  25.   return followSet;
  26. }

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

  1. protected BitSet combineFollows(boolean exact) {
  2.   int top = state._fsp;
  3.   BitSet followSet = new BitSet();
  4.   for (int i=top; i>=0; i--) {
  5.     BitSet localFollowSet = state.following[i];
  6.     /*
  7.     System.out.println("local follow depth "+i+"="+
  8.               localFollowSet.toString(getTokenNames())+")");
  9.      */
  10.     followSet.orInPlace(localFollowSet);
  11.     if ( exact ) {
  12.       // can we see end of rule?
  13.       if ( localFollowSet.member(Token.EOR_TOKEN_TYPE) ) {
  14.         // Only leave EOR in set if at top (start rule); this lets
  15.         // us know if have to include follow(start rule); i.e., EOF
  16.         if ( i>0 ) {
  17.           followSet.remove(Token.EOR_TOKEN_TYPE);
  18.         }
  19.       }
  20.       else { // can't see end of rule, quit
  21.         break;
  22.       }
  23.     }
  24.   }
  25.   return followSet;
  26. }

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

  1. protected BitSet combineFollows(boolean exact) {
  2.   int top = state._fsp;
  3.   BitSet followSet = new BitSet();
  4.   for (int i=top; i>=0; i--) {
  5.     BitSet localFollowSet = state.following[i];
  6.     /*
  7.     System.out.println("local follow depth "+i+"="+
  8.               localFollowSet.toString(getTokenNames())+")");
  9.      */
  10.     followSet.orInPlace(localFollowSet);
  11.     if ( exact ) {
  12.       // can we see end of rule?
  13.       if ( localFollowSet.member(Token.EOR_TOKEN_TYPE) ) {
  14.         // Only leave EOR in set if at top (start rule); this lets
  15.         // us know if have to include follow(start rule); i.e., EOF
  16.         if ( i>0 ) {
  17.           followSet.remove(Token.EOR_TOKEN_TYPE);
  18.         }
  19.       }
  20.       else { // can't see end of rule, quit
  21.         break;
  22.       }
  23.     }
  24.   }
  25.   return followSet;
  26. }

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

  1. protected BitSet combineFollows(boolean exact) {
  2.   int top = state._fsp;
  3.   BitSet followSet = new BitSet();
  4.   for (int i=top; i>=0; i--) {
  5.     BitSet localFollowSet = state.following[i];
  6.     /*
  7.     System.out.println("local follow depth "+i+"="+
  8.               localFollowSet.toString(getTokenNames())+")");
  9.      */
  10.     followSet.orInPlace(localFollowSet);
  11.     if ( exact ) {
  12.       // can we see end of rule?
  13.       if ( localFollowSet.member(Token.EOR_TOKEN_TYPE) ) {
  14.         // Only leave EOR in set if at top (start rule); this lets
  15.         // us know if have to include follow(start rule); i.e., EOF
  16.         if ( i>0 ) {
  17.           followSet.remove(Token.EOR_TOKEN_TYPE);
  18.         }
  19.       }
  20.       else { // can't see end of rule, quit
  21.         break;
  22.       }
  23.     }
  24.   }
  25.   return followSet;
  26. }

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

  1. protected BitSet combineFollows(boolean exact) {
  2.   int top = state._fsp;
  3.   BitSet followSet = new BitSet();
  4.   for (int i=top; i>=0; i--) {
  5.     BitSet localFollowSet = (BitSet)state.following[i];
  6.     /*
  7.     System.out.println("local follow depth "+i+"="+
  8.               localFollowSet.toString(getTokenNames())+")");
  9.      */
  10.     followSet.orInPlace(localFollowSet);
  11.     if ( exact ) {
  12.       // can we see end of rule?
  13.       if ( localFollowSet.member(Token.EOR_TOKEN_TYPE) ) {
  14.         // Only leave EOR in set if at top (start rule); this lets
  15.         // us know if have to include follow(start rule); i.e., EOF
  16.         if ( i>0 ) {
  17.           followSet.remove(Token.EOR_TOKEN_TYPE);
  18.         }
  19.       }
  20.       else { // can't see end of rule, quit
  21.         break;
  22.       }
  23.     }
  24.   }
  25.   return followSet;
  26. }

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

BitSet

相关文章

    查看更多

    热门标签

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

    最新文章

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