Package org.infinispan.commons.hash

Examples of org.infinispan.commons.hash.Hash

94
95
96
97
98
99
100
101
102
103
104
      }

      @Override
      public CacheJoinInfo readObject(ObjectInput unmarshaller) throws IOException, ClassNotFoundException {
         ConsistentHashFactory consistentHashFactory = (ConsistentHashFactory) unmarshaller.readObject();
         Hash hashFunction = (Hash) unmarshaller.readObject();
         int numSegments = unmarshaller.readInt();
         int numOwners = unmarshaller.readInt();
         long timeout = unmarshaller.readLong();
         return new CacheJoinInfo(consistentHashFactory, hashFunction, numSegments, numOwners, timeout);
      }
View Full Code Here
295
296
297
298
299
300
301
302
303
304
305
      @SuppressWarnings("unchecked")
      public DefaultConsistentHash readObject(ObjectInput unmarshaller) throws IOException, ClassNotFoundException {
         int numSegments = unmarshaller.readInt();
         int numOwners = unmarshaller.readInt();
         List<Address> members = (List<Address>) unmarshaller.readObject();
         Hash hash = (Hash) unmarshaller.readObject();
         Address[][] segmentOwners = (Address[][]) unmarshaller.readObject();

         List<Address>[] segmentOwnerList = new List[segmentOwners.length];
         for (int i = 0; i < segmentOwners.length; i++) {
            segmentOwnerList[i] = Arrays.asList(segmentOwners[i]);
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
      // * floor(numSegments*numOwners/numNodes) <= num_segments_owned(n) for each node n
      // It will not change primary owners or remove old owners, but it will prepare things for the next phase
      // to remove owners so that
      // * num_segments_primary_owned(n) <= ceil(numSegments/numNodes) for each node n
      // * num_segments_owned(n) <= ceil(numSegments*numOwners/numNodes) for each node n
      Hash hashFunction = baseCH.getHashFunction();
      List<Address> nodes = baseCH.getMembers();

      OwnershipStatistics stats = computeStatistics(baseCH, nodes);

      // Copy the owners list out of the old CH
View Full Code Here
63
64
65
66
67
68
69
70
      }
   }

   private static ConsistentHash constructConsistentHashInstance(Configuration c) {
      Class<? extends ConsistentHash> chClass = Util.loadClass(c.getConsistentHashClass(), c.getClassLoader());
      Hash h = (Hash) Util.getInstance(c.getHashFunctionClass(), c.getClassLoader());
      return constructConsistentHashInstance(chClass, h, c.getNumVirtualNodes(), new GroupManagerImpl(c.getGroupers()));
   }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
    * @param template An older consistent hash instance to clone
    * @param addresses with which to populate the consistent hash
    * @return a new consistent hash instance
    */
   public static ConsistentHash createConsistentHash(ConsistentHash template, Collection<Address> addresses) {
      Hash hf = null;
      int numVirtualNodes = 1;
      GroupManager groupManager = null;
      if (template instanceof AbstractWheelConsistentHash) {
         AbstractWheelConsistentHash wTemplate = (AbstractWheelConsistentHash) template;
         hf = wTemplate.hashFunction;
View Full Code Here
235
236
237
238
239
240
241
242
243
244
245
      @SuppressWarnings("unchecked")
      public DefaultConsistentHash readObject(ObjectInput unmarshaller) throws IOException, ClassNotFoundException {
         int numSegments = unmarshaller.readInt();
         int numOwners = unmarshaller.readInt();
         List<Address> members = (List<Address>) unmarshaller.readObject();
         Hash hash = (Hash) unmarshaller.readObject();
         Address[][] segmentOwners = (Address[][]) unmarshaller.readObject();

         List<Address>[] segmentOwnerList = new List[segmentOwners.length];
         for (int i = 0; i < segmentOwners.length; i++) {
            segmentOwnerList[i] = Arrays.asList(segmentOwners[i]);
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
      // * floor(numSegments*numOwners/numNodes) <= num_segments_owned(n) for each node n
      // It will not change primary owners or remove old owners, but it will prepare things for the next phase
      // to remove owners so that
      // * num_segments_primary_owned(n) <= ceil(numSegments/numNodes) for each node n
      // * num_segments_owned(n) <= ceil(numSegments*numOwners/numNodes) for each node n
      Hash hashFunction = baseCH.getHashFunction();
      List<Address> nodes = baseCH.getMembers();

      OwnershipStatistics stats = computeStatistics(baseCH, nodes);

      // Copy the owners list out of the old CH
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
      }

      @Override
      public CacheJoinInfo readObject(ObjectInput unmarshaller) throws IOException, ClassNotFoundException {
         ConsistentHashFactory consistentHashFactory = (ConsistentHashFactory) unmarshaller.readObject();
         Hash hashFunction = (Hash) unmarshaller.readObject();
         int numSegments = unmarshaller.readInt();
         int numOwners = unmarshaller.readInt();
         long timeout = unmarshaller.readLong();
         boolean totalOrder = unmarshaller.readBoolean();
         boolean distributed = unmarshaller.readBoolean();
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
      int[] numOwners = {1, 2, 3, 5};
      // Since the number of nodes changes, the capacity factors are repeated
      float[][] capacityFactors = {null, {1}, {2}, {1, 100}, {2, 0, 1}};

      ConsistentHashFactory <DefaultConsistentHash> chf = createConsistentHashFactory();
      Hash hashFunction = new MurmurHash3();

      for (int nn : numNodes) {
         List<Address> nodes = new ArrayList<Address>(nn);
         for (int j = 0; j < nn; j++) {
            nodes.add(new TestAddress(j, "TA"));
View Full Code Here
331
332
333
334
335
336
337
338
339
340
      public DefaultConsistentHash readObject(ObjectInput unmarshaller) throws IOException, ClassNotFoundException {
         int numSegments = unmarshaller.readInt();
         int numOwners = unmarshaller.readInt();
         List<Address> members = (List<Address>) unmarshaller.readObject();
         Map<Address, Float> capacityFactors = (Map<Address, Float>)unmarshaller.readObject();
         Hash hash = (Hash) unmarshaller.readObject();
         List<Address>[] owners = (List<Address>[]) unmarshaller.readObject();

         return new DefaultConsistentHash(hash, numOwners, numSegments, members, capacityFactors, owners);
      }
View Full Code Here
TOP

Related Classes of org.infinispan.commons.hash.Hash

  • org.infinispan.distribution.ch.AbstractWheelConsistentHash$Externalizer
  • org.infinispan.distribution.ch.ConsistentHashHelper
  • org.infinispan.distribution.ch.DefaultConsistentHash$Externalizer
  • org.infinispan.distribution.ch.DefaultConsistentHashFactory
  • org.infinispan.distribution.ch.DefaultConsistentHashFactoryTest
  • org.infinispan.distribution.ch.impl.DefaultConsistentHash$Externalizer
  • org.infinispan.distribution.ch.impl.ReplicatedConsistentHash$Externalizer
  • org.infinispan.distribution.ch.ReplicatedConsistentHash$Externalizer
  • org.infinispan.topology.CacheJoinInfo$Externalizer
    • 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.