<?xml version="1.0" encoding="windows-1252"?>
<node id="955326" title="Re^2: Assign 2D-Arrays to a hash using a key" created="2012-02-21 09:59:17" updated="2012-02-21 09:59:17">
<type id="11">
note</type>
<author id="916830">
mmartin</author>
<data>
<field name="doctext">
Hey aaron_baugher,&lt;br&gt;
&lt;br&gt;
Thanks for the reply..!&lt;br&gt;
&lt;br&gt;
Now that I think about, I guess I kinda gave a bad example. For the values that might be duplicated, they would be integers which "should" be added together and then stored into the hash. So I guess there wouldn't be a value that has more than one value for particular record.&lt;br&gt;
&lt;br&gt;
With this new info do you still think it's necessary to do a hash of hashes still?&lt;br&gt;
&lt;br&gt;
Thanks,&lt;br&gt;
Matt&lt;br&gt;
&lt;br&gt;
&lt;br&gt;</field>
<field name="root_node">
955162</field>
<field name="parent_node">
955181</field>
</data>
</node>
