Package com.carrotsearch.hppc.mutables

Examples of com.carrotsearch.hppc.mutables.IntHolder

456
457
458
459
460
461
462
463
464
465
466
    /* */
    @Test
    public void testForEachWithProcedure()
    {
        list.add(asArray( 1, 2, 3));
        final IntHolder holder = new IntHolder();
        list.forEach(new KTypeProcedure<KType>() {
            int index = 0;
            public void apply(KType v)
            {
                assertEquals2(v, list.get(index++));
View Full Code Here
475
476
477
478
479
480
481
482
483
484
485
    @Test
    public void testForEachWithProcedure()
    {
        deque.addLast(sequence);

        final IntHolder count = new IntHolder();
        deque.forEach(new KTypeProcedure<KType>() {
            int index = 0;
            public void apply(KType v)
            {
                assertEquals2(sequence.buffer[index++], v);
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
    @Test
    public void testDescendingForEachWithProcedure()
    {
        deque.addLast(sequence);

        final IntHolder count = new IntHolder();
        deque.descendingForEach(new KTypeProcedure<KType>() {
            int index = sequence.size();
            public void apply(KType v)
            {
                assertEquals2(sequence.buffer[--index], v);
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
    {
        final Map<Character, IntHolder> counts = new HashMap<Character, IntHolder>(256);
        for (int i = 0; i < DATA.length; i++)
        {
            final char currentChar = DATA[i];
            final IntHolder currentCount = counts.get(currentChar);
            if (currentCount == null)
            {
                counts.put(currentChar, new IntHolder(1));
            }
            else
            {
                currentCount.value++;
            }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
        final char [] CHARS = DATA;
        final Map<Integer, IntHolder> counts = new HashMap<Integer, IntHolder>();
        for (int i = 0; i < CHARS.length - 1; i++)
        {
            final int bigram = CHARS[i] << 16 | CHARS[i+1];
            final IntHolder currentCount = counts.get(bigram);
            if (currentCount == null)
            {
                counts.put(bigram, new IntHolder(1));
            }
            else
            {
                currentCount.value++;
            }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
    /* */
    @Test
    public void testWithProcedureClosure()
    {
        final IntHolder count = new IntHolder();
        list.forEach(new CharProcedure() {
            public void apply(char v)
            {
                if (v != defValue)
                    count.value++;
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
    /* */
    @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
87
88
89
90
91
92
93
94
95
96
97
    /* */
    @Test
    public void testWithProcedureClosure()
    {
        final IntHolder count = new IntHolder();
        list.forEach(new FloatProcedure() {
            public void apply(float v)
            {
                if (v != defValue)
                    count.value++;
View Full Code Here
488
489
490
491
492
493
494
495
496
497
498
    /* removeIf:applied. */
    public void testForEachWithProcedure()
    {
        deque.addLast(sequence);

        final IntHolder count = new IntHolder();
        ((DoubleArrayDeque) deque).forEach(new DoubleProcedure() {
            int index = 0;
            public void apply(double v)
            {
                assertEquals2(sequence.buffer[index++], v);
View Full Code Here
507
508
509
510
511
512
513
514
515
516
517
    /* removeIf:applied. */
    public void testDescendingForEachWithProcedure()
    {
        deque.addLast(sequence);

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

Related Classes of com.carrotsearch.hppc.mutables.IntHolder

  • com.carrotsearch.hppc.ByteArrayDequeTest
  • com.carrotsearch.hppc.ByteArrayListBenchmark
  • com.carrotsearch.hppc.CharArrayDequeTest
  • com.carrotsearch.hppc.CharArrayListBenchmark
  • com.carrotsearch.hppc.DoubleArrayDequeTest
  • com.carrotsearch.hppc.DoubleArrayListBenchmark
  • com.carrotsearch.hppc.examples.BigramCounting
  • com.carrotsearch.hppc.examples.CharacterCounting
  • com.carrotsearch.hppc.FloatArrayDequeTest
  • com.carrotsearch.hppc.FloatArrayListBenchmark
    • 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.