Package cern.colt.list

Examples of cern.colt.list.IntArrayList

821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
                    throw new AssertionError("BG and HSS should be isomorphic");
                }
               
                //  Shift each vertex of the tier along associated edges to the next tier
               
                IntArrayList keys = basicPrevTierVertices.keys();
                int keysSize = keys.size();
                for (int k = 0; k < keysSize; k++)
                {
                    int tierKeyOfTheVertexToShift = keys.get(k);
   
                    IVertex prevTierVertex = (IVertex) ((OpenIntObjectHashMap) basicGraph.getTiers().get(prevTierIndex)).get(tierKeyOfTheVertexToShift);
   
                    ITripletValue tripletValue = prevTierVertex.getTripletValue();
   
View Full Code Here
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
    {
        IHyperStructure firstHS = (IHyperStructure) hss.get(0);

        final OpenIntObjectHashMap basicTierVertices = (OpenIntObjectHashMap) firstHS.getTiers().get(tierIndex);

        IntArrayList keys = basicTierVertices.keys();
       
        if (LOGGER.isDebugEnabled())
        {
            LOGGER.debug("Tier #{} of HSS contained {} vertices before unification: {}",
                    new Object[] { tierIndex + 1, basicTierVertices.size(), verticesTripletsToString(basicTierVertices) });
        }

        for (int j = 0; j < keys.size(); j++)
        {
            int vertexTierKey = keys.get(j);
           
            //  List of ICompactTripletsStructureHolder
            ObjectArrayList vertices = new ObjectArrayList(hss.size());
           
            for (int i = 0; i < hss.size(); i++)
View Full Code Here
36
37
38
39
40
41
42
43
44
45
    private boolean elementsHashDirty;
    private int elementsHash;
   
    public SimplePermutation()
    {
        permutation = new IntArrayList();
        permutationHash = new OpenIntIntHashMap();
        positionHash = new OpenIntIntHashMap();
        elementsHashDirty = true;
    }
View Full Code Here
50
51
52
53
54
55
56
57
58
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
       
        // internal var name -> original var name
        OpenIntIntHashMap internalToOriginalMap = new OpenIntIntHashMap();
        // original var name -> internal var name
        OpenIntIntHashMap sourceIndices = new OpenIntIntHashMap();
        IntArrayList sourceValues = readSourceValues(reader, sourceIndices);
       
        for (int originalVarName : sourceIndices.keys().elements())
        {
            internalToOriginalMap.put(sourceIndices.get(originalVarName), originalVarName);
        }
       
        IntArrayList values = new IntArrayList();

        for (int i = 0; i < sourceValues.size(); i++)
        {
            int sourceVar = sourceValues.get(i);
            if (sourceVar != 0)
            {
                int sign = sourceVar > 0 ? 1 : -1;
                int var = sign * sourceIndices.get(Math.abs(sourceVar));
                values.add(var);
            }
            else
            {
                if(!values.isEmpty())
                {
                    addTriplets(internalToOriginalMap, values);
                    values.clear();
                }
            }
        }
       
        formula.setVarMappings(internalToOriginalMap);
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

    private IntArrayList readSourceValues(BufferedReader reader, OpenIntIntHashMap sourceIndices)
            throws IOException
    {
        IntArrayList sourceValues = new IntArrayList();
        OpenIntIntHashMap originalVarNames = new OpenIntIntHashMap();
       
        int sign = 1;
        int r = 0;
        int ch;
        while ((ch = reader.read()) != -1)
        {
            if (Character.isWhitespace(ch))
            {
                if (r != 0)
                {
                    originalVarNames.put(r, r);
                    r = r * sign;
                    sourceValues.add(r);
                   
                    r = 0;
                    sign = 1;
                }
                continue;
            }
            if (ch == '0' && r == 0)
            {
                sourceValues.add(0);
                continue;
            }
            if (ch == '-')
            {
                sign = -1;
            }

            if ('0' <= ch && ch < '0' + 10)
            {
                r = r * 10 + ch - '0';
            }
        }
       
        IntArrayList sortedVarNames = originalVarNames.keys();
        sortedVarNames.sort();
        for (int i = 0; i < sortedVarNames.size(); i++)
        {
            sourceIndices.put(sortedVarNames.get(i), i + 1);
        }
       
        return sourceValues;
    }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
    public boolean remove(int value) {
        return super.removeKey(value);
    }

    public int[] getAll() {
        IntArrayList keys = new IntArrayList(size());
        keys(keys);
        assert keys.size() == size() : keys.size() + " vs " + size();
        int[] all = keys.elements();
        assert all.length == size();
        return all;
    }
View Full Code Here
189
190
191
192
193
194
195
196
197
* This method can be used to iterate over the keys of the receiver.
*
* @return the keys.
*/
public IntArrayList keys() {
  IntArrayList list = new IntArrayList(size());
  keys(list);
  return list;
}
View Full Code Here
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
/**
* Returns a string representation of the receiver, containing
* the String representation of each key-value pair, sorted ascending by key.
*/
public String toString() {
  IntArrayList theKeys = keys();
  theKeys.sort();

  StringBuffer buf = new StringBuffer();
  buf.append("[");
  int maxIndex = theKeys.size() - 1;
  for (int i = 0; i <= maxIndex; i++) {
    int key = theKeys.get(i);
      buf.append(String.valueOf(key));
    buf.append("->");
      buf.append(String.valueOf(get(key)));
    if (i < maxIndex) buf.append(", ");
  }
View Full Code Here
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
/**
* Returns a string representation of the receiver, containing
* the String representation of each key-value pair, sorted ascending by value, according to natural ordering.
*/
public String toStringByValue() {
  IntArrayList theKeys = new IntArrayList();
  keysSortedByValue(theKeys);

  StringBuffer buf = new StringBuffer();
  buf.append("[");
  int maxIndex = theKeys.size() - 1;
  for (int i = 0; i <= maxIndex; i++) {
    int key = theKeys.get(i);
      buf.append(String.valueOf(key));
    buf.append("->");
      buf.append(String.valueOf(get(key)));
    if (i < maxIndex) buf.append(", ");
  }
View Full Code Here
228
229
230
231
232
233
234
* <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt>
*
* @param keyList the list to be filled, can have any size.
*/
public void keysSortedByValue(final LongArrayList keyList) {
  pairsSortedByValue(keyList, new IntArrayList(size()));
}
View Full Code Here
TOP

Related Classes of cern.colt.list.IntArrayList

  • cern.colt.buffer.IntBuffer
  • cern.colt.buffer.IntBuffer2D
  • cern.colt.buffer.IntBuffer3D
  • cern.colt.map.AbstractDoubleIntMap
  • cern.colt.map.AbstractIntDoubleMap
  • cern.colt.map.AbstractIntIntMap
  • cern.colt.map.AbstractIntObjectMap
  • cern.colt.map.AbstractLongIntMap
  • cern.colt.matrix.DoubleMatrix1D
  • cern.colt.matrix.DoubleMatrix2D
    • 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.