Package java.util

Examples of java.util.LinkedList.subList()

48
49
50
51
52
53
54
55
56
57
58
    new Support_ListTest("", ll).runTest();

    LinkedList subList = new LinkedList();
    for (int i = -50; i < 150; i++)
      subList.add(new Integer(i));
    new Support_ListTest("", subList.subList(50, 150)).runTest();
  }

  /**
   * @tests java.util.LinkedList#LinkedList(java.util.Collection)
   */
 
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
            // So in our case we are seraching for [b, a, c, d, b]
            final String label = ( String ) cycleStack.getFirst();

            final int pos = cycleStack.lastIndexOf( label );

            final List cycle = cycleStack.subList( 0, pos + 1 );

            Collections.reverse( cycle );

            return cycle;
        }
View Full Code Here
599
600
601
602
603
604
605
606
607
608
609
      for (int i = 0; i < sample.numInstances(); i++) {
  extraIndices.add(i);
      }
    }
    Collections.shuffle(extraIndices, rand);
    extraIndices = extraIndices.subList(0, extraIndicesCount);
    Set extraIndexSet = new HashSet(extraIndices);

    // the main loop to handle computing nearest neighbors and generating SMOTE
    // examples from each instance in the original minority class data
    Instance[] nnArray = new Instance[nearestNeighbors];
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
            // So in our case we are seraching for [b, a, c, d, b]
            final String label = (String) cycleStack.getFirst();

            final int pos = cycleStack.lastIndexOf( label );

            final List cycle = cycleStack.subList( 0, pos + 1 );

            Collections.reverse( cycle );

            return cycle;
        }
View Full Code Here
343
344
345
346
347
348
349
350
351
352
353
         Collections.sort(uf, new UserEntryComparator());

         if (offset + limit <= size)
         {
            return processUsers(uf.subList(offset, offset + limit));
         }
         else if (offset >= size)
         {
            return new HashSet();
         }
View Full Code Here
350
351
352
353
354
355
356
357
358
359
360
         else if (offset >= size)
         {
            return new HashSet();
         }

         return processUsers(uf.subList(offset, size));
      }
      catch (NoSuchElementException e)
      {
         log.debug("No users found", e);
      }
View Full Code Here
327
328
329
330
331
332
333
334
335
336
337
         Collections.sort(uf, new UserEntryComparator());

         if (offset + limit <= size)
         {
            return processUsers(uf.subList(offset, offset + limit));
         }
         else if (offset >= size)
         {
            return new HashSet();
         }
View Full Code Here
334
335
336
337
338
339
340
341
342
343
344
         else if (offset >= size)
         {
            return new HashSet();
         }

         return processUsers(uf.subList(offset, size));
      }
      catch (NoSuchElementException e)
      {
         log.debug("No users found", e);
      }
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
         Collections.sort(uf, new UserEntryComparator());

         if (offset + limit <= size)
         {
            return processUsers(uf.subList(offset, offset + limit));
         }
         else if (offset >= size)
         {
            return new HashSet();
         }
View Full Code Here
179
180
181
182
183
184
185
186
187
188
189
         else if (offset >= size)
         {
            return new HashSet();
         }

         return processUsers(uf.subList(offset, size));
      }
      catch (NoSuchElementException e)
      {
         log.debug("No users found", e);
      }
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.