"Here is the current code, which is not doing what I want it to, and am having trouble wrapping my head around how to get to the structure I want to get."

Your "current code" is just a subroutine definition. You don't show how, or in what context, you're calling it. You don't say how it's behaving differently from your expections or whether it's generating error or warning messages. You don't indicate which part, or parts, you're specifically having difficulties with ("wrapping my head around"). I've already provided you with the link to "How do I post a question effectively?" in this thread: here it is again, please read it this time and follow its guidelines in any future postings.

"First, the data structure I want:"

So, you want an array with a single element which is a hashref; that hashref having a single key/value pair, the value being an arrayref; that arrayref having a single element which is a hashref; ... In some places you want a key called 'data' to have a value which is an arrayref and in other places you want a key with same name to have a value which is an hashref. Can you explain why you want a structure like that and how you propose to use it?

I asked you to provide the data structure you'd like to generate from a fairly simple directory structure. You've refused to do that! Why?

What you've posted is not related to any directory structure you've shown and is peppered with meaningless noise. For instance, am I supposed to know what "spriteCssClass" is?

I'm not convinced that you know what data structure you actually want. This would be the reason why you're having difficulties writing code to generate it.

About the only help I can provide you with at this time is to show a possible data structure. This is an example of what I was expecting from you. 

{
    name => 'dir_A',
    subs => [
        {
            name => 'file_B',
            size => 99,
        },
        {
            name => 'dir_C',
            subs => [
                {
                    name => 'file_D',
                    size => 99,
                },
                {
                    name => 'dir_E',
                    subs => [
                        {
                            name => 'file_F',
                            size => 99,
                        },
                    ],
                },
                {
                    name => 'file_G',
                    size => 99,
                },
            ],
        },
        {
            name => 'file_H',
            size => 99,
        },
    ],
}

[download]

Once you get the structure right, you can add whatever other information you want (file types, permissions, modification times, etc.). But, you need to get the structure right first!

-- Ken

In reply to Re^5: directory tree to hash of arrays by kcott
in thread directory tree to hash of arrays by mabossert

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.