|
Java example source code file (LazySearchEnumerationImpl.java)
The LazySearchEnumerationImpl.java Java example source code/* * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ /** * Given an enumeration of candidates, check whether each * item in enumeration satifies the given filter. * Each item is a Binding and the following is used to get its * attributes for used by the filter: * * ((DirContext)item.getObject()).getAttributes(""). * If item.getObject() is not an DirContext, the item is skipped * * The items in the enumeration are obtained one at a time as * items from the search enumeration are requested. * * @author Rosanna Lee */ package com.sun.jndi.toolkit.dir; import javax.naming.*; import javax.naming.directory.*; import javax.naming.spi.DirectoryManager; import java.util.NoSuchElementException; import java.util.Hashtable; final public class LazySearchEnumerationImpl implements NamingEnumeration<SearchResult> { private NamingEnumeration<Binding> candidates; private SearchResult nextMatch = null; private SearchControls cons; private AttrFilter filter; private Context context; private Hashtable<String, Object> env; private boolean useFactory = true; public LazySearchEnumerationImpl(NamingEnumeration<Binding> candidates, AttrFilter filter, SearchControls cons) throws NamingException { this.candidates = candidates; this.filter = filter; if(cons == null) { this.cons = new SearchControls(); } else { this.cons = cons; } } @SuppressWarnings("unchecked") // For Hashtable clone: env.clone() public LazySearchEnumerationImpl(NamingEnumeration<Binding> candidates, AttrFilter filter, SearchControls cons, Context ctx, Hashtable<String, Object> env, boolean useFactory) throws NamingException { this.candidates = candidates; this.filter = filter; this.env = (Hashtable<String, Object>) ((env == null) ? null : env.clone()); this.context = ctx; this.useFactory = useFactory; if(cons == null) { this.cons = new SearchControls(); } else { this.cons = cons; } } public LazySearchEnumerationImpl(NamingEnumeration<Binding> candidates, AttrFilter filter, SearchControls cons, Context ctx, Hashtable<String, Object> env) throws NamingException { this(candidates, filter, cons, ctx, env, true); } public boolean hasMore() throws NamingException { // find and do not remove from list return findNextMatch(false) != null; } public boolean hasMoreElements() { try { return hasMore(); } catch (NamingException e) { return false; } } public SearchResult nextElement() { try { return findNextMatch(true); } catch (NamingException e) { throw new NoSuchElementException(e.toString()); } } public SearchResult next() throws NamingException { // find and remove from list return (findNextMatch(true)); } public void close() throws NamingException { if (candidates != null) { candidates.close(); } } private SearchResult findNextMatch(boolean remove) throws NamingException { SearchResult answer; if (nextMatch != null) { answer = nextMatch; if (remove) { nextMatch = null; } return answer; } else { // need to find next match Binding next; Object obj; Attributes targetAttrs; while (candidates.hasMore()) { next = candidates.next(); obj = next.getObject(); if (obj instanceof DirContext) { targetAttrs = ((DirContext)(obj)).getAttributes(""); if (filter.check(targetAttrs)) { if (!cons.getReturningObjFlag()) { obj = null; } else if (useFactory) { try { // Give name only if context non-null, // otherewise, name will be interpreted relative // to initial context (not what we want) Name nm = (context != null ? new CompositeName(next.getName()) : null); obj = DirectoryManager.getObjectInstance(obj, nm, context, env, targetAttrs); } catch (NamingException e) { throw e; } catch (Exception e) { NamingException e2 = new NamingException( "problem generating object using object factory"); e2.setRootCause(e); throw e2; } } answer = new SearchResult(next.getName(), next.getClassName(), obj, SearchFilter.selectAttributes(targetAttrs, cons.getReturningAttributes()), true); if (!remove) nextMatch = answer; return answer; } } } return null; } } } Other Java examples (source code examples)Here is a short list of links related to this Java LazySearchEnumerationImpl.java source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2024 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.