Examples of addNode()

Examples of org.apache.directory.shared.ldap.filter.NotNode.addNode()

208
209
210
211
212
213
214
215
216
217
218
        NotNode notNode = new NotNode();

        ExprNode exprNode = new SubstringNode( "cn", "J", null );
        Evaluator<? extends ExprNode, ServerEntry, Long> eval = new SubstringEvaluator( ( SubstringNode ) exprNode,
            store, schemaManager );
        notNode.addNode( exprNode );

        NotCursor<String, Long> cursor = new NotCursor( store, eval ); //cursorBuilder.build( andNode );

        assertTrue( cursor.next() );
        assertTrue( cursor.available() );
View Full Code Here

Examples of org.apache.directory.shared.ldap.filter.OrNode.addNode()

164
165
166
167
168
169
170
171
172
173
174
                            else
                            {
                                throw new IllegalStateException( I18n.err( I18n.ERR_260, leaf ) );
                            }

                            orNode.addNode( newLeaf );
                        }
                    }
                }
                catch ( NamingException e )
                {
View Full Code Here

Examples of org.apache.directory.shared.ldap.filter.PresenceNode.addNode()

795
796
797
798
799
800
801
802
803
804
805
             * list does not have any values then we match for just the presence
             * of the attribute in the entry
             */
            if ( attr.size() == 0 )
            {
                filter.addNode( new PresenceNode( attr.getID() ) );
                continue;
            }

            /*
             * With 1 or more value we build a set of simple nodes and add them
View Full Code Here

Examples of org.apache.directory.shared.ldap.model.filter.AndNode.addNode()

758
759
760
761
762
763
764
765
766
767
768
             * list does not have any values then we match for just the presence
             * of the attribute in the entry
             */
            if ( attr.size() == 0 )
            {
                filter.addNode( new PresenceNode( attr.getID() ) );
                continue;
            }

            /*
             * With 1 or more value we build a set of simple nodes and add them
View Full Code Here

Examples of org.apache.directory.shared.ldap.model.filter.BranchNode.addNode()

382
383
384
385
386
387
388
389
390
391
392
                // Loop on all AND/OR children
                if ( filtersSet != null )
                {
                    for ( Filter node : filtersSet )
                    {
                        branch.addNode( transform( node ) );
                    }
                }

                return branch;
            }
View Full Code Here

Examples of org.apache.directory.shared.ldap.model.filter.NotNode.addNode()

207
208
209
210
211
212
213
214
215
216
217
        NotNode notNode = new NotNode();

        ExprNode exprNode = new SubstringNode( schemaManager.getAttributeType( "cn" ), "J", null );
        Evaluator<? extends ExprNode, Entry, Long> eval = new SubstringEvaluator( (SubstringNode) exprNode, store,
            schemaManager );
        notNode.addNode( exprNode );

        NotCursor<String, Long> cursor = new NotCursor( store, eval ); //cursorBuilder.build( andNode );
        cursor.beforeFirst();

        Set<Long> set = new HashSet<Long>();
View Full Code Here

Examples of org.apache.directory.shared.ldap.model.filter.OrNode.addNode()

520
521
522
523
524
525
526
527
528
529
530
        BranchNode filter = new OrNode();
        SimpleNode<String> nameAVA = new EqualityNode<String>( M_NAME_AT,
            new StringValue( entityName.toLowerCase() ) );
        SimpleNode<String> oidAVA = new EqualityNode<String>( M_OID_AT,
            new StringValue( entityName.toLowerCase() ) );
        filter.addNode( nameAVA );
        filter.addNode( oidAVA );
        SearchControls searchControls = new SearchControls();
        searchControls.setSearchScope( SearchControls.SUBTREE_SCOPE );
        EntryFilteringCursor cursor = null;
View Full Code Here

Examples of org.apache.directory.shared.ldap.model.filter.PresenceNode.addNode()

758
759
760
761
762
763
764
765
766
767
768
             * list does not have any values then we match for just the presence
             * of the attribute in the entry
             */
            if ( attr.size() == 0 )
            {
                filter.addNode( new PresenceNode( attr.getID() ) );
                continue;
            }

            /*
             * With 1 or more value we build a set of simple nodes and add them
View Full Code Here

Examples of org.apache.hadoop.hdfs.server.blockmanagement.BlockInfo.addNode()

352
353
354
355
356
357
358
359
360
361
362
  private BlockInfo blockOnNodes(long blkId, List<DatanodeDescriptor> nodes) {
    Block block = new Block(blkId);
    BlockInfo blockInfo = new BlockInfo(block, 3);

    for (DatanodeDescriptor dn : nodes) {
      blockInfo.addNode(dn);
    }
    return blockInfo;
  }

  private List<DatanodeDescriptor> nodes(int ... indexes) {
View Full Code Here

Examples of org.apache.jackrabbit.commons.flat.NodeSequence.addNode()

79
80
81
82
83
84
85
86
87
88
89
    public void testSingletonNodeSequence() throws RepositoryException {
        Comparator<String> order = Rank.<String>comparableComparator();
        TreeManager treeManager = new BTreeManager(testNode, 5, 10, order, true);
        NodeSequence nodes = ItemSequence.createNodeSequence(treeManager, errorHandler);

        nodes.addNode("key", NodeType.NT_UNSTRUCTURED);
        assertTrue(nodes.hasItem("key"));

        Iterator<Node> nodeIt = nodes.iterator();
        assertTrue(nodeIt.hasNext());
        assertEquals("key", nodeIt.next().getName());
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.