/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at legal-notices/CDDLv1_0.txt
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at legal-notices/CDDLv1_0.txt.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information:
* Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*
*
* Copyright 2006-2009 Sun Microsystems, Inc.
*/
/**
* This class defines the integerOrderingMatch matching rule defined in X.520
* and referenced in RFC 4519.
*/
public class IntegerOrderingMatchingRule
extends AbstractMatchingRule
implements OrderingMatchingRule
{
/**
* The serial version identifier required to satisfy the compiler because this
* class implements the <CODE>java.io.Serializable</CODE> interface. This
* value was generated using the <CODE>serialver</CODE> command-line utility
* included with the Java SDK.
*/
/**
* Creates a new instance of this integerOrderingMatch matching rule.
*/
public IntegerOrderingMatchingRule()
{
super();
}
/**
* {@inheritDoc}
*/
{
}
/**
* Retrieves the common name for this matching rule.
*
* @return The common name for this matching rule, or <CODE>null</CODE> if
* it does not have a name.
*/
{
return OMR_INTEGER_NAME;
}
/**
* Retrieves the OID for this matching rule.
*
* @return The OID for this matching rule.
*/
{
return OMR_INTEGER_OID;
}
/**
* Retrieves the description for this matching rule.
*
* @return The description for this matching rule, or <CODE>null</CODE> if
* there is none.
*/
{
// There is no standard description for this matching rule.
return null;
}
/**
* Retrieves the OID of the syntax with which this matching rule is
* associated.
*
* @return The OID of the syntax with which this matching rule is associated.
*/
{
return SYNTAX_INTEGER_OID;
}
/**
* Retrieves the normalized form of the provided value, which is best suited
* for efficiently performing matching operations on that value.
*
* @param value The value to be normalized.
*
* @return The normalized version of the provided value.
*
* @throws DirectoryException If the provided value is invalid according to
* the associated attribute syntax.
*/
throws DirectoryException
{
boolean logged = false;
for (int i=0; i < length; i++)
{
{
case '0':
{
case 0:
// This is only OK if the value is zero
if (i == (length-1))
{
}
else
{
switch (DirectoryServer.getSyntaxEnforcementPolicy())
{
case REJECT:
throw new DirectoryException(
case WARN:
if (! logged)
{
logged = true;
}
break;
}
}
break;
case 1:
// This is OK as long as the first character isn't a dash.
{
switch (DirectoryServer.getSyntaxEnforcementPolicy())
{
case REJECT:
throw new DirectoryException(
case WARN:
if (! logged)
{
logged = true;
message);
}
break;
}
}
else
{
}
break;
default:
// This is always fine.
break;
}
break;
case '1':
break;
case '2':
break;
case '3':
break;
case '4':
break;
case '5':
break;
case '6':
break;
case '7':
break;
case '8':
break;
case '9':
break;
case '-':
// This is only OK if the buffer is empty.
{
}
else
{
switch (DirectoryServer.getSyntaxEnforcementPolicy())
{
case REJECT:
throw new DirectoryException(
case WARN:
if (! logged)
{
logged = true;
message);
}
break;
}
}
break;
default:
switch (DirectoryServer.getSyntaxEnforcementPolicy())
{
case REJECT:
throw new DirectoryException(
case WARN:
if (! logged)
{
logged = true;
message);
}
break;
}
}
}
{
switch (DirectoryServer.getSyntaxEnforcementPolicy())
{
case REJECT:
message);
case WARN:
if (! logged)
{
logged = true;
message);
}
break;
default:
break;
}
}
{
switch (DirectoryServer.getSyntaxEnforcementPolicy())
{
case REJECT:
message);
case WARN:
if (! logged)
{
logged = true;
message);
}
break;
default:
break;
}
}
}
/**
* Compares the first value to the second and returns a value that indicates
* their relative order.
*
* @param value1 The normalized form of the first value to compare.
* @param value2 The normalized form of the second value to compare.
*
* @return A negative integer if <CODE>value1</CODE> should come before
* <CODE>value2</CODE> in ascending order, a positive integer if
* <CODE>value1</CODE> should come after <CODE>value2</CODE> in
* ascending order, or zero if there is no difference between the
* values with regard to ordering.
*/
{
// A length of zero should be considered a value of zero.
if (b1Length == 0)
{
if (b2Length == 0)
{
return 0;
}
{
return 1;
}
else
{
return -1;
}
}
else if (b2Length == 0)
{
{
return -1;
}
else
{
return 1;
}
}
// Starting with a dash should be an indicator of a negative value.
{
{
{
return -1;
}
{
return 1;
}
else
{
for (int i=1; i < b1Length; i++)
{
{
return -1;
}
{
return 1;
}
}
return 0;
}
}
else
{
return -1;
}
}
{
return 1;
}
// They are both positive, so see which one's bigger.
{
return 1;
}
{
return -1;
}
else
{
for (int i=0; i < b1Length; i++)
{
{
return 1;
}
{
return -1;
}
}
return 0;
}
}
/**
* Compares the contents of the provided byte arrays to determine their
* relative order.
*
* @param b1 The first byte array to use in the comparison.
* @param b2 The second byte array to use in the comparison.
*
* @return A negative integer if <CODE>b1</CODE> should come before
* <CODE>b2</CODE> in ascending order, a positive integer if
* <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending
* order, or zero if there is no difference between the values with
* regard to ordering.
*/
{
// A length of zero should be considered a value of zero.
if (b1Length == 0)
{
if (b2Length == 0)
{
return 0;
}
{
return 1;
}
else
{
return -1;
}
}
else if (b2Length == 0)
{
{
return -1;
}
else
{
return 1;
}
}
// Starting with a dash should be an indicator of a negative value.
{
{
{
return -1;
}
{
return 1;
}
else
{
for (int i=1; i < b1Length; i++)
{
{
return -1;
}
{
return 1;
}
}
return 0;
}
}
else
{
return -1;
}
}
{
return 1;
}
// They are both positive, so see which one's bigger.
{
return 1;
}
{
return -1;
}
else
{
for (int i=0; i < b1Length; i++)
{
{
return 1;
}
{
return -1;
}
}
return 0;
}
}
}