Package gnu.trove.iterator

Examples of gnu.trove.iterator.TIntIterator

161
162
163
164
165
166
167
168
169
170
171
172
173
     * vector changes.
     */
    @Override public double magnitude() {
        if (magnitude < 0) {
            magnitude = 0;
            TIntIterator iter = map.valueCollection().iterator();
            while (iter.hasNext()) {
                int i = iter.next();
                magnitude += i*i;
            }
            magnitude = Math.sqrt(magnitude);
        }
        return magnitude;
View Full Code Here
541
542
543
544
545
546
547
548
549
550
551
552
553
            }

            // The remaining non-zero values in left should be zero'd out
            // because they were effectively multiplied by zero by the right
            // vector.
            TIntIterator iter = lnz.iterator();
            while (iter.hasNext())
                left.set(iter.next(), 0);
        }
        else {
            int length = left.length();
            for (int i = 0; i < length; ++i)
                left.set(i, left.get(i) * right.get(i));
 
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
258
259
            // Some checking here
            curExtension = extensionStack.peek();
            if (curExtension == null)
                return null;

            TIntIterator iter = curExtension.iterator();
            int w = iter.next();
            iter.remove();
           
            vertsInSubgraph.push(w);
            // The return type of copy() isn't parameterized on the type of the
            // graph itself.  However, we know that all the current interfaces
            // confirm to the convention that the type is refined (narrowed,
View Full Code Here
294
295
296
297
298
299
300
301
302
303
304
305
306
            if (extension.isEmpty())
                return;

            // Choose and remove an aribitrary vertex from the extension           
            TIntIterator iter = extension.iterator();
            Integer w = iter.next();
            iter.remove();

            // The next extension is formed from all edges to vertices whose
            // indices are greater than the currently selected vertex, w,
            // and that point to a vertex in the exclusive neighborhood of
            // w.  The exclusive neighborhood is defined relative to a set
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
359
360
361
362
363
364
365
366
367
368
369
370
371

    /** {@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
411
412
413
414
415
416
417
418
419
420
421
422
423
424
    }

    /** {@inheritDoc} */
    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
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.