Examples of ByteArray

ch.epfl.lamp.util.ByteArray
Array of bytes. @author Michel Schinz @version 1.0
com.alibaba.citrus.util.io.ByteArray
代表一个byte数组。 @author Michael Zhou
com.alibaba.common.lang.ByteArray
代表一个byte数组。 @author Michael Zhou @version $Id: ByteArray.java 593 2004-02-26 13:47:19Z baobao $
com.alvazan.orm.api.z8spi.conv.ByteArray
com.android.dx.util.ByteArray
Wrapper for a {@code byte[]}, which provides read-only access and can "reveal" a partial slice of the underlying array. Note: Multibyte accessors all use big-endian order.
com.google.code.com.sun.mail.iap.ByteArray
A simple wrapper around a byte array, with a start position and count of bytes. @author John Mani
com.sun.mail.iap.ByteArray
A simple wrapper around a byte array, with a start position and count of bytes. @author John Mani
gov.niarl.his.webservices.hisPrivacyCAWebServices2.clientWsImport.ByteArray
net.bnubot.util.ByteArray
@author scotta
net.gleamynode.netty.array.ByteArray
A random-accessible sequence of zero or more bytes (octets). This interface provides an abstract view for one or more primitive byte arrays ( {@code byte[]}) and {@linkplain ByteBuffer NIO buffers}.
Index
Unlike an ordinary primitive byte array, {@link ByteArray} allows a negativeindex, which means its {@linkplain #firstIndex() first index} can be eitherless than {@code 0}, equal to {@code 0} or even greater than {@code 0}. Therefore, you should not make an assumption that an array's first index is always {@code 0}. For example, to iterate all bytes over an array one by one, you have to do the following, regardless of the array's implementation detail:
```
 ByteArray array = ...; for (int i = array.firstIndex(); i < array.endIndex(); i ++) { byte b = array.get8(i); System.out.println((char) b); } 
```
Getters and Setters
Various getter and setter methods are provided, from a single byte access method to big and little endian 16 / 24 / 32 / 48 / 64-bit integer access methods. Bulk access operations for primitive byte array, NIO buffer and {@link ByteArray} are also available.
Search operations
{@code indexOf()} and {@code lastIndexOf()} methods help you locate an index of a value which meets a certain criteria. Complicated dynamic sequential search can be done with {@link ByteArrayIndexFinder} as well as simple static single byte search.
I/O operations
{@code copyTo()} methods write the partial or entire content of an array to an {@link OutputStream} or a NIO {@link Channel}. Gathering write operation is performed whenever possible.
Conversion to a NIO buffer
{@code getByteBuffer()} methods return a NIO buffer which is either a wrapper (using {@link ByteBuffer#wrap(byte[])}) or a deep copy (creating a new NIO buffer) of the partial or entire content of an array. These methods will always avoid buffer allocation and memory copy whenever possible, but there's no guarantee that they will always return a wrapper. @author The Netty Project (netty@googlegroups.com) @author Trustin Lee (trustin@gmail.com) @version $Rev: 456 $, $Date: 2008-06-26 10:14:06 +0900 (Thu, 26 Jun 2008) $ @apiviz.landmark
net.imglib2.img.basictypeaccess.array.ByteArray
TODO @author Stephan Preibisch @author Stephan Saalfeld @author Stephan Saalfeld
net.yacy.kelondro.util.ByteArray
this class is a experimental replacement of byte[]. It can be used if a byte[] shall be stored within a HashMap or HashSet which is faster than TreeMap but is generally not possible because storing a byte[] in a Hashtable does not work because the hash computation does not work for byte[]. This class extends byte[] with a cached hashing function, so it can be used in hashtables.
org.activemq.io.util.ByteArray
Simple holder for a an array of Bytes - used instead of a ByteBuffer to avoid unecessary System.array() copies @version $Revision: 1.1.1.1 $
org.activemq.message.util.ByteArray
Simple holder for a an array of Bytes - used instead of a ByteBuffer to avoid unecessary System.array() copies @version $Revision: 1.1.1.1 $
org.apache.axis.utils.ByteArray
Class ByteArray
org.apache.blur.lucene.fst.ByteArray
org.apache.crunch.impl.spark.ByteArray
org.apache.derby.iapi.util.ByteArray
ByteArray wraps java byte arrays (byte[]) to allow byte arrays to be used as keys in hashtables. This is required because the equals function on byte[] directly uses reference equality.
This class also allows the trio of array, offset and length to be carried around as a single object.
org.apache.hadoop.hdfs.util.ByteArray
Wrapper for byte[] to use byte[] as key in HashMap
org.apache.hadoop.io.file.tfile.ByteArray
Adaptor class to wrap byte-array backed objects (including java byte array) as RawComparable objects.
org.apache.hadoop.zebra.tfile.ByteArray
Adaptor class to wrap byte-array backed objects (including java byte array) as RawComparable objects.
org.apache.niolex.notify.ByteArray
Encapsulate raw byte array, to support use as hash map key. Implement {@link #hashCode()}and {@link #equals(Object)} inside. @author Xie, Jiyun @version 1.0.5 @since 2012-12-27
org.apache.uima.jcas.cas.ByteArray
JCas class model for ByteArray
org.codehaus.activemq.message.util.ByteArray
Simple holder for a an array of Bytes - used instead of a ByteBuffer to avoid unecessary System.array() copies @version $Revision: 1.1 $
org.elasticsearch.common.util.ByteArray
Abstraction of an array of byte values.
org.exist.util.ByteArray
org.jbpm.bytes.ByteArray
is a persistable array of bytes. While there is no generic way of storing blobs that is supported by many databases, all databases are able to handle small chunks of bytes properly. It is the responsibility of this class to chop the large byte array into small chunks of 1K (and combine the chunks again in the reverse way). Hibernate will persist the list of byte-chunks in the database. ByteArray is used in process variableInstances and in the file module (that stores the non-parsed process archive files).
org.lilyproject.bytes.api.ByteArray
A utility class providing read only access to a byte[].
Upon construction, the byte[] to be wrapped needs to be given.
This byte[] is copied by the constructor {@link ByteArray#ByteArray(byte[])}to avoid external changes to the byte[] from having an impact.
If the user is absolutely certain a byte[] will not be modified later on, the factory method {@link ByteArray#wrap(byte[])} can be used which will not copythe byte[] but just wrap it.
org.pdfclown.util.ByteArray
fanochizzolini.it) @since 0.0.8 @version 0.1.0
org.sdnplatform.sync.internal.util.ByteArray
A byte array container that provides an equals and hashCode pair based on the contents of the byte array. This is useful as a key for Maps.
org.sonar.duplications.block.ByteArray
Represents hash for {@link Block}. Immutable. TODO Godin: would be better to rename to BlockHash, also maybe we can incorporate it into Block to reduce memory footprint during detection of duplicates
org.tc65sh.util.ByteArray
org.xmlBlaster.util.xbformat.ByteArray
Derived from Suns ByteArrayOutputStream, added method insert() and toByteArray(int len). Removed synchronized - this is not thread save anymore but better performing!

This class implements an output stream in which the data is written into a byte array. The buffer automatically grows as data is written to it. The data can be retrieved using toByteArray() and toString().
Closing a ByteArray has no effect. The methods in this class can be called after the stream has been closed without generating an IOException. @author Arthur van Hoff @version 1.45, 12/03/01 @since JDK1.0
tv.porst.swfretools.parser.structures.ByteArray
Represents a parsed byte array. @author sp
voldemort.utils.ByteArray
A byte array container that provides an equals and hashCode pair based on the contents of the byte array. This is useful as a key for Maps.

Examples of voldemort.utils.ByteArray

    }


    @Test
    public void testGetVersions2ZZZ() throws Exception {
        List<ByteArray> keys = getKeys(2);
        ByteArray key = keys.get(0);
        byte[] value = getValue();
        Store<ByteArray, byte[], byte[]> store = getZonedStore();
        store.put(key, Versioned.value(value), null);
        List<Versioned<byte[]>> versioneds = store.get(key, null);
        List<Version> versions = store.getVersions(key);

View Full Code Here

Examples of voldemort.utils.ByteArray

                continue;


            if(!partitionEntries.containsKey(p))
                partitionEntries.put(p, new HashSet<String>());


            store.put(new ByteArray(key.getBytes()), new Versioned<byte[]>(key.getBytes()), null);
            partitionEntries.get(p).add(key);
        }
    }

View Full Code Here

Examples of voldemort.utils.ByteArray

     */
    private void getAllWithNodeDown(Store<ByteArray, byte[], byte[]> store) throws Exception {


        Map<ByteArray, byte[]> expectedValues = Maps.newHashMap();
        for(byte i = 1; i < 11; ++i) {
            ByteArray key = new ByteArray(new byte[] { i });
            byte[] value = new byte[] { (byte) (i + 50) };
            store.put(key, Versioned.value(value), null);
            expectedValues.put(key, value);
        }


        recordException(failureDetector, cluster.getNodes().iterator().next());


        Map<ByteArray, List<Versioned<byte[]>>> all = store.getAll(expectedValues.keySet(), null);
        assertEquals(expectedValues.size(), all.size());
        for(Map.Entry<ByteArray, List<Versioned<byte[]>>> mapEntry: all.entrySet()) {
            byte[] value = expectedValues.get(mapEntry.getKey());
            assertEquals(new ByteArray(value), new ByteArray(mapEntry.getValue().get(0).getValue()));
        }
    }

View Full Code Here

Examples of voldemort.utils.ByteArray

                                                            failureDetector,
                                                            createConfig(timeoutConfig));
        /* do some puts so we have some data to test getalls */
        Map<ByteArray, byte[]> expectedValues = Maps.newHashMap();
        for(byte i = 1; i < 11; ++i) {
            ByteArray key = new ByteArray(new byte[] { i });
            byte[] value = new byte[] { (byte) (i + 50) };
            routedStore.put(key, Versioned.value(value), null);
            expectedValues.put(key, value);
        }

View Full Code Here

Examples of voldemort.utils.ByteArray

                                                            failureDetector,
                                                            createConfig(timeoutConfig));
        /* do some puts so we have some data to test getalls */
        Map<ByteArray, byte[]> expectedValues = Maps.newHashMap();
        for(byte i = 1; i < 11; ++i) {
            ByteArray key = new ByteArray(new byte[] { i });
            byte[] value = new byte[] { (byte) (i + 50) };
            routedStore.put(key, Versioned.value(value), null);
            expectedValues.put(key, value);
        }

View Full Code Here

Examples of voldemort.utils.ByteArray

        Store<ByteArray, byte[], byte[]> store = new InconsistencyResolvingStore<ByteArray, byte[], byte[]>(routedStore,
                                                                                                            new VectorClockInconsistencyResolver<byte[]>());


        Map<ByteArray, byte[]> expectedValues = Maps.newHashMap();
        for(byte i = 1; i < 11; ++i) {
            ByteArray key = new ByteArray(new byte[] { i });
            byte[] value = new byte[] { (byte) (i + 50) };
            store.put(key, Versioned.value(value), null);
            expectedValues.put(key, value);
        }


        Map<ByteArray, List<Versioned<byte[]>>> all = store.getAll(expectedValues.keySet(), null);
        assertEquals(expectedValues.size(), all.size());
        for(Map.Entry<ByteArray, List<Versioned<byte[]>>> mapEntry: all.entrySet()) {
            byte[] value = expectedValues.get(mapEntry.getKey());
            assertEquals(new ByteArray(value), new ByteArray(mapEntry.getValue().get(0).getValue()));
        }
    }

