/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package org.neo4j.internal.batchimport.cache.idmapping.string;

import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.neo4j.internal.batchimport.cache.NumberArrayFactories.AUTO_WITHOUT_PAGECACHE;
import static org.neo4j.internal.batchimport.cache.NumberArrayFactories.CHUNKED_FIXED_SIZE;
import static org.neo4j.internal.batchimport.cache.NumberArrayFactories.HEAP;
import static org.neo4j.internal.batchimport.cache.NumberArrayFactories.OFF_HEAP;
import static org.neo4j.memory.EmptyMemoryTracker.INSTANCE;

import java.util.Arrays;
import java.util.Collection;
import org.junit.jupiter.api.extension.ExtendWith;
import org.junit.jupiter.params.ParameterizedTest;
import org.junit.jupiter.params.provider.MethodSource;
import org.neo4j.internal.batchimport.cache.NumberArrayFactory;
import org.neo4j.test.RandomSupport;
import org.neo4j.test.extension.Inject;
import org.neo4j.test.extension.RandomExtension;

@ExtendWith(RandomExtension.class)
class LongCollisionValuesTest {
    @Inject
    private RandomSupport random;

    static Collection<NumberArrayFactory> data() {
        return Arrays.asList(HEAP, OFF_HEAP, AUTO_WITHOUT_PAGECACHE, CHUNKED_FIXED_SIZE);
    }

    @ParameterizedTest
    @MethodSource("data")
    void shouldStoreAndLoadLongs(NumberArrayFactory factory) {
        // given
        try (LongCollisionValues values = new LongCollisionValues(factory, 100, INSTANCE)) {
            // when
            long[] offsets = new long[100];
            long[] longs = new long[offsets.length];
            for (int i = 0; i < offsets.length; i++) {
                long value = random.nextLong(Long.MAX_VALUE);
                offsets[i] = values.add(value);
                longs[i] = value;
            }

            // then
            for (int i = 0; i < offsets.length; i++) {
                assertEquals(longs[i], (long) values.get(offsets[i]));
            }
        }
    }
}
