ContiguousSet.closedOpen(1, 1),
            ContiguousSet.closedOpen(Integer.MIN_VALUE, Integer.MIN_VALUE),
            ImmutableSortedSet.of(),
            ImmutableSet.of())
        .testEquals();
    // not testing hashCode for these because it takes forever to compute
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.<Integer>all(), integers()));

      return domain.minValue();
    }

    @Override
    Comparable<?> greatestValueBelow(DiscreteDomain<Comparable<?>> domain) {
      throw new AssertionError();
    }

    @Override
    Cut<Comparable<?>> canonical(DiscreteDomain<Comparable<?>> domain) {
      try {
        return Cut.<Comparable<?>>belowValue(domain.minValue());
      } catch (NoSuchElementException e) {

            ContiguousSet.closedOpen(1, 1),
            ContiguousSet.closedOpen(Integer.MIN_VALUE, Integer.MIN_VALUE),
            ImmutableSortedSet.of(),
            ImmutableSet.of())
        .testEquals();
    // not testing hashCode for these because it takes forever to compute
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.<Integer>all(), integers()));

    log_id bigint NOT NULL
);

ALTER TABLE public.log_usage ALTER COLUMN log_id ADD GENERATED BY DEFAULT AS IDENTITY (
    SEQUENCE NAME public.log_usage_log_id_seq
    START WITH 1
    INCREMENT BY 1
    NO MINVALUE
    NO MAXVALUE
    CACHE 1
);
	`).Error; err != nil {
		t.Fatalf("failed to create table, got error %v", err)
	}

	columns, err := DB.Migrator().ColumnTypes("log_usage")
	if err != nil {

      replica.put(newValue, new AtomicInteger(1));
    }
  }

  private static void removeMinFromReplica(
      SortedMap<Integer, AtomicInteger> replica, int minValue) {
    Integer replicatedMinValue = replica.firstKey();
    assertEquals(replicatedMinValue, (Integer) minValue);
    removeFromReplica(replica, replicatedMinValue);
  }

  private static void removeMaxFromReplica(

        searchRenderData.setAllRecordCount(Long.MIN_VALUE);
        searchRenderData.setCurrentStartRecordNumber(Long.MIN_VALUE);
        searchRenderData.setCurrentEndRecordNumber(Long.MIN_VALUE + 10);
        searchRenderData.setPageSize(Integer.MIN_VALUE);
        searchRenderData.setAllPageCount(Integer.MIN_VALUE);
        searchRenderData.setCurrentPageNumber(Integer.MIN_VALUE);

        // The comparator b2 - b1 with MAX_VALUE and MIN_VALUE causes overflow
        List<Integer> executionOrder = PriorityTrackingBooster.getExecutionOrder();
        assertEquals(3, executionOrder.size());
        assertEquals(Integer.valueOf(Integer.MIN_VALUE), executionOrder.get(0));
        assertEquals(Integer.valueOf(Integer.MAX_VALUE), executionOrder.get(1));

        assertEquals(Long.MAX_VALUE, dictionaryItem.getId());
    }

    public void test_getId_minValue() {
        // Test with minimum Long value
        dictionaryItem.id = Long.MIN_VALUE;
        assertEquals(Long.MIN_VALUE, dictionaryItem.getId());
    }

    public void test_multipleInstances() {
        // Test that different instances have independent ID values

        crawlerContext.setActiveThreadCount(Integer.MIN_VALUE);
        assertEquals(Integer.MIN_VALUE, crawlerContext.getActiveThreadCount().intValue());

        crawlerContext.setNumOfThread(Integer.MIN_VALUE);
        assertEquals(Integer.MIN_VALUE, crawlerContext.getNumOfThread());

        crawlerContext.setMaxThreadCheckCount(Integer.MIN_VALUE);
        assertEquals(Integer.MIN_VALUE, crawlerContext.getMaxThreadCheckCount());

        void shouldHandleMinimumLongValues() {
            // Given
            TestAllocInfo allocInfo = new TestAllocInfo(Long.MIN_VALUE, Long.MIN_VALUE);

            // When & Then
            assertEquals(Long.MIN_VALUE, allocInfo.getCapacity());
            assertEquals(Long.MIN_VALUE, allocInfo.getFree());
        }

        @Test
        @DisplayName("Should calculate used space correctly")