graphtest

Documentation

Index

• func TestConcurrentEdgeIterators(t *testing.T, g graph.Graph)
• func TestConcurrentLinkIterators(t *testing.T, g graph.Graph)
• func TestEdgeIteratorTimeFilter(t *testing.T, g graph.Graph)
• func TestFindLink(t *testing.T, g graph.Graph)
• func TestLinkIteratorTimeFilter(t *testing.T, g graph.Graph)
• func TestPartitionedEdgeIterators(t *testing.T, g graph.Graph)
• func TestPartitionedLinkIterators(t *testing.T, g graph.Graph)
• func TestRemoveStaleEdges(t *testing.T, g graph.Graph)
• func TestUpsertEdge(t *testing.T, g graph.Graph)
• func TestUpsertLink(t *testing.T, g graph.Graph)
• type Suite
  • func (s *Suite) TestGraph(t *testing.T)

Functions

func TestConcurrentEdgeIterators

func TestConcurrentEdgeIterators(t *testing.T, g graph.Graph)

TestConcurrentEdgeIterators verifies that multiple clients can concurrently access the store.

func TestConcurrentLinkIterators

func TestConcurrentLinkIterators(t *testing.T, g graph.Graph)

TestConcurrentLinkIterators verifies that multiple clients can concurrently access the store.

func TestEdgeIteratorTimeFilter

func TestEdgeIteratorTimeFilter(t *testing.T, g graph.Graph)

TestEdgeIteratorTimeFilter verifies that the time-based filtering of the edge iterator works as expected.

func TestFindLink

func TestFindLink(t *testing.T, g graph.Graph)

TestFindLink verifies the link lookup logic.

func TestLinkIteratorTimeFilter

func TestLinkIteratorTimeFilter(t *testing.T, g graph.Graph)

TestLinkIteratorTimeFilter verifies that the time-based filtering of the link iterator works as expected.

func TestPartitionedEdgeIterators

func TestPartitionedEdgeIterators(t *testing.T, g graph.Graph)

TestPartitionedEdgeIterators verifies that the graph partitioning logic works as expected even when partitions contain an uneven number of items.

func TestPartitionedLinkIterators

func TestPartitionedLinkIterators(t *testing.T, g graph.Graph)

TestPartitionedLinkIterators verifies that the graph partitioning logic works as expected even when partitions contain an uneven number of items.

func TestRemoveStaleEdges

func TestRemoveStaleEdges(t *testing.T, g graph.Graph)

TestRemoveStaleEdges verifies that the edge deletion logic works as expected.

func TestUpsertEdge

func TestUpsertEdge(t *testing.T, g graph.Graph)

TestUpsertEdge verifies the edge upsert logic.

func TestUpsertLink

func TestUpsertLink(t *testing.T, g graph.Graph)

TestUpsertLink verifies the link upsert logic.

Types

type Suite

type Suite struct {
	G graph.Graph

	// Optional helper functions.
	BeforeEach func(*testing.T)
	AfterEach  func(*testing.T)
}

Suite defines a re-usable set of graph-related tests that can be executed against any type that implements graph.Graph.

func (*Suite) TestGraph

func (s *Suite) TestGraph(t *testing.T)