[#48779] Ruby jobs — Phlip <phlip_cpp@...>
Rubies:
Tom Sawyer <transami@transami.net> writes:
On Sun, 2002-09-01 at 08:18, Phlip wrote:
[#48820] Time to retire st_* and replace it with Judy? — doug@... (Doug Baskins)
After a posting I did yesterday, I decided to take a closer look
[#48825] another german book is coming.. — Markus Jais <mjais@...>
hello
[#48852] ruby-dev summary 18070-18110 — TAKAHASHI Masayoshi <maki@...>
Hi all,
[#48856] Idea: Ruby Object Persistence Service — Gabriel Emerson <gemerson@...>
I was just thinking last night of working on a TCP/IP server which would
[#48886] cgi redirect — Tom Robinson <tom@...>
in perl, this is easy:
In Ruby, you can always add the method you want to CGI dynamically:
[#48890] Ruby Segfault: Marshaling large objects — Tom Payne <twp20@...>
Hi All --
[#48892] OT: Just browsing... — Albert Wagner <alwagner@...>
This is really just Sort-of_Off_Topic. I am currently in a state of
[#48905] Class variables and inheritance — Philipp Meier <meier@...>
Hallo rubyers,
[#48917] New list: ruby-modules - for module developers... — Sean Chittenden <sean@...>
Howdy folks. I've put together a new list for ruby developers at
>
[#48978] option remember —
Hi,
Dave Thomas <Dave@PragmaticProgrammer.com> wrote in message news:<m2u1l69bl6.fsf@zip.local.thomases.com>...
[#49011] Is It Possible to Create Block from within C? — William Djaja Tjokroaminata <billtj@...>
Hi,
[#49018] Ruby, Java, et. al. — Michael Campbell <michael_s_campbell@...>
> Ruby won't get a chance to compete with Java... because java will
[#49039] rpkg questions — patrick-may@... (Patrick May)
first of all, rpkg == mana from heaven!!!
[#49042] Options for optimizing a large Ruby system — sera@... (Francis Hwang)
Hi everybody:
sera@fhwang.net (Francis Hwang) writes:
[#49045] Breaking from 'case' — Wejn <lists+rubytalk@...>
Hi,
[#49107] RE: suggestions to the Ruby community — "Berger, Daniel" <djberge@...>
I've been following the documentation discussion with some interest. Some
-----BEGIN PGP SIGNED MESSAGE-----
"Gavin Sinclair" <gsinclair@soyabean.com.au> writes:
[#49118] Stibbsian — "john%johnknight.com@..." <john%johnknight.com@...>
[#49200] Re: Ruby 10'th most popular ICFP contest language — "David Douthitt" <DDouthitt@...>
This is interesting! If you take this as a rough grade of popularity and u=
[#49205] Sort Question — "Firestone, Mark - Technical Support" <mark.firestone@...>
I don't understand something (so what else is new) again... lets say I have
[#49235] How to have a conversation with popen — Phlip <phlip_cpp@...>
Rubies:
[#49279] cgi.rb replacing "0x0a" symbols with "0x0d 0x0a" ? — RayZ <rayz@...>
Hi!
[#49286] segault of interpeter —
Hi,
[#49294] OS-independent build of ruby — "reckless" <reckless2k@...>
Hi,
Woah, you want an executable - binary format - that is OS independent?
In article <alali7$cth$01$1@news.t-online.com>,
JRuby exists ...
Austin Ziegler wrote:
On Sun, 8 Sep 2002 11:52:15 +0900, Christian Szegedy wrote:
Austin Ziegler wrote:
Anders Bengtsson <ndrsbngtssn@yahoo.se> writes:
Hi,
On Sun, 08 Sep 2002 02:36:35 +0000, Austin Ziegler wrote:
On Mon, 9 Sep 2002 01:49:16 +0900, Jan Arne Petersen wrote:
[#49297] Larry Wall's comments on Ruby — ptkwt@...1.aracnet.com (Phil Tomson)
http://interviews.slashdot.org/article.pl?sid=02/09/06/1343222&mode=thread&tid=145
[#49301] Re: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
Andrew Hunt wrote:
Patrick May (patrick-may@monmouth.com) wrote:
On Sat, 7 Sep 2002 14:21:22 +0900, Reimer Behrends wrote:
----- Original Message -----
On Sun, 8 Sep 2002 12:50:25 +0900, Hal E. Fulton wrote:
Matt Gushee wrote:
[#49322] Re: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
Kent Starr says:
[#49323] Re: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
Denys Usynin observes:
[#49325] Re: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
Denys Usynin goes on to say:
[#49327] RE: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
Drew Mills points out:
> But this is all beside the point -- Larry's off the mark
On Sat, Sep 07, 2002 at 05:09:37AM +0900, Michael Campbell wrote:
> On Sat, Sep 07, 2002 at 05:09:37AM +0900, Michael Campbell wrote:
In article <NFBBKBEMGLGCIPPFGHOLKELGCKAA.michael_s_campbell@yahoo.com>,
[#49328] Re: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
Bill glows:
[#49333] Re: Larry Wall's comments on Ruby — Andrew Hunt <andy@...>
>yeah and as I said, depending on your background , Ruby is just as full
Andrew Hunt (andy@toolshed.com) wrote:
[#49367] SciTE/VIM Syntax highlighting — "Jim Bartlett" <jimbart@...>
I am learning Ruby via "Programming Ruby: A Pragmatic Programmer's Guide".
[#49434] Regular expression question — "Rich Kilmer" <rich@...>
As I don't have my copy of Mastering Regular Expressions at home, and
[#49469] 1.7.3 net library crud — Tom Sawyer <transami@...>
after insurmountable problems with Ruby 1.7.3's TCP classes, i decided
[#49519] Equivalent of pascal's keypressed ? — Philip Mateescu <pmateescu@...>
Hi,
[#49543] getting the IP address of the local machine — Tom Sawyer <transami@...>
does anyone know how to get the IP address of the machine a ruby script
[#49551] HOWTO create Ruby bindings for a library — Giuseppe Bilotta <bilotta78@...>
Hello,
[#49555] Ruby-gtk, Gtk::Text question — Jacek Podkanski <jacekpodkanski@...>
Hi,
[#49556] ruby-dev summary 18111-18212 — Takaaki Tateishi <ttate@...>
Hello,
On Mon, Sep 09, 2002 at 09:05:49PM +0900, Takaaki Tateishi wrote:
Hi,
On Tue, Sep 10, 2002 at 09:17:39AM +0900, Yukihiro Matsumoto wrote:
Hi,
On Wed, Sep 11, 2002 at 12:22:58AM +0900, Yukihiro Matsumoto wrote:
[#49562] Reading in Hex numbers. — khabibiuf@... (Khurram)
Hi all,
[#49573] Multiple .rb versions support — "Chris Morris" <chrismo@...>
The following is just some thoughts I've had for setting up a structure
[#49586] scopes — "Kontra, Gergely" <kgergely@...>
Hi!
[#49618] RubyConf 2002 — "Hal E. Fulton" <hal9000@...>
I can't resist the urge to hype this a little.
"Hal E. Fulton" <hal9000@hypermetrics.com> writes:
> Hmm...perhaps next year it should be on the East coast? :)
" JamesBritt" <james@jamesbritt.com> writes:
[#49627] Re: Larry Wall's comments on Ruby — "Marcin 'Qrczak' Kowalczyk" <qrczak@...>
Mon, 9 Sep 2002 14:26:37 +0900, Wirianto Djunaidi <ryo_saeba_009@yahoo.com> pisze:
Hi,
"Yukihiro Matsumoto" wrote
>
----- Original Message -----
----- Original Message -----
"Yukihiro Matsumoto" wrote in
Christoph wrote:
At 10:48 PM +0900 9/11/02, Gavin Sinclair wrote:
Hi,
[#49700] Refactoring Ruby — Steve Tuckner <STUCKNER@...>
Hi all,
[#49707] Re: Larry Wall's comments on Ruby — David.Stagner@...
I think Gavin is right... we don't "add" strings, we concatenate them.
Agreed. Until now, I still mistakenly use the "." operator from time to
[#49715] Bug in Ruby Ext to C or it is me ? — weilljc@... (JCW)
Compile this, link it with ruby lib, execute with a small
[#49758] Multi-level sort idiom? — Brett Williams <brett_williams@...>
Let's say I have an array, each element of which is a 2-dimensional array
[#49762] Is there a "get" function for words and dwords? — khabibiuf@... (Khurram)
Hi all,
[#49766] RubyInline 1.0.4 Released! (fwd) — Pat Eyler <pate@...>
Woohoo! another cool new toy to play with!
Hi,
Hi,
>
I'm having a few problems running RubyInline on a Sun:
[#49768] UDPSocket bug? — Danny van Bruggen <danny@...>
Hello all,
On Wed, Sep 11, 2002 at 04:04:50AM +0900, Danny van Bruggen wrote:
On Wed, Sep 11, 2002 at 05:37:40AM +0900, Paul Brannan wrote:
[#49787] call for commentary: review of Ruby for a magazine (long, sorry!) — Rick Wayne <fewayne@...>
hello again folks,
Rick Wayne <fewayne@facstaff.wisc.edu> wrote:
On Wed, Sep 25, 2002 at 04:41:29AM +0900, William Djaja Tjokroaminata wrote:
Aha, someone caught my post. Yes, I love Ruby very much, but I should
William Djaja Tjokroaminata <billtj@z.glue.umd.edu> writes:
[#49809] Re: RubyInline 1.0.4 Released! (fwd) — Ryan Davis <ryand@...>
On 2002-09-10T17:15:25, Pat Eyler wrote:
[#49812] Re: RubyInline 1.0.4 Released! (fwd) — Ryan Davis <ryand@...>
On 2002-09-10T17:52:14, Pat Eyler wrote:
[#49830] marshalling objects to the fox registry — Joel VanderWerf <vjoel@...>
[#49849] private variables — ts <decoux@...>
"ts" wrote in
Wait, wait, wait... I think someone should really have defined what
Well, will these localized/private variables make it into the next Ruby
Hi --
>>>>> "d" == dblack <dblack@candle.superlink.net> writes:
[#49873] using REXML for XML document creation — Ian Macdonald <ian@...>
Hi,
On Thu, Sep 12, 2002 at 12:59:42AM +0900, Ian Macdonald wrote:
On Thu 12 Sep 2002 at 01:45:01 +0900, Matt Gushee wrote:
[#49874] RE: Full Screen Editor — "Firestone, Mark - Technical Support" <mark.firestone@...>
Ah, but I want to connect this to the Ruby BBS program that I wrote, so that
[#49886] Proxy Server — Alan Chen <alan@...>
I've been playing around with a project that's a proxy and cache
[#49931] Missing includes with 1.6 install on win32? — "Paul E.C. Melis" <paul@...>
Hi,
[#49978] Upper/lowercase shared lib name problem. — Farrel Lifson <flifson@...>
Hi all,
[#49988] not grasping the method overloading/multi-dispatch thing — dblack@...
Hello --
dblack@candle.superlink.net writes:
Hi --
----- Original Message -----
In article <3D80AD8D.27388.FBF0F18@localhost>,
On Thursday 12 September 2002 01:40 pm, Phil Tomson wrote:
About a year ago there was a thread on method overloading based on
On Fri, Sep 13, 2002 at 05:41:20AM +0900, Rich Kilmer wrote:
In article <20020912151951.T25425@atdesk.com>,
In Phil's example, it seems like "meth" is testing the argument's
On Thursday 12 September 2002 03:40 pm, Tim.Hunter@sas.com wrote:
[#50027] interesting Perl Journal move — Pat Eyler <pate@...>
The Perl Journal is being reborn yet again. This time, it will be an
On Fri, Sep 13, 2002 at 01:44:18AM +0900, Pat Eyler wrote:
On Thu, 2002-09-12 at 13:14, Jim Freeze wrote:
> agreed! unless perl journal is willing to alter it name to Script
Jim Freeze <jim@freeze.org> writes:
[#50033] General ?s about a couple of Ruby features — Matt Gushee <mgushee@...>
Hi, Folks--
[#50105] Disabling exceptions - thoughts? — Daniel Berger <djberge@...>
Hi all,
[#50120] Re: not grasping the method overloading/multi-dispatch thing — patrick-may@... (Patrick May)
Dale Martenson <dmartenson@multitech.com> wrote in message news:<20C86D2620F6D411A199009005DC0102016D1830@exchange serve.multitech.prv>...
Philipp Meier <meier@meisterbohne.de> wrote in message news:<20020913101910.GC17997@o-matic.net>...
[#50143] Why can't ruby be used from a (native) thread other than the main one? — Lorien Dunn <loriend@...>
Hello,
[#50172] DbTalk 0.7 — Dalibor Sramek <dali@...>
I would like to announce a new release of my Ruby project DbTalk.
[#50180] float precision — Daniel Bretoi <lists@...>
Sorry if this has been answered before.
[#50199] Dump each method called to stdout? — "Chris Morris" <chrismo@...>
I've got a script that loops through a bunch of stuff and somewhere in the
[#50224] MVC and OO Design? — jcb@... (MetalOne)
The Model View Controller Architecture has always had me a bit
[#50254] Time#+ and usec — mike.pub@... (Michael Witrant)
Hello,
[#50255] Bug in RubyInline 1.0.5 — "Shashank Date" <ADATE@...>
The following code fragment does not compile, using ruby 1.7.2 (2002-07-02)
[#50257] Getting Python and Ruby to Talk to Each Other — shunting@... (Sam Hunting)
A clueless Ruby newbie seeks help...
In article <7c40e468.0209141347.4d338e56@posting.google.com>,
[#50285] Ruby bcc32 on win32 — "Shashank Date" <ADATE@...>
I am trying to compile ruby 1.7.3 using borland's bcc32 on win32.
[#50288] ruby HTTP redirect? — 1lluminate <1lluminate@...>
Hi,
[#50295] RubyConf registration open for two more weeks — dblack@...
Hi --
[#50296] Requiring multiple libraries — Bruce Williams <bruce@...>
Is there a stylistic and/or technical reason that the ability to require
[#50298] camelCaseTo_ruby_case.rb ?? — Thomas Sdergaard <tsondergaard@...>
Hi,
Hello --
In article <20020916033549.GD8112@panoptic.com>,
On 2002.09.16, Phil Tomson <ptkwt@shell1.aracnet.com> wrote:
[#50311] Syntax errors with webrick 1.2. head of cvs with Div — "Booth, Peter" <Peter.Booth@...>
I downloaded and installed drb,erb,div,webrick
[#50369] Why are parser tools rarely used in ruby? — "MikkelFJ" <mikkelfj-anti-spam@...>
Why is it that all the ruby source I find in the Ruby (windows) distribution
On Tue, Sep 17, 2002 at 12:31:15AM +0900, MikkelFJ wrote:
In article <3d87a236$0$64151$edfadb0f@dspool01.news.tele.dk>,
[#50374] Dependency "trees" - suggestions? — Massimiliano Mirra <list@...>
I'm struggling with building dependency "trees" for rpkg. What
On Tue, Sep 17, 2002 at 12:52:49AM +0900, Massimiliano Mirra wrote:
On Tue, Sep 17, 2002 at 01:37:33AM +0900, Paul Brannan wrote:
[#50390] Is Ruby Array#shift/unshift Efficient? — William Djaja Tjokroaminata <billtj@...>
Hi,
[#50403] comments and continuing strings on the next line — Paul Brannan <pbrannan@...>
I have a tendency to write:
Hi,
On Tue, Sep 17, 2002 at 10:33:35PM +0900, William Djaja Tjokroaminata wrote:
[#50407] back tick equivalent — "CHENG, WEI CHI (LNG)" <WEICHI.CHENG@...>
Just install ruby last Friday and tried to find the back tick equivalent as
[#50449] RE: ruby HTTP redirect? — "SHULTZ,BARRY (HP-Israel,ex1)" <barry_shultz@...>
Hi,
[#50451] Java vs. Perl vs. ... — " JamesBritt" <james@...>
The "Use Perl" website (use.perl.org) has a small entry commenting on a Java
[#50466] Qt vs. FOX vs. ? (was Help on installing ruby-qt on windowsXP) — "Volkmann, Mark" <Mark.Volkmann@...>
> -----Original Message-----
[#50515] Are there any O'Reilly Ruby books on the horizon? — gmnotyet@... (J Hall)
Dear Ruby Users,
[#50525] Matz, if you're reading, please scan this email — ser@... (Sean Russell)
I've found a problem with the Ruby interpreter, wherein the
> I've found a problem with the Ruby interpreter, wherein the
>>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
> S> In the unit tests for libxml, I think I've pushed things to SEGV land
>>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
> >>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
>>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
> S> :-/ You could be right, but, the IO context is created when reading
>>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
> S> Good catch, I fixed this in the CVS version, however this is a
>>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
[ I've had this email open for two day strait now, I should probably
>>>>> "S" == Sean Chittenden <sean@chittenden.org> writes:
[#50532] Code coverage in Ruby? — "Hal E. Fulton" <hal9000@...>
Has anybody worked on a method for determining
[#50561] Picking arbitrary elements from an array — "James F.Hranicky" <jfh@...>
Anyone like the idea of being able to pick arbitrary elements from
>>>>> "J" == James F Hranicky <jfh@cise.ufl.edu> writes:
On Wed, 18 Sep 2002 23:04:02 +0900
[#50579] How to Efficiently Calculate the Pattern of Zeros and Ones? — William Djaja Tjokroaminata <billtj@...>
Hi,
[#50580] How best to use exceptions? — Robert McGovern <tarasis@...>
Hi, I am currently writting a module for reading id3 v1, v1.1 & v2.x
[#50600] self-loading scripts (at Ruby's startup time) — Overnight <NOSPAM_jazz_x@..._NOSPAM>
Do they exist? I'm afraid they don't, or at least I couldnt' find any
[#50602] Semi-OT: Web issues — "Hal E. Fulton" <hal9000@...>
There's a disturbing absence of Ruby code
----- Original Message -----
[#50606] Python the new Lisp, what about Ruby then? — web2ed@... (Edward Wilson)
I've been reading that Python is the new lisp.
come on! python the new lisp? what's that suppose to mean? nothing
> ruby though just may gain as great a heritage as lisp due to its highly
[#50636] RubyInline 1.0.6 Released — Ryan Davis <ryand@...>
RubyInline 1.0.6 has been released!
[#50640] Business Objects — "Matthew, Graeme" <Graeme.Matthew@...>
I have been searching the www for some examples on how programmers have
[#50652] Is better to subclass or to add methods to an existing class? — Vincent Foley <vinfoley@...>
I was discussing with a (Python) friend last night. I told him that one
[#50667] select and select — dblack@...
Hello --
Is there a general concensus as to the best tool/format for documenting Ruby
At Sat, 21 Sep 2002 22:15:09 +0900,
GOTO Kentaro <gotoken@notwork.org> writes:
At Mon, 23 Sep 2002 13:13:56 +0900,
Hi,
At Mon, 23 Sep 2002 16:17:58 +0900,
GOTO Kentaro <gotoken@notwork.org> writes:
Hi,
Hi --
Tom Sawyer wrote:
Yukihiro Matsumoto wrote:
Hi,
Hi --
I really like the feel of 'pick' with arrays.
Hi --
Hi --
[#50683] visual ruby — "Kontra, Gergely" <kgergely@...>
I just want to find the Visual Ruby project, and find this page:
[#50685] subclassing Integer — John Tromp <tromp@...>
I'm writing a state space search program where each state can be consisely
[#50729] ruby/tcltk reentrancy bug — Jakub Travnik <j.travnik@...>
Hello,
[#50732] don't understand cause of `sysread': Bad file descriptor (Errno::EBADF) — Robert McGovern <tarasis@...>
Was writting a script to poll an audiotron (www.audiotron.net) and
[#50762] Thoughts on improving usage of Regexp#match — "Hal E. Fulton" <hal9000@...>
Please feel free to point out obvious things
[#50780] loving the look of Ruby code — dblack@...
Hi --
[#50820] wxWindows for Ruby Again — "Park Heesob" <phasis@...>
[#50825] RFC: Need a better caller(n) - real reflection for call stack wanted — Ryan Davis <ryand@...>
RubyInline has the following extension to Object:
[#50838] Questions regarding: Mnemonic and Object Prevalence — Oliver Beddows <oliver-b@...>
Hello,
I have tried Mnemonic a couple of months ago. It seems very promising,
Erik Terpstra <erik@solidcode.net> writes:
[#50848] Extconf problem. — Christian Szegedy <szegedy@...>
I have a minor problem with mkmf (ruby 1.6.7) and gmake.
[#50850] Checking hash key's and values, with case insensitivity — khabibiuf@... (Khurram)
Hey all,
On 2002.09.20, Khurram <khabibiuf@hotmail.com> wrote:
----- Original Message -----
[#50857] Regexp question (newbie) — Johann Spies <jspies@...>
After playing a little bit with Ruby 3 years ago, I am trying to learn
[#50867] Speed up suggestions — Tomas Brixi <tomas_brixi@...>
Hello,
[#50878] String interpolation at will? — "Hal E. Fulton" <hal9000@...>
Maybe I'm overlooking something obvious,
Maybe this is too dangerous but
[#50925] Inverse of id2name? — Philip Mak <mfraser@...>
If I have a variable set to :test, I can convert that to "test" by calling
[#50931] self as method argument revisited — dblack@...
Hello --
[#50934] The problem with run-time type checking — Philip Mak <mfraser@...>
One problem that I find crops up in Ruby, but doesn't really happen in
[#50936] Avoiding busy waiting — Harry Ohlsen <harryo@...>
I have a situation where I'd like to set up a queue that's filled by one
[#50937] caller lies, or Method#id is wrong, or both — Ryan Davis <ryand-ruby@...>
So, caller lies. I suspect this is true no matter what. It may also be
[#50948] Re: The problem with run-time type checking — Philip Mak <mfraser@...>
Dossy wrote:
[#50953] Getting a directory tree — "Hal E. Fulton" <hal9000@...>
Hi, all...
[#50958] are functions/methods "first class objects"? — David Garamond <davegaramond@...>
sorry this is a bit philosophical, but i just wonder whether ruby can be
Christoph wrote:
Hello Christian,
[#50962] RE: [ANN] RubyInline 1.0.7 Released — "Pe, Botp" <botp@...>
Hi sir Ryan,
[#50972] Re: Speed up suggestions — Tomas Brixi <tomas_brixi@...>
Thanks all for speedup tips.
In my experience, Python is faster than Ruby. I made a small script to
On Mon, Sep 23, 2002 at 11:44:30PM +0900, Vincent Foley wrote:
[#51017] embedding ruby inside an application? — Basile STARYNKEVITCH <basile+NO@...+starynkevitch.net.invalid>
Is it easy to embed ruby inside an application?
[#51027] File.lib bug? — Overnight <NOSPAM_jazz_x@..._NOSPAM>
Hello!
[#51046] Regexp: How to Find Legitimate Tokens? — William Djaja Tjokroaminata <billtj@...>
Hi,
At 11:44 PM 9/23/2002 +0900, Bill wrote:
[#51056] another easy one... — Mark Probert <probertm@...>
On Tue, Sep 24, 2002 at 01:09:45AM +0900, Mark Probert wrote:
[#51090] Using Ruby with other languages — Tapio Kelloniemi <spam07@...>
Hi all
[#51156] adding overload to ruby — "Bulat Ziganshin" <bulatz@...>
Hello all and especially Matz,
Hello Justin,
>>>>> "B" == Bulat Ziganshin <bulatz@integ.ru> writes:
Hello Justin,
>>>>> "B" == Bulat Ziganshin <bulatz@integ.ru> writes:
Hello ts,
>>>>> "B" == Bulat Ziganshin <bulatz@integ.ru> writes:
Hello ts,
Hi --
Hello dblack,
Hi --
Hi All,
Hi Dave,
Hello Justin,
Hello Nikodemus,
Hi,
Hi,
Hi --
Oh yes, in fact, this is one of our selling points, right? We show the
Hi --
Hello William,
Hi,
Hello Yukihiro,
Hi,
Hello Yukihiro,
On Mon, Sep 30, 2002 at 10:02:36PM +0900, Bulat Ziganshin wrote:
Hello Mauricio,
On Tue, Oct 01, 2002 at 01:34:22PM +0900, Bulat Ziganshin wrote:
Hello Mauricio,
On Thu, Oct 03, 2002 at 02:00:24PM +0900, Bulat Ziganshin wrote:
Hello Mauricio,
>>>>> "B" == Bulat Ziganshin <bulatz@integ.ru> writes:
Hello ts,
>>>>> "B" == Bulat Ziganshin <bulatz@integ.ru> writes:
Did you have a look at http://merd.net :
----- Original Message -----
Hello Christian,
"Bulat Ziganshin" <bulatz@integ.ru> writes:
William Djaja Tjokroaminata wrote:
Hello --
----- Original Message -----
-----BEGIN PGP SIGNED MESSAGE-----
Hello bbense+comp,
Hi,
Hello Yukihiro,
Why not designing a new language with a mix of typed variable and untyped
Well, I would like the idea of optional typing in one instance...to
Hi, great, I have someone with the same interest. My idea is simple:
-----BEGIN PGP SIGNED MESSAGE-----
On Fri, Sep 27, 2002 at 05:16:38AM +0900, bbense+comp.lang.ruby.Sep.26.02@telemark.stanford.edu wrote:
Hello bbense+comp,
On Fri, Sep 27, 2002 at 03:04:56PM +0900, Bulat Ziganshin wrote:
-----BEGIN PGP SIGNED MESSAGE-----
Hi,
[#51175] My script showing Python speed vs. Ruby (long, includes code) — bobx@... (Bob)
OS = Windows XP
[#51183] Why "and and or" Have Different Association from "&& and ||"? — William Djaja Tjokroaminata <billtj@...>
Hi,
[#51185] Object-Oriented struct Model in C — William Djaja Tjokroaminata <billtj@...>
Hi,
Hi,
On Wed, Sep 25, 2002 at 01:01:13AM +0900, William Djaja Tjokroaminata wrote:
Hi Paul,
[#51315] http/net — Manfred Hansen <manfred@...>
Hi,
>>>>> "M" == Manfred Hansen <manfred@toppoint.de> writes:
On Thu, Sep 26, 2002 at 01:05:53AM +0900, ts wrote:
On Thu, Sep 26, 2002 at 03:20:19AM +0900, Jim Freeze wrote:
At Thu, 26 Sep 2002 04:10:34 +0900,
[#51322] Is There a Formal List on What "Surprises" in Ruby? — William Djaja Tjokroaminata <billtj@...>
Hi,
[#51349] getting all classes within a module ?? — Markus Jais <info@...>
hello
[#51389] Is Ruby's grammar LL(k)? — Mauricio =?unknown-8bit?Q?Fern=E1ndez?= <batsman.geo@...>
Hi,
[#51407] Short Presentation on Ruby — Jon Dowland <jon@...>
Dear All,
[#51421] object attributes list — ajksharma@... (ajksharma)
HI,
[#51444] Ruby/Tk or mod_ruby or what ?? — GBanschbach@...
Dear All,
>>>>> "William" == William Djaja Tjokroaminata <billtj@z.glue.umd.edu> writes:
[#51459] Ruby program design question ( Pattern or AntiPattern ?) — <bbense+comp.lang.ruby.Sep.26.02@...>
-----BEGIN PGP SIGNED MESSAGE-----
[#51486] Ruby - common pitfalls? — Rudolf Polzer <AntiATField_adsgohere@...>
Is there a list of common pitfalls beginners in this language should
Scripsit ille William Djaja Tjokroaminata <billtj@y.glue.umd.edu>:
[#51495] hash missing value — "MikkelFJ" <mikkelfj-anti-spam@...>
Wouldn't it be useful with a missing value in hash tables so you avoid the
[#51504] Bye all — "Matthew, Graeme" <Graeme.Matthew@...>
[#51528] String gsub last '/\\%[0-8a-fA-F][0-8a-fA-F]/ match does not sub — "Robert Linder" <robert_linder_2000@...>
Ruby Versions:
[#51530] Where Is Method Call Precedence? — William Djaja Tjokroaminata <billtj@...>
Hi,
Hi,
Hi Bulat,
On Mon, Sep 30, 2002 at 10:36:41PM +0900, William Djaja Tjokroaminata wrote:
Hi Bulat,
[#51586] Design patterns for communication protocols? — coma_killen@...
Hi,
On 9/27/02 6:27 AM, "coma_killen@fastmail.fm" <coma_killen@fastmail.fm>
> Have you considered BEEP? It's an IETF standard for designing application
[#51639] RE: REXML namespace support — "Volkmann, Mark" <Mark.Volkmann@...>
In my case I'm given a string which is a namespace prefix and I want to
On 9/27/02 11:18 AM, "Volkmann, Mark" <Mark.Volkmann@AGEDWARDS.com> wrote:
On Mon, Sep 30, 2002 at 11:08:15PM +0900, Bob Hutchison wrote:
[#51640] method called on terminated object — Ariff Abdullah <skywizard@...>
[#51666] Visual C++ and RUBY — Bernhard Glueck <bernhard@...>
Hi there!
[#51767] python <=> ruby — Christian Szegedy <szegedy@...>
FYI, I found this while googling:
[#51768] Method <=> Proc — Christian Szegedy <szegedy@...>
Hi,
[#51775] alias versus method_missing — Lyle Johnson <lyle@...>
All,
Lyle Johnson wrote:
Joel VanderWerf wrote:
[#51809] thoughts on typelessness — dblack@...
Hi --
Hi David,
Hi,
On Sun, Sep 29, 2002 at 12:09:32PM +0900, dblack@candle.superlink.net wrote:
Gavin Sinclair wrote:
Chris Gehlker wrote:
Hi Dave,
----- Original Message -----
Hi,
William Djaja Tjokroaminata <billtj@y.glue.umd.edu> writes:
Hi Dave,
William Djaja Tjokroaminata <billtj@y.glue.umd.edu> writes:
At Wed, 2 Oct 2002 01:37:46 +0900,
On Wed, Oct 02, 2002 at 02:11:24AM +0900, GOTO Kentaro wrote:
At Wed, 2 Oct 2002 02:31:39 +0900,
On Wed, Oct 02, 2002 at 02:43:22AM +0900, GOTO Kentaro wrote:
At Wed, 2 Oct 2002 03:54:25 +0900,
On Wed, Oct 02, 2002 at 04:25:29AM +0900, GOTO Kentaro wrote:
Hi Matz,
Hi,
Hi Matz,
Hi Alan,
[#51818] announce@ == less email (FAQ item?) — Ryan Davis <ryand-ruby@...>
ZenTest and ZenWeb were just released. I announced these to several
Ryan Davis wrote:
Hi Hal,
Hello William,
> >> I *do* like to keep the discussion of changing Ruby down to less
[#51819] Embedding Ruby in Mac OS X 10.2 — "Rod Schmidt" <rschmidt@...>
It appears that libruby, ruby.h, etc. doesn't come with Jaguar. Anyone have
[#51886] idea for a much needed application — rsrchstr@... (mike henley)
I remember a while ago reading about tim burners-lee and how his
[#51935] idris1000@golfemail.com — "IDRIS" <idrial@...>
Date:September 30,2002.
[#51947] Get to know my external IP adress from Ruby? — coma_killen@...
Hi,
[#51974] Things That Newcomers to Ruby Should Know — William Djaja Tjokroaminata <billtj@...>
Things That Newcomers to Ruby Should Know
Thanks, Gabriele. I will try to incorporate your input. The "0 is
>> - the ||= operator exists :-)
Hi,
Hi --
[#52000] Friedl goes Ruby — "MikkelFJ" <mikkelfj-anti-spam@...>
Judy inside st_*
Attached is my latest development on the new st_* routines based on JudyL arrays. It is now nearly as fast as the standard hashing method, and there shouldn't be many bugs left. I won't be able to work on this for a while as I'm moving to Stuttgart (Germany) tomorrow from Madrid (Spain), and I don't know when I'll get a computer... BTW, I've seen there's a Ruby Users Group in B.-W. :-) -- _ _ | |__ __ _| |_ ___ _ __ ___ __ _ _ __ | '_ \ / _` | __/ __| '_ ` _ \ / _` | '_ \ | |_) | (_| | |_\__ \ | | | | | (_| | | | | |_.__/ \__,_|\__|___/_| |_| |_|\__,_|_| |_| Running Debian GNU/Linux Sid (unstable) batsman dot geo at yahoo dot com Linux: Where Don't We Want To Go Today? -- Submitted by Pancrazio De Mauro, paraphrasing some well-known sales talk
Attachments (1)
diff -rwdu ruby/configure.in ruby-judy/configure.in
--- ruby/configure.in Sun Aug 11 23:43:24 2002
+++ ruby-judy/configure.in Wed Aug 28 12:20:31 2002
@@ -281,6 +281,7 @@
AC_CHECK_LIB(crypt, crypt)
AC_CHECK_LIB(dl, dlopen) # Dynamic linking for SunOS/Solaris and SYSV
AC_CHECK_LIB(dld, shl_load) # Dynamic linking for HP-UX
+AC_CHECK_LIB(Judy, JudyLIns) # Judy
dnl Checks for header files.
AC_HEADER_DIRENT
diff -rwdu ruby/hash.c ruby-judy/hash.c
--- ruby/hash.c Wed Jul 31 00:30:17 2002
+++ ruby-judy/hash.c Fri Aug 30 10:44:30 2002
@@ -125,11 +125,10 @@
{
int status;
st_table *tbl = RHASH(arg->hash)->tbl;
- struct st_table_entry **bins = tbl->bins;
if (key == Qundef) return ST_CONTINUE;
status = (*arg->func)(key, value, arg->arg);
- if (RHASH(arg->hash)->tbl != tbl || RHASH(arg->hash)->tbl->bins != bins){
+ if (RHASH(arg->hash)->tbl != tbl){
rb_raise(rb_eIndexError, "rehash occurred during iteration");
}
return status;
@@ -280,10 +279,12 @@
{
st_table *tbl;
+#ifndef HAVE_LIBJUDY
tbl = st_init_table_with_size(&objhash, RHASH(hash)->tbl->num_entries);
st_foreach(RHASH(hash)->tbl, rb_hash_rehash_i, tbl);
st_free_table(RHASH(hash)->tbl);
RHASH(hash)->tbl = tbl;
+#endif
return hash;
}
@@ -544,9 +545,12 @@
VALUE hash, key, val;
{
rb_hash_modify(hash);
- if (TYPE(key) != T_STRING || st_lookup(RHASH(hash)->tbl, key, 0)) {
+ if ( TYPE(key) != T_STRING ) {
st_insert(RHASH(hash)->tbl, key, val);
}
+ else if ( st_update_if_present(RHASH(hash)->tbl, key, val) ) {
+ /* do nothing, as it was already in and has been updated*/
+ }
else {
st_add_direct(RHASH(hash)->tbl, rb_str_new4(key), val);
}
diff -rwdu ruby/st.c ruby-judy/st.c
--- ruby/st.c Wed Jul 31 00:30:20 2002
+++ ruby-judy/st.c Sun Sep 1 00:39:37 2002
@@ -11,27 +11,18 @@
#include <malloc.h>
#endif
+#include <Judy.h>
+
+#define HASH_LOG
+
typedef struct st_table_entry st_table_entry;
struct st_table_entry {
- unsigned int hash;
char *key;
char *record;
st_table_entry *next;
};
-#define ST_DEFAULT_MAX_DENSITY 5
-#define ST_DEFAULT_INIT_TABLE_SIZE 11
-
- /*
- * DEFAULT_MAX_DENSITY is the default for the largest we allow the
- * average number of items per bin before increasing the number of
- * bins
- *
- * DEFAULT_INIT_TABLE_SIZE is the default for the number of bins
- * allocated initially
- *
- */
static int numcmp();
static int numhash();
static struct st_hash_type type_numhash = {
@@ -66,73 +57,14 @@
#define EQUAL(table,x,y) ((x)==(y) || (*table->type->compare)((x),(y)) == 0)
#define do_hash(key,table) (unsigned int)(*(table)->type->hash)((key))
-#define do_hash_bin(key,table) (do_hash(key, table)%(table)->num_bins)
-
-/*
- * MINSIZE is the minimum size of a dictionary.
- */
-
-#define MINSIZE 8
-
-/*
-Table of prime numbers 2^n+a, 2<=n<=30.
-*/
-static long primes[] = {
- 8 + 3,
- 16 + 3,
- 32 + 5,
- 64 + 3,
- 128 + 3,
- 256 + 27,
- 512 + 9,
- 1024 + 9,
- 2048 + 5,
- 4096 + 3,
- 8192 + 27,
- 16384 + 43,
- 32768 + 3,
- 65536 + 45,
- 131072 + 29,
- 262144 + 3,
- 524288 + 21,
- 1048576 + 7,
- 2097152 + 17,
- 4194304 + 15,
- 8388608 + 9,
- 16777216 + 43,
- 33554432 + 35,
- 67108864 + 15,
- 134217728 + 29,
- 268435456 + 3,
- 536870912 + 11,
- 1073741824 + 85,
- 0
-};
+#define do_hash_bin(key,table) (do_hash(key, table) % HASHSIZE)
-static int
-new_size(size)
- int size;
-{
- int i;
+#define HASHARRAY(table,code) ((table)->PJLArray[(code) % HASHSIZE])
+#define HASHINDEX(code) ((code)/HASHSIZE)
+#define HASHNODE(ppv) (* (st_table_entry **)ppv)
+#define NEWNODE(ppv) *(ppv) = calloc(1, sizeof(st_table_entry))
-#if 0
- for (i=3; i<31; i++) {
- if ((1<<i) > size) return 1<<i;
- }
- return -1;
-#else
- int newsize;
- for (i = 0, newsize = MINSIZE;
- i < sizeof(primes)/sizeof(primes[0]);
- i++, newsize <<= 1)
- {
- if (newsize > size) return primes[i];
- }
- /* Ran out of polynomials */
- return -1; /* should raise exception */
-#endif
-}
#ifdef HASH_LOG
static int collision = 0;
@@ -153,6 +85,12 @@
int size;
{
st_table *tbl;
+ int i;
+
+ tbl = alloc(st_table);
+ //FIXME: optimize
+ for ( i = 0; i < HASHSIZE; i++ )
+ tbl->PJLArray[i] = 0;
#ifdef HASH_LOG
if (init_st == 0) {
@@ -161,13 +99,8 @@
}
#endif
- size = new_size(size); /* round up to prime number */
-
- tbl = alloc(st_table);
tbl->type = type;
tbl->num_entries = 0;
- tbl->num_bins = size;
- tbl->bins = (st_table_entry **)Calloc(size, sizeof(st_table_entry*));
return tbl;
}
@@ -211,21 +144,28 @@
{
register st_table_entry *ptr, *next;
int i;
+ PPvoid_t PValue;
+ Word_t Index, Useless;
+ st_table_entry *pNode, *pTmp;
- for(i = 0; i < table->num_bins; i++) {
- ptr = table->bins[i];
- while (ptr != 0) {
- next = ptr->next;
- free(ptr);
- ptr = next;
+ for(i = 0; i < HASHSIZE; i++) {
+ Index = 0;
+ JLF( PValue, table->PJLArray[i], Index);
+ while (PValue) {
+ // go through all the positions inside the Judy array
+ pNode = HASHNODE(PValue);
+ while (pNode) { // clear the collision list
+ pTmp = pNode;
+ pNode = pNode->next;
+ free(pTmp);
}
+ JLN( PValue, table->PJLArray[i], Index);
}
- free(table->bins);
- free(table);
+ JLFA( Useless, table->PJLArray[i] );
}
-#define PTR_NOT_EQUAL(table, ptr, hash_val, key) \
-((ptr) != 0 && (ptr->hash != (hash_val) || !EQUAL((table), (key), (ptr)->key)))
+ free(table);
+}
#ifdef HASH_LOG
#define COLLISION collision++
@@ -234,14 +174,25 @@
#endif
#define FIND_ENTRY(table, ptr, hash_val, bin_pos) do {\
- bin_pos = hash_val%(table)->num_bins;\
- ptr = (table)->bins[bin_pos];\
- if (PTR_NOT_EQUAL(table, ptr, hash_val, key)) {\
+ PPvoid_t PValue;\
+ \
+ bin_pos = HASHINDEX(hash_val);\
+ /*FIXME: error handling? */\
+ /*FIXME: is JLG really faster than JudyLGet?*/\
+ JLG(PValue,HASHARRAY(table,hash_val), bin_pos);\
+ if (PValue) {\
+ ptr = HASHNODE(PValue);\
+ if ( ptr ) {\
+ if ( EQUAL(table, ptr->key, key) ) \
+ break;\
COLLISION;\
- while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\
- ptr = ptr->next;\
+ for ( ptr = ptr->next; ptr; ptr = ptr->next)\
+ if ( EQUAL(table, ptr->key, key) ) \
+ break;\
}\
- ptr = ptr->next;\
+ }\
+ else {\
+ ptr = 0;\
}\
} while (0)
@@ -269,18 +220,15 @@
#define ADD_DIRECT(table, key, value, hash_val, bin_pos)\
do {\
st_table_entry *entry;\
- if (table->num_entries/(table->num_bins) > ST_DEFAULT_MAX_DENSITY) {\
- rehash(table);\
- bin_pos = hash_val % table->num_bins;\
- }\
+ PPvoid_t PValue;\
\
- entry = alloc(st_table_entry);\
+ JLI( PValue, HASHARRAY(table,hash_val), bin_pos );\
\
- entry->hash = hash_val;\
+ entry = alloc(st_table_entry);\
entry->key = key;\
entry->record = value;\
- entry->next = table->bins[bin_pos];\
- table->bins[bin_pos] = entry;\
+ entry->next = HASHNODE(PValue);\
+ *PValue = entry;\
table->num_entries++;\
} while (0)
@@ -292,12 +240,59 @@
{
unsigned int hash_val, bin_pos;
register st_table_entry *ptr;
+ PPvoid_t PValue;
+
+
+ hash_val = do_hash(key, table);
+ JLI( PValue, HASHARRAY(table, hash_val), HASHINDEX(hash_val) );
+ if ( *PValue ) {
+ ptr = HASHNODE(PValue);
+ /* we layout the code this way to be able to count collisions */
+ if ( ptr ) {
+ if (EQUAL(table, ptr->key, key) ) {
+ ptr->record = value;
+ return 1;
+ }
+ COLLISION;
+ for ( ptr = ptr->next; ptr; ptr = ptr->next )
+ if ( EQUAL(table, ptr->key, key) ) {
+ ptr->record = value;
+ return 1;
+ }
+ }
+ /* if it gets here, either the has was empty or no element had
+ * the same key */
+ ptr = alloc(st_table_entry);
+ ptr->key = key;
+ ptr->record = value;
+ ptr->next = *PValue;
+ *PValue = ptr;
+ ++table->num_entries;
+ return 0;
+ }
+ else {
+ *PValue = alloc(st_table_entry);
+ HASHNODE(PValue)->key = key;
+ HASHNODE(PValue)->record = value;
+ HASHNODE(PValue)->next = 0;
+ ++table->num_entries;
+ return 0;
+ }
+}
+
+int
+st_update_if_present(table, key, value)
+ st_table *table;
+ register char *key;
+ char *value;
+{
+ unsigned int hash_val, bin_pos;
+ register st_table_entry *ptr;
hash_val = do_hash(key, table);
FIND_ENTRY(table, ptr, hash_val, bin_pos);
if (ptr == 0) {
- ADD_DIRECT(table, key, value, hash_val, bin_pos);
return 0;
}
else {
@@ -315,72 +310,46 @@
unsigned int hash_val, bin_pos;
hash_val = do_hash(key, table);
- bin_pos = hash_val % table->num_bins;
+ bin_pos = HASHINDEX(hash_val);
ADD_DIRECT(table, key, value, hash_val, bin_pos);
}
-static void
-rehash(table)
- register st_table *table;
-{
- register st_table_entry *ptr, *next, **new_bins;
- int i, old_num_bins = table->num_bins, new_num_bins;
- unsigned int hash_val;
-
- new_num_bins = new_size(old_num_bins+1);
- new_bins = (st_table_entry**)Calloc(new_num_bins, sizeof(st_table_entry*));
-
- for(i = 0; i < old_num_bins; i++) {
- ptr = table->bins[i];
- while (ptr != 0) {
- next = ptr->next;
- hash_val = ptr->hash % new_num_bins;
- ptr->next = new_bins[hash_val];
- new_bins[hash_val] = ptr;
- ptr = next;
- }
- }
- free(table->bins);
- table->num_bins = new_num_bins;
- table->bins = new_bins;
-}
-
st_table*
st_copy(old_table)
st_table *old_table;
{
st_table *new_table;
- st_table_entry *ptr, *entry;
- int i, num_bins = old_table->num_bins;
+ st_table_entry *oldptr, *ptr, **entry;
+ PPvoid_t PValue;
+ Word_t Index;
+ int i;
- new_table = alloc(st_table);
+ new_table = st_init_table( old_table->type );
if (new_table == 0) {
return 0;
}
- *new_table = *old_table;
- new_table->bins = (st_table_entry**)
- Calloc((unsigned)num_bins, sizeof(st_table_entry*));
-
- if (new_table->bins == 0) {
- free(new_table);
- return 0;
- }
+ new_table->num_entries = old_table->num_entries;
- for(i = 0; i < num_bins; i++) {
- new_table->bins[i] = 0;
- ptr = old_table->bins[i];
- while (ptr != 0) {
- entry = alloc(st_table_entry);
- if (entry == 0) {
- free(new_table->bins);
- free(new_table);
- return 0;
+ for(i = 0; i < HASHSIZE; i++) {
+ Index = 0;
+ JLF( PValue, old_table->PJLArray[i], Index );
+ while( PValue ) {
+ //FIXME: should assert( *PValue ); ?
+ JLI( entry, new_table->PJLArray[i], Index );
+ *entry = alloc(st_table_entry);
+ (*entry)->key = HASHNODE(PValue)->key;
+ (*entry)->record = HASHNODE(PValue)->record;
+ (*entry)->next = 0;
+ for (oldptr = HASHNODE(PValue)->next; oldptr; oldptr = oldptr->next) {
+ ptr = alloc(st_table_entry);
+ // FIXME: check error in memory allocation
+ ptr->key = oldptr->key;
+ ptr->record = oldptr->record;
+ ptr->next = *entry;
+ *entry = ptr;
}
- *entry = *ptr;
- entry->next = new_table->bins[i];
- new_table->bins[i] = entry;
- ptr = ptr->next;
+ JLN( PValue, old_table->PJLArray[i], Index );
}
}
return new_table;
@@ -394,33 +363,27 @@
{
unsigned int hash_val;
st_table_entry *tmp;
- register st_table_entry *ptr;
-
- hash_val = do_hash_bin(*key, table);
- ptr = table->bins[hash_val];
+ register st_table_entry **ptr, *ptr2;
+ int useless;
+ hash_val = do_hash(*key, table);
+ JLG( ptr, HASHARRAY(table, hash_val), HASHINDEX(hash_val) );
if (ptr == 0) {
if (value != 0) *value = 0;
return 0;
}
- if (EQUAL(table, *key, ptr->key)) {
- table->bins[hash_val] = ptr->next;
- table->num_entries--;
- if (value != 0) *value = ptr->record;
- *key = ptr->key;
- free(ptr);
- return 1;
- }
-
- for(; ptr->next != 0; ptr = ptr->next) {
- if (EQUAL(table, ptr->next->key, *key)) {
- tmp = ptr->next;
- ptr->next = ptr->next->next;
- table->num_entries--;
- if (value != 0) *value = tmp->record;
- *key = tmp->key;
- free(tmp);
+ for( tmp = 0, ptr2 = *ptr; ptr2; tmp = ptr2, ptr2 = ptr2->next ) {
+ if (EQUAL(table, ptr2->key, *key)) {
+ if(value) *value = ptr2->record;
+ if(tmp)
+ tmp->next = ptr2->next;
+ else // head of the list
+ *ptr = (*ptr)->next;
+ free( ptr2 );
+ if ( ! *ptr )
+ JLD( useless, HASHARRAY(table,hash_val), HASHINDEX(hash_val) );
+ --table->num_entries;
return 1;
}
}
@@ -437,15 +400,17 @@
{
unsigned int hash_val;
register st_table_entry *ptr;
+ PPvoid_t pValue;
- hash_val = do_hash_bin(*key, table);
- ptr = table->bins[hash_val];
+ hash_val = do_hash(*key, table);
+ JLG( pValue, HASHARRAY(table,hash_val), HASHINDEX(hash_val) );
- if (ptr == 0) {
+ if (pValue == 0) {
if (value != 0) *value = 0;
return 0;
}
+ ptr = HASHNODE(pValue);
for(; ptr != 0; ptr = ptr->next) {
if ((ptr->key != never) && EQUAL(table, ptr->key, *key)) {
table->num_entries--;
@@ -472,10 +437,10 @@
st_table *table;
char *never;
{
- int num_entries = table->num_entries;
+ //int num_entries = table->num_entries;
st_foreach(table, delete_never, never);
- table->num_entries = num_entries;
+ //table->num_entries = num_entries;
}
void
@@ -485,12 +450,21 @@
char *arg;
{
st_table_entry *ptr, *last, *tmp;
+ PPvoid_t PValue;
+ Word_t Index;
enum st_retval retval;
int i;
- for(i = 0; i < table->num_bins; i++) {
+ for(i = 0; i < HASHSIZE; i++) {
+ Index = 0;
+ if ( table->PJLArray[i] == 0 ) // empty JudyL array
+ continue;
+ JLF( PValue, table->PJLArray[i], Index );
+ while ( PValue ) {
last = 0;
- for(ptr = table->bins[i]; ptr != 0;) {
+ ptr = HASHNODE(PValue);
+ while ( ptr != 0 ) {
+ /*FIXME: sometimes crashes here with ptr->record == NULL !!!*/
retval = (*func)(ptr->key, ptr->record, arg);
switch (retval) {
case ST_CONTINUE:
@@ -502,7 +476,7 @@
case ST_DELETE:
tmp = ptr;
if (last == 0) {
- table->bins[i] = ptr->next;
+ HASHNODE(PValue) = ptr->next;
}
else {
last->next = ptr->next;
@@ -510,9 +484,11 @@
ptr = ptr->next;
free(tmp);
table->num_entries--;
- }
- }
- }
+ } // switch
+ } // while to scan collision list
+ JLN( PValue, table->PJLArray[i], Index );
+ } // while to scan Judy array
+ } // for
}
static int
@@ -563,3 +539,7 @@
{
return n;
}
+
+/*
+ * vim: ts=4:
+ */
diff -rwdu ruby/st.h ruby-judy/st.h
--- ruby/st.h Wed Jan 5 05:37:12 2000
+++ ruby-judy/st.h Sun Sep 1 00:44:07 2002
@@ -6,6 +6,8 @@
#define ST_INCLUDED
+#include <Judy.h>
+
typedef struct st_table st_table;
struct st_hash_type {
@@ -13,11 +15,12 @@
int (*hash)();
};
+#define HASHSIZE 1
+
struct st_table {
struct st_hash_type *type;
- int num_bins;
int num_entries;
- struct st_table_entry **bins;
+ Pvoid_t PJLArray[HASHSIZE];
};
#define st_is_member(table,key) st_lookup(table,key,(char **)0)
@@ -32,6 +35,7 @@
st_table *st_init_strtable_with_size();
int st_delete(), st_delete_safe();
int st_insert(), st_lookup();
+int st_update_if_present();
void st_foreach(), st_add_direct(), st_free_table(), st_cleanup_safe();
st_table *st_copy();