/*
 * 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 compliance
 * with the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/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 org.apache.hadoop.hbase.procedure2.store.wal;

import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertFalse;
import static org.junit.jupiter.api.Assertions.assertTrue;

import org.apache.hadoop.hbase.procedure2.Procedure;
import org.apache.hadoop.hbase.procedure2.store.wal.ProcedureStoreTracker.DeleteState;
import org.apache.hadoop.hbase.testclassification.MasterTests;
import org.apache.hadoop.hbase.testclassification.SmallTests;
import org.junit.jupiter.api.Tag;
import org.junit.jupiter.api.Test;

@Tag(MasterTests.TAG)
@Tag(SmallTests.TAG)
public class TestBitSetNode {

  @Test
  public void testGetActiveMaxMinProcId() {
    BitSetNode node = new BitSetNode(5L, false);
    assertEquals(5L, node.getActiveMinProcId());
    assertEquals(5L, node.getActiveMaxProcId());
    node.insertOrUpdate(10L);
    assertEquals(5L, node.getActiveMinProcId());
    assertEquals(10L, node.getActiveMaxProcId());
    node.insertOrUpdate(1L);
    assertEquals(1L, node.getActiveMinProcId());
    assertEquals(10L, node.getActiveMaxProcId());

    node.delete(10L);
    assertEquals(1L, node.getActiveMinProcId());
    assertEquals(5L, node.getActiveMaxProcId());
    node.delete(1L);
    assertEquals(5L, node.getActiveMinProcId());
    assertEquals(5L, node.getActiveMaxProcId());
    node.delete(5L);
    assertEquals(Procedure.NO_PROC_ID, node.getActiveMinProcId());
    assertEquals(Procedure.NO_PROC_ID, node.getActiveMaxProcId());
  }

  @Test
  public void testGrow() {
    BitSetNode node = new BitSetNode(1000, false);
    // contains, do not need to grow but should not fail
    assertTrue(node.canGrow(1024));
    assertTrue(node.canGrow(900));
    assertTrue(node.canGrow(1100));
    assertFalse(node.canGrow(100));
    assertFalse(node.canGrow(10000));

    // grow to right
    node.grow(1100);
    assertTrue(node.contains(1100));
    assertTrue(node.isModified(1000));
    // grow to left
    node.grow(900);
    assertTrue(node.contains(900));
    assertTrue(node.isModified(1000));
    for (long i = node.getStart(); i <= node.getEnd(); i++) {
      if (i != 1000) {
        assertEquals(DeleteState.YES, node.isDeleted(i));
      } else {
        assertEquals(DeleteState.NO, node.isDeleted(i));
      }
    }
  }

  @Test
  public void testMerge() {
    BitSetNode node = new BitSetNode(1000, false);
    assertTrue(node.canMerge(new BitSetNode(1200, false)));
    assertFalse(node.canMerge(new BitSetNode(10000, false)));
    BitSetNode rightNode = new BitSetNode(1200, false);
    node.merge(rightNode);
    assertTrue(node.isModified(1000));
    assertTrue(node.isModified(1200));
    for (long i = node.getStart(); i <= node.getEnd(); i++) {
      if (i != 1000 && i != 1200) {
        assertEquals(DeleteState.YES, node.isDeleted(i));
      } else {
        assertEquals(DeleteState.NO, node.isDeleted(i));
      }
    }
  }
}
