content: /*
   ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~
   ~                                                                               ~
   ~ The MIT License (MIT)                                                         ~
   ~                                                                               ~
   ~ Copyright (c) 2015-2025 miaixz.org and other contributors.                    ~
   ~                                                                               ~
   ~ Permission is hereby granted, free of charge, to any person obtaining a copy  ~
   ~ of this software and associated documentation files (the "Software"), to deal ~
   ~ in the Software without restriction, including without limitation the rights  ~
   ~ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell     ~
   ~ copies of the Software, and to permit persons to whom the Software is         ~
   ~ furnished to do so, subject to the following conditions:                      ~
   ~                                                                               ~
   ~ The above copyright notice and this permission notice shall be included in    ~
   ~ all copies or substantial portions of the Software.                           ~
   ~                                                                               ~
   ~ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR    ~
   ~ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,      ~
   ~ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE   ~
   ~ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER        ~
   ~ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, ~
   ~ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN     ~
   ~ THE SOFTWARE.                                                                 ~
   ~                                                                               ~
   ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~
  */
  package org.miaixz.bus.core.lang.range;
  
  import java.util.Objects;
  
  import org.miaixz.bus.core.text.CharsBacker;
  import org.miaixz.bus.core.xyz.ObjectKit;
  
  /**
   * 由一个有限值构成的边界
   *
   * @param <T> 边界值类型
   * @author Kimi Liu
   * @since Java 17+
   */
  public class FiniteBound<T extends Comparable<? super T>> implements Bound<T> {
  
      /**
       * 边界值
       */
      private final T value;
  
      /**
       * 边界类型
       */
      private final BoundType type;
  
      /**
       * 构造
       *
       * @param value 边界值
       * @param type  边界类型
       */
      FiniteBound(final T value, final BoundType type) {
          this.value = value;
          this.type = type;
      }
  
      /**
       * 获取边界值
       *
       * @return 边界值
       */
      @Override
      public T getValue() {
          return value;
      }
  
      /**
       * 获取边界类型
       *
       * @return 边界类型
       */
      @Override
      public BoundType getType() {
          return type;
      }
  
      /**
       * 检验指定值是否在当前边界表示的范围内
       *
       * @param t 要检验的值，不允许为{@code null}
       * @return 是否
       */
      @Override
      public boolean test(final T t) {
          final BoundType bt = this.getType();
          final int compareValue = getValue().compareTo(t);
          // 与边界值相等
          if (compareValue == 0) {
              return bt.isClose();
          }
          // 小于或大于边界值
          return compareValue > 0 ? bt.isUpperBound() : bt.isLowerBound();
      }
  
      /**
       * <p>
       * 比较另一边界与当前边界在坐标轴上位置的先后顺序。 若令当前边界为<em>t1</em>，另一边界为<em>t2</em>，则有
       * <ul>
       * <li>-1：<em>t1</em>在<em>t2</em>的左侧；</li>
       * <li>0：<em>t1</em>与<em>t2</em>的重合；</li>
       * <li>-1：<em>t1</em>在<em>t2</em>的右侧；</li>
       * </ul>
       *
       * @param bound 边界
       * @return 位置
       */
      @Override
      public int compareTo(final Bound<T> bound) {
          // 另一边界为无限小的左边界，则当前边界必然靠后
          if (bound instanceof NoneLowerBound) {
              return 1;
          }
          // 另一边界为无限大的右边界，则当前边界必然靠前
          if (bound instanceof NoneUpperBound) {
              return -1;
          }
          // 两值不相等，直接比较边界值
          if (ObjectKit.notEquals(getValue(), bound.getValue())) {
              return getValue().compareTo(bound.getValue());
          }
          // 两边界值相等
          return compareIfSameBoundValue(bound);
      }
  
      /**
       * 获取{@code "[value"}或{@code "(value"}格式的字符串
       *
       * @return 字符串
       */
      @Override
      public String descBound() {
          final BoundType bt = getType();
          return bt.isLowerBound() ? bt.getSymbol() + getValue() : getValue() + bt.getSymbol();
      }
  
      /**
       * 对当前边界取反
       *
       * @return 取反后的边界
       */
      @Override
      public Bound<T> negate() {
          return new FiniteBound<>(value, getType().negate());
      }
  
      /**
       * 将当前实例转为一个区间
       *
       * @return 区间
       */
      @Override
      public BoundedRange<T> toRange() {
          return getType().isLowerBound() ? new BoundedRange<>(this, Bound.noneUpperBound())
                  : new BoundedRange<>(Bound.noneLowerBound(), this);
      }
  
      /**
       * 两实例是否相等
       *
       * @param o 另一实例
       * @return 是否
       */
      @Override
      public boolean equals(final Object o) {
          if (this == o) {
              return true;
          }
          if (o == null || getClass() != o.getClass()) {
              return false;
          }
          final FiniteBound<?> that = (FiniteBound<?>) o;
          return value.equals(that.value) && type == that.type;
      }
  
      /**
       * 获取哈希值
       *
       * @return 哈希值
       */
      @Override
      public int hashCode() {
          return Objects.hash(value, type);
      }
  
      /**
       * 获得当前实例对应的{@code {x| x >= xxx}}格式的不等式字符串
       *
       * @return 字符串
       */
      @Override
      public String toString() {
          return CharsBacker.format("{x | x {} {}}", type.getOperator(), value);
      }
  
      /**
       * 当两个边界的值不相等时，判断它们在坐标轴上位置的先后顺序
       */
      private int compareIfSameBoundValue(final Bound<T> bound) {
          final BoundType bt1 = this.getType();
          final BoundType bt2 = bound.getType();
          // 两边界类型相同，说明连边界重合
          if (bt1 == bt2) {
              return 0;
          }
          // 一为左边界，一为右边界，则左边界恒在右边界后
          if (bt1.isDislocated(bt2)) {
              return bt1.isLowerBound() ? 1 : -1;
          }
          // 都为左边界，则封闭边界在前，若都为右边界，则封闭边界在后
          return Integer.compare(bt1.getCode(), bt2.getCode());
      }
  
  }
  