On Feb 26, 8:03 pm, "funkyj" <[EMAIL PROTECTED]> wrote:
> I want to call os.path.join() on a list instead of a variable list of
> arguments. I.e.
>
> [scr-misc] (186:0)$ python
> iPython 2.4 (#2, Feb 18 2005, 16:39:27)
> [GCC 2.95.4 20020320 [Free
I want to call os.path.join() on a list instead of a variable list of
arguments. I.e.
[scr-misc] (186:0)$ python
iPython 2.4 (#2, Feb 18 2005, 16:39:27)
[GCC 2.95.4 20020320 [FreeBSD]] on freebsd4
Type "help", "copyright", "credits" or "license" for more
information.
m>>>
Peter Otten wrote:
> funkyj wrote:
>
> > I've been googling around trying to find the answer to this question
> > but all I've managed to turn up is a 2 year old post of someone else
> > asking the same question (no answer though).
> How about monkey-
I've been googling around trying to find the answer to this question
but all I've managed to turn up is a 2 year old post of someone else
asking the same question (no answer though).
http://groups.google.com/group/comp.lang.python/browse_frm/thread/8004c690b8c4db53/81e460a0ee8b03a5?lnk=st&q=python
Chris F Clark wrote:
> Yes, there is literature on the generating side of the regular
> expression/FSM model. In fact, the matching problem and the
> generating problems are exactly equivalent. A slight variation of the
> definition of how a matcher works, turns it into a generator and vice
> ver
Going in a slightly different direction ...
There has been lots of published work on how to create efficient FSMs
from regexps. Generally these FSMs are used for pattern matching (i.e.
"does string 's' match regexp 'e'?").
Is there any corresponding literature on the topic addressed by the
OP's
Dinko Tenev wrote:
> Doug Quale wrote:
> Hmmm...storage is not an issue in the Prolog version. It generates a
> candidate solution, then checks membership in the wildcard set, then
> backtracks (backtracking is caused by "fail" in the test goal.) On
> backtracking, it effectively "forgets" the l
[EMAIL PROTECTED] wrote:
> It would seem that your program is just filtering the full cartesian
> product, right? The solution I'm looking for generates the elements
> one-by-one so that it could be used in a loop.
One advantage of a generator over filtering the full product is that I,
as the user
NOTE: I am a lisp newbie. I'm sure our resident lisp experts can
create much better (both faster, shorter and clearer) solutions than
the one above.
Even I could have created something shorter but I thought it would be
fun to apply the "utility function" approach in decomposing the
problem.
--
here is my version of the same.
REPL output:
CL-USER> (tests)
set = (1 2)
n= 3
patterns = ((1 ANY 2))
---
(1 1 1)
(1 2 1)
(2 1 1)
(2 1 2)
(2 2 1)
(2 2 2)
set = (A B)
n= 3
patterns = ((A ANY B) (B ANY A))
---
(A A A)
(A B A)
(B
I'm interested in the same sort of config file issues.
Unfortunately the restricted execution has fallen out of favor. My
preferred solution would be to have a configEval() function that is
just like the regular Python eval() but only accepts a subset of the
python language, e.g. creating the bas
Yeah, going back to the sourceforge site now I see the install
instructions you quote above.
Perhaps I'm spoiled by all the FSF packages I've dealt with over the
years. In addition to being impatient I expect the README file to
either tell me how to install the product or direct me to the INSTALL
Fredrik Lundh wrote:
> any special reason why pexpect cannot ship with a standard distutils
> setup.py file (or even egg support) ?
Oh, apparently there is a standard/builtin python distribution
mechanism called 'distutils'.
I guess on the install issue my only suggestion would be for the
pexpe
I love pexpect because it means I may never have to use expect again (I
don't do any heavy expect lifting -- I just need simple tty control)!
As a python advocate I find it embarassing how difficult it is do the
following in python (without pexpect):
- logon to a remote system using ssh
- do an '
14 matches
Mail list logo
