Package org.apache.mahout.math.list

Examples of org.apache.mahout.math.list.IntArrayList

191
192
193
194
195
196
197
198
199
   * #forEachKey(IntProcedure)}. <p> This method can be used to iterate over the keys of the receiver.
   *
   * @return the keys.
   */
  public IntArrayList keys() {
    IntArrayList list = new IntArrayList(size());
    keys(list);
    return list;
  }
View Full Code Here
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
  /**
   * Returns a string representation of the receiver, containing the String representation of each key-value pair,
   * sorted ascending by key.
   */
  public String toString() {
    IntArrayList theKeys = keys();
    //theKeys.sort();

    StringBuilder buf = new StringBuilder();
    buf.append('[');
    int maxIndex = theKeys.size() - 1;
    for (int i = 0; i <= maxIndex; i++) {
      int key = theKeys.get(i);
      buf.append(String.valueOf(key));
      buf.append("->");
      buf.append(String.valueOf(get(key)));
      if (i < maxIndex) {
        buf.append(", ");
View Full Code Here
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
  /**
   * Returns a string representation of the receiver, containing the String representation of each key-value pair,
   * sorted ascending by value.
   */
  public String toStringByValue() {
    IntArrayList theKeys = new IntArrayList();
    keysSortedByValue(theKeys);

    StringBuilder buf = new StringBuilder();
    buf.append('[');
    int maxIndex = theKeys.size() - 1;
    for (int i = 0; i <= maxIndex; i++) {
      int key = theKeys.get(i);
      buf.append(String.valueOf(key));
      buf.append("->");
      buf.append(String.valueOf(get(key)));
      if (i < maxIndex) {
        buf.append(", ");
View Full Code Here
190
191
192
193
194
195
196
197
198
   * #forEachKey(IntProcedure)}. <p> This method can be used to iterate over the keys of the receiver.
   *
   * @return the keys.
   */
  public IntArrayList keys() {
    IntArrayList list = new IntArrayList(size());
    keys(list);
    return list;
  }
View Full Code Here
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
  /**
   * Returns a string representation of the receiver, containing the String representation of each key-value pair,
   * sorted ascending by key.
   */
  public String toString() {
    IntArrayList theKeys = keys();
    //theKeys.sort();

    StringBuilder buf = new StringBuilder();
    buf.append('[');
    int maxIndex = theKeys.size() - 1;
    for (int i = 0; i <= maxIndex; i++) {
      int key = theKeys.get(i);
      buf.append(String.valueOf(key));
      buf.append("->");
      buf.append(String.valueOf(get(key)));
      if (i < maxIndex) {
        buf.append(", ");
View Full Code Here
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
  /**
   * Returns a string representation of the receiver, containing the String representation of each key-value pair,
   * sorted ascending by value.
   */
  public String toStringByValue() {
    IntArrayList theKeys = new IntArrayList();
    keysSortedByValue(theKeys);

    StringBuilder buf = new StringBuilder();
    buf.append('[');
    int maxIndex = theKeys.size() - 1;
    for (int i = 0; i <= maxIndex; i++) {
      int key = theKeys.get(i);
      buf.append(String.valueOf(key));
      buf.append("->");
      buf.append(String.valueOf(get(key)));
      if (i < maxIndex) {
        buf.append(", ");
View Full Code Here
92
93
94
95
96
97
98
99
100
   * #forEachKey(IntProcedure)}. <p> This method can be used to iterate over the keys of the receiver.
   *
   * @return the keys.
   */
  public IntArrayList keys() {
    IntArrayList list = new IntArrayList(size());
    keys(list);
    return list;
  }
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
  /**
   * Returns a string representation of the receiver, containing the String representation of each key-value pair,
   * sorted ascending by key.
   */
  public String toString() {
    IntArrayList theKeys = keys();
    //theKeys.sort();

    StringBuilder buf = new StringBuilder();
    buf.append('[');
    int maxIndex = theKeys.size() - 1;
    for (int i = 0; i <= maxIndex; i++) {
      int key = theKeys.get(i);
      buf.append(String.valueOf(key));
      if (i < maxIndex) {
        buf.append(", ");
      }
    }
View Full Code Here
35
36
37
38
39
40
41
42
43
  public IntBuffer2D(IntBuffer2DConsumer target, int capacity) {
    this.target = target;
    this.capacity = capacity;
    this.xElements = new int[capacity];
    this.yElements = new int[capacity];
    this.xList = new IntArrayList(xElements);
    this.yList = new IntArrayList(yElements);
    this.size = 0;
  }
View Full Code Here
38
39
40
41
42
43
44
45
46
47
    this.target = target;
    this.capacity = capacity;
    this.xElements = new int[capacity];
    this.yElements = new int[capacity];
    this.zElements = new int[capacity];
    this.xList = new IntArrayList(xElements);
    this.yList = new IntArrayList(yElements);
    this.zList = new IntArrayList(zElements);
    this.size = 0;
  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.list.IntArrayList

  • org.apache.mahout.clustering.meanshift.MeanShiftCanopy
  • org.apache.mahout.common.IntTuple
  • org.apache.mahout.fpm.pfpgrowth.fpgrowth2.FPGrowthIds
  • org.apache.mahout.fpm.pfpgrowth.fpgrowth2.FPTree
  • org.apache.mahout.fpm.pfpgrowth.ParallelFPGrowthMapper
  • org.apache.mahout.fpm.pfpgrowth.ParallelFPGrowthReducer
  • org.apache.mahout.fpm.pfpgrowth.PFPGrowth
  • org.apache.mahout.fpm.pfpgrowth.TransactionTree
  • org.apache.mahout.fpm.pfpgrowth.TransactionTreeIterator
  • org.apache.mahout.fpm.pfpgrowth.TransactionTreeTest
    • Copyright © 2018 www.massapicom. 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.