varastNodes=[[0,0,0,"(root)",null,"\n",[],false],[0,0,0,null,null,null,null,false],[0,0,0,"std",null,"",[],false],[1,0,0,null,null,null,null,false],[1,1,0,null,null,null,null,false],[1,2,0,null,null,null,null,false],[0,0,0,"array_list.zig",null,"",[],false],[2,0,0,null,null,null,null,false],[2,1,0,null,null,null,null,false],[2,2,0,null,null,null,null,false],[2,3,0,null,null,null,null,false],[2,4,0,null,null,null,null,false],[2,5,0,null,null,null,null,false],[2,6,0,null,null,null,null,false],[2,13,0,null,null," A contiguous, growable list of items in memory.\n This is a wrapper around an array of T values. Initialize with `init`.\n\n This struct internally stores a `std.mem.Allocator` for memory management.\n To manually specify an allocator with each function call see `ArrayListUnmanaged`.",[15],false],[0,0,0,"T",null,"",null,true],[2,24,0,null,null," A contiguous, growable list of arbitrarily aligned items in memory.\n This is a wrapper around an array of T values aligned to `alignment`-byte\n addresses. If the specified alignment is `null`, then `@alignOf(T)` is used.\n Initialize with `init`.\n\n This struct internally stores a `std.mem.Allocator` for memory management.\n To manually specify an allocator with each function call see `ArrayListAlignedUnmanaged`.",[17,18],false],[0,0,0,"T",null,"",null,true],[0,0,0,"alignment",null,"",[167,168,170],true],[2,31,0,null,null,null,null,false],[2,45,0,null,null,null,null,false],[2,47,0,null,null,null,[22],false],[0,0,0,"s",null,"",null,true],[2,52,0,null,null," Deinitialize with `deinit` or use `toOwnedSlice`.",[24],false],[0,0,0,"allocator",null,"",null,false],[2,63,0,null,null," Initialize with capacity to hold `num` elements.\n The resulting capacity will equal `num` exactly.\n Deinitialize with `deinit` or use `toOwnedSlice`.",[26,27],false],[0,0,0,"allocator",null,"",null,false],[0,0,0,"num",null,"",null,false],[2,70,0,null,null," Release all allocated memory.",[29],false],[0,0,0,"self",null,"",null,false],[2,79,0,null,null," ArrayList takes ownership of the passed in slice. The slice must have been\n allocated with `allocator`.\n Deinitialize with `deinit` or use `toOwnedSlice`.",[31,32],false],[0,0,0,"allocator",null,"",null,false],[0,0,0,"slice",null,"",null,false],[2,90,0,null,null," ArrayList takes ownership of the passed in slice. The slice must have been\n allocated with `allocator`.\n Deinitialize with `deinit` or use `toOwnedSlice`.",[34,35,36],false],[0,0,0,"allocator",null,"",null,false],[0,0,0,"sentinel",null,"",null,true],[0,0,0,"slice",null,"",null,false],[2,100,0,null,null," Initializes an ArrayListUnmanaged with the `items` and `capacity` fields\n of this ArrayList. Empties this ArrayList.",[38],false],[0,0,0,"self",null,"",null,false],[2,109,0,null,null," The caller owns the returned memory. Empties this ArrayList,\n Its capacity is cleared, making deinit() safe but unnecessary to call.",[40],false],[0,0,0,"self",null,"",null,false],[2,127,0,null,null," The caller owns the returned memory. Empties this ArrayList.",[42,43],false],[0,0,0,"self",null,"",null,false],[0,0,0,"sentinel",null,"",null,true],[2,136,0,null,null," Creates a copy of this ArrayList, using the same allocator.",[45],false],[0,0,0,"self",null,"",null,false],[2,147,0,null,null," Insert `item` at index `i`. Moves `list[i .. list.len]` to higher indices to make room.\n If `i` is equal to the length of the list this operation is equivalent to append.\n This operation is O(N).\n Invalidates element pointers if additional memory is needed.\n Asserts that the index is in bounds or equal to the length.",[47,48,49],false],[0,0,0,"self",null,"",null,false],[0,0,0,"i",null,"",null,false],[0,0,0,"item",null,"",null,false],[2,158,0,null,null," Insert `item` at index `i`. Moves `list[i .. list.len]` to higher indices to make room.\n If `i` is equal to the length of the list this operation is\n equivalent to appendAssumeCapacity.\n This operation is O(N).\n Asserts that there is enough capacity for the new item.\n Asserts that the index is in bounds or equal to the length.",[51,52,53],false],[0,0,0,
