Package com.carrotsearch.hppc.procedures

Examples of com.carrotsearch.hppc.procedures.IntProcedure

45
46
47
48
49
50
51
52
53
54
55
        // Deques also support iteration through [type]Procedure interfaces.
        // The apply() method will be called once for each element in the deque.
       
        // Iteration from head to tail
        deque.forEach(new IntProcedure()
        {
            public void apply(int value)
            {
                System.out.println(value);
            }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
        // [[[start:iteration-lists-using-procedures]]]
        final IntArrayList list = prepare(10);

        // Lists also support iteration through [type]Procedure interfaces.
        // The apply() method will be called once for each element in the list.
        list.forEach(new IntProcedure()
        {
            public void apply(int value)
            {
                System.out.println(value);
            }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
        // Sets also support iteration through [type]Procedure interfaces.
        // The apply() method will be called once for each element in the set.
       
        // Iteration from head to tail
        set.forEach(new IntProcedure()
        {
            public void apply(int value)
            {
                System.out.println(value);
            }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
    /* */
    @Test
    public void testWithProcedureClosure()
    {
        final IntHolder count = new IntHolder();
        list.forEach(new IntProcedure() {
            public void apply(int v)
            {
                if (v != defValue)
                    count.value++;
            }
View Full Code Here
489
490
491
492
493
494
495
496
497
498
499
    public void testForEachWithProcedure()
    {
        deque.addLast(sequence);

        final IntHolder count = new IntHolder();
        ((IntArrayDeque) deque).forEach(new IntProcedure() {
            int index = 0;
            public void apply(int v)
            {
                assertEquals2(sequence.buffer[index++], v);
                count.value++;
View Full Code Here
508
509
510
511
512
513
514
515
516
517
518
    public void testDescendingForEachWithProcedure()
    {
        deque.addLast(sequence);

        final IntHolder count = new IntHolder();
        ((IntArrayDeque) deque).descendingForEach(new IntProcedure() {
            int index = sequence.size();
            public void apply(int v)
            {
                assertEquals2(sequence.buffer[--index], v);
                count.value++;
View Full Code Here
TOP

Related Classes of com.carrotsearch.hppc.procedures.IntProcedure

  • com.carrotsearch.hppc.examples.IteratingOverDeques
  • com.carrotsearch.hppc.examples.IteratingOverLists
  • com.carrotsearch.hppc.examples.IteratingOverSets
  • com.carrotsearch.hppc.IntArrayDequeTest
  • com.carrotsearch.hppc.IntArrayListBenchmark
    • 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.