Search and limit the number of results returned - Java JNDI

Java examples for JNDI:Search

  1. HOME
  2. Java
  3. JNDI
  4. Search

Description

Search and limit the number of results returned

Demo Code

import javax.naming.*;
import javax.naming.directory.*;

import java.util.Hashtable;

/**//from  w  w  w  .  j a v  a 2  s  .  c  om
 * Demonstrates how to perform a search and limit the number of
 * results returned.
 *
 * usage: java SearchCountLimit
 */
class SearchCountLimit {
    static int expected = 1;

    public static void printSearchEnumeration(NamingEnumeration srhEnum) {
        int count = 0;
        try {
            while (srhEnum.hasMore()) {
                SearchResult sr = (SearchResult) srhEnum.next();
                System.out.println(">>>" + sr.getName());
                ++count;
            }
            System.out.println("number of answers: " + count);
        } catch (SizeLimitExceededException e) {
            if (count == expected)
                System.out.println("number of answers: " + count);
            else
                e.printStackTrace();
        } catch (NamingException e) {
            e.printStackTrace();
        }
    }

    public static void main(String[] args) {

        // Set up the environment for creating the initial context
        Hashtable<String, Object> env = new Hashtable<String, Object>(11);
        env.put(Context.INITIAL_CONTEXT_FACTORY,
                "com.sun.jndi.ldap.LdapCtxFactory");
        env.put(Context.PROVIDER_URL, "ldap://localhost:389/o=JNDITutorial");

        try {
            // Create initial context
            DirContext ctx = new InitialDirContext(env);

            // Set search controls to limit count to 'expected'
            SearchControls ctls = new SearchControls();
            ctls.setCountLimit(expected);

            // Search for objects with those matching attributes
            NamingEnumeration answer = ctx.search("ou=People", "(sn=M*)",
                    ctls);

            // Print the answer
            printSearchEnumeration(answer);

            // Close the context when we're done
            ctx.close();
        } catch (Exception e) {
            System.err.println(e);
        }
    }
}

/*
 * Copyright (c) 1995, 2008, Oracle and/or its affiliates. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *   - Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *
 *   - Redistributions in binary form must reproduce the above copyright
 *     notice, this list of conditions and the following disclaimer in the
 *     documentation and/or other materials provided with the distribution.
 *
 *   - Neither the name of Oracle or the names of its
 *     contributors may be used to endorse or promote products derived
 *     from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

Related Tutorials