Classes | Public Member Functions | Private Member Functions | Private Attributes | List of all members
absl::synchronization_internal::GraphCycles Class Reference

#include <graphcycles.h>

Classes

struct  Rep
 

Public Member Functions

bool CheckInvariants () const
 
bool CheckInvariants () const
 
int FindPath (GraphId source, GraphId dest, int max_path_len, GraphId path[]) const
 
int FindPath (GraphId source, GraphId dest, int max_path_len, GraphId path[]) const
 
GraphId GetId (void *ptr)
 
GraphId GetId (void *ptr)
 
int GetStackTrace (GraphId id, void ***ptr)
 
int GetStackTrace (GraphId id, void ***ptr)
 
 GraphCycles ()
 
 GraphCycles ()
 
bool HasEdge (GraphId source_node, GraphId dest_node) const
 
bool HasEdge (GraphId source_node, GraphId dest_node) const
 
bool HasNode (GraphId node)
 
bool HasNode (GraphId node)
 
bool InsertEdge (GraphId source_node, GraphId dest_node)
 
bool InsertEdge (GraphId source_node, GraphId dest_node)
 
bool IsReachable (GraphId source_node, GraphId dest_node) const
 
bool IsReachable (GraphId source_node, GraphId dest_node) const
 
void * Ptr (GraphId id)
 
void * Ptr (GraphId id)
 
void RemoveEdge (GraphId source_node, GraphId dest_node)
 
void RemoveEdge (GraphId source_node, GraphId dest_node)
 
void RemoveNode (void *ptr)
 
void RemoveNode (void *ptr)
 
void UpdateStackTrace (GraphId id, int priority, int(*get_stack_trace)(void **, int))
 
void UpdateStackTrace (GraphId id, int priority, int(*get_stack_trace)(void **, int))
 
 ~GraphCycles ()
 
 ~GraphCycles ()
 

Private Member Functions

 GraphCycles (const GraphCycles &)=delete
 
 GraphCycles (const GraphCycles &)=delete
 
GraphCyclesoperator= (const GraphCycles &)=delete
 
GraphCyclesoperator= (const GraphCycles &)=delete
 

Private Attributes

Reprep_
 

Detailed Description

Definition at line 62 of file abseil-cpp/absl/synchronization/internal/graphcycles.h.

Constructor & Destructor Documentation

◆ GraphCycles() [1/4]

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

◆ ~GraphCycles() [1/2]

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

◆ GraphCycles() [2/4]

absl::synchronization_internal::GraphCycles::GraphCycles ( const GraphCycles )
privatedelete

◆ GraphCycles() [3/4]

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

◆ ~GraphCycles() [2/2]

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

◆ GraphCycles() [4/4]

absl::synchronization_internal::GraphCycles::GraphCycles ( const GraphCycles )
privatedelete

Member Function Documentation

◆ CheckInvariants() [1/2]

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

◆ CheckInvariants() [2/2]

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

◆ FindPath() [1/2]

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

◆ FindPath() [2/2]

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

◆ GetId() [1/2]

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

◆ GetId() [2/2]

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

◆ GetStackTrace() [1/2]

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

◆ GetStackTrace() [2/2]

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

◆ HasEdge() [1/2]

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

◆ HasEdge() [2/2]

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

◆ HasNode() [1/2]

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

◆ HasNode() [2/2]

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

◆ InsertEdge() [1/2]

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

◆ InsertEdge() [2/2]

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

◆ IsReachable() [1/2]

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

◆ IsReachable() [2/2]

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

◆ operator=() [1/2]

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

◆ operator=() [2/2]

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

◆ Ptr() [1/2]

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

◆ Ptr() [2/2]

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

◆ RemoveEdge() [1/2]

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

◆ RemoveEdge() [2/2]

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

◆ RemoveNode() [1/2]

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

◆ RemoveNode() [2/2]

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

◆ UpdateStackTrace() [1/2]

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

◆ UpdateStackTrace() [2/2]

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

Member Data Documentation

◆ rep_

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

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


grpc
Author(s):
autogenerated on Fri May 16 2025 03:02:55