All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.fitbur.apache.commons.lang.math.LongRange Maven / Gradle / Ivy

There is a newer version: 1.0.0
Show newest version
/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in com.fitburpliance with
 * the License.  You may obtain a copy of the License at
 * 
 *      http://www.apache.com.fitbur/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.fitbur.apache.com.fitburmons.lang.math;

import java.io.Serializable;

import com.fitbur.apache.com.fitburmons.lang.text.StrBuilder;

/**
 * 

LongRange represents an inclusive range of longs.

* * @author Apache Software Foundation * @since 2.0 * @version $Id: LongRange.java 1057072 2011-01-10 01:55:57Z niallp $ */ public final class LongRange extends Range implements Serializable { /** * Required for serialization support. * * @see java.io.Serializable */ private static final long serialVersionUID = 71849363892720L; /** * The minimum number in this range (inclusive). */ private final long min; /** * The maximum number in this range (inclusive). */ private final long max; /** * Cached output minObject (class is immutable). */ private transient Long minObject = null; /** * Cached output maxObject (class is immutable). */ private transient Long maxObject = null; /** * Cached output hashCode (class is immutable). */ private transient int hashCode = 0; /** * Cached output toString (class is immutable). */ private transient String toString = null; /** *

Constructs a new LongRange using the specified * number as both the minimum and maximum in this range.

* * @param number the number to use for this range */ public LongRange(long number) { super(); this.min = number; this.max = number; } /** *

Constructs a new LongRange using the specified * number as both the minimum and maximum in this range.

* * @param number the number to use for this range, must not * be null * @throws IllegalArgumentException if the number is null */ public LongRange(Number number) { super(); if (number == null) { throw new IllegalArgumentException("The number must not be null"); } this.min = number.longValue(); this.max = number.longValue(); if (number instanceof Long) { this.minObject = (Long) number; this.maxObject = (Long) number; } } /** *

Constructs a new LongRange with the specified * minimum and maximum numbers (both inclusive).

* *

The arguments may be passed in the order (min,max) or (max,min). The * getMinimum and getMaximum methods will return the correct values.

* * @param number1 first number that com.fitburfines the edge of the range, inclusive * @param number2 second number that com.fitburfines the edge of the range, inclusive */ public LongRange(long number1, long number2) { super(); if (number2 < number1) { this.min = number2; this.max = number1; } else { this.min = number1; this.max = number2; } } /** *

Constructs a new LongRange with the specified * minimum and maximum numbers (both inclusive).

* *

The arguments may be passed in the order (min,max) or (max,min). The * getMinimum and getMaximum methods will return the correct values.

* * @param number1 first number that com.fitburfines the edge of the range, inclusive * @param number2 second number that com.fitburfines the edge of the range, inclusive * @throws IllegalArgumentException if either number is null */ public LongRange(Number number1, Number number2) { super(); if (number1 == null || number2 == null) { throw new IllegalArgumentException("The numbers must not be null"); } long number1val = number1.longValue(); long number2val = number2.longValue(); if (number2val < number1val) { this.min = number2val; this.max = number1val; if (number2 instanceof Long) { this.minObject = (Long) number2; } if (number1 instanceof Long) { this.maxObject = (Long) number1; } } else { this.min = number1val; this.max = number2val; if (number1 instanceof Long) { this.minObject = (Long) number1; } if (number2 instanceof Long) { this.maxObject = (Long) number2; } } } // Accessors //-------------------------------------------------------------------- /** *

Returns the minimum number in this range.

* * @return the minimum number in this range */ public Number getMinimumNumber() { if (minObject == null) { minObject = new Long(min); } return minObject; } /** *

Gets the minimum number in this range as a long.

* * @return the minimum number in this range */ public long getMinimumLong() { return min; } /** *

Gets the minimum number in this range as a int.

* *

This conversion can lose information for large values.

* * @return the minimum number in this range */ public int getMinimumInteger() { return (int) min; } /** *

Gets the minimum number in this range as a double.

* *

This conversion can lose information for large values.

* * @return the minimum number in this range */ public double getMinimumDouble() { return min; } /** *

Gets the minimum number in this range as a float.

* *

This conversion can lose information for large values.

* * @return the minimum number in this range */ public float getMinimumFloat() { return min; } /** *

Returns the maximum number in this range.

* * @return the maximum number in this range */ public Number getMaximumNumber() { if (maxObject == null) { maxObject = new Long(max); } return maxObject; } /** *

Gets the maximum number in this range as a long.

* * @return the maximum number in this range */ public long getMaximumLong() { return max; } /** *

Gets the maximum number in this range cast to an int.

* *

This conversion can lose information for large values.

* * @return the maximum number in this range cast to an int. */ public int getMaximumInteger() { return (int) max; } /** *

Gets the maximum number in this range as a double.

* *

This conversion can lose information for large values.

* * @return The maximum number in this range as a double. */ public double getMaximumDouble() { return max; } /** *

Gets the maximum number in this range as a float.

* *

This conversion can lose information for large values.

* * @return The maximum number in this range as a float. */ public float getMaximumFloat() { return max; } // Tests //-------------------------------------------------------------------- /** *

Tests whether the specified number occurs within * this range using long com.fitburparison.

* *

null is handled and returns false.

* * @param number the number to test, may be null * @return true if the specified number occurs within this range */ public boolean containsNumber(Number number) { if (number == null) { return false; } return containsLong(number.longValue()); } /** *

Tests whether the specified long occurs within * this range using long com.fitburparison.

* *

This implementation overrides the superclass for performance as it is * the most com.fitburmon case.

* * @param value the long to test * @return true if the specified number occurs within this * range by long com.fitburparison */ public boolean containsLong(long value) { return value >= min && value <= max; } // Range tests //-------------------------------------------------------------------- /** *

Tests whether the specified range occurs entirely within this range * using long com.fitburparison.

* *

null is handled and returns false.

* * @param range the range to test, may be null * @return true if the specified range occurs entirely within this range * @throws IllegalArgumentException if the range is not of this type */ public boolean containsRange(Range range) { if (range == null) { return false; } return containsLong(range.getMinimumLong()) && containsLong(range.getMaximumLong()); } /** *

Tests whether the specified range overlaps with this range * using long com.fitburparison.

* *

null is handled and returns false.

* * @param range the range to test, may be null * @return true if the specified range overlaps with this range */ public boolean overlapsRange(Range range) { if (range == null) { return false; } return range.containsLong(min) || range.containsLong(max) || containsLong(range.getMinimumLong()); } // Basics //-------------------------------------------------------------------- /** *

Compares this range to another object to test if they are equal.

. * *

To be equal, the class, minimum and maximum must be equal.

* * @param obj the reference object with which to com.fitburpare * @return true if this object is equal */ public boolean equals(Object obj) { if (obj == this) { return true; } if (obj instanceof LongRange == false) { return false; } LongRange range = (LongRange) obj; return min == range.min && max == range.max; } /** *

Gets a hashCode for the range.

* * @return a hash code value for this object */ public int hashCode() { if (hashCode == 0) { hashCode = 17; hashCode = 37 * hashCode + getClass().hashCode(); hashCode = 37 * hashCode + ((int) (min ^ (min >> 32))); hashCode = 37 * hashCode + ((int) (max ^ (max >> 32))); } return hashCode; } /** *

Gets the range as a String.

* *

The format of the String is 'Range[min,max]'.

* * @return the String representation of this range */ public String toString() { if (toString == null) { StrBuilder buf = new StrBuilder(32); buf.append("Range["); buf.append(min); buf.append(','); buf.append(max); buf.append(']'); toString = buf.toString(); } return toString; } /** *

Returns an array containing all the long values in the range.

* * @return the long[] representation of this range * @since 2.4 */ public long[] toArray() { long[] array = new long[(int)(max - min + 1L)]; for(int i = 0; i < array.length; i++) { array[i] = min + i; } return array; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy