Package gnu.trove

Examples of gnu.trove.TIntHashSet.toArray()

77
78
79
80
81
82
83
84
85
86
87
        return mean(instances, maxDenseIndex + 1);
      }
    }

    // reaching this statement implies we can create a sparse vector
    return mean(instances, hIndices.toArray());

  }

  /**
   * Returns a <CODE>SparseVector</CODE> whose entries (dense with the given
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
        for(int fi=0;fi<fieldCount;fi++)
          fields[fi][i] = field_occurrences[fi].get(a);
        final TIntHashSet ids = term_blocks.get(a);
        blockfreqs[i] = ids.size();
        this.blockTotal += ids.size();
        final int[] bids = ids.toArray();
        Arrays.sort(bids);
        term2blockids.put(termids[i], bids);
        i++;
        return true;
      }
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
        for(int fi=0;fi<fieldCount;fi++)
          fields[fi][i] = field_occurrences[fi].get(a);
        final TIntHashSet ids = term_blocks.get(a);
        blockfreqs[i] = ids.size();
        this.blockTotal += ids.size();
        final int[] bids = ids.toArray();
        Arrays.sort(bids);
        term2blockids.put(termids[i], bids);
        i++;
        return true;
      }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
        termids[i] = getTermId(a);
        tfs[i] = b;
        final TIntHashSet ids = term_blocks.get(a);
        blockfreqs[i] = ids.size();
        blockTotal += ids.size();
        final int[] bids = ids.toArray();
        Arrays.sort(bids);
        term2blockids.put(termids[i], bids);
        //System.err.println(a+": tid="+termids[i]+" tf="+tfs[i]+" bf="+blockfreqs[i] +" blocks="+Arrays.toString(bids));
        i++;
        return true;
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
        termids[i] = getTermId(a);
        tfs[i] = b;
        final TIntHashSet ids = term_blocks.get(a);
        blockfreqs[i] = ids.size();
        blockTotal += ids.size();
        final int[] bids = ids.toArray();
        Arrays.sort(bids);
        term2blockids.put(termids[i], bids);
        //System.err.println(a+": tid="+termids[i]+" tf="+tfs[i]+" bf="+blockfreqs[i] +" blocks="+Arrays.toString(bids));
        i++;
        return true;
View Full Code Here
448
449
450
451
452
453
454
455
456
457
458
  public static int[] union(int[] arr1, int[] arr2) {
    TIntHashSet set = new TIntHashSet();
    set.addAll(arr1);
    set.addAll(arr2);

    int[] arr = set.toArray();
    Arrays.sort(arr);
   
    return arr;
  }
 
View Full Code Here
298
299
300
301
302
303
304
305
306
307
308
      termIds.add(lee.getValue().getTermId());
      count++;
    }
    assertEquals(NUMBER_UNIQUE_TERMS, count);
    assertEquals(NUMBER_UNIQUE_TERMS, termIds.size());
    assertEquals(0, StaTools.min(termIds.toArray()));
    assertEquals(NUMBER_UNIQUE_TERMS-1, StaTools.max(termIds.toArray()));
    assertTrue("Not all terms found in lexicon as stream", checkFreqs.size() == 0);
    IndexUtil.close(lexIn);
  }
 
View Full Code Here
299
300
301
302
303
304
305
306
307
308
309
      count++;
    }
    assertEquals(NUMBER_UNIQUE_TERMS, count);
    assertEquals(NUMBER_UNIQUE_TERMS, termIds.size());
    assertEquals(0, StaTools.min(termIds.toArray()));
    assertEquals(NUMBER_UNIQUE_TERMS-1, StaTools.max(termIds.toArray()));
    assertTrue("Not all terms found in lexicon as stream", checkFreqs.size() == 0);
    IndexUtil.close(lexIn);
  }
 
 
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
    }
    TIntHashSet items = myMulti.get(key);
    if (items != null) {
      items.remove(value);
      if (items.size() == 1) {
        mySingle.put(key, items.toArray()[0]);
        myMulti.remove(key);
      }
    }
  }
View Full Code Here
71
72
73
74
75
76
77
78
    if (mySingle.containsKey(key)) {
      return new int[]{mySingle.get(key)};
    }
    TIntHashSet items = myMulti.get(key);
    if (items == null) return ArrayUtil.EMPTY_INT_ARRAY;
    return items.toArray();
  }
}
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.