move_ordering_test.cc File Reference

#include <random>
#include <string>
#include <cmath>
#include <gtest/gtest.h>
#include <search_move_ordering.H>

Include dependency graph for move_ordering_test.cc:

Go to the source code of this file.

Functions
	TEST (KillerMoveTable, EmptyTableReportsFalse)
	TEST (KillerMoveTable, RecordAndQuery)
	TEST (KillerMoveTable, TwoSlotsPerDepth)
	TEST (KillerMoveTable, ThirdRecordEvictsOldest)
	TEST (KillerMoveTable, DuplicateRecordIsNoOp)
	TEST (KillerMoveTable, IndependentDepths)
	TEST (KillerMoveTable, ClearResetsAll)
	TEST (KillerMoveTable, SparseDepthAccess)
	TEST (KillerMoveTable, NonComparableMovesUseNoOpTable)
	TEST (KillerMoveTable, StringMoves)
	TEST (HistoryHeuristicTable, EmptyTableReturnsZero)
	TEST (HistoryHeuristicTable, RecordAndScore)
	TEST (HistoryHeuristicTable, AccumulatesBonus)
	TEST (HistoryHeuristicTable, DefaultBonusIsOne)
	TEST (HistoryHeuristicTable, IndependentKeys)
	TEST (HistoryHeuristicTable, ClearResetsAll)
	TEST (HistoryHeuristicTable, NullTableIsNoOp)
	TEST (SortRankedMoves, SortsByPriorityDescending)
	TEST (SortRankedMoves, KillerMovesFirst)
	TEST (SortRankedMoves, HistoryBreaksTies)
	TEST (SortRankedMoves, OrdinalBreaksTiesWhenEverythingEqual)
	TEST (SortRankedMoves, KillerThenHistoryThenPriority)
	TEST (SortRankedMoves, SingleElementIsNoOp)
	TEST (SortRankedMoves, EmptyIsNoOp)
	TEST (KillerMoveTable, LargeDepthRange)
	TEST (KillerMoveTable, EvictionUnderManyInsertsPerDepth)
	TEST (KillerMoveTable, NonComparableLargeInput)
	TEST (HistoryHeuristicTable, LargeKeySet)
	TEST (HistoryHeuristicTable, AccumulatesLargeBonuses)
	TEST (HistoryHeuristicTable, NullTableLargeInput)
	TEST (SortRankedMoves, RandomizedStress)

Function Documentation

TEST() [1/31]

TEST	(	HistoryHeuristicTable	,
		AccumulatesBonus
	)

Definition at line 167 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [2/31]

TEST	(	HistoryHeuristicTable	,
		AccumulatesLargeBonuses
	)

Definition at line 388 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [3/31]

TEST	(	HistoryHeuristicTable	,
		ClearResetsAll
	)

Definition at line 195 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::clear(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [4/31]

TEST	(	HistoryHeuristicTable	,
		DefaultBonusIsOne
	)

Definition at line 175 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [5/31]

TEST	(	HistoryHeuristicTable	,
		EmptyTableReturnsZero
	)

Definition at line 154 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [6/31]

TEST	(	HistoryHeuristicTable	,
		IndependentKeys
	)

Definition at line 184 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [7/31]

TEST	(	HistoryHeuristicTable	,
		LargeKeySet
	)

Definition at line 372 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::clear(), k, N, Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [8/31]

TEST	(	HistoryHeuristicTable	,
		NullTableIsNoOp
	)

Definition at line 206 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Null_History_Heuristic_Table::record(), Aleph::Null_History_Heuristic_Table::score(), and Aleph::Null_History_Heuristic_Table::supported.

TEST() [9/31]

TEST	(	HistoryHeuristicTable	,
		NullTableLargeInput
	)

Definition at line 399 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Null_History_Heuristic_Table::clear(), k, Aleph::Null_History_Heuristic_Table::record(), Aleph::Null_History_Heuristic_Table::score(), and Aleph::Null_History_Heuristic_Table::supported.

TEST() [10/31]

TEST	(	HistoryHeuristicTable	,
		RecordAndScore
	)

Definition at line 160 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::record(), and Aleph::History_Heuristic_Table< Key, HashMapTable, Cmp >::score().

TEST() [11/31]

TEST	(	KillerMoveTable	,
		ClearResetsAll
	)

Definition at line 106 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [12/31]

TEST	(	KillerMoveTable	,
		DuplicateRecordIsNoOp
	)

Definition at line 82 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [13/31]

TEST	(	KillerMoveTable	,
		EmptyTableReportsFalse
	)

Definition at line 43 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [14/31]

TEST	(	KillerMoveTable	,
		EvictionUnderManyInsertsPerDepth
	)

Definition at line 345 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [15/31]

TEST	(	KillerMoveTable	,
		IndependentDepths
	)

Definition at line 94 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [16/31]

TEST	(	KillerMoveTable	,
		LargeDepthRange
	)

Definition at line 324 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and N.

TEST() [17/31]

TEST	(	KillerMoveTable	,
		NonComparableLargeInput
	)

Definition at line 358 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [18/31]

TEST	(	KillerMoveTable	,
		NonComparableMovesUseNoOpTable
	)

Definition at line 125 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and value.

TEST() [19/31]

TEST	(	KillerMoveTable	,
		RecordAndQuery
	)

Definition at line 50 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [20/31]

TEST	(	KillerMoveTable	,
		SparseDepthAccess
	)

Definition at line 117 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [21/31]

TEST	(	KillerMoveTable	,
		StringMoves
	)

Definition at line 139 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [22/31]

TEST	(	KillerMoveTable	,
		ThirdRecordEvictsOldest
	)

Definition at line 70 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [23/31]

TEST	(	KillerMoveTable	,
		TwoSlotsPerDepth
	)

Definition at line 60 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [24/31]

TEST	(	SortRankedMoves	,
		EmptyIsNoOp
	)

Definition at line 311 of file move_ordering_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Array< T >::is_empty(), and Aleph::sort_ranked_moves().

TEST() [25/31]

TEST	(	SortRankedMoves	,
		HistoryBreaksTies
	)

Definition at line 249 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::sort_ranked_moves().

TEST() [26/31]

TEST	(	SortRankedMoves	,
		KillerMovesFirst
	)

Definition at line 233 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::sort_ranked_moves().

TEST() [27/31]

TEST	(	SortRankedMoves	,
		KillerThenHistoryThenPriority
	)

Definition at line 281 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::sort_ranked_moves().

TEST() [28/31]

TEST	(	SortRankedMoves	,
		OrdinalBreaksTiesWhenEverythingEqual
	)

Definition at line 265 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::sort_ranked_moves().

TEST() [29/31]

TEST	(	SortRankedMoves	,
		RandomizedStress
	)

Definition at line 415 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), N, and rng.

TEST() [30/31]

TEST	(	SortRankedMoves	,
		SingleElementIsNoOp
	)

Definition at line 299 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::sort_ranked_moves().

TEST() [31/31]

TEST	(	SortRankedMoves	,
		SortsByPriorityDescending
	)

Definition at line 217 of file move_ordering_test.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::sort_ranked_moves().