#include <graphcycles.h>

Classes
struct	Rep

Public Member Functions
bool	CheckInvariants () const

int	FindPath (GraphId source, GraphId dest, int max_path_len, GraphId path[]) const

GraphId	GetId (void *ptr)

int	GetStackTrace (GraphId id, void ***ptr)

	GraphCycles ()

bool	HasEdge (GraphId source_node, GraphId dest_node) const

bool	HasNode (GraphId node)

bool	InsertEdge (GraphId source_node, GraphId dest_node)

bool	IsReachable (GraphId source_node, GraphId dest_node) const

void *	Ptr (GraphId id)

void	RemoveEdge (GraphId source_node, GraphId dest_node)

void	RemoveNode (void *ptr)

void	UpdateStackTrace (GraphId id, int priority, int(get_stack_trace)(void *, int))

	~GraphCycles ()

Private Member Functions
	GraphCycles (const GraphCycles &)=delete

GraphCycles &	operator= (const GraphCycles &)=delete

Private Attributes
Rep *	rep_

Detailed Description

Definition at line 59 of file graphcycles.h.

Constructor & Destructor Documentation

◆ GraphCycles() [1/2]

absl::synchronization_internal::GraphCycles::GraphCycles ( )

Definition at line 363 of file graphcycles.cc.

◆ ~GraphCycles()

absl::synchronization_internal::GraphCycles::~GraphCycles ( )

Definition at line 369 of file graphcycles.cc.

◆ GraphCycles() [2/2]

absl::synchronization_internal::GraphCycles::GraphCycles ( const GraphCycles & )

privatedelete

Member Function Documentation

◆ CheckInvariants()

bool absl::synchronization_internal::GraphCycles::CheckInvariants ( ) const

Definition at line 378 of file graphcycles.cc.

◆ FindPath()

int absl::synchronization_internal::GraphCycles::FindPath	(	GraphId	source,
		GraphId	dest,
		int	max_path_len,
		GraphId	path[]
	)		const

Definition at line 623 of file graphcycles.cc.

◆ GetId()

GraphId absl::synchronization_internal::GraphCycles::GetId ( void * ptr )

Definition at line 404 of file graphcycles.cc.

◆ GetStackTrace()

int absl::synchronization_internal::GraphCycles::GetStackTrace	(	GraphId	id,
		void ***	ptr
	)

Definition at line 681 of file graphcycles.cc.

◆ HasEdge()

bool absl::synchronization_internal::GraphCycles::HasEdge	(	GraphId	source_node,
		GraphId	dest_node
	)		const

Definition at line 468 of file graphcycles.cc.

◆ HasNode()

bool absl::synchronization_internal::GraphCycles::HasNode ( GraphId node )

Definition at line 464 of file graphcycles.cc.

◆ InsertEdge()

bool absl::synchronization_internal::GraphCycles::InsertEdge	(	GraphId	source_node,
		GraphId	dest_node
	)

Definition at line 491 of file graphcycles.cc.

◆ IsReachable()

bool absl::synchronization_internal::GraphCycles::IsReachable	(	GraphId	source_node,
		GraphId	dest_node
	)		const

Definition at line 667 of file graphcycles.cc.

◆ operator=()

GraphCycles& absl::synchronization_internal::GraphCycles::operator= ( const GraphCycles & )

privatedelete

◆ Ptr()

void * absl::synchronization_internal::GraphCycles::Ptr ( GraphId id )

Definition at line 458 of file graphcycles.cc.

◆ RemoveEdge()

void absl::synchronization_internal::GraphCycles::RemoveEdge	(	GraphId	source_node,
		GraphId	dest_node
	)

Definition at line 473 of file graphcycles.cc.

◆ RemoveNode()

void absl::synchronization_internal::GraphCycles::RemoveNode ( void * ptr )

Definition at line 435 of file graphcycles.cc.

◆ UpdateStackTrace()

void absl::synchronization_internal::GraphCycles::UpdateStackTrace	(	GraphId	id,
		int	priority,
		int()(void *, int)	get_stack_trace
	)

Definition at line 671 of file graphcycles.cc.

Member Data Documentation

◆ rep_

Rep* absl::synchronization_internal::GraphCycles::rep_

private

Definition at line 127 of file graphcycles.h.

The documentation for this class was generated from the following files:

Classes

Public Member Functions

Private Member Functions

Private Attributes