예제 #1
0
def test_speed_c():
    tree = cCoverTree(metric='periodic',
                      metric_args={'cell_lengths': [10, 10, 10]})
    positions = np.random.uniform(0, 10, (10000, 3))
    for p in positions:
        tree.insert(p)
    
    positions = np.random.uniform(0, 10, (10000, 3))
    for p in positions:
        tree.query_ball(p, 0.5)
예제 #2
0
def test_speed_c():
    tree = cCoverTree(metric='periodic',
                      metric_args={'cell_lengths': [10, 10, 10]})
    positions = np.random.uniform(0, 10, (10000, 3))
    for p in positions:
        tree.insert(p)

    positions = np.random.uniform(0, 10, (10000, 3))
    for p in positions:
        tree.query_ball(p, 0.5)
예제 #3
0
def test_insert_c():
    K = 100

    positions = np.random.uniform(0, 5, (K, 3))
    tree = cCoverTree(metric='periodic',
                     metric_args={'cell_lengths': [10, 10, 10]})

    # Insert single value
    for p in positions[1:]:
        tree.insert(p)
    
    check_invariant(tree)
예제 #4
0
def test_insert_c():
    K = 100

    positions = np.random.uniform(0, 5, (K, 3))
    tree = cCoverTree(metric='periodic',
                      metric_args={'cell_lengths': [10, 10, 10]})

    # Insert single value
    for p in positions[1:]:
        tree.insert(p)

    check_invariant(tree)
예제 #5
0
def test_insert():
    K = 100

    positions = np.random.uniform(0, 5, (K, 3))
    tree = cCoverTree(metric='periodic',
                      metric_args={'cell_lengths': [10, 10, 10]})

    # Insert single value
    tree.insert(positions[0])
    check_invariant(tree)
    assert_raises(ValueError, tree.insert, positions[0])

    # Insert multiple values
    for p in positions[1:]:
        tree.insert(p)
        check_invariant(tree)
예제 #6
0
def test_insert():
    K = 100

    positions = np.random.uniform(0, 5, (K, 3))
    tree = cCoverTree(metric='periodic',
                      metric_args={'cell_lengths': [10, 10, 10]})

    # Insert single value
    tree.insert(positions[0])
    check_invariant(tree)
    assert_raises(ValueError, tree.insert, positions[0])

    # Insert multiple values
    for p in positions[1:]:
        tree.insert(p)
        check_invariant(tree)