Examples of org.infinispan.distribution.MagicKey

org.infinispan.distribution.MagicKey
A special type of key that if passed a cache in its constructor, will ensure it will always be assigned to that cache (plus however many additional caches in the hash space). Note that this only works if all the caches have joined a single cluster before creating the key. If the cluster membership changes then the keys may move to other servers.

      Cache<Object, Object> cache0 = cache(0);
      Cache<Object, Object> cache1 = cache(1);
      Cache<Object, Object> cache2 = cache(2);
      Cache<Object, Object> cache3 = cache(3);


      MagicKey hello = new MagicKey("hello", cache(2));


      // Auto-commit is true
      cache0.put(hello, "world");


      tm(0).begin();

View Full Code Here

      Cache<Object, Object> cache0 = cache(0);
      Cache<Object, Object> cache1 = cache(1);
      Cache<Object, Object> cache2 = cache(2);
      Cache<Object, Object> cache3 = cache(3);


      MagicKey hello = new MagicKey("hello", cache(2));


      // Auto-commit is true
      cache0.put(hello, "world");


      // create a write skew

View Full Code Here


   /**
    * Check that the transaction commit/rollback recovers if we receive a StateTransferInProgressException from the remote node
    */
   private void doStateTransferInProgressTest(boolean commit, final boolean failOnOriginator) throws Exception {
      MagicKey k1 = new MagicKey("k1", c1);
      MagicKey k2 = new MagicKey("k2", c2);


      tm(c1).begin();
      c1.put(k1, "v1");
      c1.put(k2, "v2");

View Full Code Here


   /**
    * Check that the transaction commit/rollback recovers if the remote node dies during the RPC
    */
   private void doTestSuspect(boolean commit) throws Exception {
      MagicKey k1 = new MagicKey("k1", c1);
      MagicKey k2 = new MagicKey("k2", c2);


      tm(c1).begin();
      c1.put(k1, "v1");
      c1.put(k2, "v2");

View Full Code Here

      Cache<Object, Object> cache1 = cache(1);
      Cache<Object, Object> cache2 = cache(2);
      Cache<Object, Object> cache3 = cache(3);


      // TODO Add multiple keys, to ensure one of them ends up on the joiner
      MagicKey hello = new MagicKey("hello", cache2);
      cache0.put(hello, "world");


      // no state transfer per se, but we check that the initial data is ok
      checkStateTransfer(hello);

View Full Code Here

      failureInterceptor1.fail = false;


   }


   protected Object getKey() {
      return new MagicKey(cache(2));
   }

View Full Code Here

         Future<Object> future = fork(runWithTx(tm, new Callable<Object>() {


            @Override
            public Object call() throws Exception {
               if (additionalValueOnNonOwner) {
                  MagicKey mk = new MagicKey("placeholder", nonOwnerCache);
                  String value = "somevalue";
                  primaryOwnerCache.put(mk, value);
                  log.tracef("Adding additional value on nonOwner value inserted: %s = %s", mk, value);
               }
               primaryOwnerCache.getAdvancedCache().addInterceptorBefore(new BlockingInterceptor(cyclicBarrier,

View Full Code Here

      // on the non owner which is getting the state transfer
      final AdvancedCache<Object, Object> primaryOwnerCache = cache(0, cacheName).getAdvancedCache();
      final AdvancedCache<Object, Object> backupOwnerCache = cache(1, cacheName).getAdvancedCache();
      final AdvancedCache<Object, Object> nonOwnerCache = cache(2, cacheName).getAdvancedCache();


      final MagicKey key = new MagicKey(primaryOwnerCache, backupOwnerCache);


      // Prepare for replace/remove: put a previous value in cache0
      final Object previousValue = op.getPreviousValue();
      if (previousValue != null) {
         primaryOwnerCache.put(key, previousValue);

View Full Code Here


      // Wait for cache1 to send the StateResponseCommand to cache1, but keep it blocked
      // We only block the StateResponseCommand on cache1, because that's the node cache2 will ask for the magic key
      blockingRpcManager1.waitForCommandToBlock();


      final MagicKey key = getKeyForCache2();


      // Prepare for replace: put a previous value in cache0 and cache1
      if (op.getPreviousValue() != null) {
         cache0.withFlags(Flag.CACHE_MODE_LOCAL).put(key, op.getPreviousValue());
         cache1.withFlags(Flag.CACHE_MODE_LOCAL).put(key, op.getPreviousValue());

View Full Code Here

      assertEquals(op.getValue(), cache2.get(key));


   }


   private MagicKey getKeyForCache2() {
      return new MagicKey(cache(0), cache(1), cache(2));
   }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.infinispan.distribution.MagicKey

org.infinispan.api.AbstractRepeatableReadIsolationTest

org.infinispan.api.ConditionalOperationPrimaryOwnerFailTest

org.infinispan.api.ConditionalOperationsConcurrentWriteSkewTest

org.infinispan.api.flags.FlagsEnabledTest

org.infinispan.api.flags.NonTxFlagsEnabledTest

org.infinispan.api.mvcc.PutForExternalReadLockCleanupTest

org.infinispan.api.mvcc.PutForExternalReadTest

org.infinispan.api.RepeatableReadRemoteGetCountTest

org.infinispan.api.ReplicatedNonTxCacheTest

org.infinispan.atomic.AtomicMapStateTransferTest

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.