[#10209] Market for XML Web stuff — Matt Sergeant <matt@...>

I'm trying to get a handle on what the size of the market for AxKit would be

15 messages 2001/02/01

[#10238] RFC: RubyVM (long) — Robert Feldt <feldt@...>

Hi,

20 messages 2001/02/01
[#10364] Re: RFC: RubyVM (long) — Mathieu Bouchard <matju@...> 2001/02/05

[#10708] Suggestion for threading model — Stephen White <spwhite@...>

I've been playing around with multi-threading. I notice that there are

11 messages 2001/02/11

[#10853] Re: RubyChangeRequest #U002: new proper name for Hash#indexes, Array#indexes — "Mike Wilson" <wmwilson01@...>

10 messages 2001/02/14

[#11037] to_s and << — "Brent Rowland" <tarod@...>

list = [1, 2.3, 'four', false]

15 messages 2001/02/18

[#11094] Re: Summary: RCR #U002 - proper new name fo r indexes — Aleksi Niemel<aleksi.niemela@...>

> On Mon, 19 Feb 2001, Yukihiro Matsumoto wrote:

12 messages 2001/02/19

[#11131] Re: Summary: RCR #U002 - proper new name fo r indexes — "Conrad Schneiker" <schneik@...>

Robert Feldt wrote:

10 messages 2001/02/19

[#11251] Programming Ruby is now online — Dave Thomas <Dave@...>

36 messages 2001/02/21

[#11469] XML-RPC and KDE — schuerig@... (Michael Schuerig)

23 messages 2001/02/24
[#11490] Re: XML-RPC and KDE — schuerig@... (Michael Schuerig) 2001/02/24

Michael Neumann <neumann@s-direktnet.de> wrote:

[#11491] Negative Reviews for Ruby and Programming Ruby — Jim Freeze <jim@...> 2001/02/24

Hi all:

[#11633] RCR: shortcut for instance variable initialization — Dave Thomas <Dave@...>

13 messages 2001/02/26

[#11652] RE: RCR: shortcut for instance variable initialization — Michael Davis <mdavis@...>

I like it!

14 messages 2001/02/27

[#11700] Starting Once Again — Ron Jeffries <ronjeffries@...>

OK, I'm starting again with Ruby. I'm just assuming that I've

31 messages 2001/02/27
[#11712] RE: Starting Once Again — "Aaron Hinni" <aaron@...> 2001/02/27

> 2. So far I think running under TextPad will be better than running

[#11726] Re: Starting Once Again — Aleksi Niemel<zak@...> 2001/02/28

On Wed, 28 Feb 2001, Aaron Hinni wrote:

[ruby-talk:11140] Re: Summary: RCR #U002 - proper new name fo r indexes

From: David Alan Black <dblack@...>
Date: 2001-02-20 00:43:00 UTC
List: ruby-talk #11140
On Tue, 20 Feb 2001, Dave Thomas wrote:

> David Alan Black <dblack@candle.superlink.net> writes:
> 
> > In spite of being an advocate of having two different names, I do
> > agree that conceptually an array is essentially a hash on positive
> > integers.  (See for example [ruby-talk:6611] and [ruby-talk:6663].)
> > In fact, looking at arrays and hashes that way makes me wonder about
> > what *exactly* is common to them, and what implications that has.  I
> > keep thinking of a phantom module called "Hashable", and wishing it
> > existed....  
> 
> I'm not sure I agree that they are essentially the same. For example:
> 
>   a = []
>   a[0] = 0
>   a[10] = 10
>   p a     #=> [0, nil, nil, nil, nil, nil, nil, nil, nil, nil, 10]
> 
>   b = {}
>   b[0] = 0
>   b[10] = 10
>   p b     #=> {0=>0, 10=>10}
> 
> An array is a vector, while a hash is an indexed collection.  Arrays
> have key-ordering, while hashes are unordered.

There's no question that they behave differently, and offer different
functionality.  But one could also look at ordered keys as a special
case of non-ordered keys -- namely, a case where the keys
automatically get sorted, in exchange for the constraint of their
having to be integers.  An array could be understood as a
special-purpose hash, with extra intelligence in one area and
restricted flexibility in others.

> However, I _would_ agree that both arrays and hashes might be
> derivable from some underlying collection class.

In my non-existent, phantom scheme, being hashable (i.e., mixing in
Hashable) would mean maintaining a collection of key/value pairs
(tuples?).  Every class that mixed in Hashable (e.g., Hash and Array)
would implement constraints on its possible keys.  (I don't know
whether Hashable is a practical or useful idea -- I've gravitated
toward it mainly as a way of mentally refactoring and picturing the
common hashability of arrays and hashes.)


David

-- 
David Alan Black
home: dblack@candle.superlink.net
work: blackdav@shu.edu
Web:  http://pirate.shu.edu/~blackdav


In This Thread