View Full Code Here

Examples of voldemort.utils.ByteArray

        Store<ByteArray, byte[], byte[]> store = new InconsistencyResolvingStore<ByteArray, byte[], byte[]>(routedStore,
                                                                                                            new VectorClockInconsistencyResolver<byte[]>());


        Map<ByteArray, byte[]> expectedValues = Maps.newHashMap();
        for(byte i = 1; i < 11; ++i) {
            ByteArray key = new ByteArray(new byte[] { i });
            byte[] value = new byte[] { (byte) (i + 50) };
            store.put(key, Versioned.value(value), null);
            expectedValues.put(key, value);
        }


        Map<ByteArray, List<Versioned<byte[]>>> all = store.getAll(expectedValues.keySet(), null);
        assertEquals(expectedValues.size(), all.size());
        for(Map.Entry<ByteArray, List<Versioned<byte[]>>> mapEntry: all.entrySet()) {
            byte[] value = expectedValues.get(mapEntry.getKey());
            assertEquals(new ByteArray(value), new ByteArray(mapEntry.getValue().get(0).getValue()));
        }
    }

View Full Code Here

Examples of voldemort.utils.ByteArray

        // superceding clock [1:1,6:1]
        recordException(failureDetector, primaryNode);
        recordSuccess(failureDetector, secondaryNode);
        List<Versioned<byte[]>> versioneds = store.get(aKey, null);
        assertEquals(1, versioneds.size());
        assertEquals(new ByteArray(anotherValue), new ByteArray(versioneds.get(0).getValue()));


        // Read repairs are done asynchronously, so we sleep for a short period.
        // It may be a good idea to use a synchronous executor service.
        Thread.sleep(500);
        for(Map.Entry<Integer, Store<ByteArray, byte[], byte[]>> innerStoreEntry: routedStore.getInnerStores()
                                                                                             .entrySet()) {
            // Only look at the nodes in the pref list
            if(replicatingNodes.contains(innerStoreEntry.getKey())) {
                List<Versioned<byte[]>> innerVersioneds = innerStoreEntry.getValue()
                                                                         .get(aKey, null);
                assertEquals(1, versioneds.size());
                assertEquals(new ByteArray(anotherValue), new ByteArray(innerVersioneds.get(0)
                                                                                       .getValue()));
            }
        }
    }

