Package gnu.trove.iterator

Examples of gnu.trove.iterator.TIntIterator

258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
            indexes.sort();

            int start = data.size();
            indexer.put(vecid, start);
            lengths.put(vecid, indexes.size() * 2);
            TIntIterator iter = indexes.iterator();
            if (max < accumuFactor * sparseFactor) {
                while (iter.hasNext()) {
                    int key = iter.next();
                    float value = results.get(key);
                    data.add(key);
                    data.add(value);
                }
            } else {
                while (iter.hasNext()) {
                    int key = iter.next();
                    float value = results.get(key) * accumuFactor / max;
                    data.add(key);
                    data.add(value);
                }
            }
View Full Code Here
571
572
573
574
575
576
577
578
579
580
581
582
583
        /** {@inheritDoc} */
        public boolean containsAll( TIntCollection collection ) {
            if ( collection == this ) {
                return true;
            }
            TIntIterator iter = collection.iterator();
            while ( iter.hasNext() ) {
                if ( ! TIntObjectHashMap.this.containsKey( iter.next() ) ) {
                    return false;
                }
            }
            return true;
        }
View Full Code Here
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
        }

        /** {@inheritDoc} */
        public boolean retainAll( Collection<?> collection ) {
            boolean modified = false;
            TIntIterator iter = iterator();
            while ( iter.hasNext() ) {
                //noinspection SuspiciousMethodCalls
                if ( ! collection.contains( Integer.valueOf ( iter.next() ) ) ) {
                    iter.remove();
                    modified = true;
                }
            }
            return modified;
        }
View Full Code Here
625
626
627
628
629
630
631
632
633
634
635
636
637
638
        public boolean retainAll( TIntCollection collection ) {
            if ( this == collection ) {
                return false;
            }
            boolean modified = false;
            TIntIterator iter = iterator();
            while ( iter.hasNext() ) {
                if ( ! collection.contains( iter.next() ) ) {
                    iter.remove();
                    modified = true;
                }
            }
            return modified;
        }
View Full Code Here
672
673
674
675
676
677
678
679
680
681
682
683
684
            if ( collection == this ) {
                clear();
                return true;
            }
            boolean changed = false;
            TIntIterator iter = collection.iterator();
            while ( iter.hasNext() ) {
                int element = iter.next();
                if ( remove( element ) ) {
                    changed = true;
                }
            }
            return changed;
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
242
243
    }


    /** {@inheritDoc} */
    public boolean containsAll( TIntCollection collection ) {
        TIntIterator iter = collection.iterator();
        while ( iter.hasNext() ) {
            int element = iter.next();
            if ( ! contains( element ) ) {
                return false;
            }
        }
        return true;
View Full Code Here
269
270
271
272
273
274
275
276
277
278
279
280
281

    /** {@inheritDoc} */
    public boolean addAll( TIntCollection collection ) {
        boolean changed = false;
        TIntIterator iter = collection.iterator();
        while ( iter.hasNext() ) {
            int element = iter.next();
            if ( add( element ) ) {
                changed = true;
            }
        }
        return changed;
View Full Code Here
296
297
298
299
300
301
302
303
304
305
306
307
308
309
    /** {@inheritDoc} */
    @SuppressWarnings({"SuspiciousMethodCalls"})
    public boolean retainAll( Collection<?> collection ) {
        boolean modified = false;
      TIntIterator iter = iterator();
      while ( iter.hasNext() ) {
          if ( ! collection.contains( Integer.valueOf ( iter.next() ) ) ) {
            iter.remove();
            modified = true;
          }
      }
      return modified;
    }
View Full Code Here
313
314
315
316
317
318
319
320
321
322
323
324
325
326
    public boolean retainAll( TIntCollection collection ) {
        if ( this == collection ) {
            return false;
        }
        boolean modified = false;
      TIntIterator iter = iterator();
      while ( iter.hasNext() ) {
          if ( ! collection.contains( iter.next() ) ) {
            iter.remove();
            modified = true;
          }
      }
      return modified;
    }
View Full Code Here
362
363
364
365
366
367
368
369
370
371
372
373
374

    /** {@inheritDoc} */
    public boolean removeAll( TIntCollection collection ) {
        boolean changed = false;
        TIntIterator iter = collection.iterator();
        while ( iter.hasNext() ) {
            int element = iter.next();
            if ( remove( element ) ) {
                changed = true;
            }
        }
        return changed;
View Full Code Here
TOP

Related Classes of gnu.trove.iterator.TIntIterator

  • cc.redberry.core.tensor.ApplyIndexMapping
  • cc.redberry.core.transformations.substitutions.PrimitiveSubstitution
  • cc.redberry.core.transformations.substitutions.SubstitutionIterator$SumFC
  • com.dsi.parallax.ml.vector.TrovePrimativeMapLinearVector
  • com.guokr.simbase.store.Recommendation
  • com.guokr.simbase.store.SparseVectorSet
  • edu.ucla.sspace.graph.SparseUndirectedEdgeSet
  • edu.ucla.sspace.graph.SubgraphIterator$Extension
  • edu.ucla.sspace.vector.SparseHashIntegerVector
  • edu.ucla.sspace.vector.VectorMath
    • 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.