Examples of TLongArrayList

gnu.trove.list.array.TLongArrayList
A resizable, array-backed list of long primitives.

Examples of gnu.trove.list.array.TLongArrayList


        assertEquals( 2, map.size() );


        long[] values = map.values( new long[map.size()] );
        assertEquals( 2, values.length );
        TLongList values_list = new TLongArrayList( values );


        assertTrue( values_list.contains( 1 ) );
        assertTrue( values_list.contains( 2 ) );


        long[] values2 = map.values();
        assertEquals( 2, values2.length );
        TLongList keys_list2 = new TLongArrayList( values2 );


        assertTrue( keys_list2.contains( 1 ) );
        assertTrue( keys_list2.contains( 2 ) );


        int element_count = 20;
        map = new TIntLongHashMap();
        for ( int i = 0; i < element_count; i++ ) {
            map.put( i, i * i );

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

        for ( int i = 1; i <= element_count; i++ ) {
            map.put( i, i * i );
        }


        class ForEach implements TLongProcedure {
            TLongList built = new TLongArrayList();




            public boolean execute( long value ) {
                built.add( value );
                return true;
            }


            TLongList getBuilt() {
                return built;
            }
        }


        ForEach foreach = new ForEach();
        map.forEachValue( foreach );
        TLongList built = foreach.getBuilt();
        TLongList vals = new TLongArrayList( map.values() );
        assertEquals( vals, built );


        built.sort();
        vals.sort();
        assertEquals( vals, built );




        class ForEachFalse implements TLongProcedure {
            TLongList built = new TLongArrayList();




            public boolean execute( long value ) {
                built.add( value );
                return false;
            }


            TLongList getBuilt() {
                return built;
            }
        }


        ForEachFalse foreach_false = new ForEachFalse();
        map.forEachValue( foreach_false );
        built = foreach_false.getBuilt();
        vals = new TLongArrayList( map.values() );
        assertEquals( 1, built.size() );
        assertEquals( vals.get( 0 ), built.get( 0 ) );
    }

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

    public void removeOwner(short node) {
        final boolean trace = LOG.isTraceEnabled();
        final Transaction txn = null;
//        final Transaction txn = env.beginTransaction(null, TransactionConfig.DEFAULT);
//        try {
        TLongArrayList lines = new TLongArrayList();


        final DatabaseEntry sKey = new DatabaseEntry(Shorts.toByteArray(node));
        final DatabaseEntry pKey = new DatabaseEntry();
        final DatabaseEntry data = new DatabaseEntry();


        final SecondaryCursor cursor = ownerIndex.openCursor(txn, null);
        try {
            OperationStatus retVal = cursor.getSearchKey(sKey, pKey, data, LockMode.DEFAULT);
            while (retVal == OperationStatus.SUCCESS) {
                final long id = Longs.fromByteArray(pKey.getData());
                if (trace)
                    LOG.trace("Owner of {}: {} -> 0", id, node);


                lines.add(id); // cursor.getPrimaryDatabase().put(null, pKey, SERVER); - causes deadlock
                retVal = cursor.getNextDup(sKey, pKey, data, LockMode.DEFAULT);
            }
        } finally {
            cursor.close();
        }


        byte[] longArray = new byte[8];
        for (TLongIterator it = lines.iterator(); it.hasNext();) {
            toByteArray(it.next(), longArray);
            pKey.setData(longArray);
            ownerDirectory.put(null, pKey, SERVER);
        }
//            txn.commit();

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

    public void removeOwner(short node) {
        final boolean trace = LOG.isTraceEnabled();
        final Transaction txn = null;
//        final Transaction txn = env.beginTransaction(null, TransactionConfig.DEFAULT);
//        try {
        TLongArrayList lines = new TLongArrayList();


        final DatabaseEntry sKey = new DatabaseEntry(Shorts.toByteArray(node));
        final DatabaseEntry pKey = new DatabaseEntry();
        final DatabaseEntry data = new DatabaseEntry();


        final SecondaryCursor cursor = ownerIndex.openCursor(txn, null);
        try {
            OperationStatus retVal = cursor.getSearchKey(sKey, pKey, data, LockMode.DEFAULT);
            while (retVal == OperationStatus.SUCCESS) {
                final long id = Longs.fromByteArray(pKey.getData());
                if (trace)
                    LOG.trace("Owner of {}: {} -> 0", id, node);


                lines.add(id); // cursor.getPrimaryDatabase().put(null, pKey, SERVER); - causes deadlock
                retVal = cursor.getNextDup(sKey, pKey, data, LockMode.DEFAULT);
            }
        } finally {
            cursor.close();
        }


        byte[] longArray = new byte[8];
        for (TLongIterator it = lines.iterator(); it.hasNext();) {
            toByteArray(it.next(), longArray);
            pKey.setData(longArray);
            ownerDirectory.put(null, pKey, SERVER);
        }
//            txn.commit();

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

    public void removeOwner(short node) {
        final boolean trace = LOG.isTraceEnabled();
        final Transaction txn = null;
//        final Transaction txn = env.beginTransaction(null, TransactionConfig.DEFAULT);
//        try {
        TLongArrayList lines = new TLongArrayList();


        final DatabaseEntry sKey = new DatabaseEntry(Shorts.toByteArray(node));
        final DatabaseEntry pKey = new DatabaseEntry();
        final DatabaseEntry data = new DatabaseEntry();


        try (SecondaryCursor cursor = ownerIndex.openCursor(txn, null)) {
            OperationStatus retVal = cursor.getSearchKey(sKey, pKey, data, LockMode.DEFAULT);
            while (retVal == OperationStatus.SUCCESS) {
                final long id = Longs.fromByteArray(pKey.getData());
                if (trace)
                    LOG.trace("Owner of {}: {} -> 0", id, node);


                lines.add(id); // cursor.getPrimaryDatabase().put(null, pKey, SERVER); - causes deadlock
                retVal = cursor.getNextDup(sKey, pKey, data, LockMode.DEFAULT);
            }
        }


        byte[] longArray = new byte[8];
        for (TLongIterator it = lines.iterator(); it.hasNext();) {
            toByteArray(it.next(), longArray);
            pKey.setData(longArray);
            ownerDirectory.put(null, pKey, SERVER);
        }
//            txn.commit();

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

    public void removeOwner(short node) {
        final boolean trace = LOG.isTraceEnabled();
        final Transaction txn = null;
//        final Transaction txn = env.beginTransaction(null, TransactionConfig.DEFAULT);
//        try {
        TLongArrayList lines = new TLongArrayList();


        final DatabaseEntry sKey = new DatabaseEntry(Shorts.toByteArray(node));
        final DatabaseEntry pKey = new DatabaseEntry();
        final DatabaseEntry data = new DatabaseEntry();


        final SecondaryCursor cursor = ownerIndex.openCursor(txn, null);
        try {
            OperationStatus retVal = cursor.getSearchKey(sKey, pKey, data, LockMode.DEFAULT);
            while (retVal == OperationStatus.SUCCESS) {
                final long id = Longs.fromByteArray(pKey.getData());
                if (trace)
                    LOG.trace("Owner of {}: {} -> 0", id, node);


                lines.add(id); // cursor.getPrimaryDatabase().put(null, pKey, SERVER); - causes deadlock
                retVal = cursor.getNextDup(sKey, pKey, data, LockMode.DEFAULT);
            }
        } finally {
            cursor.close();
        }


        byte[] longArray = new byte[8];
        for (TLongIterator it = lines.iterator(); it.hasNext();) {
            toByteArray(it.next(), longArray);
            pKey.setData(longArray);
            ownerDirectory.put(null, pKey, SERVER);
        }
//            txn.commit();

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

        return result;
    }


    @Override
    public TLongList getAsLongArray() {
        TLongList result = new TLongArrayList(size());
        for (JsonElement element : array) {
            result.add(element.getAsLong());
        }
        return result;
    }

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

        return result;
    }


    @Override
    public TLongList getAsLongArray() {
        TLongList result = new TLongArrayList(data.getLongCount());
        for (int i = 0; i < data.getLongCount(); ++i) {
            result.add(data.getLong(i));
        }
        return result;
    }

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

  private TLongArrayList accumulate;
  private TLongArrayList current;


  public Timer() {
    keys = new TObjectIntHashMap<String>();
    accumulate = new TLongArrayList();
    current = new TLongArrayList();
  }

View Full Code Here

Examples of gnu.trove.list.array.TLongArrayList

      featuresCounters.adjustOrPutValue(features[i], 1, 1);
    }
  }


  private double calculateCategory(String categoryName, String... features) {
    TLongArrayList denomList = new TLongArrayList();
    TLongArrayList numList = new TLongArrayList();


    LongPair pair = new LongPair();
    /*
     * categoryProbability(categoryName, pair); gcd(pair);
     * denomList.add(pair.getSecond()); numList.add(pair.getFirst());
     */
    Category category = categories.get(categoryName);
    for (int i = 0; i < features.length; i++) {
      pair.setFirst(category.featureOccurences(features[i]) + alpha);
      pair.setSecond(featureOccurences(features[i]) + categories.size()
          * alpha);
      gcd(pair);
      numList.add(pair.getFirst());
      denomList.add(pair.getSecond());
    }
    // count the amount of zeros in the lists


    long numerator = 1, denominator = 1;
    for (int i = 0; i < denomList.size(); i++) {
      numerator *= numList.get(i);
      long tmp = MathOperations.gcd(numerator, denominator);
      if (tmp > 1) {
        numerator = numerator / tmp;
        denominator = denominator / tmp;
      }

View Full Code Here

0 1 2

TOP

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.