Home
last modified time | relevance | path

Searched refs:activeArc (Results 1 – 10 of 10) sorted by relevance

/dports/chinese/bitchx/bitchx-1.2.1/dll/europa/cse476/
H A Dparse.h6 typedef struct activeArc { struct
16 void add(activeArc *newArc); argument
20 activeArc *currArc(void);
27 activeArc *arc;
H A Dparse.cpp56 activeArc *newArc; in processAgenda()
58 newArc = new activeArc; in processAgenda()
77 activeArc *checkArc; in processAgenda()
102 activeArc *newArc = new activeArc; in processAgenda()
233 void ActiveArcList::add(activeArc *newArc) { in add()
268 activeArc *newArc2 = new activeArc; in add()
307 activeArc *ActiveArcList::currArc(void) { in currArc()
/dports/irc/bitchx/bitchx-1.2.1/dll/europa/cse476/
H A Dparse.h6 typedef struct activeArc { struct
16 void add(activeArc *newArc); argument
20 activeArc *currArc(void);
27 activeArc *arc;
H A Dparse.cpp56 activeArc *newArc; in processAgenda()
58 newArc = new activeArc; in processAgenda()
77 activeArc *checkArc; in processAgenda()
102 activeArc *newArc = new activeArc; in processAgenda()
233 void ActiveArcList::add(activeArc *newArc) { in add()
268 activeArc *newArc2 = new activeArc; in add()
307 activeArc *ActiveArcList::currArc(void) { in currArc()
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-v0.3.1/src/
H A DconcatenatedPreGraph.c174 PreArc *activeArc = NULL; in isEligibleTip() local
186 activeArc = getPreArc_pg(currentIndex, preGraph); in isEligibleTip()
187 currentIndex = getDestination_pg(activeArc, currentIndex); in isEligibleTip()
203 if (getMultiplicity_pg(activeArc) == 1) in isEligibleTip()
213 return mult > getMultiplicity_pg(activeArc); in isEligibleTip()
H A DcorrectedGraph.c2456 Arc *activeArc = NULL; in isMinorityChoice() local
2462 activeArc = getArc(current); in isMinorityChoice()
2463 current = getDestination(activeArc); in isMinorityChoice()
2475 if (getMultiplicity(activeArc) == 1) in isMinorityChoice()
2485 return mult >= getMultiplicity(activeArc); in isMinorityChoice()
H A DgraphStats.c3076 Arc *activeArc = NULL; in depthFirstSearchSubgraph() local
3084 for (activeArc = getArc(getNodeInGraph(graph, currentIndex)); in depthFirstSearchSubgraph()
3085 activeArc != NULL; activeArc = getNextArc(activeArc)) { in depthFirstSearchSubgraph()
3086 nextIndex = getNodeID(getDestination(activeArc)); in depthFirstSearchSubgraph()
/dports/biology/velvet/velvet_1.2.10/src/
H A DconcatenatedPreGraph.c187 PreArcI activeArc = NULL_IDX; in isEligibleTip() local
200 activeArc = getPreArc_pg(currentIndex, preGraph); in isEligibleTip()
201 currentIndex = getDestination_pg(activeArc, currentIndex); in isEligibleTip()
217 if (getMultiplicity_pg(activeArc) == 1) in isEligibleTip()
227 return mult > getMultiplicity_pg(activeArc); in isEligibleTip()
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-1.2.01/Velvet-1.1.06/
H A DconcatenatedPreGraph.c187 PreArcI activeArc = NULL_IDX; in isEligibleTip() local
199 activeArc = getPreArc_pg(currentIndex, preGraph); in isEligibleTip()
200 currentIndex = getDestination_pg(activeArc, currentIndex); in isEligibleTip()
216 if (getMultiplicity_pg(activeArc) == 1) in isEligibleTip()
226 return mult > getMultiplicity_pg(activeArc); in isEligibleTip()
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-1.2.01/Common/
H A DMetaGraph.cc141 Arc *activeArc = NULL; in dfs() local
142 …for( activeArc=getArc(getNodeInGraph(graph, currentIndex)) ; activeArc!=NULL ; activeArc=getNextAr… in dfs()
143 long nextIndex = getNodeID(getDestination(activeArc)); in dfs()