Re^5: directory tree to hash of arrays

"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

Comment on Re^5: directory tree to hash of arrays Select or Download Code

Replies are listed 'Best First'.
Re^6: directory tree to hash of arrays by mabossert (Scribe) on Mar 14, 2014 at 06:11 UTC
The subroutine takes a directory as an argument...then iterates over the directories and files found in that directory. The result needs to be sent as JSON to a web-application that uses the resulting data to populate a directory tree (file browser). The data structure you were poking at (array with single element which is a hashref...) is structured that way because the Javascript UI framework expects a JSON object with a "data" section that contains, not surprisingly, data...and a metadata section that contains other information about the datasource (e.g. if paging is used, how many records, time if retrieval, etc.). I didn't refuse to use your example...I simply thought that the actual structure I wanted was more useful. So, if it makes it easier, here is your structure: [ {information => { text => 'dir_A', data => { size => 99, type => 'folder' }, contents => [ { text => 'file_B', data => { size => 99, type => 'file' } }, { text => 'dir_C', data => { size => 99, type => 'folder' }, contents => [ { text => 'file_D', data => { size => 99, type => 'file' } }, { text => 'dir_E', data => { size => 99, type => 'folder' }, contents => [ { text => 'file_F', data => { size => 99, type => 'file' } } ] }, { text => 'file_G', data => { type => 'file', size => 99 } } ] }, { text => 'file_H', data => { type => 'file', size => 99 } } ] } } ] [download] The subroutine would be used thusly: `my $arrayref = _directoryTree('/usr/local/bin','/usr/local');` [download] The reason for the filter is that I don't want to expose the entire path to the user of the web-application. All they need to see is the directory structure starting at a certain level...so, rather that showing them a tree consisting of /home/user/somedirectory/web-app/public/data... The filter could be used to "start" with /public/data as the "root", rather than the whole thing. The arrayref is then passed to the web-app framework(Mojolicious) and rendered as JSON to the client side thusly: `get => 'directory_list' sub { my $self = shift; my $arrayref = _directoryTree('/usr/local/bin','/usr/local'); $self->render(json => $arrayref); };` [download] On a final note. I understand what you said about the two different uses of a key called "data". Since those are in two entirely different hashes, they have nothing to do with each other. The convention for the javascript framework is to construct a datasource with a "data" section containing the data and another data section for each record that contains any user-defined fields (e.g. those the framework does not specifically call out)...making it more sensible on the javascript side. If the field is in the documentation then just call object.text for instance, for an undocumented field, call object.data.customThing. Not my choice of conventions...I am just working with it.	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^6: directory tree to hash of arrays
by mabossert (Scribe) on Mar 14, 2014 at 06:11 UTC

The subroutine takes a directory as an argument...then iterates over the directories and files found in that directory. The result needs to be sent as JSON to a web-application that uses the resulting data to populate a directory tree (file browser). The data structure you were poking at (array with single element which is a hashref...) is structured that way because the Javascript UI framework expects a JSON object with a "data" section that contains, not surprisingly, data...and a metadata section that contains other information about the datasource (e.g. if paging is used, how many records, time if retrieval, etc.).

I didn't refuse to use your example...I simply thought that the actual structure I wanted was more useful. So, if it makes it easier, here is your structure:

[
  {information => {
    text => 'dir_A',
     data => {
      size => 99,
      type => 'folder'
    },
    contents => [
      {
        text => 'file_B',
         data => {
           size => 99,
           type => 'file'
         }
      },
      {
        text => 'dir_C',
        data => {
           size => 99,
           type => 'folder'
         },
        contents => [
          {
            text => 'file_D',
            data => {
              size => 99,
              type => 'file'
            }
          },
          {
            text => 'dir_E',
            data => {
              size => 99,
              type => 'folder'
            },
            contents => [
              {
                text => 'file_F',
                data => {
                  size => 99,
                  type => 'file'
                }
              }
            ]
          },
          {
            text => 'file_G',
            data => {
              type => 'file',
              size => 99
            }
          }
        ]
      },
      {
        text => 'file_H',
        data => {
          type => 'file',
          size => 99
        }
      }
    ]
  }
  }
]
[download]

The subroutine would be used thusly:

my $arrayref = _directoryTree('/usr/local/bin','/usr/local');
[download]

The reason for the filter is that I don't want to expose the entire path to the user of the web-application. All they need to see is the directory structure starting at a certain level...so, rather that showing them a tree consisting of /home/user/somedirectory/web-app/public/data... The filter could be used to "start" with /public/data as the "root", rather than the whole thing. The arrayref is then passed to the web-app framework(Mojolicious) and rendered as JSON to the client side thusly:

get => 'directory_list' sub {
  my $self = shift;
  my $arrayref = _directoryTree('/usr/local/bin','/usr/local');
  $self->render(json => $arrayref);
};
[download]

On a final note. I understand what you said about the two different uses of a key called "data". Since those are in two entirely different hashes, they have nothing to do with each other. The convention for the javascript framework is to construct a datasource with a "data" section containing the data and another data section for each record that contains any user-defined fields (e.g. those the framework does not specifically call out)...making it more sensible on the javascript side. If the field is in the documentation then just call object.text for instance, for an undocumented field, call object.data.customThing. Not my choice of conventions...I am just working with it.

[reply]
[d/l]
[select]