Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re^2: Found a great cron program for windows

by brap (Pilgrim)
on Nov 24, 2009 at 03:57 UTC ( #808991=note: print w/replies, xml ) Need Help??

in reply to Re: Found a great cron program for windows
in thread Found a great cron program for windows

For what it's worth, personally I'd hesitate to recommend "at" for anything running every five minutes. Constantly rescheduling the job is more hassle than it's worth.

Scheduled Tasks (GUI or command line) handles schedules of this sort nicely.

  • Comment on Re^2: Found a great cron program for windows

Replies are listed 'Best First'.
Re^3: Found a great cron program for windows
by jdlev (Scribe) on Nov 24, 2009 at 15:25 UTC
    I love it when a program comes together - jdhannibal
    I always heard scheduled tasks was a pain in the butt to use? PS...i thought this tool was's not, and JUST EXPIRED! It claims it is shareware...but after a day they want $35 >:(

      You could use cron from the cygwin tools, if you want a free package. It's not GUI-based, but if you're familiar with cron on unix, you'll be at home with it.

      FYI: Shareware ne free...


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://808991]
[LanX]: all combinations with same amount of left and right?
[Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n
[LanX]: (Pascale path)
[Eily]: paths like that
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (10)
As of 2018-03-19 11:19 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.