Package org.apache.ldap.common.filter

Examples of org.apache.ldap.common.filter.ExprNode

215
216
217
218
219
220
221
222
223
224
225

    public void testWithMinMaxAndSimpleRefinement() throws Exception
    {
        FilterParser parser = new FilterParserImpl();
        ExprNode refinement = parser.parse( "( objectClass = person )" );

        SubtreeSpecificationModifier modifier = new SubtreeSpecificationModifier();
        modifier.setRefinement( refinement );
        modifier.setMinBaseDistance( 1 );
        modifier.setMaxBaseDistance( 3 );
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
            return;
        }

        boolean bypass = false;
        SearchControls searchControls = call.getControls();
        ExprNode filter = call.getFilter();
        if ( searchControls.getSearchScope() == SearchControls.OBJECT_SCOPE &&
                filter instanceof SimpleNode )
        {
            SimpleNode node = ( SimpleNode ) filter;
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
            effectiveBase = base;
        }

        // Add the scope node using the eective base to the ilter
        BranchNode root = new BranchNode( AbstractExprNode.AND );
        ExprNode node = new ScopeNode( env, effectiveBase.toString(),
            searchCtls.getSearchScope() );
        root.getChildren().add( node );
        root.getChildren().add( filter );

        // Annotate the node with the optimizer and return search enumeration.
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
        case( BranchNode.OR ):
            Iterator children = bnode.getChildren().iterator();
           
            while ( children.hasNext() )
            {
                ExprNode child = ( ExprNode ) children.next();
               
                if ( evaluate( child, record ) )
                {
                    return true;
                }
            }

            return false;
        case( BranchNode.AND ):
            children = bnode.getChildren().iterator();
            while ( children.hasNext() )
            {
                ExprNode child = ( ExprNode ) children.next();

                if ( ! evaluate( child, record ) )
                {
                    return false;
                }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
            BranchNode branch = ( BranchNode ) exprNode;
            ArrayList exprNodes = branch.getChildren();
            for ( int ii = 0; ii < exprNodes.size(); ii++ )
            {
                ExprNode child = ( ExprNode ) exprNodes.get(ii);
                children.add( new ASTNode( this, child ) );
            }
        }
        catch( Exception e )
        {
View Full Code Here
583
584
585
586
587
588
589
590
591
592
593
    {
        System.out.println( "Search attempt using filter '" + filter + "' "
            + "with scope '" + scope + "' and a return limit of '" + limit
            + "'" );
        FilterParser parser = new FilterParserImpl();
        ExprNode root = null;

        try
        {
            root = parser.parse( filter );
        }
View Full Code Here
729
730
731
732
733
734
735
736
737
738
739
    public boolean doAnnotate( String filter )
        throws Exception
    {
    FilterParser parser = new FilterParserImpl();
        ExprNode root = null;

        try
        {
            root = parser.parse( filter );
        }
View Full Code Here
617
618
619
620
621
622
623
624
625
626
627
            + "with scope '" + scope + "' and a return limit of '" + limit
            + "'" );
        }

        FilterParser parser = new FilterParserImpl();
        ExprNode root = null;

        try
        {
            root = parser.parse( filter );
        }
View Full Code Here
766
767
768
769
770
771
772
773
774
775
776
    public boolean doAnnotate( String filter )
        throws Exception
    {
    FilterParser parser = new FilterParserImpl();
        ExprNode root = null;

        try
        {
            root = parser.parse( filter );
        }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
            BranchNode branch = ( BranchNode ) exprNode;
            ArrayList exprNodes = branch.getChildren();
            for ( int ii = 0; ii < exprNodes.size(); ii++ )
            {
                ExprNode child = ( ExprNode ) exprNodes.get(ii);
                children.add( new ASTNode( this, child ) );
            }
        }
        catch( Exception e )
        {
View Full Code Here
TOP

Related Classes of org.apache.ldap.common.filter.ExprNode

  • org.apache.ldap.server.authz.TupleCache
  • org.apache.ldap.server.db.DefaultSearchEngine
  • org.apache.ldap.server.db.ExpressionEvaluator
  • org.apache.ldap.server.db.gui.ASTNode
  • org.apache.ldap.server.db.gui.MainFrame
  • org.apache.ldap.server.event.ExpressionEvaluator
  • org.apache.ldap.server.jndi.ServerContext
  • org.apache.ldap.server.jndi.ServerDirContext
  • org.apache.ldap.server.partition.impl.btree.DefaultOptimizer
  • org.apache.ldap.server.partition.impl.btree.DefaultSearchEngine
    • 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.