Home
last modified time | relevance | path

Searched refs:sp_IsEmpty (Results 1 – 8 of 8) sorted by relevance

/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/edge-addition-planarity-suite-Version_3.0.0.5/c/
H A Dstack.h41 int sp_IsEmpty(stackP);
66 #define sp_IsEmpty(theStack) !theStack->size macro
H A Dstack.c119 int sp_IsEmpty(stackP theStack) in sp_IsEmpty() function
H A DgraphK33Search.c628 while (!sp_IsEmpty(theGraph->theStack)) in _SearchForDescendantExternalConnection()
739 if (sp_IsEmpty(theGraph->theStack)) in _SearchForMergeBlocker()
750 while (!sp_IsEmpty(tempStack)) in _SearchForMergeBlocker()
1038 while (!sp_IsEmpty(theGraph->theStack)) in _TestForZtoWPath()
1084 while (!sp_IsEmpty(theGraph->theStack)) in _TestForZtoWPath()
H A DgraphDrawPlanar.c203 while (!sp_IsEmpty(theEmbedding->theStack)) in _ComputeVertexPositionsInComponent()
877 if (sp_IsEmpty(theEmbedding->edgeHoles)) in gp_DrawPlanar_RenderToFile()
/dports/math/planarity/edge-addition-planarity-suite-Version_3.0.1.1/c/
H A Dstack.h41 int sp_IsEmpty(stackP);
74 #define sp_IsEmpty(theStack) !theStack->size macro
H A Dstack.c119 int sp_IsEmpty(stackP theStack) in sp_IsEmpty() function
H A DgraphK33Search.c628 while (!sp_IsEmpty(theGraph->theStack))
739 if (sp_IsEmpty(theGraph->theStack))
750 while (!sp_IsEmpty(tempStack))
1037 while (!sp_IsEmpty(theGraph->theStack))
1083 while (!sp_IsEmpty(theGraph->theStack))
H A DgraphDrawPlanar.c203 while (!sp_IsEmpty(theEmbedding->theStack)) in _ComputeVertexPositionsInComponent()
878 if (sp_IsEmpty(theEmbedding->edgeHoles)) in gp_DrawPlanar_RenderToFile()