On 05/14/2012 09:48 PM, Francois Berenger wrote:
Hello,
What's the gold standard in OCaml to have
unit test as comments in source code in order
for a tool to automatically extract them
and generate a test suite?
Thanks,
F.
Batteries uses a program called qtest to do this; it's within the
using ACGT), in which case, the matcher
could run 4 basepairs at a time, but there's a lot of corner issues
doing things that way. A lot depends on how much time and effort you're
willing to spend engineering something.
E.
2012/3/16 Edgar Friendly thelema...@gmail.com
mailto:thelema
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
for most uses.
E.
btw, link to the docs I meant to include in my first email:
http://ocaml-batteries-team.github.com/batteries-included/hdoc/BatArray.Cap.html
On Wed, Mar 14, 2012 at 5:12 PM, Lukasz Stafiniak lukst...@gmail.comwrote:
On Wed, Mar 14, 2012 at 10:03 PM, Edgar Friendly thelema
On 03/09/2012 09:26 AM, Daniel Bünzli wrote:
Without going into the dependency resolving thing, I still think it's
an issue. Basically with odb you don't really know what you are
downloading.
http://oasis.ocamlcore.org/dev/odb/
This page shows the stable, testing and unstable versions of each
On 03/07/2012 08:02 PM, Francois Berenger wrote:
Wouldn't it be possible to have 'odb remove foo' just call
'ocamlfind remove foo'?
Yes, this is possible. Most details of this are already implemented;
the code to do `ocamlfind remove foo` is already implemented as part of
--force for
On 03/07/2012 07:32 AM, Daniel Bünzli wrote:
Hello,
A few questions about odb.
1) Is it possible to specify in ~/.odb/packages a remote packages file (instead
of just individual remote packages) ?
Not at the moment, but this is an interesting idea. The only support
for remote packages is
On 03/07/2012 09:41 AM, Goswin von Brederlow wrote:
The task then needs pointers to each of the lists data
structures creating cycles. Not good for ocaml. It also would waste
memory for 2 pointers (per list).
Cycles are fine for ocaml, pointers are pretty cheap, and I think the
answer to your
On 03/07/2012 10:47 AM, Daniel Bünzli wrote:
Okay. Would be nice to have the support in the tool and documentation
on how to make your own package source (basically GET on a
~/.odb/packages file ?). Package distribution should be distributed.
one file per package, filename is package name,
Here is an example of giving an exception as an argument to a function:
let run_or ~cmd ~err = if Sys.command cmd 0 then raise err
and an example usage:
let config_fail = Failure (Could not configure ^ p.id) in
run_or ~cmd:(sh configure ^ config_opt) ~err:config_fail;
The problem with your
I struggled with this too, but if you read the wikipedia page
http://en.wikipedia.org/wiki/Interval_tree, he's implemented a centered
interval tree. Yes, there's a lot of complications needed to insert and
remove, but what he's done works for static interval trees.
His lookup function is `int -
On 02/13/2012 06:01 AM, Arnaud Spiwack wrote:
I see an immediate problem with packages that install several executable
files (for instance, Melt provides a library and a collection of tools,
none of them named melt, by the way). I haven't spent time looking more
than superficially into oasis or
On 02/11/2012 12:38 PM, Goswin von Brederlow wrote:
On Fri, Feb 10, 2012 at 10:07:05AM +0900, Francois Berenger wrote:
I need to use an interval tree.
Biocaml has one, batteries have imap/iset, nice!
Anyone have something like this but for non-overlapping intervals and
allowing interval
On 01/21/2012 01:14 PM, Pierre Chopin wrote:
Hi,
I am trying to do pattern matching on unicode characters, represented by
integers. I would like to do something like that
let f c =
match c with
0xff .. 0xfff - foo
I know we can pattern match over char intervals but It doesn't be to be
On 01/20/2012 03:37 AM, David Allsopp wrote:
Actually, it's possible that with more cases it might be faster -
it's
eliminating the allocation (at some point) of all the tuples needed for
the match case,
Doesn't the ocaml compiler not allocate the unnecessary tuples?
On 01/20/2012 04:38 AM, oliver wrote:
More concise does not always mean better readable or more performant.
You apply the same kind of selection for both values.
I can't measure readability, but I did throw together a quick benchmark
to test the different methods. Please take no offense at
On 01/20/2012 08:58 AM, oliver wrote:
On Fri, Jan 20, 2012 at 08:29:09AM -0500, Edgar Friendly wrote:
[...]
if a then if b then [a;b] else [a]
else if b then [b] else []
[...]
For me, the original pattern matching code looks much easier to read.
I agree - this was not meant
On 01/20/2012 09:12 AM, David Allsopp wrote:
Maybe for this case with two variables, yes - but it can't do that
indefinitely: as the number of variables increases, the code size increases
exponentially.
true, the right way to generalize this is to use vuillion's `maybe`
function that
On 01/04/2012 08:30 AM, Diego Olivier Fernandez Pons wrote:
I think the biggest thing the community can do to improve OCaml is
not to tweak around with language design. It's to improve the
library packaging situation.
Then just do it.
I have, and the result is odb[1]. It
Not a problem, other than memory waste (which doesn't matter the key).
Hashtbl.add prepends to the front of the list, so it'll be fast. And
Hashtbl.find will match the head of the list, and return quickly too.
Hashtbl.find_all will have to go through the whole list, but that's
expected.
E.
On
On 12/17/2011 06:27 PM, Daniel Bünzli wrote:
I tried to use Oasis on one of my projects. I got stuck at the very
begining. I am on MacOS, there is no binary installer, and no
instructions for MacOS users. It told me a bunch of dependencies were
unsatisfied when I tried to compile.
Agreed.
On 12/16/2011 07:39 AM, Alain Frisch wrote:
We don't necessarily need a full-blown packaging system, with dependency
tracking, versioning, automatic download, etc.
At first, maybe. In the long run, any friction in the system of
inter-package dependencies grinds away at the composability of
On 12/10/2011 03:32 PM, Andrei Formiga wrote:
The question is: what should be done? What must be done to enable
OASIS-DB?
Sylvain has worked with me to enable auto-installation of oasis-db
packages via odb[2]. There's not a large repo of packages[1], but most
of it is auto-installable (run
On 12/10/2011 04:12 PM, ri...@happyleptic.org wrote:
What I'd really like is a way to mix any version I want of the packages I
install, especially experimental versions for the packages I want to test or
contribute to.
I stopped using GODI some time ago because I wanted master of ocaml and
On 12/10/2011 04:44 PM, Gabriel Scherer wrote:
Could you (or Sylvain) make a more precise picture of how exactly the
community could help in the Oasis-DB effort?
My opinion is that oasis-db+odb is good enough for wider use. I don't
know what plans Sylvain has for the oasis-db server side, but
On 12/10/2011 04:49 PM, ri...@happyleptic.org wrote:
I will try to use it for some time.
But your description of it does not match my dreams.
Ideally, I would `odb install this-package --version=X.Y.Z`,
and `odb install another-one --branch=master`, and odb would
upgrade and/or rebuild what's
It seems that anonymous access to the bugtracker is no longer available, is
this accidental?
E.
On Thu, Dec 8, 2011 at 2:40 AM, Maxence Guesdon maxence.gues...@inria.frwrote:
On Thu, 1 Dec 2011 10:20:23 +0100
Maxence Guesdon maxence.gues...@inria.fr wrote:
Hello,
Mantis[1], the bug
On 06/28/2011 09:38 AM, Mihamina Rakotomandimby wrote:
A kind of ocaml-dev mailing list, I think.
As far as I can tell, this kind of discussion takes place somewhere
private. Maybe inside INRIA, maybe with Caml Consortium members only.
I think it's a good idea to open things up, but this
28 matches
Mail list logo