Package org.exoplatform.services.jcr.impl.core.query

Examples of org.exoplatform.services.jcr.impl.core.query.LocationStepQueryNode

1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
       */
      boolean needsMerge()
      {
         for (Iterator it = operands.iterator(); it.hasNext();)
         {
            LocationStepQueryNode step = (LocationStepQueryNode) it.next();
            if (step.getIncludeDescendants() && step.getNameTest() == null)
            {
               return true;
            }
         }
         return false;
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
      // use //* if no path has been set
      PathQueryNode pathNode = root.getLocationNode();
      pathNode.setAbsolute(true);
      if (pathConstraints.size() == 0)
      {
         LocationStepQueryNode step = factory.createLocationStepQueryNode(pathNode);
         step.setNameTest(null);
         step.setIncludeDescendants(true);
         pathNode.addPathStep(step);
      }
      else
      {
         try
         {
            while (pathConstraints.size() > 1)
            {
               // merge path nodes
               MergingPathQueryNode path = null;
               for (Iterator it = pathConstraints.iterator(); it.hasNext();)
               {
                  path = (MergingPathQueryNode) it.next();
                  if (path.needsMerge())
                  {
                     break;
                  }
                  else
                  {
                     path = null;
                  }
               }
               if (path == null)
               {
                  throw new IllegalArgumentException("Invalid combination of jcr:path clauses");
               }
               else
               {
                  pathConstraints.remove(path);
                  MergingPathQueryNode[] paths =
                           (MergingPathQueryNode[]) pathConstraints.toArray(new MergingPathQueryNode[pathConstraints
                                    .size()]);
                  paths = path.doMerge(paths);
                  pathConstraints.clear();
                  pathConstraints.addAll(Arrays.asList(paths));
               }
            }
         }
         catch (NoSuchElementException e)
         {
            throw new IllegalArgumentException("Invalid combination of jcr:path clauses", e);
         }
         MergingPathQueryNode path = (MergingPathQueryNode) pathConstraints.get(0);
         LocationStepQueryNode[] steps = path.getPathSteps();
         for (int i = 0; i < steps.length; i++)
         {
            LocationStepQueryNode step = factory.createLocationStepQueryNode(pathNode);
            step.setNameTest(steps[i].getNameTest());
            step.setIncludeDescendants(steps[i].getIncludeDescendants());
            step.setIndex(steps[i].getIndex());
            pathNode.addPathStep(step);
         }
      }

      if (constraintNode.getNumOperands() == 1)
View Full Code Here
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
                  throw new IllegalArgumentException("Illegal name: " + name);
               }
            }
            // if name test is % this means also search descendants
            boolean descendant = name == null;
            LocationStepQueryNode step = factory.createLocationStepQueryNode(pathNode);
            step.setNameTest(qName);
            step.setIncludeDescendants(descendant);
            if (index > 0)
            {
               step.setIndex(index);
            }
            pathNode.addPathStep(step);
         }
      }
      pathConstraints.add(pathNode);
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
            }
            break;
         case JJTTEXTTEST :
            if (queryNode.getType() == QueryNode.TYPE_LOCATION)
            {
               LocationStepQueryNode loc = (LocationStepQueryNode) queryNode;
               loc.setNameTest(JCR_XMLTEXT);
            }
            break;
         case JJTTYPENAME :
            if (queryNode.getType() == QueryNode.TYPE_LOCATION)
            {
               LocationStepQueryNode loc = (LocationStepQueryNode) queryNode;
               String ntName = ((SimpleNode) node.jjtGetChild(0)).getValue();
               try
               {
                  InternalQName nt = resolver.parseJCRName(ntName).getInternalName();
                  NodeTypeQueryNode nodeType = factory.createNodeTypeQueryNode(loc, nt);
                  loc.addPredicate(nodeType);
               }
               catch (RepositoryException e)
               {
                  exceptions.add(new InvalidQueryException("Not a valid name: " + ntName));
               }
View Full Code Here
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
    *          the parent <code>PathQueryNode</code>.
    * @return the created <code>LocationStepQueryNode</code>.
    */
   private LocationStepQueryNode createLocationStep(SimpleNode node, NAryQueryNode parent)
   {
      LocationStepQueryNode queryNode = null;
      boolean descendant = false;
      Node p = node.jjtGetParent();
      for (int i = 0; i < p.jjtGetNumChildren(); i++)
      {
         SimpleNode c = (SimpleNode) p.jjtGetChild(i);
         if (c == node)
         {
            queryNode = factory.createLocationStepQueryNode(parent);
            queryNode.setNameTest(null);
            queryNode.setIncludeDescendants(descendant);
            parent.addOperand(queryNode);
            break;
         }
         descendant = (c.getId() == JJTSLASHSLASH || c.getId() == JJTROOTDESCENDANTS);
      }
View Full Code Here
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
            if (node.jjtGetNumChildren() == 3)
            {
               boolean descendant = false;
               if (queryNode.getType() == QueryNode.TYPE_LOCATION)
               {
                  LocationStepQueryNode loc = (LocationStepQueryNode) queryNode;
                  // remember if descendant axis
                  descendant = loc.getIncludeDescendants();
                  queryNode = loc.getParent();
                  ((NAryQueryNode) queryNode).removeOperand(loc);
               }
               if (queryNode.getType() == QueryNode.TYPE_PATH)
               {
                  PathQueryNode pathNode = (PathQueryNode) queryNode;
View Full Code Here
227
228
229
230
231
232
233
234
235
236
237
238
239
    */
   private static QueryRootNode createMatchAllNodesQuery(QueryNodeFactory factory)
   {
      QueryRootNode allNodesQueryNode = factory.createQueryRootNode();
      PathQueryNode pathNode = factory.createPathQueryNode(allNodesQueryNode);
      LocationStepQueryNode lsNode = factory.createLocationStepQueryNode(pathNode);
      lsNode.setNameTest(null);
      lsNode.setIncludeDescendants(true);
      pathNode.addPathStep(lsNode);
      pathNode.setAbsolute(true);
      allNodesQueryNode.setLocationNode(pathNode);
      return allNodesQueryNode;
   }
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
      // use //* if no path has been set
      PathQueryNode pathNode = root.getLocationNode();
      pathNode.setAbsolute(true);
      if (pathConstraints.size() == 0)
      {
         LocationStepQueryNode step = factory.createLocationStepQueryNode(pathNode);
         step.setNameTest(null);
         step.setIncludeDescendants(true);
         pathNode.addPathStep(step);
      }
      else
      {
         try
         {
            while (pathConstraints.size() > 1)
            {
               // merge path nodes
               MergingPathQueryNode path = null;
               for (Iterator<MergingPathQueryNode> it = pathConstraints.iterator(); it.hasNext();)
               {
                  path = it.next();
                  if (path.needsMerge())
                  {
                     break;
                  }
                  else
                  {
                     path = null;
                  }
               }
               if (path == null)
               {
                  throw new IllegalArgumentException("Invalid combination of jcr:path clauses");
               }
               else
               {
                  pathConstraints.remove(path);
                  MergingPathQueryNode[] paths =
                     (MergingPathQueryNode[])pathConstraints.toArray(new MergingPathQueryNode[pathConstraints.size()]);
                  paths = path.doMerge(paths);
                  pathConstraints.clear();
                  pathConstraints.addAll(Arrays.asList(paths));
               }
            }
         }
         catch (NoSuchElementException e)
         {
            throw new IllegalArgumentException("Invalid combination of jcr:path clauses", e);
         }
         MergingPathQueryNode path = (MergingPathQueryNode)pathConstraints.get(0);
         LocationStepQueryNode[] steps = path.getPathSteps();
         for (int i = 0; i < steps.length; i++)
         {
            LocationStepQueryNode step = factory.createLocationStepQueryNode(pathNode);
            step.setNameTest(steps[i].getNameTest());
            step.setIncludeDescendants(steps[i].getIncludeDescendants());
            step.setIndex(steps[i].getIndex());
            pathNode.addPathStep(step);
         }
      }

      if (constraintNode.getNumOperands() == 1)
View Full Code Here
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
               }

            }
            // if name test is % this means also search descendants
            boolean descendant = name == null;
            LocationStepQueryNode step = factory.createLocationStepQueryNode(pathNode);
            step.setNameTest(qName);
            step.setIncludeDescendants(descendant);
            if (index > 0)
            {
               step.setIndex(index);
            }
            pathNode.addPathStep(step);
         }
      }
      pathConstraints.add(pathNode);
