Dmitry Olshansky:
Yes, definitely just decouple table preparation and searching
range itself. It's common to use KMP and its ilk to do a lot
of series of searches for the same needle.
OK.
Regarding the license, this is a translation from another
language of a basic algorithm. I don't think
On 15.06.2012 23:41, Roman D. Boiko wrote:
On Friday, 15 June 2012 at 19:03:56 UTC, bearophile wrote:
A lazy Knuth-Morris-Pratt that works on a Input Range:
http://ideone.com/dUs5B
Do you have suggestions for improvements of the code? Maybe do I have
to turn it into a Forward Range if the first
On Friday, 15 June 2012 at 19:41:35 UTC, Roman D. Boiko wrote:
Pay attention to "Licensed under the PSF License" for your
source implementation. You will not be able to include it into
Phobos unless implementation details that you borrowed from
Python implementation can be found elsewhere under
On Friday, 15 June 2012 at 19:03:56 UTC, bearophile wrote:
A lazy Knuth-Morris-Pratt that works on a Input Range:
http://ideone.com/dUs5B
Do you have suggestions for improvements of the code? Maybe do
I have to turn it into a Forward Range if the first range is a
Forward one? Is something simi
On 15.06.2012 23:03, bearophile wrote:
A lazy Knuth-Morris-Pratt that works on a Input Range:
http://ideone.com/dUs5B
Do you have suggestions for improvements of the code? Maybe do I have to
turn it into a Forward Range if the first range is a Forward one? Is
something similar to this useful for
On Friday, 15 June 2012 at 10:01:42 UTC, Dmitry Olshansky wrote:
Suggest you revisit toNode function as it does return
something strange :)
Just looking at first - last lines:
pure nothrow auto toNode(R)(R range, immutable(Maybe!Node)
parent) if(isInputRange!R && hasLength!R)
On 15.06.2012 12:50, Roman D. Boiko wrote:
On Friday, 15 June 2012 at 08:31:08 UTC, dennis luehring wrote:
Am 15.06.2012 08:25, schrieb Jacob Carlborg:
On 2012-06-14 17:32, Roman D. Boiko wrote:
I agree, just looking how to accomplish my goals. I decided to get rid
of casting, and will store
On Friday, 15 June 2012 at 08:31:08 UTC, dennis luehring wrote:
Am 15.06.2012 08:25, schrieb Jacob Carlborg:
On 2012-06-14 17:32, Roman D. Boiko wrote:
I agree, just looking how to accomplish my goals. I decided
to get rid
of casting, and will store everything on heap. I don't know
how to put
On 2012-06-15 10:30, dennis luehring wrote:
i think he needs to - else he encapsulate the float into an struct which
is then also on the heap
(ast/whatever)
nodex -> float
nodey -> string
nodez -> int
nodew -> double
etc.
in this example a node can contain from n types values - how would you
Am 15.06.2012 08:25, schrieb Jacob Carlborg:
On 2012-06-14 17:32, Roman D. Boiko wrote:
I agree, just looking how to accomplish my goals. I decided to get rid
of casting, and will store everything on heap. I don't know how to put a
variable of type float to the heap, and thought that it would b
On Friday, 15 June 2012 at 06:25:59 UTC, Jacob Carlborg wrote:
On 2012-06-14 17:32, Roman D. Boiko wrote:
I agree, just looking how to accomplish my goals. I decided to
get rid
of casting, and will store everything on heap. I don't know
how to put a
variable of type float to the heap, and thou
On Friday, June 15, 2012 09:14:45 Matthias Walter wrote:
> Hi,
>
> I have a const std.container object (e.g., a const(Array!int)) of which
> I'd like to have a range which can traverse that container having
> read-only access. This does not seem to be possible with opSlice(). Is
> there an alterna
Hi,
I have a const std.container object (e.g., a const(Array!int)) of which
I'd like to have a range which can traverse that container having
read-only access. This does not seem to be possible with opSlice(). Is
there an alternative?
Best regards,
Matthias
13 matches
Mail list logo
