Home
last modified time | relevance | path

Searched refs:edgeInfo (Results 1 – 25 of 63) sorted by relevance

123

/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/brite/helper/
H A Dbrite-topology-helper.cc192 BriteEdgeInfo edgeInfo; in BuildBriteEdgeInfoList() local
193 edgeInfo.edgeId = (*el)->GetId (); in BuildBriteEdgeInfoList()
196 edgeInfo.length = (*el)->Length (); in BuildBriteEdgeInfoList()
225 edgeInfo.type = "E_RT_NONE "; in BuildBriteEdgeInfoList()
228 edgeInfo.type = "E_RT_STUB "; in BuildBriteEdgeInfoList()
231 edgeInfo.type = "E_RT_BORDER "; in BuildBriteEdgeInfoList()
234 edgeInfo.type = "E_RT_BACKBONE "; in BuildBriteEdgeInfoList()
245 edgeInfo.type = "E_AS_NONE "; in BuildBriteEdgeInfoList()
248 edgeInfo.type = "E_AS_STUB "; in BuildBriteEdgeInfoList()
251 edgeInfo.type = "E_AS_BORDER "; in BuildBriteEdgeInfoList()
[all …]
/dports/devel/doxygen/doxygen-1.9.3/src/
H A Ddotnode.cpp586 &pn->edgeInfo()[index], in write()
618 const EdgeInfo &edgeInfo = *it; in writeXML() local
622 switch(edgeInfo.color()) in writeXML()
638 if (!edgeInfo.label().isEmpty()) in writeXML()
650 << convertToXML(edgeInfo.label().right(edgeInfo.label().length()-p)) in writeXML()
680 const EdgeInfo &edgeInfo = *it; in writeDocbook() local
684 switch(edgeInfo.color()) in writeDocbook()
712 << convertToXML(edgeInfo.label().right(edgeInfo.label().length()-p)) in writeDocbook()
749 const EdgeInfo &edgeInfo = *it; in writeDEF() local
754 switch (edgeInfo.color()) in writeDEF()
[all …]
/dports/math/ogdf/OGDF/include/ogdf/energybased/fast_multipole_embedder/
H A DArrayGraph.h147 inline EdgeAdjInfo& edgeInfo(uint32_t i) { return m_edgeAdj[i]; } in edgeInfo() function
150 inline const EdgeAdjInfo& edgeInfo(uint32_t i) const { return m_edgeAdj[i]; } in edgeInfo() function
159 inline EdgeAdjInfo* edgeInfo() { return m_edgeAdj; } in edgeInfo() function
162 inline const EdgeAdjInfo* edgeInfo() const { return m_edgeAdj; } in edgeInfo() function
200 return edgeInfo(currEdgeAdjIndex).nextEdgeAdjIndex(nodeIndex); in nextEdgeAdjIndex()
206 return edgeInfo(currEdgeAdjIndex).twinNode(nodeIndex); in twinNodeIndex()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/rendering/
H A DRenderFrameSet.cpp385 if (edgeInfo.allowBorder(LeftFrameEdge)) in fillFromEdgeInfo()
387 if (edgeInfo.allowBorder(RightFrameEdge)) in fillFromEdgeInfo()
389 if (edgeInfo.preventResize(LeftFrameEdge)) in fillFromEdgeInfo()
394 if (edgeInfo.allowBorder(TopFrameEdge)) in fillFromEdgeInfo()
396 if (edgeInfo.allowBorder(BottomFrameEdge)) in fillFromEdgeInfo()
398 if (edgeInfo.preventResize(TopFrameEdge)) in fillFromEdgeInfo()
419 FrameEdgeInfo edgeInfo; in computeEdgeInfo() local
421 edgeInfo = toRenderFrameSet(child)->edgeInfo(); in computeEdgeInfo()
423 edgeInfo = toRenderFrame(child)->edgeInfo(); in computeEdgeInfo()
424 fillFromEdgeInfo(edgeInfo, r, c); in computeEdgeInfo()
[all …]
H A DRenderFrameSet.h63 FrameEdgeInfo edgeInfo() const;
108 void fillFromEdgeInfo(const FrameEdgeInfo& edgeInfo, int r, int c);
H A DRenderFrame.h37 FrameEdgeInfo edgeInfo() const;
/dports/graphics/fortytwo/FT-0.2.0/
H A DFTOrderedEdgeSetImpl.m224 //__FTNodeIdToEdgeArrayIndex *edgeInfo;
236 edgeInfo = [[__FTNodeIdToEdgeArrayIndex alloc]
242 if( [edgeInfo withinAnEdge] ) {
243 NSArray *indexArray = [edgeInfo indexArray];
247 [[edgeInfo array] removeObjectAtIndex: [edgeInfo arrayIndex]];
250 [edgeInfo release];
256 edgeInfo = [[__FTNodeIdToEdgeArrayIndex alloc]
262 if( [edgeInfo withinAnEdge] ) {
263 [[edgeInfo array] removeObjectAtIndex: [edgeInfo arrayIndex]];
266 [edgeInfo release];
/dports/cad/sumo/sumo-1.2.0/src/utils/router/
H A DAStarRouter.h114 for (const auto& edgeInfo : edgeInfos) { variable
115 myEdgeInfos.push_back(typename BASE::EdgeInfo(edgeInfo.edge));
116 …myMaxSpeed = MAX2(myMaxSpeed, edgeInfo.edge->getSpeedLimit() * edgeInfo.edge->getLengthGeometryFac…
129 for (auto& edgeInfo : myFrontierList) { in init()
130 edgeInfo->reset(); in init()
133 for (auto& edgeInfo : myFound) { in init()
134 edgeInfo->reset(); in init()
H A DDijkstraRouter.h100 for (auto& edgeInfo : myFrontierList) { in init()
101 edgeInfo->reset(); in init()
104 for (auto& edgeInfo : myFound) { in init()
105 edgeInfo->reset(); in init()
249 for (const auto& edgeInfo : edgeInfos) { in DijkstraRouter() local
250 myEdgeInfos.push_back(typename BASE::EdgeInfo(edgeInfo.edge)); in DijkstraRouter()
/dports/math/py-graphillion/Graphillion-1.3/src/subsetting/spec/
H A DDegreeConstraint.hpp102 Graph::EdgeInfo const& e = graph.edgeInfo(i); in getChild()
124 shiftMate(mate, graph.edgeInfo(i).v0 - e.v0); in getChild()
127 Graph::EdgeInfo const& e = graph.edgeInfo(i); in getChild()
142 shiftMate(mate, graph.edgeInfo(i).v0 - e.v0); in getChild()
H A DFrontierBasedSearch.hpp436 int const v0 = graph.edgeInfo(0).v0; in getRoot()
450 Graph::EdgeInfo const* e = &graph.edgeInfo(i); in getChild()
461 Graph::EdgeInfo const* ee = &graph.edgeInfo(i); in getChild()
473 ee = &graph.edgeInfo(i); in getChild()
/dports/lang/ghc/ghc-8.10.7/compiler/nativeGen/
H A DBlockLayout.hs697 relevantWeight edge@(CfgEdge from to edgeInfo)
698 | (EdgeInfo CmmSource { trans_cmmNode = CmmCall {} } _) <- edgeInfo
702 , w <- edgeWeight edgeInfo
704 = Just (CfgEdge from to edgeInfo { edgeWeight = w/8 })
705 | (EdgeInfo CmmSource { trans_cmmNode = exitNode } _) <- edgeInfo
707 , w <- edgeWeight edgeInfo
711 = Just (CfgEdge from to edgeInfo { edgeWeight = w * 0.96875 })
751 relevantWeight (CfgEdge _ _ edgeInfo)
752 | EdgeInfo (CmmSource { trans_cmmNode = CmmCall {}}) _ <- edgeInfo
759 weight = negate (edgeWeight edgeInfo)
H A DCFG.hs108 type EdgeInfoMap edgeInfo = LabelMap (LabelMap edgeInfo)
124 , edgeInfo :: !EdgeInfo function
146 ppr (CfgEdge from1 to1 edgeInfo)
147 = parens (ppr from1 <+> text "-(" <> ppr edgeInfo <> text ")->" <+> ppr to1)
180 ppr edgeInfo = text "weight:" <+> ppr (edgeWeight edgeInfo)
526 | Just edgeInfo <- getEdgeInfo from old m
527 = (from,between,old,edgeInfo)
534 updateWeight m (from,between,old,edgeInfo)
535 = addEdge from between edgeInfo .
/dports/math/vtk9/VTK-9.1.0/Filters/General/
H A DvtkAreaContourSpectrumFilter.cxx112 vtkVariantArray* edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
115 if (!edgeInfo) in RequestData()
125 vtkAbstractArray* vertexList = edgeInfo->GetPointer(ArcId)->ToArray(); in RequestData()
H A DvtkVolumeContourSpectrumFilter.cxx118 vtkVariantArray* edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
121 if (!edgeInfo) in RequestData()
131 vtkAbstractArray* vertexList = edgeInfo->GetPointer(ArcId)->ToArray(); in RequestData()
/dports/math/vtk8/VTK-8.2.0/Filters/General/
H A DvtkAreaContourSpectrumFilter.cxx113 vtkVariantArray *edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
116 if(!edgeInfo) in RequestData()
126 vtkAbstractArray *vertexList = edgeInfo->GetPointer(ArcId)->ToArray(); in RequestData()
H A DvtkVolumeContourSpectrumFilter.cxx115 vtkVariantArray *edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
118 if(!edgeInfo) in RequestData()
128 vtkAbstractArray *vertexList = edgeInfo->GetPointer(ArcId)->ToArray(); in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/General/
H A DvtkAreaContourSpectrumFilter.cxx115 vtkVariantArray *edgeInfo = vtkVariantArray::SafeDownCast( in RequestData() local
118 if(!edgeInfo) in RequestData()
128 vtkAbstractArray *vertexList = edgeInfo->GetPointer(ArcId)->ToArray(); in RequestData()
H A DvtkVolumeContourSpectrumFilter.cxx117 vtkVariantArray *edgeInfo = vtkVariantArray::SafeDownCast( in RequestData() local
120 if(!edgeInfo) in RequestData()
130 vtkAbstractArray *vertexList = edgeInfo->GetPointer(ArcId)->ToArray(); in RequestData()
/dports/math/ogdf/OGDF/src/ogdf/energybased/
H A DFastMultipoleEmbedder.cpp354 GalaxyMultilevel::LevelEdgeInfo& edgeInfo = (*(m_pFinestLevel->m_pEdgeInfo))[e]; in initFinestLevel() local
359 edgeInfo.length = (vNodeInfo.radius + wNodeInfo.radius) + edgeLength[e]; in initFinestLevel()
380 GalaxyMultilevel::LevelEdgeInfo& edgeInfo = (*(m_pCurrentLevel->m_pEdgeInfo))[e]; in initCurrentLevel() local
381 (*m_pCurrentEdgeLength)[e] = edgeInfo.length*0.25f; in initCurrentLevel()
/dports/math/vtk9/VTK-9.1.0/Filters/ReebGraph/
H A DvtkReebGraphToJoinSplitTreeFilter.cxx126 vtkVariantArray* edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
128 if (!edgeInfo) in RequestData()
152 vtkAbstractArray* deg2NodeList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
186 vtkAbstractArray* deg2NodeList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
H A DvtkReebGraphVolumeSkeletonFilter.cxx122 vtkVariantArray* edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
124 if (!edgeInfo) in RequestData()
147 vtkAbstractArray* vertexList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
/dports/math/vtk8/VTK-8.2.0/Filters/ReebGraph/
H A DvtkReebGraphToJoinSplitTreeFilter.cxx132 vtkVariantArray *edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
134 if(!edgeInfo) in RequestData()
157 vtkAbstractArray *deg2NodeList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
190 vtkAbstractArray *deg2NodeList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
H A DvtkReebGraphVolumeSkeletonFilter.cxx125 vtkVariantArray *edgeInfo = vtkArrayDownCast<vtkVariantArray>( in RequestData() local
127 if(!edgeInfo) in RequestData()
151 vtkAbstractArray *vertexList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/ReebGraph/
H A DvtkReebGraphToJoinSplitTreeFilter.cxx132 vtkVariantArray *edgeInfo = vtkVariantArray::SafeDownCast( in RequestData() local
134 if(!edgeInfo) in RequestData()
157 vtkAbstractArray *deg2NodeList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()
190 vtkAbstractArray *deg2NodeList = edgeInfo->GetPointer(e.Id)->ToArray(); in RequestData()

123