tvm::graph::internal Namespace Reference

Classes
class	AbstractNode
class	DependencyGraph
class	Inputs
class	Log
class	Logger

Functions
template<typename T , typename EnumT >
constexpr bool	is_valid_update (EnumT v)
template<typename T , typename EnumT , typename... Args>
constexpr bool	is_valid_update (EnumT v, Args... args)
template<typename ObjType , typename MemberType , typename... Args>
bool	lexLess (const ObjType &l, const ObjType &r, MemberType ObjType::*member, Args &&... args)
template<typename ObjType , typename MemberType , typename... Args>
bool	eq (const ObjType &l, const ObjType &r, MemberType ObjType::*member, Args &&... args)
template<typename ObjType , typename MemberType >
bool	lexLess (const ObjType &l, const ObjType &r, MemberType ObjType::*member)
template<typename ObjType , typename MemberType >
bool	eq (const ObjType &l, const ObjType &r, MemberType ObjType::*member)
template<typename T >
std::uintptr_t	getPointerValue (void(T::*ptfm)())

Function Documentation

eq() [1/2]

template<typename ObjType , typename MemberType >

bool tvm::graph::internal::eq	(	const ObjType &	l,
		const ObjType &	r,
		MemberType ObjType::*	member
	)

End of recursion.

eq() [2/2]

template<typename ObjType , typename MemberType , typename... Args>

bool tvm::graph::internal::eq	(	const ObjType &	l,
		const ObjType &	r,
		MemberType ObjType::*	member,
		Args &&...	args
	)

Equality comparison of two objects given an ordered list of the members to compare.

getPointerValue()

template<typename T >

std::uintptr_t tvm::graph::internal::getPointerValue

(

void(T::*)()

ptfm

)

is_valid_update() [1/2]

template<typename T , typename EnumT >

constexpr bool tvm::graph::internal::is_valid_update ( EnumT  v )

constexpr

Check if a value of EnumT is a valid update for Node type T

is_valid_update() [2/2]

template<typename T , typename EnumT , typename... Args>

constexpr bool tvm::graph::internal::is_valid_update ( EnumT  v, Args...  args  )

constexpr

Check if all values of a given set are valid updates for Updates type T

lexLess() [1/2]

template<typename ObjType , typename MemberType >

bool tvm::graph::internal::lexLess	(	const ObjType &	l,
		const ObjType &	r,
		MemberType ObjType::*	member
	)

End of recursion.

lexLess() [2/2]

template<typename ObjType , typename MemberType , typename... Args>

bool tvm::graph::internal::lexLess	(	const ObjType &	l,
		const ObjType &	r,
		MemberType ObjType::*	member,
		Args &&...	args
	)

lexicographic comparison of two objects given an ordered list of the members to compare.