binheap.cc File Reference

Tests for Binheap. More...

#include <algorithm>
#include <functional>
#include <numeric>
#include <random>
#include <vector>
#include <gtest/gtest.h>
#include <tpl_dynBinHeap.H>

Include dependency graph for binheap.cc:

Go to the source code of this file.

Functions
	TEST (DynBinHeapTest, InsertExtractInOrder)
	TEST (DynBinHeapTest, RemoveArbitraryNodes)
	TEST (DynBinHeapTest, UpdateReordersAfterPriorityChange)
	TEST (DynBinHeapTest, RandomizedInsertExtract)
	TEST (DynBinHeapTest, IteratorTraversesAllElements)
	TEST (DynBinHeapTest, EmptyRemovesAllNodes)
	TEST (DynBinHeapTest, UpdateWithDuplicatePriorities)

Detailed Description

Tests for Binheap.

Definition in file binheap.cc.

Function Documentation

TEST() [1/7]

TEST	(	DynBinHeapTest	,
		EmptyRemovesAllNodes
	)

Definition at line 158 of file binheap.cc.

References Aleph::DynBinHeap< T, Compare >::empty(), Aleph::DynBinHeap< T, Compare >::getMin(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::maps(), and Aleph::GenBinHeap< NodeType, Key, Compare >::size().

TEST() [2/7]

TEST	(	DynBinHeapTest	,
		InsertExtractInOrder
	)

Definition at line 50 of file binheap.cc.

References StlAlephIterator< SetName >::begin(), StlAlephIterator< SetName >::end(), Aleph::DynBinHeap< T, Compare >::getMin(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::maps(), Aleph::GenBinHeap< NodeType, Key, Compare >::size(), and Aleph::DynBinHeap< T, Compare >::top().

TEST() [3/7]

TEST	(	DynBinHeapTest	,
		IteratorTraversesAllElements
	)

Definition at line 144 of file binheap.cc.

References Aleph::count(), LocateFunctions< Container, Type >::get_it(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::maps(), and N.

TEST() [4/7]

TEST	(	DynBinHeapTest	,
		RandomizedInsertExtract
	)

Definition at line 124 of file binheap.cc.

References StlAlephIterator< SetName >::begin(), StlAlephIterator< SetName >::end(), Aleph::DynBinHeap< T, Compare >::getMin(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::maps(), and rng.

TEST() [5/7]

TEST	(	DynBinHeapTest	,
		RemoveArbitraryNodes
	)

Definition at line 71 of file binheap.cc.

References StlAlephIterator< SetName >::begin(), StlAlephIterator< SetName >::end(), Aleph::DynBinHeap< T, Compare >::getMin(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::maps(), Aleph::DynBinHeap< T, Compare >::remove(), and Aleph::GenBinHeap< NodeType, Key, Compare >::size().

TEST() [6/7]

TEST	(	DynBinHeapTest	,
		UpdateReordersAfterPriorityChange
	)

Definition at line 103 of file binheap.cc.

References Aleph::DynBinHeap< T, Compare >::getMin(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::low(), Aleph::maps(), Aleph::DynBinHeap< T, Compare >::top(), and Aleph::DynBinHeap< T, Compare >::update().

TEST() [7/7]

TEST	(	DynBinHeapTest	,
		UpdateWithDuplicatePriorities
	)

Definition at line 174 of file binheap.cc.

References StlAlephIterator< SetName >::begin(), StlAlephIterator< SetName >::end(), Aleph::DynList< T >::get(), Aleph::DynBinHeap< T, Compare >::getMin(), Aleph::DynBinHeap< T, Compare >::insert(), Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::maps(), Aleph::DynBinHeap< T, Compare >::top(), and Aleph::DynBinHeap< T, Compare >::update().