Berwin A Turlach wrote:
on the other hand, i have seen quite a few responses that were
bashing a user for reporting a non-existent bug or submitting an
annoying patch.
>>> In didactic terms those are "negative motivations/reinforcements";
>>> opinion differ
Dimitris Rizopoulos wrote:
>> in my opinion the point of the whole discussion could be summarized by
>> the question, what
>> is a design flaw? This is totally subjective, and it happens almost
>> everywhere in life.
This [what constitutes a design flaw, and the suggestion that all design
flaw
...
My earlier email requires too much reading between the lines. This one puts
the finger more closely on the issues: There are historical inconsistencies
and there are design flaws. Naturally, there often is an overlap, but there
is also a clear area of excellence. These are largely different th
> "WK" == Wacek Kusnierczyk
> on Tue, 24 Feb 2009 11:31:13 +0100 writes:
WK> Dimitris Rizopoulos wrote:
>> in my opinion the point of the whole discussion could be summarized by
>> the question, what is a design flaw? This is totally subjective, and
>> it happens almos
On 24-Feb-09 13:14:36, Berwin A Turlach wrote:
> G'day Dimitris,
>
> On Tue, 24 Feb 2009 11:19:15 +0100
> Dimitris Rizopoulos wrote:
>
>> in my opinion the point of the whole discussion could be summarized
>> by the question, what is a design flaw? This is totally subjective,
>> and it happens a
G'day Dimitris,
On Tue, 24 Feb 2009 11:19:15 +0100
Dimitris Rizopoulos wrote:
> in my opinion the point of the whole discussion could be summarized
> by the question, what is a design flaw? This is totally subjective,
> and it happens almost everywhere in life. [...]
Beautifully summarised and
Dimitris Rizopoulos wrote:
> in my opinion the point of the whole discussion could be summarized by
> the question, what is a design flaw? This is totally subjective, and
> it happens almost everywhere in life. Take human languages as an
> example and in particular, English. I do not know the histo
Berwin A Turlach wrote:
>
> I am well aware of those fortunes and maybe you missed the one:
>
>
>> fortune("Watson")
>>
>
> Getting flamed for asking dumb questions on a public mailing list is
> all part of growing up and being a man/woman.
>-- Michael Watson (in a discussion on whether
Berwin A Turlach wrote:
On Tue, 24 Feb 2009 09:39:51 +0100
Wacek Kusnierczyk wrote:
Berwin A Turlach wrote:
[...]
why not read some fortunes?
I am well aware of those fortunes and maybe you missed the one:
fortune("Watson")
Getting flamed for asking dumb questions on a public mailing
On Tue, 24 Feb 2009 09:39:51 +0100
Wacek Kusnierczyk wrote:
> Berwin A Turlach wrote:
[...]
> why not read some fortunes?
I am well aware of those fortunes and maybe you missed the one:
> fortune("Watson")
Getting flamed for asking dumb questions on a public mailing list is
all part of growing
Berwin A Turlach wrote:
>
>> i am sending *no* patch for this. the issue has to be first discussed
>> on the design level, and only then, if accepted, should anyone -- me,
>> for example -- make an attempt to implement it. tell me you want to
>> listen to what i have to say, and we can discuss.
On Mon, 23 Feb 2009 20:27:23 +0100
Wacek Kusnierczyk wrote:
> Berwin A Turlach wrote:
> >> [...]
> >> judging from your question, you couldn't possibly see sorting
> >> routines in other languages.
> >>
> >
> > Quite likely, or the other languages that I regularly use (C,
> > Fortran) have
Berwin A Turlach wrote:
>
>> it's not just making changes to sort.list, berwin. sort.list calls
>> .Internal order, and this one would have to be modified in order to
>> accommodate for the additional comparator argument. [...]
>>
>
> Well, you could start of with an R only implementation and
On Mon, 23 Feb 2009 13:27:08 +0100
Wacek Kusnierczyk wrote:
> Berwin A Turlach wrote:
>
>
>
> >> can you give one concrete example, and suggest how to estimate how
> >> much old code would involve the same issue?
> >>
> >
> > Check out the svn source of R, run configure, do whatever chang
Berwin A Turlach wrote:
>> can you give one concrete example, and suggest how to estimate how
>> much old code would involve the same issue?
>>
>
> Check out the svn source of R, run configure, do whatever change you
> want to sort.list, "make", "make check FORCE=FORCE". That should give
>
On Mon, 23 Feb 2009 11:31:16 +0100
Wacek Kusnierczyk wrote:
> Berwin A Turlach wrote:
> > On Mon, 23 Feb 2009 08:52:05 +0100
> > Wacek Kusnierczyk wrote:
[...]
> >> and you mean that sort.list not being applicable to lists is a)
> >> good design, and b) something that by noe means should be fixe
Dear vQ,
vectors (can-be-considered-lists),
can you please stop repeating this nonsense? I don't think anybody
ever claimed that vectors can be considered list. It's rather the
other way round: lists can also be seen as vectors to R (possibly they
are implemented as such, but I don't m
Berwin A Turlach wrote:
> On Mon, 23 Feb 2009 08:52:05 +0100
> Wacek Kusnierczyk wrote:
>
>
>> Berwin A Turlach wrote:
>>
>>> G'day Stavros,
>>>
>>
>>
In many cases, the orthogonal design is pretty straightforward.
And in the cases where the operation is currently
On Mon, 23 Feb 2009 08:52:05 +0100
Wacek Kusnierczyk wrote:
> Berwin A Turlach wrote:
> > G'day Stavros,
>
> >> In many cases, the orthogonal design is pretty straightforward.
> >> And in the cases where the operation is currently an error (e.g.
> >> sort(list(...))), I'd hope that wouldn't bre
Wacek Kusnierczyk wrote:
>
> btw. it's interesting that in revision 38438 (2006) Prof Brian Ripley
> introduced (or so does the commit message say) sorting complex numbers,
> and now you have things like:
>
> 1i > 0i
> # Error in 0+0i > 0+1i : invalid comparison with complex values
>
>
Stavros Macrakis wrote:
>
>>> ...sort(list(...))), I'd hope that wouldn't break existing code. [...]
>>>
>
>
>> ...sort is a generic function, and for sort(list(...)) to work, it would
>> have to dispatch to a function called sort.list;... such a function exists
>> already and it is not f
g'orning,
Berwin A Turlach wrote:
> G'day Stavros,
>
>
>
>> In many cases, the orthogonal design is pretty straightforward. And
>> in the cases where the operation is currently an error (e.g.
>> sort(list(...))), I'd hope that wouldn't break existing code. [...]
>>
>
> This could actua
On Sun, Feb 22, 2009 at 10:34 PM, Berwin A Turlach
wrote:
> G'day Stavros,
Hello, Berwin,
> On Sun, 22 Feb 2009 16:50:13 -0500
> Stavros Macrakis wrote:
>> ...sort(list(...))), I'd hope that wouldn't break existing code. [...]
> ...sort is a generic function, and for sort(list(...)) to work,
G'day Stavros,
On Sun, 22 Feb 2009 16:50:13 -0500
Stavros Macrakis wrote:
> On Sun, Feb 22, 2009 at 4:12 PM, Duncan Murdoch
> wrote:
[]
> > Which ones in particular should change? What should they change
> > to? What will break when you do that?
>
> In many cases, the orthogonal design
On Sun, Feb 22, 2009 at 4:12 PM, Duncan Murdoch wrote:
> I think this was posted to the wrong list, so my followup is going to
> R-devel.
OK.
> On 22/02/2009 3:42 PM, Stavros Macrakis wrote:
>>
>> Inspired by the exchange between Rolf Turner and Wacek Kusnierczyk, I
>> thought I'd clear up for m
25 matches
Mail list logo
