Page History

...

1) Convert path to array/list  {'a','b','c(1)','d','e(m:n)','f','g'}

2) Call traverse(ctx = p-fCtx, path, node = ids)

3) Get node name from list, look for IDS field of this name

...

• NO - cut node from list, call traverse (reducedList, currentNode)
• YES - it is AoS   ,
  •  call createAoS from class representing AoS
    • call resize for a number of structures defined by indices
    • get AoS context (aos context - info about index? is ctx accessible? )
  • cut node from list
  • create AoS ctx in LL 
  • traverse (reducedList, aosNode)

OPEN POINTS:

• IMPLEMENTATION IN NEW LL ONLY!!!!!
• AoS as ancestor(s) of queried data
  • once implemented mechanism for creation of AoS could be reused to "go through" ancestors
• returned value 
  • type provided by user?
  • AoS? if not - functionality can be placed at the Low Level and available for all HLIs (however it could be a problem with returned type  anyway)
• Level of nesting
  • path/AoS(indices)/x/y/z ?

...