예제 #1
0
def test_lsm_tree_large_inserts(test_folder):
    n = 30000
    tree = LSMTree(test_folder)
    for i in range(n):
        tree.insert(i), i
    for i in range(n):
        assert tree.query(i), i
    assert not tree.query(n)
예제 #2
0
def test_lsm_tree_random_inserts(test_folder):
    n = 3000
    arr = np.arange(n)
    np.random.shuffle(arr)
    tree = LSMTree(test_folder)
    for i in arr:
        tree.insert(i), i
    for i in arr:
        assert tree.query(i), i
    assert not tree.query(n)
예제 #3
0
def test_lsm_tree_large_random_inserts(test_folder):
    n = 100000
    arr = np.arange(n)
    rng = np.random.RandomState(42)
    rng.shuffle(arr)
    tree = LSMTree(test_folder)
    for i in arr:
        tree.insert(i), i
    for i in np.arange(n):
        assert tree.query(i), i
    assert not tree.query(n)
예제 #4
0
def test_lsm_tree_reverse_inserts(test_folder):
    n = 1000000
    tree = LSMTree(test_folder)
    for i in reversed(range(n)):
        tree.insert(i), i
    assert not tree.query(n)