Hub::Data::Handlers - Access nested data

Get a nested value whose parent may need to be loaded from disk

 Usage: fetch \%data, $index

Store a nested value whose parent may need to be loaded from disk

 Usage: store \%data, $index, ?value

Get a nested value

 Usage: getv \%data, $index
 Usage: getv \@data, $index

Store a nested value

 Usage: setv \%data, $index, ?value
 Usage: setv \@data, $index, ?value

Remove a nested value

 Usage: delete \%data, $index
 Usage: delete \@data, $index

Get node value from an array or hash

 Usage: _get \%data, $node
 Usage: _get \@data, $node

Set a node value on an array or hash

 Usage: _set \%data, $node, $value
 Usage: _set \@data, $node, $value

Remove a node from an array or hash

 Usage: _delete - \%data, $node
 Usage: _delete - \@data, $node

Create missing parent nodes

 Usage: _autovivify \%result

Step into the nested data structure one index node at a time

 Usage: _traverse \%data, $index
 Usage: _traverse \@data, $index

Extend the search to the file system

 Usage: _transcend \%result

Get the parser for a given file

Split an index into nodes, removing empty ones

 Usage: _split - $index

Ryan Gies (ryangies@livesite.net)

Copyright (C) 2006-2007 by Livesite Networks, LLC. All rights reserved.

Copyright (C) 2000-2005 by Ryan Gies. All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

* The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.

* Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.

* The name of the author may not be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

To the best of our knowledge, no patented algorithms have been used. However, we do not have the resources to carry out a patent search, and therefore cannot give any guarantee of the above statement.

08/02/2007