Package com.carrotsearch.hppc

Examples of com.carrotsearch.hppc.IntArrayDeque$DescendingIterator

1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
   
    st = System.currentTimeMillis();
   
    for (i=0; i<size; i++)
    {
      deque = new IntArrayDeque();
     
      for (j=0; j<len; j++)
        deque.addLast(j);
     
      deque.removeLast();
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
   
    @Test
    public void testWithProcedureClosure()
    {
        // [[[start:iteration-deques-using-procedures]]]
        final IntArrayDeque deque = prepare(10);

        // 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
    @Test
    public void testDirectBufferLoop() throws Exception
    {
        // [[[start:iteration-deques-using-direct-buffer-access]]]
        final IntArrayDeque deque = prepare(10);
       
        // For the fastest iteration, you can access the deque's data buffer directly.
        // Note that this time it's a little more complicated than with array lists.
        final int [] buffer = deque.buffer;
        final int bufferSize = buffer.length;
       
        // Iteration from head to tail
        final int forwardStart = deque.head;
        final int forwardStop = forwardStart + deque.size();
        for (int i = forwardStart; i < forwardStop; i++)
        {
            System.out.println(buffer[i % bufferSize]);
        }
       
        // Iteration from tail to head
        final int backwardStart = deque.tail + bufferSize - 1;
        final int backwardStop = backwardStart - deque.size();
        for (int i = backwardStart; i > backwardStop; i--)
        {
            System.out.println(buffer[i % bufferSize]);
        }
        // [[[end:iteration-deques-using-direct-buffer-access]]]
View Full Code Here
8
9
10
11
12
13
14
15
16
17
18
19
public class IteratingOverDeques
{
    IntArrayDeque prepare(int size)
    {
        final IntArrayDeque deque = new IntArrayDeque(size);
        for (int i = 0; i < size; i++)
        {
            deque.addFirst(i);
        }
        return deque;
    }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
    @Test
    public void testIterableCursor()
    {
        // [[[start:iteration-deques-using-iterator]]]
        // Prepare some deque to iterate over
        final IntArrayDeque deque = prepare(10);
       
        // Deques implement the Iterable interface that returns [type]Cursor elements.
        // The cursor contains the index and value of the current element.
       
        // Please note that the for-each loop as below will always
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
        IArcPredicate arcPredicate, boolean pruneOneNodeSubrgaphs)
    {
        // Find coherent sub-graphs using breadth-first search
        final boolean [] nodesChecked = new boolean [vertexCount];
        final List<IntArrayList> clusterGroups = Lists.newArrayList();
        final IntArrayDeque nodeQueue = new IntArrayDeque();

        for (int i = 0; i < vertexCount; i++)
        {
            if (!nodesChecked[i])
            {
                nodeQueue.clear();
                nodeQueue.addLast(i);
                nodesChecked[i] = true;
                IntArrayList clusterGroup = new IntArrayList();

                while (!nodeQueue.isEmpty())
                {
                    // Get a node from the queue
                    int node = nodeQueue.removeFirst();

                    // Add to the current sub-graph (cluster group)
                    clusterGroup.add(node);

                    // Add all its non-checked neighbors to the queue
                    for (int j = i + 1; j < vertexCount; j++)
                    {
                        if (!nodesChecked[j])
                        {
                            if (arcPredicate.isArcPresent(node, j))
                            {
                                nodeQueue.addLast(j);
                                nodesChecked[j] = true;
                            }
                        }
                    }
                }
View Full Code Here
829
830
831
832
833
834
835
836
837
838
839
   
    st = System.currentTimeMillis();
   
    for (i=0; i<size; i++)
    {
      deque = new IntArrayDeque();
     
      for (j=0; j<len; j++)
        deque.addLast(j);
     
      deque.removeLast();
View Full Code Here
939
940
941
942
943
944
945
946
947
948
949
   
    st = System.currentTimeMillis();
   
    for (i=0; i<size; i++)
    {
      deque = new IntArrayDeque();
     
      for (j=0; j<len; j++)
        deque.addLast(j);
     
      deque.removeLast();
View Full Code Here
TOP

Related Classes of com.carrotsearch.hppc.IntArrayDeque$DescendingIterator

  • com.carrotsearch.hppc.cursors.ByteCursor
  • com.carrotsearch.hppc.cursors.CharCursor
  • com.carrotsearch.hppc.cursors.DoubleCursor
  • com.carrotsearch.hppc.cursors.FloatCursor
  • com.carrotsearch.hppc.cursors.IntCursor
  • com.carrotsearch.hppc.cursors.LongCursor
  • com.carrotsearch.hppc.cursors.ShortCursor
  • com.carrotsearch.hppc.examples.IteratingOverDeques
  • com.carrotsearch.hppc.hash.IntHashFunction
  • com.clearnlp.experiment.Tmp
    • 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.