Package org.apache.ldap.common.util

Examples of org.apache.ldap.common.util.EmptyEnumeration

739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
        {
            Object value = get( key );
           
            if ( null == value )
            {
                return new EmptyEnumeration();
            }
            else
            {
                return new SingletonEnumeration( value );
            }
        }

        set = ( TreeSet ) getRaw( key );
        if ( null == set )
        {
            return new EmptyEnumeration();
        }

        final Iterator list = set.iterator();
        return new NamingEnumeration()
        {
View Full Code Here
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
        {
            Object val = getRaw( key );
           
            if ( null == val )
            {
                return new EmptyEnumeration();
            }
            else
            {
                return new SingletonEnumeration(
                    new Tuple( key, getRaw( key ) ) );
            }
        }

        set = ( TreeSet ) getRaw( key );
        if ( set == null )
        {
            return new EmptyEnumeration();
        }

        return new TupleEnumeration( key, set.iterator() );
    }
View Full Code Here
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
        {
            Object rval = getRaw( key );

            if ( null == rval ) // key does not exist so return nothing
            {
                return new EmptyEnumeration();
            }
            else if ( val.equals( rval ) ) // val == rval return tuple
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }
            // val >= val and test is for greater then return tuple
            else if ( comparator.compareValue( val, rval ) >= 1 && isGreaterThan )
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }
            // val <= val and test is for lesser then return tuple
            else if ( comparator.compareValue( val, rval ) <= 1 && ! isGreaterThan )
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }

            return new EmptyEnumeration();
        }

       
        set = ( TreeSet ) getRaw( key );
        if ( set == null )
        {
            return new EmptyEnumeration();
        }

        if ( isGreaterThan )
        {
            return new TupleEnumeration( key,
View Full Code Here
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
        {
            Object value = get( key );
           
            if ( null == value )
            {
                return new EmptyEnumeration();
            }
            else
            {
                return new SingletonEnumeration( value );
            }
        }

        set = ( TreeSet ) getRaw( key );
        if ( null == set )
        {
            return new EmptyEnumeration();
        }

        final Iterator list = set.iterator();
        return new NamingEnumeration()
        {
View Full Code Here
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
        {
            Object val = getRaw( key );
           
            if ( null == val )
            {
                return new EmptyEnumeration();
            }
            else
            {
                return new SingletonEnumeration(
                    new Tuple( key, getRaw( key ) ) );
            }
        }

        set = ( TreeSet ) getRaw( key );
        if ( set == null )
        {
            return new EmptyEnumeration();
        }

        return new TupleEnumeration( key, set.iterator() );
    }
View Full Code Here
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
        {
            Object rval = getRaw( key );

            if ( null == rval ) // key does not exist so return nothing
            {
                return new EmptyEnumeration();
            }
            else if ( val.equals( rval ) ) // val == rval return tuple
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }
            // val >= val and test is for greater then return tuple
            else if ( comparator.compareValue( val, rval ) >= 1 && isGreaterThan )
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }
            // val <= val and test is for lesser then return tuple
            else if ( comparator.compareValue( val, rval ) <= 1 && ! isGreaterThan )
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }

            return new EmptyEnumeration();
        }

       
        set = ( TreeSet ) getRaw( key );
        if ( set == null )
        {
            return new EmptyEnumeration();
        }

        if ( isGreaterThan )
        {
            return new TupleEnumeration( key,
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
                StringBuffer buf = new StringBuffer();
                buf.append( "undefined filter based on undefined attributeType '" );
                buf.append( ln.getAttribute() );
                buf.append( "' not evaluted at all.  Returning empty enumeration." );
                log.warn( buf.toString() );
                return new EmptyEnumeration();
            }
        }

        filter.accept( visitor );

        // check that after pruning we have valid branch node at the top
        if ( ! filter.isLeaf() )
        {
            BranchNode child = ( BranchNode ) filter;

            // if the remaining filter branch node has no children return an empty enumeration
            if ( child.getChildren().size() == 0 )
            {
                log.warn( "Undefined branchnode filter without child nodes not evaluted at all.  Returning empty enumeration." );
                return new EmptyEnumeration();
            }

            // now for AND & OR nodes with a single child left replace them with their child
            if ( child.getChildren().size() == 1 && child.getOperator() != BranchNode.NOT )
            {
View Full Code Here
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
        {
            Object value = get( key );
           
            if ( null == value )
            {
                return new EmptyEnumeration();
            }
            else
            {
                return new SingletonEnumeration( value );
            }
        }

        set = ( TreeSet ) getRaw( key );
        if ( null == set )
        {
            return new EmptyEnumeration();
        }

        final Iterator list = set.iterator();
        return new NamingEnumeration()
        {
View Full Code Here
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
        {
            Object val = getRaw( key );
           
            if ( null == val )
            {
                return new EmptyEnumeration();
            }
            else
            {
                return new SingletonEnumeration(
                    new Tuple( key, getRaw( key ) ) );
            }
        }

        set = ( TreeSet ) getRaw( key );
        if ( set == null )
        {
            return new EmptyEnumeration();
        }

        return new TupleEnumeration( key, set.iterator() );
    }
View Full Code Here
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
        {
            Object rval = getRaw( key );

            if ( null == rval ) // key does not exist so return nothing
            {
                return new EmptyEnumeration();
            }
            else if ( val.equals( rval ) ) // val == rval return tuple
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }
            // val >= val and test is for greater then return tuple
            else if ( comparator.compareValue( val, rval ) >= 1 && isGreaterThan )
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }
            // val <= val and test is for lesser then return tuple
            else if ( comparator.compareValue( val, rval ) <= 1 && ! isGreaterThan )
            {
                return new SingletonEnumeration( new Tuple( key, val ) );
            }

            return new EmptyEnumeration();
        }

       
        set = ( TreeSet ) getRaw( key );
        if ( set == null )
        {
            return new EmptyEnumeration();
        }

        if ( isGreaterThan )
        {
            return new TupleEnumeration( key,
View Full Code Here
TOP

Related Classes of org.apache.ldap.common.util.EmptyEnumeration

  • org.apache.ldap.server.db.jdbm.JdbmTable
  • org.apache.ldap.server.normalization.NormalizationService
  • org.apache.ldap.server.partition.impl.btree.jdbm.JdbmTable
    • 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.