Package com.carrotsearch.hppc

Examples of com.carrotsearch.hppc.IntOpenHashSet.toArray()

1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
   * @return an array of IDs from the subtree of this node, including the ID of this node.
   */
  public int[] getSubIdArray()
  {
    IntOpenHashSet set = getSubIdSet();
    int[] list = set.toArray();
    Arrays.sort(list);
   
    return list;
  }
 
View Full Code Here
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
   * @return an array of IDs from the subtree of this node, including the ID of this node.
   */
  public int[] getSubIdArray()
  {
    IntOpenHashSet set = getSubIdSet();
    int[] list = set.toArray();
    Arrays.sort(list);
   
    return list;
  }
 
View Full Code Here
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
   * @return an array of IDs from the subtree of this node, including the ID of this node.
   */
  public int[] getSubIdArray()
  {
    IntOpenHashSet set = getSubIdSet();
    int[] list = set.toArray();
    Arrays.sort(list);
   
    return list;
  }
 
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
   * @return the sorted list of terminal IDs belonging to this argument give the specific tree.
   */
  public int[] getSortedTerminalIdList(CTTree tree)
  {
    IntOpenHashSet set = getTerminalIdSet(tree);
    int[] ids = set.toArray();
   
    Arrays.sort(ids);
    return ids;
  }
 
View Full Code Here
150
151
152
153
154
155
156
157
158
159
160
    IntOpenHashSet sArg = arg .getSubIdSet();
   
    if (pred.isDescendentOf(arg))
      sArg.removeAll(pred.getSubIdSet());     
   
    int[] span = sArg.toArray();
    return span;
  }
 
  static public void main(String[] args)
  {
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
        {
          build.append("_");
        }
        else
        {
          indices = set.toArray();
          Arrays.sort(indices);
          build.append("tpc=");
          build.append(UTArray.join(indices, ","));
        }
       
View Full Code Here
361
362
363
364
365
366
367
368
369
370
371
                    if(parser.nextToken() == Token.START_ARRAY) {
                        IntOpenHashSet precisions = new IntOpenHashSet();
                        while(parser.nextToken() != Token.END_ARRAY) {
                            precisions.add(parsePrecision(parser));
                        }
                        precision = precisions.toArray();
                    } else {
                        precision = new int[] { parsePrecision(parser) };
                    }
                } else if (FIELD_VALUE.equals(fieldName)) {
                    if(Double.isNaN(lon) && Double.isNaN(lat)) {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.