Class: LazyGraph::ArrayNode
- Defined in:
- lib/lazy_graph/node/array_node.rb
Constant Summary
Constants included from Node::DerivedRules
Node::DerivedRules::PLACEHOLDER_VAR_REGEX
Instance Attribute Summary
Attributes inherited from Node
#children, #depth, #derived, #invisible, #is_object, #name, #namespace, #parent, #path, #root, #type
Instance Method Summary collapse
- #cast(value) ⇒ Object
- #children=(value) ⇒ Object
-
#resolve(path, stack_memory, should_recycle = stack_memory) ⇒ Object
An Array supports the following types of path resolutions.
Methods inherited from Node
#absolute_path, #ancestors, #build_caster, #build_derived_inputs!, #clear_visits!, #copy_item!, #define_missing_value_proc!, #derive_item!, #fetch_and_resolve, #fetch_item, #find_resolver_for, #initialize, #lazy_init_node!, #raise_presence_validation_error!, #resolve_relative_input, #simple?, #trace!
Methods included from Node::DerivedRules
#build_derived_inputs, #create_derived_input_context, #extract_derived_src, extract_expr_from_source_location, get_file_body, #interpret_derived_proc, #map_derived_inputs_to_paths, #parse_args_with_conditions, #parse_derived_inputs, #parse_rule_string, #resolver_for, #rule_definition_backtrace
Constructor Details
This class inherits a constructor from LazyGraph::Node
Instance Method Details
permalink #cast(value) ⇒ Object
[View source]
64 65 66 |
# File 'lib/lazy_graph/node/array_node.rb', line 64 def cast(value) Array(value) end |
permalink #children=(value) ⇒ Object
[View source]
59 60 61 62 |
# File 'lib/lazy_graph/node/array_node.rb', line 59 def children=(value) @children = value @child_properties = @children.children[:properties].compare_by_identity if @children.is_object end |
permalink #resolve(path, stack_memory, should_recycle = stack_memory) ⇒ Object
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 |
# File 'lib/lazy_graph/node/array_node.rb', line 11 def resolve( path, stack_memory, should_recycle = stack_memory, ** ) return MissingValue() unless input = stack_memory.frame @visited[input.object_id >> 2 ^ path.shifted_id] ||= begin path_next = path.next if (path_segment = path.segment).is_a?(PathParser::PathGroup) unless path_segment.index? return input.length.times.map do |index| children.fetch_and_resolve(path, input, index, stack_memory) end end return resolve(path_segment..first.merge(path_next), stack_memory, nil) if path_segment..one? return path_segment..map { |part| resolve(part.merge(path_next), stack_memory, nil) } end segment = path_segment&.part case segment when nil unless @children.simple? input.length.times do |index| @children.fetch_and_resolve(path, input, index, stack_memory) end end input when DIGIT_REGEXP @children.fetch_and_resolve(path_next, input, segment.to_s.to_i, stack_memory) else if @child_properties&.key?(segment) || input&.first&.key?(segment) input.length.times.map do |index| @children.fetch_and_resolve(path, input, index, stack_memory) end else MissingValue() end end end ensure should_recycle&.recycle! end |