sumtree_test.cpp File Reference

#include <mlpack/core.hpp>
#include <mlpack/methods/reinforcement_learning/replay/sumtree.hpp>
#include "catch.hpp"
#include "test_catch_tools.hpp"

Include dependency graph for sumtree_test.cpp:

Functions
	TEST_CASE ("SetElement", "[SumTreeTest]")
	Test that we set the element.
	TEST_CASE ("GetElement", "[SumTreeTest]")
	Test that we get the element.
	TEST_CASE ("FindPrefixSum", "[SumTreeTest]")
	Test that we find the highest index in the array such that Sum(arr[0] + arr[1] + arr[2] ... More...
	TEST_CASE ("BatchUpdate", "[SumTreeTest]")
	Test that we find the highest index in the array such that sum(arr[0] + arr[1] + arr[2] ... More...

Detailed Description

Author

Xiaohong

Test for Sumtree implementation.

mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-clause BSD license. You should have received a copy of the 3-clause BSD license along with mlpack. If not, see http://www.opensource.org/licenses/BSD-3-Clause for more information.

Function Documentation

TEST_CASE() [1/2]

TEST_CASE	(	"FindPrefixSum"	,
		""	[SumTreeTest]
	)

Test that we find the highest index in the array such that Sum(arr[0] + arr[1] + arr[2] ...

• arr[i]) <= mass.

TEST_CASE() [2/2]

TEST_CASE	(	"BatchUpdate"	,
		""	[SumTreeTest]
	)

Test that we find the highest index in the array such that sum(arr[0] + arr[1] + arr[2] ...

• arr[i]) <= mass.