En réponse à Dave Hoover [EMAIL PROTECTED]:
And on a semi-related topic, so far the web interface uses
a golfer's email addie as way to confirm his/her identity. But
since a lot of us are on fwp and see each other addie, isn't
that a risk? I mean, if Andrew hadn't been dozens of
On Tue, Mar 12, 2002 at 09:58:19PM -0600, Dave Hoover wrote:
Well, obviously, being able to get the score of the golfer would
be kind of fun. :)
OK.
And having the score of previous golf courses would be neat too.
And, and that would be Neat witha capital, underlined N, is to
Philippe 'BooK' Bruhat wrote:
Yes, but they could mess up the Post-Mortem.
Post-Mortems are a community resource. If the community wants to
litter them with garbage, that's the community's choice.
I'd say PGAS needs a semi-elaborate way to confirm one identity, for
example with a
Yanick wrote:
And having the score of previous golf courses would be neat too.
And, and that would be Neat witha capital, underlined N, is to
get the submitted scripts too.
This is in the works.
Oh, and maybe a fake golfer with the name 'winner' that
would alias to the winner of
Philippe 'BooK' Bruhat wrote:
Post-Mortems are a community resource. If the community wants to
litter them with garbage, that's the community's choice.
Anybody can post, not just the community.
Good point, but this would be true with or without passwords.
I'd say PGAS needs a
-- Ted Zlatanov [EMAIL PROTECTED] on 03/14/02 10:38:29 -0500
I remember a lengthy LCS discussion, and the solutions for the most
part used the regex engine. I also looked on CPAN, but couldn't find
a canonical LCS module.
Has anyone developed an implementation of the well-known
On Wed, 13 Mar 2002, Dave Hoover wrote:
Philippe 'BooK' Bruhat wrote:
We are not talking e-commerce security here. If your password get
stolen
or sniffed or whatever, it's not a big problem.
Sure it is. What's the point of having passwords if it's not a big
deal if they get stolen?
On Thu, Mar 14, 2002 at 10:38:29AM -0500, Ted Zlatanov wrote:
I remember a lengthy LCS discussion, and the solutions for the most
part used the regex engine. I also looked on CPAN, but couldn't find
a canonical LCS module.
Has anyone developed an implementation of the well-known bitstring
This is very much not my area, so I don't know if this is a good or bad
recommendation, but here goes anyway... :-)
Algorithm::Diff has an LCS function. It's not very fast, but it has
worked well for my purposes in the past.
Chris
Ted Zlatanov wrote:
I remember a lengthy LCS discussion,
On Thu, 14 Mar 2002 10:38:29 -0500, Ted Zlatanov wrote:
Has anyone developed an implementation of the well-known bitstring
algorithm? Basically you convert your data strings to bitstrings, AND
the two, and look for the longest match.
Maybe it's just me, but that doesn't feel right. If you AND
Stephen Turner wrote:
I think you're being too clever, Dave. Even plain text passwords would
prevent the I wonder what happens if I click on someone else's
name type
of misattribution, which is probably the most likely sort.
Wow, I've never been accused of being *too* clever! :-)
You make
[EMAIL PROTECTED] (Bart Lateur) writes:
On Thu, 14 Mar 2002 10:38:29 -0500, Ted Zlatanov wrote:
Has anyone developed an implementation of the well-known bitstring
algorithm? Basically you convert your data strings to bitstrings, AND
the two, and look for the longest match.
Maybe it's just
On Thu, 14 Mar 2002, Ted Zlatanov wrote:
[EMAIL PROTECTED] (Bart Lateur) writes:
On Thu, 14 Mar 2002 10:38:29 -0500, Ted Zlatanov wrote:
Has anyone developed an implementation of the well-known bitstring
algorithm? Basically you convert your data strings to bitstrings, AND
the two,
[EMAIL PROTECTED] (Stephen Turner) writes:
This is essentially what my solution at
http:[EMAIL PROTECTED]/msg01662.html
did.
Ah, I missed that. Thanks.
Ted
golf anyone ? :)
arbitrary cut : 1 big #!.../perl, 2 perl lines
#!s/.xbegin//gszs/perl.x//zs/./chruorduyBw-AAw/gezs/.../chryB/geze
val/beginhgihkgkggjmgplgmhhhihiglphhihhkhglhhghhmgkggjkgjm
gplgpihhggjkgkhgkkhhlgkngkggkmgkhgkngjmgkpgjmgkpgknhgjgmigkpglphhl
Yanick and co.,
PGAS XML-RPC methods now include:
* getGolferId
* getScore
* getSolutionsByGolfer
* getAllCourses
* getAllGolfers
* getWinner
The API can be found here:
http://sourceforge.net/docman/index.php?group_id=46501
Let me know if anyone has ideas for other methods.
Enjoy,
--Dave
In article [EMAIL PROTECTED],
Dave Hoover [EMAIL PROTECTED] writes:
Stephen Turner wrote:
I think you're being too clever, Dave. Even plain text passwords would
prevent the I wonder what happens if I click on someone else's
name type
of misattribution, which is probably the most
En op 14 maart 2002 sprak `/anick:
A first tentative to see what kind of stuff can be done
with that can be found at
http://babyl.dyndns.org/golf/golfers.epl
Cool.
En op 14 maart 2002 sprak `/anick:
My next step is to try to create mock-baseball cards
with scores and
Yanick wrote:
A first tentative to see what kind of stuff can be done
with that can be found at
http://babyl.dyndns.org/golf/golfers.epl
Awesome. There are so many possibilities when the data is freely available!
My next step is to try to create mock-baseball cards
with
My next step is to try to create mock-baseball
cards with scores and everything. Shouldn't be
too hard to do...
I think we should allocate earnings for each
tournament, so we can have a money-winner's list
and an end-of-season money winner's prize, just
like the real PGA tour. Your
20 matches
Mail list logo
