blob: 0f4b26febdb56c8befcfcc3a11e24f8503f64589 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
//===- BinTreeTest.h ------------------------------------------------------===//
//
// The MCLinker Project
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef BINTREE_TEST_H
#define BINTREE_TEST_H
#include "mcld/ADT/BinTree.h"
#include <gtest.h>
namespace mcld {
class BinTree;
} // namespace for mcld
namespace mcldtest {
/** \class BinTreeTest
* \brief Make sure the interface of BinTree , such as insert , traversal ,
*etc..
*
* \see BinTree
*/
class BinTreeTest : public ::testing::Test {
public:
// Constructor can do set-up work for all test here.
BinTreeTest();
// Destructor can do clean-up work that doesn't throw exceptions here.
virtual ~BinTreeTest();
// SetUp() will be called immediately before each test.
virtual void SetUp();
// TearDown() will be called immediately after each test.
virtual void TearDown();
protected:
mcld::BinaryTree<int>* m_pTestee;
};
} // namespace of mcldtest
#endif
|
