On Fri, Mar 16, 2012 at 02:03:38PM +0100, Philippe Veber wrote:
> Dear camlers,
>
> Say that you'd like to search a regexp on a file with lines so long that
> you'd rather not load them entirely at once. If you can bound the size of a
> match by k << length of a line, then you know that you can on
ｈｉ philippe,
i am curious, is your string a dna sequencｅｓｏ ｔｈａｔ ｓ ｗｈｙ ｉｔ ｉｓ ｓｏ ｌｏｎｇ？
ｒｅｇａｒｄｓ，ｆ
On Fri, 16 Mar 2012 10:14:41 -0400
Edgar Friendly wrote:
> On 03/16/2012 09:03 AM, Philippe Veber wrote:
> > Dear camlers,
> >
> > Say that you'd like to search a regexp on a file with lines so long
So given a large file and a line number, you want to:
1) extract that line from the file
2) produce an enum of all k-length slices of that line?
3) match each slice against your regexp set to produce a list/enum of
substrings that match the regexps?
Without reading the whole line into memory at onc
2012/3/16 Edgar Friendly
> On 03/16/2012 09:03 AM, Philippe Veber wrote:
>
>> Dear camlers,
>>
>> Say that you'd like to search a regexp on a file with lines so long that
>> you'd rather not load them entirely at once. If you can bound the size
>> of a match by k << length of a line, then you kno
Le Fri, 16 Mar 2012 14:03:38 +0100,
Philippe Veber a écrit :
> Say that you'd like to search a regexp on a file with lines so long
> that you'd rather not load them entirely at once. If you can bound
> the size of a match by k << length of a line, then you know that you
> can only keep a small po
On 03/16/2012 09:03 AM, Philippe Veber wrote:
Dear camlers,
Say that you'd like to search a regexp on a file with lines so long that
you'd rather not load them entirely at once. If you can bound the size
of a match by k << length of a line, then you know that you can only
keep a small portion of
On 2012-03-08, at 16:36, Daniel Bünzli wrote:
> Btw. the standard still seems to have lowercased files module files (witness
> the whole ocaml system itself), in fact I thought this was mandated by the
> compilers (don't know were I got that),
It was mandatory before version 3.07 (released in
Dear camlers,
Say that you'd like to search a regexp on a file with lines so long that
you'd rather not load them entirely at once. If you can bound the size of a
match by k << length of a line, then you know that you can only keep a
small portion of the line in memory to search the regexp. Typica
We (OCamlPro) are looking to recruit an excellent software engineer.
OCamlPro[1] is a small French company located near Paris. It is devoted to
promote the use of OCaml to IT professionals, as a way to make industrial
software more reliable. We participate to the development of OCaml and we
cre
[Please post - apologies for multiple copies.]
WING 2012 - 4th International Workshop on INvariant Generation
http://cs.nyu.edu/acsys/wing2012/
June 30, 2012
Manchester, UK (a satellite Workshop of IJCAR 2012)
Hello,
On 16-03-2012, Francois Berenger wrote:
> Hello,
>
> Let's say I have this section in an _oasis file:
>
> ---
> Executable "Toto"
>Path: src
>MainIs: toto.ml
>BuildDepends: batteries
>BuildTools: ocamlbuild
> ---
>
> I'd like the .ml file to be preprocessed
11 matches
Mail list logo
