Re: Siesta party
* Nigel Rantor ([EMAIL PROTECTED]) wrote: > > Eep. None of my business of course, but that place chongs for the lord. > I am an NW3 resident and it sucketh arse like nobody's business. > > If you want mexican in town go to Cafe Pacifico in Covent Garden, best > marguaritas (speelong?) ever. > If thats the place thats on roughly located as follows | |* <-- here | --- street that runs along the top of convent garden i have to agree, this is a great mexican place, fairly reasonably priced, good food, good "drink with lime juice, tequilla and usually one other spirit"'s. i don't care what the occasion is but if anyone fancys going there and its convenient, i'm up for it, i can never remember its name, because when i finally get up, find that someone has replaced my legs with jelly, stagger to the door and grab business card to remember the place. i find that i end up with a business card for la perla - an italian. maybe la perla is owned by the same people, or else the waiting staff really hate la perla and me, and think that we deserve each other and hence play the cunning rouse of switching business cards, h. but never fear, as you can tell my highly detailed map, i know exactly where it is! ;-) G. -- Greg McCarroll http://www.mccarroll.org.uk/~gem/ jabber://[EMAIL PROTECTED] msn://[EMAIL PROTECTED]
Re: Siesta party
At 23:16 + 2003/08/14, Greg McCarroll wrote: i can never remember its name, because when i finally get up, find that someone has replaced my legs with jelly, stagger to the door and grab business card to remember the place. i find that i end up with a business card for la perla - an italian. http://jerakeen.org/pictures/Misc/Cafe_Pacifico_Card I knew I had that there for a reason. -- .tom
OSX to Netscreen
Title: Message Hello, I saw your posting about this on line and would appreciate the details. I've just started a new job where I need access a Netscreen VPN from home using my Powerbook. Cheers, MIke == Mike Friedman IT Manager Alzheimers Assn. of Northern California 2065 W. El Camino Real Mt. View, CA 94040 650-623-3129 (office) 415-823-9990 (cell) BEGIN:VCARD VERSION:2.1 N:Friedman;Mike FN:Mike Friedman EMAIL;PREF;INTERNET:[EMAIL PROTECTED] REV:20030805T174538Z END:VCARD
Re: Siesta party
On Fri, 15 Aug 2003, Tom Insam wrote: > At 23:16 + 2003/08/14, Greg McCarroll wrote: > > > >i can never remember its name, because when i finally get up, > >find that someone has replaced my legs with jelly, stagger to the > >door and grab business card to remember the place. i find that i > >end up with a business card for la perla - an italian. > > http://jerakeen.org/pictures/Misc/Cafe_Pacifico_Card > Yes I have been there too - had a very drunken night with some colleagues about a year ago which ended up in the Long Island Ice Tea House at the bottom of Long Acre. I'd be up for it if anyone else is going. /J\
Re: Exporting from .mdb Access files
On Thu, 14 Aug 2003, Paul Makepeace wrote: > On Thu, Aug 14, 2003 at 12:21:04PM -0400, Chris Devers wrote: > > It seems like if you can get an instance of Access running with the file, > > you should be able to use ODBC to extract the data. > > Indeed, but that would require running Windows, obtaining a copy & > license for Access, not to mention all the faffing with DSN and connect > permissions, AFAIK. In all, it would add to the number of my problems, > rather than reduce them :-) > I'm absolutely sure I have seen a project that is aiming to produce an open source library for access databases bt for the life of me I can't find it in any of the usual places. /J\
Cafe Pacifico Cat Herding
So lots of people seem to want to go to Cafe Pacifico, and as i haven't been stupid enough to volunteer for cat herding in sometime i'll take care of it. I will be going to Cafe Pacifico on Friday 22nd of August (next friday), I shall be aiming to sit down at the table for 7pm. If you would like to come along, please email me offlist by say monday evening and i shall book an appropriately sized table. I'll probably bring my wife along, so it might be a good chance to bring your own ``signficant other'' to meet some perl mongers. That is all, Greg -- Greg McCarroll http://www.mccarroll.org.uk/~gem/ jabber://[EMAIL PROTECTED] msn://[EMAIL PROTECTED]
Re: Exporting from .mdb Access files
On Fri, Aug 15, 2003 at 09:48:26AM +0100, Jonathan Stowe wrote: > I'm absolutely sure I have seen a project that is aiming to produce an > open source library for access databases bt for the life of me I can't > find it in any of the usual places. libmdb? http://mdbtools.sourceforge.net/ Cheers, Alex.
Re: [JOB] Yahoo! News (in California)
Paul Makepeace wrote: On Tue, Jul 08, 2003 at 05:58:44PM +0100, Paul Makepeace wrote: Any success actually having a H1B granted? I had one during the dot com boom and it was a massive PITA even then. As a student in the US and then an employee of an American corporation which sheperded my application through the process and paid all of my legal fees, I always marvelled that the tired, unwashed, huddled masses *ever* made it into the US, let alone in numbers large enough to be apparently taking jobs away from the good old boys in the USA. Welcome (or not) to Fortress USA. I have often suspected that one of the criteria on INS applications was rapant xenophobia: 1. Do you believe that the US is God's greatest gift to the world? 2. Do you believe that foreigners are all lazy bums looking to sponge off of our [ahem] generous unemployemnt benefits? 3. Have you never held a passport? If you responded 'yes' to all three questions then welcome to the immigration authority. Forget 'Fast Track' visas. The 65K pool is available sometime in October (if I remember correctly) and is used up on a first-come, first-served basis. So if you don't apply within a month of the pool become available you will *not* be able to get a visa until next *year*. You will also need to be sponsored by an employer during this process so you need to find someone willing to pay a great deal of money for an employee they won't be able to have on-site for another four to eight months. If you are serious about wanting to work in the US then you will want to speak to a good lawyer specialising in US immigration law. It *is* possible but requires a great deal of voodoo and good luck. jon -- jon reades fulcrum analytics t: 0870.366.9338 m: 0797.698.7392 f: 0870.888.8880 lower ground floor 2 sheraton street london w1f 8bh
Re: what are you doing
On Thu, 14 Aug 2003, Michael Stevens wrote: > On Thu, Aug 14, 2003 at 01:39:16PM +0100, Ali Young wrote: > > I'm starting an OU maths degree next year. This is because free time is > > patently evil and wrong and much be got rid of. > > Do you actually have any free time at the moment, though? :) I'm about to gain a hell of a lot more of it, seeing as I'll be unemployed in 28 days time. Really must update my CV _now_. > When I say "No IT work", like when I say "There are no jobs", the > slightly more serious formulation is "There very few jobs, and > massively fewer of them than there were 3 years ago". But, eg) most > of this list has work of some kind. Even if some of us have sold our > souls. *twitch* Ali -- Ali Young [EMAIL PROTECTED] http://ali.anarres.org/ 0777 32 96 156
[OT] Decompiling perl2exe apps
Hi Everyone I need a bit of advice with a slightly embarrasing problem... No, not in the trouser department (as yet). I have managed to lose some source code (ahem) for a script that I packaged with perl2exe on a Windows 2000 PC. I have seen a few hints that perl2exe applications can be cracked to reveal the source code. This sound great except the word trivial seems to crop up a lot without actually giving much detail on how to do it. Being from a biology background and relatively inexperienced in the computer sciences field, I could use some straight-forward advice on how to do this. Has anyone ever done this and if so would they mind sharing their knowledge with me. I am keeping my fingers crossed. Cheers James =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= James Campbell Research Bioinformatician Proteome Sciences Institute of Psychiatry South Wing Lab PO BOX P045 16 De Crespigny Park London SE5 8AF Tel:+44-(0)20-7848-5111 Fax:+44-(0)20-7848-5114 Email: [EMAIL PROTECTED] Web 1: www.proteome.co.uk Web 2: www.proteinworks.com =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Re: [OT] Decompiling perl2exe apps
On Fri, 15 Aug 2003, James Campbell wrote: > I have managed to lose some source code (ahem) for a script that I packaged > with perl2exe on a Windows 2000 PC. I have seen a few hints that perl2exe > applications can be cracked to reveal the source code. This sound great > except the word trivial seems to crop up a lot without actually giving much > detail on how to do it. 'strings' is probably a good start. S. -- Shevekhttp://www.anarres.org/ I am the Borg. http://www.gothnicity.org/
IPC::Shareable: Could not create semaphore set
Hello I have had a good look round at what may be causing the error.. Could not create semaphore set: No space left on device What I am basically doing is the following... tie %myhash, 'IPC::Shareable', "hashkey", {create => 1, exclusive => 0, mode => 0666, destroy => 1, size => 262144 }; while($dstIP = $sth1->fetchrow()) { print "$dstIP\n"; $myhash{$dstIP}{"dispatched"} = time(); $myhash{$dstIP}{"response"} = 0; $myhash{$dstIP}{"num_polls"} = 1; $myhash{$dstIP}{"action"} = 0; } When I start up the process, I manage to print out 10 $dstIP addresses and then I get the error. This is rather a small amount of data to fit into 262144 bytes. Even if I increase this size, I get the same error at the same point. Without setting SHM fetchrow returns 20 $dstIP addresses and they print fine. Any ideas Andy
Re: OT: Can't declare subtraction
On Thu, 14 Aug 2003 18:21:34 -0400, Mike Jarvis <[EMAIL PROTECTED]> wrote: > They swear they're upgrading RSN, when BSD (Free? Open? Whichever.) > does. They only run stable from their distro, and it's hard to fault > an ISP for that. That's a pretty lame excuse. It's very easy to disable the builtin perl and run a newer version from ports in FreeBSD. % sudo portinstall lang/perl5.8 % sudo use.perl port You still have to remove the system perl bits, but that's pretty easy: 1. Put "NOPERL=yes" in /etc/make.conf, to ensure a make world won't overwrite everything. 2. Delete /usr/share/libdata/perl, and the following programs from /usr/bin (you may also wish to delete the man pages from /usr/share/man/man1): perl a2p c2ph dprofpp enc2xs find2perl h2ph h2xs libnetcfg perl5.00503 perlbug perlcc perldoc perlivp piconv pl2pm pod2html pod2latex pod2man pod2text pod2usage podchecker podselect psed pstruct s2p sperl5.00503 splain suidperl xsubpp 3. You'll probably want to symlink /usr/bin/perl to /usr/local/bin/perl. -Dom -- | Semantico: creators of major online resources | | URL: http://www.semantico.com/ | | Tel: +44 (1273) 72 | | Address: 33 Bond St., Brighton, Sussex, BN1 1RD, UK. |
Re: IPC::Shareable: Could not create semaphore set
This is the output of ipcs -A... IPC status from as of Fri Aug 15 13:10:04 UTC 2003 T ID KEYMODEOWNERGROUP CREATOR CGROUP CBYTES QNUM QBYTES LSPID LRPID STIMERTIMECTIME Message Queues: T ID KEYMODEOWNERGROUP CREATOR CGROUP NATTCH SEGSZ CPID LPID ATIMEDTIMECTIME ISMATTCH Shared Memory: m610 0xbc054--rw-rw-rw- rootother root other 0 65536 7680 0 no-entry no-entry 13:10:010 T ID KEYMODEOWNERGROUP CREATOR CGROUP NSEMS OTIMECTIME Semaphores: before running the script, ipcs -A was clear so the shared memory was created with ID 610 Andy On Fri, 2003-08-15 at 13:44, Andy Ford wrote: > Hello > > I have had a good look round at what may be causing the error.. > Could not create semaphore set: No space left on device > > What I am basically doing is the following... > > tie %myhash, 'IPC::Shareable', "hashkey", {create => 1, exclusive => 0, > mode => 0666, destroy => 1, size => 262144 }; > > while($dstIP = $sth1->fetchrow()) > { >print "$dstIP\n"; >$myhash{$dstIP}{"dispatched"} = time(); >$myhash{$dstIP}{"response"} = 0; >$myhash{$dstIP}{"num_polls"} = 1; >$myhash{$dstIP}{"action"} = 0; > > } > > When I start up the process, I manage to print out 10 $dstIP addresses > and then I get the error. This is rather a small amount of data to fit > into 262144 bytes. Even if I increase this size, I get the same error at > the same point. Without setting SHM fetchrow returns 20 $dstIP addresses > and they print fine. > > Any ideas > > Andy >
Re: IPC::Shareable: Could not create semaphore set
Actually, $dstIP prints out 10 times. and the maximum number of shares mem segments is 10. Maybe its the hash that isn't declared correctly!? Andy On Fri, 2003-08-15 at 14:12, Andy Ford wrote: > This is the output of ipcs -A... > > IPC status from as of Fri Aug 15 13:10:04 UTC 2003 > T ID KEYMODEOWNERGROUP CREATOR > CGROUP CBYTES QNUM QBYTES LSPID LRPID STIMERTIMECTIME > Message Queues: > T ID KEYMODEOWNERGROUP CREATOR > CGROUP NATTCH SEGSZ CPID LPID ATIMEDTIMECTIME ISMATTCH > Shared Memory: > m610 0xbc054--rw-rw-rw- rootother root > other 0 65536 7680 0 no-entry no-entry 13:10:010 > T ID KEYMODEOWNERGROUP CREATOR > CGROUP NSEMS OTIMECTIME > Semaphores: > > before running the script, ipcs -A was clear so the shared memory was > created with ID 610 > > Andy > > On Fri, 2003-08-15 at 13:44, Andy Ford wrote: > > Hello > > > > I have had a good look round at what may be causing the error.. > > Could not create semaphore set: No space left on device > > > > What I am basically doing is the following... > > > > tie %myhash, 'IPC::Shareable', "hashkey", {create => 1, exclusive => 0, > > mode => 0666, destroy => 1, size => 262144 }; > > > > while($dstIP = $sth1->fetchrow()) > > { > >print "$dstIP\n"; > >$myhash{$dstIP}{"dispatched"} = time(); > >$myhash{$dstIP}{"response"} = 0; > >$myhash{$dstIP}{"num_polls"} = 1; > >$myhash{$dstIP}{"action"} = 0; > > > > } > > > > When I start up the process, I manage to print out 10 $dstIP addresses > > and then I get the error. This is rather a small amount of data to fit > > into 262144 bytes. Even if I increase this size, I get the same error at > > the same point. Without setting SHM fetchrow returns 20 $dstIP addresses > > and they print fine. > > > > Any ideas > > > > Andy > > >
Re: IPC::Shareable: Could not create semaphore set
I meant semaphores... from 'sysdef -i' I get * IPC Semaphores * 10 semaphore identifiers (SEMMNI) 60 semaphores in system (SEMMNS) 30 undo structures in system (SEMMNU) 25 max semaphores per id (SEMMSL) 10 max operations per semop call (SEMOPM) 10 max undo entries per process (SEMUME) 32767 semaphore maximum value (SEMVMX) 16384 adjust on exit max value (SEMAEM) * Andy On Fri, 2003-08-15 at 14:12, Andy Ford wrote: > This is the output of ipcs -A... > > IPC status from as of Fri Aug 15 13:10:04 UTC 2003 > T ID KEYMODEOWNERGROUP CREATOR > CGROUP CBYTES QNUM QBYTES LSPID LRPID STIMERTIMECTIME > Message Queues: > T ID KEYMODEOWNERGROUP CREATOR > CGROUP NATTCH SEGSZ CPID LPID ATIMEDTIMECTIME ISMATTCH > Shared Memory: > m610 0xbc054--rw-rw-rw- rootother root > other 0 65536 7680 0 no-entry no-entry 13:10:010 > T ID KEYMODEOWNERGROUP CREATOR > CGROUP NSEMS OTIMECTIME > Semaphores: > > before running the script, ipcs -A was clear so the shared memory was > created with ID 610 > > Andy > > On Fri, 2003-08-15 at 13:44, Andy Ford wrote: > > Hello > > > > I have had a good look round at what may be causing the error.. > > Could not create semaphore set: No space left on device > > > > What I am basically doing is the following... > > > > tie %myhash, 'IPC::Shareable', "hashkey", {create => 1, exclusive => 0, > > mode => 0666, destroy => 1, size => 262144 }; > > > > while($dstIP = $sth1->fetchrow()) > > { > >print "$dstIP\n"; > >$myhash{$dstIP}{"dispatched"} = time(); > >$myhash{$dstIP}{"response"} = 0; > >$myhash{$dstIP}{"num_polls"} = 1; > >$myhash{$dstIP}{"action"} = 0; > > > > } > > > > When I start up the process, I manage to print out 10 $dstIP addresses > > and then I get the error. This is rather a small amount of data to fit > > into 262144 bytes. Even if I increase this size, I get the same error at > > the same point. Without setting SHM fetchrow returns 20 $dstIP addresses > > and they print fine. > > > > Any ideas > > > > Andy > > >
Re: IPC::Shareable: Could not create semaphore set
I am getting somewhere now!! If I call 'tie' after I have created the hash, all is fine. Surely I should be able to create the shares memory and then add/remove entries in the hash at will!? Andy On Fri, 2003-08-15 at 14:12, Andy Ford wrote: > This is the output of ipcs -A... > > IPC status from as of Fri Aug 15 13:10:04 UTC 2003 > T ID KEYMODEOWNERGROUP CREATOR > CGROUP CBYTES QNUM QBYTES LSPID LRPID STIMERTIMECTIME > Message Queues: > T ID KEYMODEOWNERGROUP CREATOR > CGROUP NATTCH SEGSZ CPID LPID ATIMEDTIMECTIME ISMATTCH > Shared Memory: > m610 0xbc054--rw-rw-rw- rootother root > other 0 65536 7680 0 no-entry no-entry 13:10:010 > T ID KEYMODEOWNERGROUP CREATOR > CGROUP NSEMS OTIMECTIME > Semaphores: > > before running the script, ipcs -A was clear so the shared memory was > created with ID 610 > > Andy > > On Fri, 2003-08-15 at 13:44, Andy Ford wrote: > > Hello > > > > I have had a good look round at what may be causing the error.. > > Could not create semaphore set: No space left on device > > > > What I am basically doing is the following... > > > > tie %myhash, 'IPC::Shareable', "hashkey", {create => 1, exclusive => 0, > > mode => 0666, destroy => 1, size => 262144 }; > > > > while($dstIP = $sth1->fetchrow()) > > { > >print "$dstIP\n"; > >$myhash{$dstIP}{"dispatched"} = time(); > >$myhash{$dstIP}{"response"} = 0; > >$myhash{$dstIP}{"num_polls"} = 1; > >$myhash{$dstIP}{"action"} = 0; > > > > } > > > > When I start up the process, I manage to print out 10 $dstIP addresses > > and then I get the error. This is rather a small amount of data to fit > > into 262144 bytes. Even if I increase this size, I get the same error at > > the same point. Without setting SHM fetchrow returns 20 $dstIP addresses > > and they print fine. > > > > Any ideas > > > > Andy > > >
Re: Bra
dha wrote: > On Thu, Aug 14, 2003 at 10:26:18AM +0100, Leon Brocard wrote: >> The goods have indeed arrived. I will not take any photos of it. I may >> bring[1] it to the next social. It is a black Victoria's Secret bra. > > And will you be bringing it on tour for those of us not in the london > area? I'm sure MoMA would be happy to put in a temporary exhibit. :-) dha, if you can organise a secluded orange-walled room at the museum, Leon can simply walk in, toss the bra in the air and leave in his wake a wonderful contemporary site-specific art exhibit, for which I have prepared the following description. Victoria Bra, Secret Tango (2003) = L.A.B. Brocard 1976- This, the third work in Brocard's acclaimed "Orange" sequence, explodes the theme of semantic [a]chromatic aspects of visual perception first explored in his highly successful "Buffy" series, and fully explores the concept of supporting relationships, which were touched on in his earlier works. The site's central artifact is a stark reminder of the lack of support in contemporary relationships, with the jumbled juxtaposition of its two cups, indicative of being discarded in a hurry, symbolizing the excessive rapidity and tautness of modern life. As always with Brocard, it is vital to consider the intertextuality of the title of the work, in order to deconstruct the surface meaning of the work itself and penetrate, as it were, to the kernel of the work's "meaning", if such a concept is still relevant in the present context. Consider, for example, the word "Victoria": does it express the moniker of the bra's former occupant or merely the state or district in which she was born? And what of "Secret Tango"? Is it, in the context of the universe that is the present work, merely indicative of the site's location and visual perception, or does it suggest the bra's former resident once furtively enjoyed a rhythmic dance of long gliding steps and sudden pauses with the artist? The viewer will no doubt at this point recall that the word "tango" rhymes with "mango" and thereby grasp the semantic thrust of the work's title. However, the installation itself has even more to reveal when the particularly observant viewer speculates on the site's central device being strapped to the bra's current owner. This work is extremely fragile. Please do not touch. /-\ http://search.yahoo.com.au - Yahoo! Search - Looking for more? Try the new Yahoo! Search
Re: [OT] Decompiling perl2exe apps
On Fri, Aug 15, 2003 at 12:46:50PM +0100, Shevek wrote: > On Fri, 15 Aug 2003, James Campbell wrote: > > > I have managed to lose some source code (ahem) for a script that I packaged > > with perl2exe on a Windows 2000 PC. I have seen a few hints that perl2exe > > applications can be cracked to reveal the source code. This sound great > > except the word trivial seems to crop up a lot without actually giving much > > detail on how to do it. > > 'strings' is probably a good start. I don't know whether perl2exe hides the source code more effectively than this, or doesn't even include the source code. I'm not sure if 'trivial' solutions involve B::Deparse Try setting PERL5OPT to -MO=Deparse in your environment (not sure what the Windows equivalent of export PERL5OPT=-MO=Deparse is) Depending on how perl2exe does things, you may find that that lists your program for you. If it's also been obfuscated, try Deobfuscate in place of Deparse: http://search.cpan.org/author/JJORE/B-Deobfuscate/ Nicholas Clark
Re: Bra
On Thu, 14 Aug 2003, Leon Brocard wrote: > The goods have indeed arrived. I will not take any photos of it. I may > bring[1] it to the next social. It is a black Victoria's Secret bra. I'd be *more* than happy to take photographs of you modelling the bra, so as to let those who can't make it to the social join in the fun. ;) Marna
Re: Bra
On Fri, Aug 15, 2003 at 03:57:58PM +0100, Marna Gilligan wrote: > On Thu, 14 Aug 2003, Leon Brocard wrote: > > > The goods have indeed arrived. I will not take any photos of it. I may > > bring[1] it to the next social. It is a black Victoria's Secret bra. > > I'd be *more* than happy to take photographs of you modelling the bra, so > as to let those who can't make it to the social join in the fun. ;) This counts as "art" rather than debauchery? On the basis that debauchery is frowned on at social meetings? Anyway, this seems unlikely, given Leon's previous insistence that he won't be wearing it. Nicholas Clark
Re: Bra
On Fri, 15 Aug 2003, Nicholas Clark wrote: > This counts as "art" rather than debauchery? On the basis that debauchery > is frowned on at social meetings? > > Anyway, this seems unlikely, given Leon's previous insistence that he > won't be wearing it. Count the number of people who pat him on the back at the meeting just to check ;) Jason Clifford -- UKFSN.ORG Finance Free Software while you surf the 'net http://www.ukfsn.org/ ADSL Broadband available now
Re: Bra
On Fri, 15 Aug 2003, Jason Clifford wrote: > On Fri, 15 Aug 2003, Nicholas Clark wrote: > > > This counts as "art" rather than debauchery? On the basis that debauchery > > is frowned on at social meetings? > > > > Anyway, this seems unlikely, given Leon's previous insistence that he > > won't be wearing it. > > Count the number of people who pat him on the back at the meeting just to > check ;) and the number of people who try to ping his bra strap Ali -- Ali Young [EMAIL PROTECTED] http://ali.anarres.org/ 0777 32 96 156
Re: Bra
Nicholas Clark [EMAIL PROTECTED] quoth: *> *>This counts as "art" rather than debauchery? On the basis that debauchery *>is frowned on at social meetings? *> *>Anyway, this seems unlikely, given Leon's previous insistence that he *>won't be wearing it. Gads, given the choice, I'd almost rather have photos of you all wearing it on your head Animal House style just to get it over with :) It'd be a fitting addition to the toilet seat around the neck series e.
Re: Bra
On Fri, 15 Aug 2003, Ali Young wrote: > and the number of people who try to ping his bra strap [EMAIL PROTECTED]:~> ping bra-strap.leon ping: unknown host bra-strap.leon Jason -- UKFSN.ORG Finance Free Software while you surf the 'net http://www.ukfsn.org/ ADSL Broadband available now
[RFC] arbitary maths evaluation
For various reasons I needed to write something that would evaluate an arbitary math's expression safely (i.e not just run it through eval ""). So I decided that the best [0] way to do it was to write a grammar. Which I have. It's quite funky, deals with large floating point numbers, sin, random numbers, logs, negatives, brackets and, erm, variables. Some examples of what it can cope with: 2 + 4 2 * 4 + 3 2 * (4+3) 8 * -10 2.6 ^ 5.9 3.9**12.4 5%2 sin(2) abs(-2) ceil(2.3) foo = sqrt(100); bar = rand(30); foo - bar bin(2) http://thegestalt.org/simon/perl/maths Now, is this worth packaing into a module? I didn't see anything on CPAN like it and it's possibly quite useful for other people - there seems to be precedence with Math::BooleanEval and, sort of orthogonally, Math::Expr The one problem is that it's quite slow, presumably (I haven't checked) becuase it's using Math::Big* ... arguably it could cope fine with normal numbers or maybe by having multiple backends for different needs. It could also do with some constants - PI, E etc etc Thoughts, comments, criticisms? [0] partly just because I wanted to learn Parse::RecDescent which, when I finally grokked it, was amazing. Simon -- act like nothing's wrong
Re: Bra
* Elaine -HFB- Ashton ([EMAIL PROTECTED]) wrote: > > Gads, given the choice, I'd almost rather have photos of you all wearing > it on your head Animal House style just to get it over with :) It'd be a > fitting addition to the toilet seat around the neck series > Last time you made a wise crack like that you ended up auction your bra, be careful what you suggest this time ;-) Greg p.s. also weird science style -- Greg McCarroll http://www.mccarroll.org.uk/~gem/ jabber://[EMAIL PROTECTED] msn://[EMAIL PROTECTED]
Re: [RFC] arbitary maths evaluation
* Simon Wistow ([EMAIL PROTECTED]) wrote: > For various reasons I needed to write something that would evaluate an > arbitary math's expression safely (i.e not just run it through eval ""). you could always just use google, maybe write a screen scraper for, have you seen the google calculator, its very good ;-) Greg -- Greg McCarroll http://www.mccarroll.org.uk/~gem/ jabber://[EMAIL PROTECTED] msn://[EMAIL PROTECTED]
Re: [RFC] arbitary maths evaluation
On Fri, Aug 15, 2003 at 08:15:52AM +, Greg McCarroll said: > you could always just use google, maybe write a screen scraper for, > have you seen the google calculator, its very good ;-) *slap!*
Re: [RFC] arbitary maths evaluation
> you could always just use google, maybe write a screen scraper for, > have you seen the google calculator, its very good ;-) *slap!* a
Re: OT: Can't declare subtraction
On Fri, Aug 15, 2003 at 01:11:21PM +, Dominic Mitchell wrote: > On Thu, 14 Aug 2003 18:21:34 -0400, Mike Jarvis <[EMAIL PROTECTED]> wrote: > > They swear they're upgrading RSN, when BSD (Free? Open? Whichever.) > > does. They only run stable from their distro, and it's hard to fault > > an ISP for that. > That's a pretty lame excuse. It's very easy to disable the builtin perl > and run a newer version from ports in FreeBSD. I'm sorry, but although the following 2 lines of yours are easy, apart from the minor issue with locating this "use.perl" script of yours... > % sudo portinstall lang/perl5.8 > % sudo use.perl port > You still have to remove the system perl bits, but that's pretty easy: > 1. Put "NOPERL=yes" in /etc/make.conf, to ensure a make world won't > overwrite everything. Easy, and maintainable, agreed. > 2. Delete /usr/share/libdata/perl, and the following programs from > /usr/bin (you may also wish to delete the man pages from > /usr/share/man/man1): [31 lines deleted] I wouldn't be happy with doing this. I could easily imagine it breaking something when I least expect it. Certainly I don't think it's useful to get rid of the 5.005 and 5.00503 suffixed binaries. > 3. You'll probably want to symlink /usr/bin/perl to > /usr/local/bin/perl. That again is fine, because: :; ls -li /usr/bin/perl /usr/bin/perl5 /usr/bin/perl5.00503 16139 -r-xr-xr-x 3 root wheel 10168 Mar 14 21:25 /usr/bin/perl 16139 -r-xr-xr-x 3 root wheel 10168 Mar 14 21:25 /usr/bin/perl5 16139 -r-xr-xr-x 3 root wheel 10168 Mar 14 21:25 /usr/bin/perl5.00503 I had some bad experiences with the OpenSSL and OpenSSH ports in their replace the base system version modes. This has made me wary of replacing functionality in the base system from the ports. -- Lusercop.net - LARTing Lusers everywhere since 2002
Re: [RFC] arbitary maths evaluation
On Fri, 15 Aug 2003, Simon Wistow wrote: > For various reasons I needed to write something that would evaluate an > arbitary math's expression safely (i.e not just run it through eval ""). > > So I decided that the best [0] way to do it was to write a grammar. > Which I have. It's quite funky, deals with large floating point numbers, > sin, random numbers, logs, negatives, brackets and, erm, variables. > > Thoughts, comments, criticisms? > > [0] partly just because I wanted to learn Parse::RecDescent which, when > I finally grokked it, was amazing. The effective halfway house, which does produce a good but fast sandbox, is to parse the thing properly, generate a parse tree, then emit guaranteed clean Perl code from the parse tree, and eval that. I do this on a fairly large scale. S. -- Shevekhttp://www.anarres.org/ I am the Borg. http://www.gothnicity.org/
Re: OT: Can't declare subtraction
Lusercop <`the.lusercop'@lusercop.net> wrote: > On Fri, Aug 15, 2003 at 01:11:21PM +, Dominic Mitchell wrote: >> On Thu, 14 Aug 2003 18:21:34 -0400, Mike Jarvis <[EMAIL PROTECTED]> wrote: >> > They swear they're upgrading RSN, when BSD (Free? Open? Whichever.) >> > does. They only run stable from their distro, and it's hard to fault >> > an ISP for that. >> That's a pretty lame excuse. It's very easy to disable the builtin perl >> and run a newer version from ports in FreeBSD. > > I'm sorry, but although the following 2 lines of yours are easy, apart from > the minor issue with locating this "use.perl" script of yours... use.perl is installed as part of the port. It's not mine. >> % sudo portinstall lang/perl5.8 >> % sudo use.perl port > >> You still have to remove the system perl bits, but that's pretty easy: >> 1. Put "NOPERL=yes" in /etc/make.conf, to ensure a make world won't >> overwrite everything. > > Easy, and maintainable, agreed. > >> 2. Delete /usr/share/libdata/perl, and the following programs from >> /usr/bin (you may also wish to delete the man pages from >> /usr/share/man/man1): > [31 lines deleted] > > I wouldn't be happy with doing this. I could easily imagine it breaking > something when I least expect it. Certainly I don't think it's useful to > get rid of the 5.005 and 5.00503 suffixed binaries. That's really your choice. You can choose to not do this step. I do it because I'm happy to live with the consequences and I prefer to not have two versions of perl sitting around. >> 3. You'll probably want to symlink /usr/bin/perl to >> /usr/local/bin/perl. > > That again is fine, because: >:; ls -li /usr/bin/perl /usr/bin/perl5 /usr/bin/perl5.00503 > 16139 -r-xr-xr-x 3 root wheel 10168 Mar 14 21:25 /usr/bin/perl > 16139 -r-xr-xr-x 3 root wheel 10168 Mar 14 21:25 /usr/bin/perl5 > 16139 -r-xr-xr-x 3 root wheel 10168 Mar 14 21:25 /usr/bin/perl5.00503 Sorry, I'm missing the point here. > I had some bad experiences with the OpenSSL and OpenSSH ports in their > replace the base system version modes. This has made me wary of replacing > functionality in the base system from the ports. I'm curious, what sort of bad experiences. I've not needed to replace either of the above, although it'd be useful to know for the future... -Dom -- | Semantico: creators of major online resources | | URL: http://www.semantico.com/ | | Tel: +44 (1273) 72 | | Address: 33 Bond St., Brighton, Sussex, BN1 1RD, UK. |
Re: [RFC] arbitary maths evaluation
* Shevek [2003-08-15 12:39]: > The effective halfway house, which does produce a good but fast > sandbox, is to parse the thing properly, generate a parse tree, then > emit guaranteed clean Perl code from the parse tree, and eval that. This is how the Template Toolkit does it too, using a grammar generated using Parse::Yapp rather than Parse::RecDescent, with a custom parser. The nice thing about this approach is that you don't need Parse::* to run the code, which makes it more easily distributable. (darren) -- I look for what needs to be done After all, that's how the universe designs itself. -- R. Buckminster Fuller pgp0.pgp Description: PGP signature
Re: [RFC] arbitary maths evaluation
On Fri, 15 Aug 2003, darren chamberlain wrote: > * Shevek [2003-08-15 12:39]: > > The effective halfway house, which does produce a good but fast > > sandbox, is to parse the thing properly, generate a parse tree, then > > emit guaranteed clean Perl code from the parse tree, and eval that. > > This is how the Template Toolkit does it too, using a grammar generated > using Parse::Yapp rather than Parse::RecDescent, with a custom parser. > The nice thing about this approach is that you don't need Parse::* to > run the code, which makes it more easily distributable. Yapp is a brilliant piece of code which I love both in architecture and implementation, but it's desperately fucking slow. It is, however, the right answer. Be aware that you will take a big performance hit. It seems to do about 1000 lines a minute for a basic C-like grammar. The same ruleset implemented in flex/bison with XS does a few thousand lines a second. It will be more than fast enough for basic applications of your module, which I look forward to seeing on CPAN. You are welcome to the source of my bison/XS hookup if you want it. S. -- Shevekhttp://www.anarres.org/ I am the Borg. http://www.gothnicity.org/
Re: [RFC] arbitary maths evaluation
Shevek wrote: > Yapp is a brilliant piece of code which I love both in architecture and > implementation, but it's desperately fucking slow. Slow at compiling the grammar or when running the parser that it builds? For compiling, we don't care that much because we only need to do it once, or whever the grammar changes at least (not often). For TT I threw away the parser that Parse::Yapp generates and wrote my own which is much[*] faster at the cost of features which I don't need. I just use the state and action table that PY generates. For TT3, I'm throwing away the Parse::Yapp generated grammar and writing a bastard hybrid of a predictive LL(1) and a recursive descent parser. Well, that's the design in my head at the moment. Could be something totally different in half an hour... /me strokes the dragon resting by his side A [*] It may even be much, much faster - I recall doing some benchmarking at the time and being impressed. I just forget how impressed I was.
Re: [RFC] arbitary maths evaluation
On Fri, 15 Aug 2003, Andy Wardley wrote: > Shevek wrote: > > Yapp is a brilliant piece of code which I love both in architecture and > > implementation, but it's desperately fucking slow. > > Slow at compiling the grammar or when running the parser that it builds? Very slow at running. I don't really care about compile time. > For TT3, I'm throwing away the Parse::Yapp generated grammar and writing > a bastard hybrid of a predictive LL(1) and a recursive descent parser. > Well, that's the design in my head at the moment. Could be something > totally different in half an hour... Please note that I am writing this without checking (I'm working on security atm, and don't want to break my concentration by checking up grammar tables). IANAL. I think you have the advantage of being a strict type 2 grammar with no precedence rules, and therefore LL(1) (or even LL(0) in this case?) is quite sufficient. C (which I am parsing) is not LL(k) for any k, and that is where LALR (as in Yapp) (or SLR?) is useful. It might be interesting to write a parser generator for LL(k) grammars, which would be at liberty to produce much faster code than Yapp since the place Yapp is slow is where it's jumping up and down on the parse stack all the time, and an LL parser does not have to do this. I will be thinking about and working a lot more on this once my current dissertation is done. In the meantime, nothing in the above mail is guaranteed correct, free from unbiased opinion, or in conformance with UK Data Protection or US Anti-Terrorism acts. S. -- Shevekhttp://www.anarres.org/ I am the Borg. http://www.gothnicity.org/
Re: [RFC] arbitary maths evaluation
Shevek wrote: On Fri, 15 Aug 2003, Andy Wardley wrote: Shevek wrote: Yapp is a brilliant piece of code which I love both in architecture and implementation, but it's desperately fucking slow. Slow at compiling the grammar or when running the parser that it builds? Very slow at running. I don't really care about compile time. Kind of tangentially I've just used P::RD to create an IDL parser and it runs terribly slowly. What would you guys recommend for Perl? Is YAPP quicker? Pure perl gets more points but a bastard XS module would work too. Ideally I want something that'll run out of the box on win and *nix N
Re: [RFC] arbitary maths evaluation
On Fri, 2003-08-15 at 20:00, Werm wrote: > Shevek wrote: > > On Fri, 15 Aug 2003, Andy Wardley wrote: > >>Shevek wrote: > >> > >>>Yapp is a brilliant piece of code which I love both in architecture and > >>>implementation, but it's desperately fucking slow. > >> > >>Slow at compiling the grammar or when running the parser that it builds? > > > > > > Very slow at running. I don't really care about compile time. > > Kind of tangentially I've just used P::RD to create an IDL parser and it > runs terribly slowly. > > What would you guys recommend for Perl? Is YAPP quicker? For Convert::ASN1 I used byacc-perl with a script to "tweak" its output. The result was faster than any other method I tried to generate a parser instead of writing it directly Graham.
Re: [RFC] arbitary maths evaluation
On Fri, 15 Aug 2003, Werm wrote: > Shevek wrote: > > On Fri, 15 Aug 2003, Andy Wardley wrote: > >>Shevek wrote: > >> > >>>Yapp is a brilliant piece of code which I love both in architecture and > >>>implementation, but it's desperately fucking slow. > >> > >>Slow at compiling the grammar or when running the parser that it builds? > > > > > > Very slow at running. I don't really care about compile time. > > Kind of tangentially I've just used P::RD to create an IDL parser and it > runs terribly slowly. That should not be slow. Or, certainly, a good Perl parser for any LL grammar should not have any major overhead. I'm not familiar with P::RD because I don't tend to use LL. > What would you guys recommend for Perl? Is YAPP quicker? I doubt it. Unless you're stretching P::RD beyond its capabilities, and thus causing some slowdown. > Pure perl gets more points but a bastard XS module would work too. I use bison/flex, as previously mentioned. However, my current release on CPAN has a bug in it (produced, ironically enough, by following the perlxs documentation). But I really think that for an LL grammar, you should be able to perform fast in pure Perl. > Ideally I want something that'll run out of the box on win and *nix "That really isn't my department. I've never used windows." S. -- Shevekhttp://www.anarres.org/ I am the Borg. http://www.gothnicity.org/
Re: [RFC] arbitary maths evaluation
On Fri, Aug 15, 2003 at 08:15:34PM +0100, Shevek wrote: > I use bison/flex, as previously mentioned. However, my current release on > CPAN has a bug in it (produced, ironically enough, by following the perlxs > documentation). But I really think that for an LL grammar, you should be Could you bug report the doc bug please, if you've not done so already. (this goes for all bugs. I confess I know of two I've not reported. My excuse is that as soon as I report them I'll get assigned to fix them. Lame, particularly as I hope that I can pass them off to crab) Thanks, Nicholas Clark
ideal pub?
My cow-worker (soon to be my boss) told me of this strange dream he had last night. Partly it's strange because he's not a perl monger (and in fact, doesn't even like perl). Anyway, he dreamt that he was in a group of London Perl mongers arguing about which pub to meet up in. After some considerable debate, a degree of consensus was eventually reached. And the name of the chosen pub? "The recruitment consultant's head" I laughed, because to me this conjures up an image of a pub sign showing an image of said object proudly sitting atop a large spike. We can only dream... Nicholas Clark
Re: [RFC] arbitary maths evaluation
Simon Wistow wrote: > For various reasons I needed to write something that would evaluate an > arbitary math's expression safely (i.e not just run it through eval ""). > > Now, is this worth packaing into a module? I didn't see anything on CPAN > like it and it's possibly quite useful for other people - there seems to > be precedence with Math::BooleanEval and, sort of orthogonally, > Math::Expr You might like to check these two out: http://search.cpan.org/dist/Math-Expression http://search.cpan.org/dist/Safe I haven't used either but remember them being mentioned in a recent Perl Monks thread. /-\ http://search.yahoo.com.au - Yahoo! Search - Looking for more? Try the new Yahoo! Search