Home
last modified time | relevance | path

Searched refs:node_ix (Results 1 – 21 of 21) sorted by relevance

/dports/textproc/mdbook/mdBook-0.4.13/cargo-crates/pulldown-cmark-0.7.2/src/
H A Dparse.rs398 match self.tree[node_ix].item.body { in parse_block()
576 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
603 self.tree[node_ix].child = None; in parse_paragraph()
1129 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1148 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1377 for &node_ix in tree.walk_spine() { in scan_containers()
1378 match tree[node_ix].item.body { in scan_containers()
1687 while let Some(node_ix) = node { in scan_nodes_to_ix()
1688 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1689 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/textproc/mdbook-linkcheck/mdbook-linkcheck-0.7.6/cargo-crates/pulldown-cmark-0.7.2/src/
H A Dparse.rs398 match self.tree[node_ix].item.body { in parse_block()
576 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
603 self.tree[node_ix].child = None; in parse_paragraph()
1129 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1148 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1377 for &node_ix in tree.walk_spine() { in scan_containers()
1378 match tree[node_ix].item.body { in scan_containers()
1687 while let Some(node_ix) = node { in scan_nodes_to_ix()
1688 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1689 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/pulldown-cmark-0.7.2/src/
H A Dparse.rs398 match self.tree[node_ix].item.body { in parse_block()
576 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
603 self.tree[node_ix].child = None; in parse_paragraph()
1129 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1148 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1377 for &node_ix in tree.walk_spine() { in scan_containers()
1378 match tree[node_ix].item.body { in scan_containers()
1687 while let Some(node_ix) = node { in scan_nodes_to_ix()
1688 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1689 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/pulldown-cmark-0.8.0/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/lang/gleam/gleam-0.18.2/cargo-crates/pulldown-cmark-0.8.0/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/editors/kak-lsp/kak-lsp-11.1.0/cargo-crates/pulldown-cmark-0.8.0/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/editors/helix/helix-0.5.0/cargo-crates/pulldown-cmark-0.8.0/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/www/zola/zola-0.15.2/cargo-crates/pulldown-cmark-0.8.0/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/textproc/mdbook-linkcheck/mdbook-linkcheck-0.7.6/cargo-crates/pulldown-cmark-0.8.0/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/pulldown-cmark/src/
H A Dparse.rs410 match self.tree[node_ix].item.body { in parse_block()
588 let node_ix = self.tree.append(Item { in parse_paragraph() localVariable
615 self.tree[node_ix].child = None; in parse_paragraph()
1209 if let Some(node_ix) = self.tree.peek_up() { in finish_list()
1228 if let Some(node_ix) = self.tree.peek_up() { in continue_list()
1457 for &node_ix in tree.walk_spine() { in scan_containers()
1458 match tree[node_ix].item.body { in scan_containers()
1768 while let Some(node_ix) = node { in scan_nodes_to_ix()
1769 if tree[node_ix].item.end <= ix { in scan_nodes_to_ix()
1770 node = tree[node_ix].next; in scan_nodes_to_ix()
[all …]
/dports/databases/postgresql-repmgr/repmgr-5.2.0/
H A Drepmgr-action-cluster.c556 int node_ix = 0; in do_cluster_crosscheck() local
558 for (node_ix = 0; node_ix < n; node_ix++) in do_cluster_crosscheck()
560 int node_status = cube[node_ix]->matrix_list_rec[i]->node_status_list[j]->node_status; in do_cluster_crosscheck()
635 int node_ix = 0; in do_cluster_crosscheck() local
653 for (node_ix = 0; node_ix < n; node_ix++) in do_cluster_crosscheck()
655 …int node_status = cube[node_ix]->matrix_list_rec[i]->node_status_list[column_node_ix]->node_stat… in do_cluster_crosscheck()
/dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/algo/
H A Dfeedback_arc_set.rs438 let mut node_ix = self.start; in to_vec() localVariable
440 while let Some(n_ix) = node_ix { in to_vec()
443 node_ix = container[n_ix].pos_mut().next; in to_vec()
/dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/algo/
H A Dfeedback_arc_set.rs438 let mut node_ix = self.start; in to_vec() localVariable
440 while let Some(n_ix) = node_ix { in to_vec()
443 node_ix = container[n_ix].pos_mut().next; in to_vec()
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/algo/
H A Dfeedback_arc_set.rs438 let mut node_ix = self.start; in to_vec() localVariable
440 while let Some(n_ix) = node_ix { in to_vec()
443 node_ix = container[n_ix].pos_mut().next; in to_vec()
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/algo/
H A Dfeedback_arc_set.rs438 let mut node_ix = self.start; in to_vec() localVariable
440 while let Some(n_ix) = node_ix { in to_vec()
443 node_ix = container[n_ix].pos_mut().next; in to_vec()
/dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/src/algo/
H A Dfeedback_arc_set.rs438 let mut node_ix = self.start;
440 while let Some(n_ix) = node_ix {
443 node_ix = container[n_ix].pos_mut().next;
/dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/graph_impl/stable_graph/
H A Dmod.rs984 fn ensure_node_exists(&mut self, node_ix: NodeIndex<Ix>) in ensure_node_exists()
988 if let Some(Some(_)) = self.g.node_weight(node_ix) { in ensure_node_exists()
991 while node_ix.index() >= self.g.node_count() { in ensure_node_exists()
996 self.occupy_vacant_node(node_ix, N::default()); in ensure_node_exists()
/dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/graph_impl/stable_graph/
H A Dmod.rs984 fn ensure_node_exists(&mut self, node_ix: NodeIndex<Ix>) in ensure_node_exists()
988 if let Some(Some(_)) = self.g.node_weight(node_ix) { in ensure_node_exists()
991 while node_ix.index() >= self.g.node_count() { in ensure_node_exists()
996 self.occupy_vacant_node(node_ix, N::default()); in ensure_node_exists()
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/graph_impl/stable_graph/
H A Dmod.rs984 fn ensure_node_exists(&mut self, node_ix: NodeIndex<Ix>) in ensure_node_exists()
988 if let Some(Some(_)) = self.g.node_weight(node_ix) { in ensure_node_exists()
991 while node_ix.index() >= self.g.node_count() { in ensure_node_exists()
996 self.occupy_vacant_node(node_ix, N::default()); in ensure_node_exists()
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/graph_impl/stable_graph/
H A Dmod.rs984 fn ensure_node_exists(&mut self, node_ix: NodeIndex<Ix>) in ensure_node_exists()
988 if let Some(Some(_)) = self.g.node_weight(node_ix) { in ensure_node_exists()
991 while node_ix.index() >= self.g.node_count() { in ensure_node_exists()
996 self.occupy_vacant_node(node_ix, N::default()); in ensure_node_exists()
/dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/src/graph_impl/stable_graph/
H A Dmod.rs984 fn ensure_node_exists(&mut self, node_ix: NodeIndex<Ix>) in ensure_node_exists()
988 if let Some(Some(_)) = self.g.node_weight(node_ix) { in ensure_node_exists()
991 while node_ix.index() >= self.g.node_count() { in ensure_node_exists()
996 self.occupy_vacant_node(node_ix, N::default()); in ensure_node_exists()