FutureDAGTest Struct Reference

Inheritance diagram for FutureDAGTest:

Classes
struct	TestNode

Public Types
typedef FutureDAG::Handle	Handle
Public Types inherited from testing::Test
typedef internal::SetUpTestCaseFunc	SetUpTestCaseFunc
typedef internal::TearDownTestCaseFunc	TearDownTestCaseFunc
typedef internal::SetUpTestCaseFunc	SetUpTestCaseFunc
typedef internal::TearDownTestCaseFunc	TearDownTestCaseFunc
typedef internal::SetUpTestCaseFunc	SetUpTestCaseFunc
typedef internal::TearDownTestCaseFunc	TearDownTestCaseFunc

Public Member Functions
Handle	add ()
void	reset ()
void	remove (Handle a)
void	dependency (Handle a, Handle b)
void	checkOrder ()
Public Member Functions inherited from testing::Test
virtual	~Test ()
virtual	~Test ()
virtual	~Test ()

Public Attributes
const std::shared_ptr< FutureDAG >	dag = FutureDAG::create()
std::map< Handle, std::unique_ptr< TestNode > >	nodes
std::vector< Handle >	order

Additional Inherited Members
Static Public Member Functions inherited from testing::Test
static void	SetUpTestCase ()
static void	TearDownTestCase ()
static bool	HasFatalFailure ()
static bool	HasNonfatalFailure ()
static bool	HasFailure ()
static void	RecordProperty (const std::string &key, const std::string &value)
static void	RecordProperty (const std::string &key, int value)
static void	SetUpTestCase ()
static void	TearDownTestCase ()
static bool	HasFatalFailure ()
static bool	HasNonfatalFailure ()
static bool	HasFailure ()
static void	RecordProperty (const std::string &key, const std::string &value)
static void	RecordProperty (const std::string &key, int value)
static void	SetUpTestCase ()
static void	TearDownTestCase ()
static bool	HasFatalFailure ()
static bool	HasNonfatalFailure ()
static bool	HasFailure ()
static void	RecordProperty (const std::string &key, const std::string &value)
static void	RecordProperty (const std::string &key, int value)
Protected Member Functions inherited from testing::Test
	Test ()
virtual void	SetUp ()
virtual void	TearDown ()
	Test ()
virtual void	SetUp ()
virtual void	TearDown ()
	Test ()
virtual void	SetUp ()
virtual void	TearDown ()

Detailed Description

Definition at line 22 of file FutureDAGTest.cpp.

Member Typedef Documentation

typedef FutureDAG::Handle FutureDAGTest::Handle

Definition at line 23 of file FutureDAGTest.cpp.

Member Function Documentation

Handle FutureDAGTest::add ( )

inline

Definition at line 25 of file FutureDAGTest.cpp.

References folly::gen::move.

               {
    auto node = std::make_unique<TestNode>(this);
    auto handle = node->handle;
    nodes.emplace(handle, std::move(node));
    return handle;
  }

void FutureDAGTest::checkOrder ( )

inline

Definition at line 68 of file FutureDAGTest.cpp.

References EXPECT_EQ, EXPECT_TRUE, and order.

                    {
    EXPECT_EQ(nodes.size(), order.size());
    for (auto& kv : nodes) {
      auto handle = kv.first;
      auto& node = kv.second;
      auto it = order.begin();
      while (*it != handle) {
        it++;
      }
      for (auto dep : node->dependencies) {
        EXPECT_TRUE(std::find(it, order.end(), dep) == order.end());
      }
    }
  }

void FutureDAGTest::dependency ( Handle  a, Handle  b  )

inline

Definition at line 63 of file FutureDAGTest.cpp.

                                      {
    nodes.at(b)->dependencies.insert(a);
    dag->dependency(a, b);
  }

void FutureDAGTest::remove ( Handle  a )

inline

Definition at line 55 of file FutureDAGTest.cpp.

References a.

                        {
    for (auto& node : nodes) {
      node.second->dependencies.erase(a);
    }
    nodes.erase(a);
    dag->remove(a);
  }

void FutureDAGTest::reset ( )

inline

Definition at line 32 of file FutureDAGTest.cpp.

               {
    Handle source_node;
    std::unordered_set<Handle> memo;
    for (auto& node : nodes) {
      for (Handle handle : node.second->dependencies) {
        memo.insert(handle);
      }
    }
    for (auto& node : nodes) {
      if (memo.find(node.first) == memo.end()) {
        source_node = node.first;
      }
    }
    for (auto it = nodes.cbegin(); it != nodes.cend();) {
      if (it->first != source_node) {
        it = nodes.erase(it);
      } else {
        ++it;
      }
    }
    dag->reset();
  }

Member Data Documentation

const std::shared_ptr<FutureDAG> FutureDAGTest::dag = FutureDAG::create()

Definition at line 96 of file FutureDAGTest.cpp.

std::map<Handle, std::unique_ptr<TestNode> > FutureDAGTest::nodes

Definition at line 97 of file FutureDAGTest.cpp.

std::vector<Handle> FutureDAGTest::order

Definition at line 98 of file FutureDAGTest.cpp.

Referenced by FutureDAGTest::TestNode::TestNode().

---

The documentation for this struct was generated from the following file:

• proxygen/folly/folly/experimental/test/FutureDAGTest.cpp