Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

comment on

( [id://3333]=superdoc: print w/replies, xml ) Need Help??

That doesn't seem to produce the correct results. Given this input:

C:\test>1169736-st.pl [ ["S", "N", "H", "A", "C", "J", "D", "E", "Z", "L"], ["S", "Y", "Y", "O", "D", "M", "G", "W", "F", "U"], ["Z", "Z", "P", "K", "G", "H", "V", "A", "J", "C"], ["P", "E", "E", "V", "M", "E", "N", "T", "K", "H"], ["I", "L", "H", "Z", "H", "T", "O", "F", "T", "V"], ["I", "Y", "H", "I", "D", "T", "V", "S", "P"], ["G", "D", "A", "B", "U", "W", "F", "D", "O"], ["L", "J", "B", "P", "U", "U", "N", "H"], ["B", "A", "X", "H", "H", "P", "R", "V"], ["M", "F", "T", "M", "L", "Y", "T", "C"], ["L", "C", "Y", "X", "O", "I", "M", "J"], ["K", "T", "P", "O", "J", "D", "F"], ["R", "T", "S", "M", "D", "J", "V"], ["D", "Y", "D", "X", "S", "H"], ["N", "O", "P", "P", "E"], ["U", "N", "Z", "T", "I"], ["B", "Z", "R", "D", "W"], ["N", "X", "A", "Z", "O"], ["T", "R", "O", "B", "L"], ["X", "V", "T", "E"], ["V", "P", "M"], ["V", "Q", "R"], ["V", "D", "C"], ["S", "H", "L"], ["P", "N", "Q"], ["A", "A"], ["R", "M"], ["O"], ["S"], ["N"], ["N"], ["C"], ]

It produces:

[ bless({ A => undef, C => undef, D => undef, E => undef, H => undef, +J => undef, L => undef, N => undef, S => undef, Z => undef }, "Set::T +iny"), bless({ D => undef, F => undef, G => undef, M => undef, O => undef, +S => undef, U => undef, W => undef, Y => undef }, "Set::Tiny"), bless({ A => undef, C => undef, G => undef, H => undef, J => undef, +K => undef, P => undef, V => undef, Z => undef }, "Set::Tiny"), bless({ E => undef, H => undef, K => undef, M => undef, N => undef, +P => undef, T => undef, V => undef }, "Set::Tiny"), bless({ F => undef, H => undef, I => undef, L => undef, O => undef, +T => undef, V => undef, Z => undef }, "Set::Tiny"), bless({ D => undef, H => undef, I => undef, P => undef, S => undef, +T => undef, V => undef, Y => undef }, "Set::Tiny"), bless({ A => undef, B => undef, D => undef, F => undef, G => undef, +O => undef, U => undef, W => undef }, "Set::Tiny"), bless({ B => undef, H => undef, J => undef, L => undef, N => undef, +P => undef, U => undef }, "Set::Tiny"), bless({ A => undef, B => undef, H => undef, P => undef, R => undef, +V => undef, X => undef }, "Set::Tiny"), bless({ C => undef, F => undef, L => undef, M => undef, T => undef, +Y => undef }, "Set::Tiny"), bless({ C => undef, I => undef, J => undef, L => undef, M => undef, +O => undef, X => undef, Y => undef }, "Set::Tiny"), bless({ D => undef, F => undef, J => undef, K => undef, O => undef, +P => undef, T => undef }, "Set::Tiny"), bless({ D => undef, J => undef, M => undef, R => undef, S => undef, +T => undef, V => undef }, "Set::Tiny"), bless({ D => undef, H => undef, S => undef, X => undef, Y => undef } +, "Set::Tiny"), bless({ E => undef, N => undef, O => undef, P => undef }, "Set::Tiny +"), bless({ I => undef, N => undef, T => undef, U => undef, Z => undef } +, "Set::Tiny"), bless({ B => undef, D => undef, R => undef, W => undef, Z => undef } +, "Set::Tiny"), bless({ A => undef, N => undef, O => undef, X => undef, Z => undef } +, "Set::Tiny"), bless({ B => undef, L => undef, O => undef, R => undef, T => undef } +, "Set::Tiny"), bless({ E => undef, T => undef, V => undef, X => undef }, "Set::Tiny +"), bless({ M => undef, P => undef, V => undef }, "Set::Tiny"), bless({ Q => undef, R => undef, V => undef }, "Set::Tiny"), bless({ C => undef, D => undef, V => undef }, "Set::Tiny"), bless({ H => undef, L => undef, S => undef }, "Set::Tiny"), bless({ N => undef, P => undef, Q => undef }, "Set::Tiny"), bless({ A => undef }, "Set::Tiny"), bless({ M => undef, R => undef }, "Set::Tiny"), bless({ O => undef }, "Set::Tiny"), bless({ S => undef }, "Set::Tiny"), bless({ N => undef }, "Set::Tiny"), bless({ C => undef }, "Set::Tiny"), ]

At least the last 6 subsets should not have made it into @filtered.

It should produce (+-the blessing):

[ ["S", "N", "H", "A", "C", "J", "D", "E", "Z", "L"], ["S", "Y", "Y", "O", "D", "M", "G", "W", "F", "U"], ["Z", "Z", "P", "K", "G", "H", "V", "A", "J", "C"], ["P", "E", "E", "V", "M", "E", "N", "T", "K", "H"], ["I", "L", "H", "Z", "H", "T", "O", "F", "T", "V"], ["I", "Y", "H", "I", "D", "T", "V", "S", "P"], ["G", "D", "A", "B", "U", "W", "F", "D", "O"], ["L", "J", "B", "P", "U", "U", "N", "H"], ["B", "A", "X", "H", "H", "P", "R", "V"], ["M", "F", "T", "M", "L", "Y", "T", "C"], ["L", "C", "Y", "X", "O", "I", "M", "J"], ["K", "T", "P", "O", "J", "D", "F"], ["R", "T", "S", "M", "D", "J", "V"], ["D", "Y", "D", "X", "S", "H"], ["N", "O", "P", "P", "E"], ["U", "N", "Z", "T", "I"], ["B", "Z", "R", "D", "W"], ["N", "X", "A", "Z", "O"], ["T", "R", "O", "B", "L"], ["X", "V", "T", "E"], ["V", "Q", "R"], ["V", "D", "C"], ["P", "N", "Q"], ]

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)
In the absence of evidence, opinion is indistinguishable from prejudice.
U, Science is about questioning the status quo. Questioning authority

In reply to Re^2: Fast Way to find one array in second array by BrowserUk
in thread Fast Way to find one array in second array by melmoth

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



  • Are you posting in the right place? Check out Where do I post X? to know for sure.
  • Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
    <code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
  • Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
  • Want more info? How to link or How to display code and escape characters are good places to start.
Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2024-04-23 19:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found