all possible sequences

From: BobD (mrbdcom_at_hotmail.com)
Date: 02/24/04 

Date: 23 Feb 2004 20:07:45 -0800

I'm looking for an algorithm for producing all possible sequences of
characters in a given string (preferably of any length). It doesn't
have to be in Pascal/Delphi but that would be nice. BASIC or C is
okay too.

I haven't been able to find or figure out such a thing. Anybody know
of one or where I might find it?

Thanks,
Ed

Relevant Pages

  • Re: Defacto standard string library
    ... arbitrary sequences of characters, possibly including embedded null ... The C standard cannot legislate over the English language. ... If we're going to use the term "string" to refer to something other ...
    (comp.lang.c)
  • Re: RegEx: How to ignore the number of whitespaces?
    ... matching character sequences in strings. ... what are the limitations of the "arbitrary Unicode characters?" ... Exactly one of them must be found in the string, ... Certain subsequences of a pattern may be marked as optional. ...
    (microsoft.public.dotnet.framework)
  • Re: (first hello) -> *** Error: unbound variable: first
    ... Identifying arbitrary 1-element sequences with their elements is ... elements of strings are restricted to be characters. ... can't have a 1-element string consisting of a 2-element string, ... would look the same as a 2-element string consisting of two 1-element ...
    (comp.lang.scheme)
  • Re: why isnt Unicode the default encoding?
    ... you would have no good way to represent sequences of bytes anymore. ... character string, it is not. ... or characters, we can't just change the interpretation. ... So then the readmethod, if given a numeric argument for bytes to read, would act differently depending on if you were using Unicode or not? ...
    (comp.lang.python)
  • Re: Regular Expression to enforce format?
    ... Here's your regular expression: ... It is a string. ... regarding sequences of characters, rather than a set of literal character ...
    (microsoft.public.dotnet.framework.aspnet)