Package org.apache.ldap.common.filter

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

238
239
240
241
242
243
244
245
246
247
248
249
        ArrayList children = node.getChildren();
        BigInteger total = BigInteger.ZERO;
       
        for ( int ii = 0; ii < children.size(); ii++ )
        {
            ExprNode child = ( ExprNode ) children.get( ii );
            annotate( child );
            total = total.add( ( BigInteger ) child.get( "count" ) );
        }

        return total;   
    }
View Full Code Here
566
567
568
569
570
571
572
573
574
575
576
     *      java.lang.String, javax.naming.directory.SearchControls)
     */
    public NamingEnumeration search( Name name, String filter, SearchControls cons )
            throws NamingException
    {
        ExprNode filterNode = null;

        LdapName target = buildTarget( name );

        if ( filter == null && getEnvironment().containsKey( "__filter__" ) )
        {
View Full Code Here
229
230
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
         * expression.
         */
        final ArrayList children = node.getChildren();
        for ( int ii = 0; ii < children.size(); ii++ )
        {
            ExprNode child = ( ExprNode ) children.get( ii );
            value = ( ( BigInteger ) child.get( "count" ) ).intValue();
            minValue = Math.min( minValue, value );

            if ( minValue == value )
            {
                minIndex = ii;
            }
        }

        // Once found we build the child enumeration & the wrapping enum
        final ExprNode minChild = ( ExprNode ) children.get( minIndex );
        IndexAssertion assertion = new IndexAssertion()
        {
            public boolean assertCandidate( IndexRecord rec ) throws NamingException
            {
                for ( int ii = 0; ii < children.size(); ii++ )
                {
                    ExprNode child = ( ExprNode ) children.get( ii );

                    // Skip the child (with min scan count) chosen for enum
                    if ( child == minChild )
                    {
                        continue;
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
            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
179
180
181
182
183
184
185
186
187
188
189
190
        BigInteger count = BigInteger.valueOf( Integer.MAX_VALUE ); 
        ArrayList children = node.getChildren();
       
        for ( int ii = 0; ii < children.size(); ii++ )
        {
            ExprNode child = ( ExprNode ) children.get( ii );
            annotate( child );
            count = ( ( BigInteger ) child.get( "count" ) ).min( count );
        }

        return count;   
    }
View Full Code Here
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
     * @return the scan count
     * @throws NamingException if there is an error
     */
    private BigInteger getNegationScan( BranchNode node ) throws NamingException
    {
        ExprNode onlyChild = ( ExprNode ) node.getChildren().get( 0 );
       
        annotate( onlyChild );

        if ( onlyChild.isLeaf()
            && ! ( onlyChild instanceof ScopeNode )
            && ! ( onlyChild instanceof AssertionNode ) 
            && ! ( onlyChild instanceof PresenceNode ) )
        {
            LeafNode leaf = ( LeafNode ) onlyChild;
View Full Code Here
238
239
240
241
242
243
244
245
246
247
248
249
        ArrayList children = node.getChildren();
        BigInteger total = BigInteger.ZERO;
       
        for ( int ii = 0; ii < children.size(); ii++ )
        {
            ExprNode child = ( ExprNode ) children.get( ii );
            annotate( child );
            total = total.add( ( BigInteger ) child.get( "count" ) );
        }

        return total;   
    }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
        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
63
64
65
66
67
68
69
70
71
72
73
            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
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
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.