| /dports/graphics/R-cran-visNetwork/visNetwork/inst/tests/ |
| H A D | highlight_combinaison.R | 8 visOptions(highlightNearest = list(enabled = T, degree = 1, hover = F)) nameattr
23 visOptions(highlightNearest = list(enabled = T, degree = 10, hover = F), collapse = T) nameattr
35 visOptions(highlightNearest = list(enabled = T, degree = 10, hover = T), selectedBy = "group") nameattr
45 visOptions(highlightNearest = list(enabled = T, degree = 10, hover = T)) nameattr
55 visOptions(highlightNearest = list(enabled = T, degree = 10, hover = T)) nameattr
111 label = "I'm an image") nameattr
122 label = "I'm an image") nameattr
141 list(label = "Group", shape = "icon", icon = list(code = "f0c0", size = 25)), nameattr
142 list(label = "User", shape = "icon", icon = list(code = "f007", size = 50, color = "red")) nameattr
144 addEdges = data.frame(label = "link"), useGroups = FALSE) nameattr
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/polygonize/ |
| H A D | PolygonizeGraph.java | 53 int degree = 0; in getDegreeNonDeleted() local
61 private static int getDegree(Node node, long label) in getDegree()
64 int degree = 0; in getDegree() local
153 long label = de.getLabel(); in convertMaximalToMinimalEdgeRings() local
172 private static List findIntersectionNodes(PolygonizeDirectedEdge startDE, long label) in findIntersectionNodes()
279 private static void label(Collection dirEdges, long label) in label() argument
315 private static void computeNextCCWEdges(Node node, long label) in computeNextCCWEdges()
|
| /dports/graphics/geos/geos-3.9.1/src/operation/polygonize/ |
| H A D | PolygonizeGraph.cpp | 51 int degree = 0; in getDegreeNonDeleted() local
61 PolygonizeGraph::getDegree(Node* node, long label) in getDegree()
64 int degree = 0; in getDegree() local
206 long label, std::vector<Node*>& intNodes) in findIntersectionNodes()
316 PolygonizeGraph::label(std::vector<PolygonizeDirectedEdge*>& dirEdges, long label) in label() function in geos::operation::polygonize::PolygonizeGraph
324 PolygonizeGraph::label(std::vector<DirectedEdge*>& dirEdges, long label) in label() function in geos::operation::polygonize::PolygonizeGraph
368 PolygonizeGraph::computeNextCCWEdges(Node* node, long label) in computeNextCCWEdges()
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/geomgraph/ |
| H A D | DirectedEdgeStar.java | 43 private Label label; field in DirectedEdgeStar
60 int degree = 0; in getOutgoingDegree() local
69 int degree = 0; in getOutgoingDegree() local
138 Label label = de.getLabel(); in mergeSymLabels() local
150 Label label = de.getLabel(); in updateLabelling() local
|
| H A D | EdgeRing.java | 44 …private Label label = new Label(Location.NONE); // label stores the locations of each geometry on … field in EdgeRing
132 Label label = de.getLabel(); in computePoints() local
154 int degree = ((DirectedEdgeStar) node.getEdges()).getOutgoingDegree(this); in computeMaxNodeDegree() local
|
| /dports/graphics/R-cran-visNetwork/visNetwork/inst/doc/ |
| H A D | Introduction-to-visNetwork.R | 17 … label = paste("Node", 1:10), # add labels on nodes nameattr
30 … label = paste("Edge", 1:8), # add labels on edges nameattr
54 nodes <- data.frame(id = 1:nb, label = paste("Label", 1:nb), nameattr
60 value = rnorm(nb, 10), label = paste("Edge", 1:nb), nameattr
68 visLegend(useGroups = FALSE, addNodes = data.frame(label = "Nodes", shape = "circle"), nameattr
69 addEdges = data.frame(label = "link", color = "black")) nameattr
77 visOptions(highlightNearest = list(enabled =TRUE, degree = 2)) nameattr
90 nodes <- data.frame(id = 1:nb, label = paste("Label", 1:nb), nameattr
|
| /dports/cad/opencascade/opencascade-7.6.0/src/TDataStd/ |
| H A D | TDataStd_BooleanArray.cxx | 67 static Handle(TDataStd_BooleanArray) SetAttr(const TDF_Label& label, in SetAttr()
143 Standard_Integer degree = index - (byte_index << 3) - myLower; in SetValue() local
173 Standard_Integer degree = index - (byte_index << 3) - myLower; in Value() local
|
| /dports/graphics/R-cran-visNetwork/visNetwork/inst/shiny/src/server/ |
| H A D | proxy_options_server.R | 3 nodes <- data.frame(id = 1:15, label = paste("Label", 1:15), nameattr
21 … algorithm = input$algorithm, degree = input$deg, hideColor = col)) nameattr
|
| /dports/biology/viennarna/ViennaRNA-2.4.18/src/RNAforester/src/wmatch/ |
| H A D | graphtypes.h | 11 int degree; member
12 int label; member
21 int label; member
|
| /dports/graphics/qgis/qgis-3.22.3/src/core/pal/ |
| H A D | problem.h | 59 int degree; member
62 int *label = nullptr; member
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/src/core/pal/ |
| H A D | problem.h | 58 int degree; member
61 int *label = nullptr; member
|
| /dports/science/opensim-core/opensim-core-4.1/OpenSim/Common/ |
| H A D | GCVSplineSet.cpp | 61 int degree, in GCVSplineSet()
66 for (const auto& label : labelsToUse) { in GCVSplineSet() local
|
| /dports/math/igraph/igraph-0.9.5/src/hrg/ |
| H A D | dendro.h | 121 int degree; // number of children in list variable
215 int label; // subtree label: smallest leaf index variable
|
| /dports/math/polymake/polymake-4.5/apps/topaz/include/ |
| H A D | complex_tools.h | 139 out_degree_checker(Int degree_arg = 0) : degree(degree_arg) { } in degree() function
238 bool on_boundary(const Set<Set<Int>>& label, const IncidenceMatrix<>& VIF) in on_boundary()
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | hrg_dendro.h | 121 int degree; // number of children in list variable
215 int label; // subtree label: smallest leaf index variable
|
| /dports/science/cdk/cdk-cdk-2.3/base/standard/src/main/java/org/openscience/cdk/tools/ |
| H A D | HOSECodeGenerator.java | 661 private Long label(TreeNode node) { in label() method in HOSECodeGenerator.TreeNodeComparator
686 int degree; field in HOSECodeGenerator.TreeNode
706 … TreeNode(String symbol, TreeNode source, IAtom atom, double bondType, int degree, long score) { in TreeNode()
|
| /dports/multimedia/vmaf/vmaf-2.3.0/libvmaf/src/ |
| H A D | svm.h | 67 int degree; /* for poly */ member
101 int *label; /* label of each class (label[k]) */ member
|
| /dports/science/libsvm-python/libsvm-3.23/ |
| H A D | svm.h | 32 int degree; /* for poly */ member
66 int *label; /* label of each class (label[k]) */ member
|
| /dports/science/libsvm/libsvm-3.23/ |
| H A D | svm.h | 32 int degree; /* for poly */ member
66 int *label; /* label of each class (label[k]) */ member
|
| /dports/science/R-cran-e1071/e1071/src/ |
| H A D | svm.h | 32 int degree; /* for poly */ member
68 int *label; /* label of each class (label[k]) */ member
|
| /dports/graphics/hugin/hugin-2020.0.0/src/celeste/ |
| H A D | svm.h | 64 int degree; /* for poly */ member
98 int *label; /* label of each class (label[k]) */ member
|
| /dports/math/saga/saga-8.1.3/saga-gis/src/tools/imagery/imagery_svm/svm/ |
| H A D | svm.h | 32 int degree; /* for poly */ member
65 int *label; /* label of each class (label[k]) */ member
|
| /dports/math/octave-forge-nan/nan-3.6.1/src/ |
| H A D | svm.h | 69 int degree; /* for poly */ member
103 int *label; /* label of each class (label[k]) */ member
|
| /dports/multimedia/vmaf/vmaf-2.3.0/third_party/libsvm/ |
| H A D | svm.h | 32 int degree; /* for poly */ member
63 int *label; /* label of each class (label[k]) */ member
|
| /dports/biology/viennarna/ViennaRNA-2.4.18/src/libsvm-3.24/ |
| H A D | svm.h | 32 int degree; /* for poly */ member
66 int *label; /* label of each class (label[k]) */ member
|