Package org.jboss.cache

Examples of org.jboss.cache.NodeNotExistsException

202
203
204
205
206
207
208
209
210
         // if not, get it from the data container.  No need to wrap here, we're just going to update the parent's child map.
         retval = container.peekInternalNode(parentFqn, false);
      }
      if (retval == null)
      {
         throw new NodeNotExistsException("Node " + parentFqn + " cannot be found in any context or data container!");
      }
      return retval;
   }
View Full Code Here
335
336
337
338
339
340
341
342
343
344
345
         // node does not exist; return an empty list since there is nothing to remove!
         return Collections.emptyList();
      } else {
         // update child ref on parent to point to child as this is now a copy.
         if (parentLockNeeded && (needToCopyNode || needToCopyParent)) {
            if (parent == null) throw new NodeNotExistsException("Parent node " + parentFqn + " does not exist!");
            InternalNode ref = null;
            if (configuration.getIsolationLevel() == IsolationLevel.READ_COMMITTED)
            {
               ref = new NodeReference(node.getDelegationTarget());
            }
View Full Code Here
345
346
347
348
349
350
351
352
353
354
355
         // node does not exist; return an empty list since there is nothing to remove!
         return Collections.emptyList();
      } else {
         // update child ref on parent to point to child as this is now a copy.
         if (parentLockNeeded && (needToCopyNode || needToCopyParent)) {
            if (parent == null) throw new NodeNotExistsException("Parent node " + parentFqn + " does not exist!");
            InternalNode ref = null;
            if (configuration.getIsolationLevel() == IsolationLevel.READ_COMMITTED)
            {
               ref = new NodeReference(node.getDelegationTarget());
            }
View Full Code Here
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
         log.warn("Attempting to move the root node.  Not taking any action, treating this as a no-op.");
         return;
      }

      WorkspaceNode oldParent = fetchWorkspaceNode(ctx, nodeFqn.getParent(), ws, false, true);
      if (oldParent == null) throw new NodeNotExistsException("Node " + nodeFqn.getParent() + " does not exist!");

      if (parentFqn.equals(oldParent.getFqn()))
      {
         log.warn("Attempting to move a node in same place.  Not taking any action, treating this as a no-op.");
         return;
      }
      // retrieve parent
      WorkspaceNode parent = fetchWorkspaceNode(ctx, parentFqn, ws, false, true);
      if (parent == null) throw new NodeNotExistsException("Node " + parentFqn + " does not exist!");

      Object nodeName = nodeFqn.getLastElement();

      // now that we have the parent and target nodes:
      // first correct the pointers at the pruning point
View Full Code Here
434
435
436
437
438
439
440
441
442
443
444
   }

   private void putDataMapAndNotify(Map<Object, Object> data, TransactionWorkspace workspace, WorkspaceNode workspaceNode, InvocationContext ctx)
   {
      if (workspaceNode == null)
         throw new NodeNotExistsException("optimisticCreateIfNotExistsInterceptor should have created this node!");
      // pre-notify
      notifier.notifyNodeModified(workspaceNode.getFqn(), true, PUT_MAP, workspaceNode.getData(), ctx);
      workspaceNode.putAll(data);
      workspace.addNode(workspaceNode);
      // post-notify
View Full Code Here
446
447
448
449
450
451
452
453
454
455
456
   }

   private Object putDataKeyValueAndNotify(Object key, Object value, TransactionWorkspace workspace, WorkspaceNode workspaceNode, InvocationContext ctx)
   {
      if (workspaceNode == null)
         throw new NodeNotExistsException("optimisticCreateIfNotExistsInterceptor should have created this node!");

      if (notifier.shouldNotifyOnNodeModified())// pre-notify
      {
         notifier.notifyNodeModified(workspaceNode.getFqn(), true, PUT_DATA, workspaceNode.getData(), ctx);
      }
View Full Code Here
472
473
474
475
476
477
478
479
480
481
482
      // it is already removed - we can ignore it
      if (workspaceNode == null) return false;

      Fqn parentFqn = workspaceNode.getFqn().getParent();
      WorkspaceNode parentNode = fetchWorkspaceNode(ctx, parentFqn, workspace, false, true);
      if (parentNode == null) throw new NodeNotExistsException("Unable to find parent node with fqn " + parentFqn);

      // pre-notify
      if (notify) notifier.notifyNodeRemoved(workspaceNode.getFqn(), true, workspaceNode.getData(), ctx);

      Fqn nodeFqn = workspaceNode.getFqn();
View Full Code Here
333
334
335
336
337
338
339
340
341
342
343
         // node does not exist; return an empty list since there is nothing to remove!
         return Collections.emptyList();
      } else {
         // update child ref on parent to point to child as this is now a copy.
         if (parentLockNeeded && (needToCopyNode || needToCopyParent)) {
            if (parent == null) throw new NodeNotExistsException("Parent node " + parentFqn + " does not exist!");
            InternalNode ref = null;
            if (configuration.getIsolationLevel() == IsolationLevel.READ_COMMITTED)
            {
               ref = new NodeReference(node.getDelegationTarget());
            }
View Full Code Here
202
203
204
205
206
207
208
209
210
         // if not, get it from the data container.  No need to wrap here, we're just going to update the parent's child map.
         retval = container.peekInternalNode(parentFqn, false);
      }
      if (retval == null)
      {
         throw new NodeNotExistsException("Node " + parentFqn + " cannot be found in any context or data container!");
      }
      return retval;
   }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
      {
         log.trace("perform(" + globalTransaction + ", \"" + fqn + "\", " + data + ")");
      }
//      NodeSPI nodeSPI = dataContainer.peekStrict(globalTransaction, fqn, false);
      NodeSPI nodeSPI = ctx.lookUpNode(fqn);
      if (nodeSPI == null) throw new NodeNotExistsException("Node " + fqn + " does not exist!");
      Map existingData = nodeSPI.getDataDirect();

      if (notifier.shouldNotifyOnNodeModified())
      {
         notifier.notifyNodeModified(fqn, true, NodeModifiedEvent.ModificationType.PUT_MAP, existingData == null ? Collections.emptyMap() : existingData, ctx);
View Full Code Here
TOP

Related Classes of org.jboss.cache.NodeNotExistsException

  • org.jboss.cache.commands.legacy.write.PessMoveCommand
  • org.jboss.cache.commands.write.MoveCommand
  • org.jboss.cache.commands.write.PutDataMapCommand
  • org.jboss.cache.commands.write.PutKeyValueCommand
  • org.jboss.cache.interceptors.OptimisticNodeInterceptor
  • org.jboss.cache.mvcc.MVCCNodeHelper
  • org.jboss.cache.mvcc.ReadCommittedNode
    • 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.