View Full Code Here
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
                    }
                }
                break;
            case JJTTEXTTEST:
                if (queryNode.getType() == QueryNode.TYPE_LOCATION) {
                    LocationStepQueryNode loc = (LocationStepQueryNode) queryNode;
                    loc.setNameTest(JCR_XMLTEXT);
                }
                break;
            case JJTTYPENAME:
                if (queryNode.getType() == QueryNode.TYPE_LOCATION) {
                    LocationStepQueryNode loc = (LocationStepQueryNode) queryNode;
                    String ntName = ((SimpleNode) node.jjtGetChild(0)).getValue();
                    try {
                        InternalQName nt = resolver.parseJCRName(ntName).getInternalName();
                        NodeTypeQueryNode nodeType = factory.createNodeTypeQueryNode(loc, nt);
                        loc.addPredicate(nodeType);
                    } catch (NamespaceException e) {
                        exceptions.add(new InvalidQueryException("Not a valid name: " + ntName));
                    } catch (RepositoryException e) {
                        exceptions.add(new InvalidQueryException("Not a valid name: " + ntName));
                    }
View Full Code Here
TOP

Related Classes of org.exoplatform.services.jcr.impl.core.query.LocationStepQueryNode

  • org.exoplatform.services.jcr.impl.core.query.lucene.QueryImpl
  • org.exoplatform.services.jcr.impl.core.query.sql.JCRSQLQueryBuilder
  • org.exoplatform.services.jcr.impl.core.query.sql.JCRSQLQueryBuilder$MergingPathQueryNode
  • org.exoplatform.services.jcr.impl.core.query.xpath.XPathQueryBuilder
    • 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.