Package cern.colt.list

Examples of cern.colt.list.LongArrayList


* This method can be used to iterate over the keys of the receiver.
*
* @return the keys.
*/
public LongArrayList keys() {
  LongArrayList list = new LongArrayList(size());
  keys(list);
  return list;
}
View Full Code Here


/**
* Returns a string representation of the receiver, containing
* the String representation of each key-value pair, sorted ascending by key.
*/
public String toString() {
  LongArrayList theKeys = keys();
  theKeys.sort();

  StringBuffer buf = new StringBuffer();
  buf.append("[");
  int maxIndex = theKeys.size() - 1;
  for (int i = 0; i <= maxIndex; i++) {
    long 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

/**
* 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() {
  LongArrayList theKeys = new LongArrayList();
  keysSortedByValue(theKeys);

  StringBuffer buf = new StringBuffer();
  buf.append("[");
  int maxIndex = theKeys.size() - 1;
  for (int i = 0; i <= maxIndex; i++) {
    long 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

* This method can be used to iterate over the keys of the receiver.
*
* @return the keys.
*/
public LongArrayList keys() {
  LongArrayList list = new LongArrayList(size());
  keys(list);
  return list;
}
View Full Code Here

/**
* Returns a string representation of the receiver, containing
* the String representation of each key-value pair, sorted ascending by key.
*/
public String toString() {
  LongArrayList theKeys = keys();
  theKeys.sort();

  StringBuffer buf = new StringBuffer();
  buf.append("[");
  int maxIndex = theKeys.size() - 1;
  for (int i = 0; i <= maxIndex; i++) {
    long 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

/**
* 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() {
  LongArrayList theKeys = new LongArrayList();
  keysSortedByValue(theKeys);

  StringBuffer buf = new StringBuffer();
  buf.append("[");
  int maxIndex = theKeys.size() - 1;
  for (int i = 0; i <= maxIndex; i++) {
    long 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

                //  See VarPairsIndex#addTier() for details of key construction
                int varName1 = (int) (key >> 21);
                int varName2 = (int) (key & 0x1FFFFF);
               
                //  List of formulaAndTierIndices
                LongArrayList tiers = (LongArrayList) value;
                long[] tiersElements = tiers.elements();
                int tierCount = tiers.size();
               
                for (int i = 0; i < tierCount - 1; i++)
                {
                    long formulaAndTierIndex = tiersElements[i];
                    int formulaIndex = (int)(formulaAndTierIndex >> 32);
View Full Code Here

                    throw new AssertionError("Bad hash");
                }
            }

            //  List of formulaAndTierIndices
            LongArrayList tiers = (LongArrayList) pairsToTiersIndex.get(key);
           
            if (tiers == null)
            {
                tiers = new LongArrayList(new long[] {formulaAndTierIndices});
                pairsToTiersIndex.put(key, tiers);
            }
            else
            {
                if (Helper.EnableAssertions)
                {
                    ITier tier = ((ICompactTripletsStructureHolder) cts.get(formulaIndex)).getCTS().getTier(tierIndex);
                    if (!tier.hasVariable(varName1) || !tier.hasVariable(varName2))
                    {
                        throw new IllegalStateException();
                    }
                }
               
                //  Ensure tier will be added only once
                if (tiers.indexOf(formulaAndTierIndices) < 0)
                {
                    tiers.add(formulaAndTierIndices);
                }
            }
        }
View Full Code Here

        /**
         * Remove pairs from index that only belong to single CTS
         */
        public void purge()
        {
            final LongArrayList toBeRemoved = new LongArrayList();
           
            pairsToTiersIndex.forEachPair(new LongObjectProcedure()
            {
                public boolean apply(long key, Object value)
                {
                    //  List of formulaAndTierIndices
                    LongArrayList tiers = (LongArrayList) value;
                    int tiersCount = tiers.size();
                    if (tiersCount < 2)
                    {
                        toBeRemoved.add(key);
                    }
                    else
                    {
                        long formulaAndTierIndex = tiers.getQuick(0);
                        long formulaIndexPart = formulaAndTierIndex & 0xFFFFFFFF00000000L;
                        for (int i = 1; i < tiersCount; i++)
                        {
                            long formulaAndTierIndex2 = tiers.getQuick(i);
                            long formulaIndexPart2 = formulaAndTierIndex2 & 0xFFFFFFFF00000000L;
                            if (formulaIndexPart != formulaIndexPart2)
                            {
                                //  Found distinct formulas
                               
                                //  See VarPairsIndex#addTier() for details of key construction
                                int varName1 = (int) (key >> 21);
                                int varName2 = (int) (key & 0x1FFFFF);
                               
                                addVarNamePair(varName1, key);
                                addVarNamePair(varName2, key);
                               
                                return true;
                            }
                        }
                        //  All triplets are from the same formula
                        toBeRemoved.add(key);
                    }
                    return true;
                }

                private void addVarNamePair(int varName1, long key)
                {
                    LongArrayList pairs = (LongArrayList) varNameToPairsIndex.get(varName1);
                    if (pairs == null)
                    {
                        pairs = new LongArrayList(new long[]{ key });
                        varNameToPairsIndex.put(varName1, pairs);
                    }
                    else
                    {
                        pairs.add(key);
                    }
                }
            });
           
            int size = toBeRemoved.size();
View Full Code Here

            }
        }

        private void addVarName(int varName)
        {
            LongArrayList pairs = fullIndex.getPairs(varName);
           
            if (pairs == null)
            {
                //  There is no any pairs that contain this varName.
                //  No need to add it to the index.
                return;
            }
           
            for (int i = 0; i < pairs.size(); i++)
            {
                long key = pairs.getQuick(i);
                if (!pairsToTiersIndex.containsKey(key))
                {
                    pairsToTiersIndex.put(key, fullIndex.pairsToTiersIndex.get(key));
                }
            }
View Full Code Here

TOP

Related Classes of cern.colt.list.LongArrayList

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.