Searched refs:len (Results 1 – 8 of 8) sorted by relevance
33 let index = self.nodes.len(); in add_node()56 if node.incoming_edges.len() == 0 { in topological_sort()60 while stack.len() > 0 { in topological_sort()67 let len = self.nodes[index].edges.len(); in topological_sort() localVariable68 for i in 0..len { in topological_sort()71 if self.nodes[edge].incoming_edges.len() == 0 { in topological_sort()76 if result.len() != self.nodes.len() { in topological_sort()
34 let index = self.nodes.len(); in add_node()58 if node.incoming_edges.len() == 0 { in topological_sort()62 while stack.len() > 0 { in topological_sort()69 let len = self.nodes[index].edges.len(); in topological_sort() localVariable70 for i in 0..len { in topological_sort()73 if self.nodes[edge].incoming_edges.len() == 0 { in topological_sort()78 if result.len() != self.nodes.len() { in topological_sort()
213 Ok(integer * factor + (fraction * factor) / (10u64.pow(fraction.to_string().len() as u32))) in parse_size()385 let len = match s.parse::<u32>() { in parse_ip_prefix_length() localVariable392 if len > 128 { in parse_ip_prefix_length()396 return Ok(len); in parse_ip_prefix_length()444 if idx == path.len() - 1 { in parse_unit_no_type()467 if s.len() != 2 { in parse_env()486 while i < cmds.len() { in parse_cmd_task()509 while i < cmds.len() && !UnitParseUtil::is_valid_exec_path(cmds[i]) { in parse_cmd_task()671 ret += integer * factor + (frac * factor) / (10u64.pow(frac.to_string().len() as u32)); in parse_sec()712 if env_file.len() > 0 { in parse_environment_file()
9 if args.len() <= 2 { in main()
208 if part.value.len() == 0 { in check()383 while index < self.value.len() { in update_next_trigger()
273 while i < lines.len() { in parse()308 let temp = &lines[i][..lines[i].len() - 1]; in parse()
175 return RUNNING_TABLE.read().unwrap().running_table.len(); in running_count()
341 if words.len() > 2 { in parse_pattern()