/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/usvg-0.11.0/src/svgtree/ |
H A D | names.rs | 7 pub enum EId { enum 82 ("rect", EId::Rect), 85 ("g", EId::G), 88 ("path", EId::Path), 90 ("a", EId::A), 92 ("use", EId::Use), 94 ("tref", EId::Tref), 97 ("defs", EId::Defs), 112 ("svg", EId::Svg), 133 impl EId { implementation [all …]
|
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/usvg-0.9.0/src/svgtree/ |
H A D | names.rs | 7 pub enum EId { enum 82 ("rect", EId::Rect), 85 ("g", EId::G), 88 ("path", EId::Path), 90 ("a", EId::A), 92 ("use", EId::Use), 94 ("tref", EId::Tref), 97 ("defs", EId::Defs), 112 ("svg", EId::Svg), 133 impl EId { implementation [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 208 EdgeId EId = 0; in addConstructedEdge() local 214 EId = Edges.size(); in addConstructedEdge() 222 return EId; in addConstructedEdge() 274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 275 ++EId; in findNextInUse() 277 return EId; in findNextInUse() 418 return EId; in addEdge() 443 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 209 EdgeId EId = 0; in addConstructedEdge() local 215 EId = Edges.size(); in addConstructedEdge() 223 return EId; in addConstructedEdge() 275 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 276 ++EId; in findNextInUse() 278 return EId; in findNextInUse() 419 return EId; in addEdge() 444 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument 191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument 209 EdgeId EId = 0; in addConstructedEdge() local 215 EId = Edges.size(); in addConstructedEdge() 223 return EId; in addConstructedEdge() 275 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse() 276 ++EId; in findNextInUse() 278 return EId; in findNextInUse() 419 return EId; in addEdge() 444 return EId; in addEdgeBypassingCostAllocator() [all …]
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/usvg-0.11.0/src/convert/ |
H A D | paint_server.rs | 232 if !link.has_tag_name(EId::Pattern) { in find_pattern_with_children() 404 (AId::X1, EId::LinearGradient) in resolve_lg_attr() 405 | (AId::Y1, EId::LinearGradient) in resolve_lg_attr() 406 | (AId::X2, EId::LinearGradient) in resolve_lg_attr() 407 | (AId::Y2, EId::LinearGradient) in resolve_lg_attr() 437 (AId::Cx, EId::RadialGradient) in resolve_rg_attr() 438 | (AId::Cy, EId::RadialGradient) in resolve_rg_attr() 439 | (AId::R, EId::RadialGradient) in resolve_rg_attr() 440 | (AId::Fx, EId::RadialGradient) in resolve_rg_attr() 469 if tag_name != EId::Pattern { in resolve_pattern_attr() [all …]
|
H A D | mod.rs | 157 if !tag_name.is_graphic() && !matches!(tag_name, EId::G | EId::Switch | EId::Svg) { in convert_element() 182 EId::Rect in convert_element() 183 | EId::Circle in convert_element() 184 | EId::Ellipse in convert_element() 185 | EId::Line in convert_element() 186 | EId::Polyline in convert_element() 187 | EId::Polygon in convert_element() 193 EId::Image => { in convert_element() 196 EId::Text => { in convert_element() 200 EId::Svg => { in convert_element() [all …]
|
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/usvg-0.9.0/src/convert/ |
H A D | paint_server.rs | 232 if !link.has_tag_name(EId::Pattern) { in find_pattern_with_children() 404 (AId::X1, EId::LinearGradient) in resolve_lg_attr() 405 | (AId::Y1, EId::LinearGradient) in resolve_lg_attr() 406 | (AId::X2, EId::LinearGradient) in resolve_lg_attr() 407 | (AId::Y2, EId::LinearGradient) in resolve_lg_attr() 437 (AId::Cx, EId::RadialGradient) in resolve_rg_attr() 438 | (AId::Cy, EId::RadialGradient) in resolve_rg_attr() 439 | (AId::R, EId::RadialGradient) in resolve_rg_attr() 440 | (AId::Fx, EId::RadialGradient) in resolve_rg_attr() 469 if tag_name != EId::Pattern { in resolve_pattern_attr() [all …]
|
H A D | mod.rs | 169 if !tag_name.is_graphic() && !matches!(tag_name, EId::G | EId::Switch | EId::Svg) { in convert_element() 194 EId::Rect in convert_element() 195 | EId::Circle in convert_element() 196 | EId::Ellipse in convert_element() 197 | EId::Line in convert_element() 198 | EId::Polyline in convert_element() 199 | EId::Polygon in convert_element() 205 EId::Image => { in convert_element() 208 EId::Text => { in convert_element() 212 EId::Svg => { in convert_element() [all …]
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/usvg-0.11.0/src/tree/ |
H A D | export.rs | 13 use crate::{geom::*, svgtree::{EId, AId}, IsDefault}; 21 xml.start_svg_element(EId::Svg); in convert() 32 xml.start_svg_element(EId::Defs); in convert() 83 xml.start_svg_element(EId::Mask); in conv_defs() 114 xml.start_svg_element(EId::Filter); in conv_defs() 414 xml.start_svg_element(EId::Image); in conv_element() 452 xml.start_svg_element(EId::G); in conv_element() 496 fn start_svg_element(&mut self, id: EId); in start_svg_element() argument 516 fn start_svg_element(&mut self, id: EId) { in start_svg_element() argument 725 xml.start_svg_element(EId::Stop); in write_base_grad() [all …]
|
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/usvg-0.9.0/src/tree/ |
H A D | export.rs | 13 use crate::{geom::*, svgtree::{EId, AId}, IsDefault}; 21 xml.start_svg_element(EId::Svg); in convert() 32 xml.start_svg_element(EId::Defs); in convert() 83 xml.start_svg_element(EId::Mask); in conv_defs() 114 xml.start_svg_element(EId::Filter); in conv_defs() 414 xml.start_svg_element(EId::Image); in conv_element() 452 xml.start_svg_element(EId::G); in conv_element() 496 fn start_svg_element(&mut self, id: EId); in start_svg_element() argument 516 fn start_svg_element(&mut self, id: EId) { in start_svg_element() argument 722 xml.start_svg_element(EId::Stop); in write_base_grad() [all …]
|