http://www.perlmonks.org?node_id=11160415

I realize it would take longer but it would be nice if you could search nodes by regular expression. Also it would be good to have a link to something like Using Super Search on the Super Search page or an updated help page with more details about how the search actually works.

UPDATE: These two nodes are also relevant Patterns in PerlMonks Searches and Exact words in super search, however, it's still not entirely clear to me what the 'separate strings with' option does, since the search matches substrings.

Replies are listed 'Best First'.
Re: super search by regex (updated)
by LanX (Saint) on Jul 07, 2024 at 14:47 UTC
    One of the problems with a regex interface is security.

    You have to make sure it's not injecting code and that it's terminating in reasonable time.

    Not sure why you need that tho

    I used globs for that reason in one of my projects, (they translated to regex but safely) and it was sufficient for 99% of our users.

    > not entirely clear to me what the separate strings with option does

    I think you are talking about the option to separate different sub strings with something different than space, like that you can search for substrings where a space is included.

    Like

    • missing|your mother
    would search
    • "missing","your mother"
    with "|" as separator, but
    • "missing|your","mother"
    by default

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    see Wikisyntax for the Monastery

    Update

    Your way of linking is constantly logging me out, not everybody is using www.perlmonks.org.

    Please prefer ids like [id://11160421] or node name links [node name]

    See also site how to

[reply]
[d/l]
[select]
[reply]
        > site how to is not recommended for current advice

        It's listed below the textarea when replying

        Want more info? How to link or How to display code and escape characters are good places to start.

        Cheers Rolf
        (addicted to the Perl Programming Language :)
        see Wikisyntax for the Monastery

[reply]
      Perl has special forces :
      Perl maintains a cache of visited states in order to short circuit redundant paths through the NFA, permitting it to evaluate some searches in linear time that take polynomial or exponential time in other Spencer engines.
      from "Can Regular Expressions Be Safely Reused Across Languages?": i-programmer.info/programming/perl/13051-can-regular-expressions-be-safely-reused-across-language-boundaries.html
[reply]
[reply]
Re: super search by regex
by jdporter (Paladin) on Jul 07, 2024 at 23:40 UTC
    it would be good to have a link to something like Using Super Search on the Super Search page

    Actually it is already linked: see the "Help for this page" link in the upper right corner of the main content area.

    Also, I added a link to the Patterns in PerlMonks Searches page at the bottom of the Using Super Search page. Thanks for the idea.

[reply]

Back to Perl Monks Discussion