View Full Code Here

Examples of voldemort.utils.ByteArray

            // from all the zones and do the essential read repairs.
            recordSuccess(failureDetector, cluster.getNodeById(0));
            recordSuccess(failureDetector, cluster.getNodeById(1));
            List<Versioned<byte[]>> versioneds = store.get(aKey, null);
            assertEquals(1, versioneds.size());
            assertEquals(new ByteArray(anotherValue), new ByteArray(versioneds.get(0).getValue()));


            // Read repairs are done asynchronously, so we sleep for a short
            // period. It may be a good idea to use a synchronous executor
            // service.
            Thread.sleep(500);
            for(Map.Entry<Integer, Store<ByteArray, byte[], byte[]>> innerStoreEntry: routedStore.getInnerStores()
                                                                                                 .entrySet()) {
                // Only look at the nodes in the pref list
                if(replicatingNodes.contains(innerStoreEntry.getKey())) {
                    List<Versioned<byte[]>> innerVersioneds = innerStoreEntry.getValue().get(aKey,
                                                                                             null);
                    assertEquals(1, versioneds.size());
                    assertEquals(new ByteArray(anotherValue),
                                 new ByteArray(innerVersioneds.get(0).getValue()));
                }
            }


        } catch(VoldemortException ve) {
            fail("Unexpected error occurred : " + ve);

View Full Code Here

Examples of voldemort.utils.ByteArray

                                                            failureDetector,
                                                            createConfig(timeout));


        long start = System.nanoTime();
        try {
            routedStore.put(new ByteArray("test".getBytes()),
                            new Versioned<byte[]>(new byte[] { 1 }),
                            null);
            fail("Should have thrown");
        } catch(InsufficientOperationalNodesException e) {
            long elapsed = (System.nanoTime() - start) / Time.NS_PER_MS;

View Full Code Here

0 1 2 3 4 5 6 7 8

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.

Examples of ByteArray

Index

Getters and Setters

Search operations

I/O operations

Conversion to a NIO buffer

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray

Examples of voldemort.utils.ByteArray