Nabble - Ocaml Beginner

Re: "ocaml_beginners"::[] understanding "unbound type constructor"

2009-12-07T01:43:39Z

On Mon, Dec 7, 2009 at 1:51 PM, Johannes Kanig <johannes.kanig@...> wrote:

>
>
>
> Martin DeMello wrote:
> > I'm trying to get MLGame compiling against the latest OCaml and
> > OCamlSDL.
>
> Strange, i tried it and it compiles fine; I'm on a recent Ubuntu, I
> installed ocaml and libsdl-ocaml-dev using the package system. MLGame
> compiles fine. Maybe there is a problem with your installation of OcamlSDL?

Ah, that's good to know! It's probably an environment issue, then (I'm
using godi). I'll play with the makefile till it compiles.

martin

Re: "ocaml_beginners"::[] understanding "unbound type constructor"

2009-12-07T00:21:30Z

Martin DeMello wrote:
> I'm trying to get MLGame compiling against the latest OCaml and
> OCamlSDL.

Strange, i tried it and it compiles fine; I'm on a recent Ubuntu, I
installed ocaml and libsdl-ocaml-dev using the package system. MLGame
compiles fine. Maybe there is a problem with your installation of OcamlSDL?

> What I don't get is, why does Sdlvideo.surface need a constructor for
> that to compile?

It doesn't matter if the type corresponds to a type in C. The Ocaml
compiler searches for an Ocaml type named Sdlvideo.surface, it doesn't
find it on your system (for whatever reason), and it fails.

Johannes

--
Johannes Kanig

Re: "ocaml_beginners"::[] understanding "unbound type constructor"

2009-12-06T23:13:54Z

Hello,

Am Sonntag, den 06.12.2009, 05:21 +0530 schrieb Martin DeMello:
> I'm trying to get MLGame compiling against the latest OCaml and
> OCamlSDL. make fails with
>

Does the compiler find the include-directory (Ocaml-directory)? Still
exists the sdl-subdirectory there? (check with ocamlc -v, it should
point to the base)

Bye Andreas

--
Andreas Romeyke
- Abteilung Blindenschrift -
Deutsche Zentralbücherei für Blinde zu Leipzig (DZB)
Gustav-Adolf-Straße 7, 04105 Leipzig
Tel: +49 341 7113-..., Fax: +49 341 7113-125
Internet: www.dzb.de
E-Mail: andreas.romeyke@...

[Non-text portions of this message have been removed]

Re: "ocaml_beginners"::[] understanding "unbound type constructor"

2009-12-06T10:10:05Z

On Sun, Dec 6, 2009 at 10:15 PM, Richard Jones <rich@...> wrote:

> On Sun, Dec 06, 2009 at 05:21:31AM +0530, Martin DeMello wrote:
> > Error: Unbound type constructor Sdlvideo.surface
> [...]
> > type t = {
> > mutable surf : Sdlvideo.surface; (* <----- this is line 22 *)
>
> You mean, why does the compiler need to know the real type at that
> point? Or do you mean 'constructor' in the sense of constructing
> those types? I'm assuming it needs to know if it's an integral or a
> boxed type, because that would change whether the compiler should
> generate calls to update the remembered set when the mutable 'surf'
> field changes.
>
> However I'm pretty sure in this case that the compiler is just looking
> up the type and failing.

Well, the type *exists* because the SDL code itself uses it all over
the place. There's just the abstract "type surface" in sdlvideo.ml and
I assume it's being mapped somewhere in sdlvideo_stub.c.

martin

Re: "ocaml_beginners"::[] understanding "unbound type constructor"

2009-12-06T08:45:42Z

On Sun, Dec 06, 2009 at 05:21:31AM +0530, Martin DeMello wrote:
> Error: Unbound type constructor Sdlvideo.surface
[...]
> type t = {
> mutable surf : Sdlvideo.surface; (* <----- this is line 22 *)
[...]
> What I don't get is, why does Sdlvideo.surface need a constructor for
> that to compile?

You mean, why does the compiler need to know the real type at that
point? Or do you mean 'constructor' in the sense of constructing
those types? I'm assuming it needs to know if it's an integral or a
boxed type, because that would change whether the compiler should
generate calls to update the remembered set when the mutable 'surf'
field changes.

However I'm pretty sure in this case that the compiler is just looking
up the type and failing.

The code is going to fail to compile one way or another if that type
is no longer available in later versions of SDL, so best to fix the
code.

Rich.

--
Richard Jones
Red Hat

"ocaml_beginners"::[] understanding "unbound type constructor"

2009-12-05T15:51:31Z

I'm trying to get MLGame compiling against the latest OCaml and
OCamlSDL. make fails with

---------------------------
$ make
Calculating dependencies of: MLG/video.mli
Compiling: MLG/video.mli
File "/home/martin/opt/MLG115/MLG/video.mli", line 22, characters 17-33:
Error: Unbound type constructor Sdlvideo.surface
make: *** [out/MLG/video.cmi] Error 2
---------------------------

and from video.mli:

---------------------------
(** Low level video routines *)

(** TODO Type t is a type which represents an image for the actual
mode or an. Atutomagically updated on videomode change. *)
type t = {
mutable surf : Sdlvideo.surface; (* <----- this is line 22 *)
mutable last_mode : int;
mutable provide : (unit -> Sdlvideo.surface);
mutable cam_pos : int * int;
mutable rect : Sdlvideo.rect;
mutable vmem : bool;
};;
---------------------------

What I don't get is, why does Sdlvideo.surface need a constructor for
that to compile?

martin

Re: "ocaml_beginners"::[] Toplevel: loading Random

2009-12-05T01:36:15Z

Richard Jones wrote:

> On Thu, Dec 03, 2009 at 10:37:00AM +0000, Hugo Ferreira wrote:
>> I tried the example of loading the Num module as indicated
>> in:
>> http://www.cocan.org/tips_for_using_the_ocaml_toplevel
>>
>> Cannot seem to load the Random module.
>
> You don't need to load the Random module. It's included in the
> standard library which is always available:
>
> $ rlwrap ocaml
> Objective Caml version 3.11.1
>
> # Random.int ;;
> - : int -> int = <fun>
>
> Unless I'm misunderstanding what you're trying to do that is ...
>

You understood correctly. My mistake.
My code snippet works.

Thanks,
Hugo F.

> Rich.
>

Re: "ocaml_beginners"::[] Toplevel: loading Random

2009-12-04T11:46:44Z

On Thu, Dec 03, 2009 at 10:37:00AM +0000, Hugo Ferreira wrote:
> I tried the example of loading the Num module as indicated
> in:
> http://www.cocan.org/tips_for_using_the_ocaml_toplevel
>
> Cannot seem to load the Random module.

You don't need to load the Random module. It's included in the
standard library which is always available:

$ rlwrap ocaml
Objective Caml version 3.11.1

# Random.int ;;
- : int -> int = <fun>

Unless I'm misunderstanding what you're trying to do that is ...

Rich.

--
Richard Jones
Red Hat

Re: "ocaml_beginners"::[] Toplevel: loading Random

2009-12-03T03:13:23Z

To Martin and Mihamina,

Martin DeMello wrote:

> On Thu, Dec 3, 2009 at 4:07 PM, Hugo Ferreira <hmf@...> wrote:
>> Hello,
>>
>> I tried the example of loading the Num module as indicated
>> in:
>> http://www.cocan.org/tips_for_using_the_ocaml_toplevel
>>
>> Cannot seem to load the Random module.
>> What am I doing wrong?
>
> Random seems to be available by default. Also, if you do #use
> "topfind";; #list;; there is no random listed.
>

Correct. Seem to have a problem elsewhere.

Thank you,
Hugo F.

> martin
>
>
> ------------------------------------
>
> Archives up to December 31, 2008 are also downloadable at http://www.connettivo.net/cntprojects/ocaml_beginners/
> The archives of the very official ocaml list (the seniors' one) can be found at http://caml.inria.fr
> Attachments are banned and you're asked to be polite, avoid flames etc.Yahoo! Groups Links
>
>
>

Re: "ocaml_beginners"::[] Toplevel: loading Random

2009-12-03T03:01:06Z

12/03/2009 01:37 PM, Hugo Ferreira::
> # #use "topfind" ;;

#list;;

Will ist aavailable modules.

--
Architecte Informatique chez Blueline/Gulfsat:
Administration Systeme, Recherche & Developpement
+261 33 11 207 36

------------------------------------

Archives up to December 31, 2008 are also downloadable at http://www.connettivo.net/cntprojects/ocaml_beginners/
The archives of the very official ocaml list (the seniors' one) can be found at http://caml.inria.fr
Attachments are banned and you're asked to be polite, avoid flames etc.Yahoo! Groups Links

<*> To visit your group on the web, go to:
http://groups.yahoo.com/group/ocaml_beginners/

<*> Your email settings:
Individual Email | Traditional

<*> To change settings online go to:
http://groups.yahoo.com/group/ocaml_beginners/join
(Yahoo! ID required)

<*> To change settings via email:
ocaml_beginners-digest@...
ocaml_beginners-fullfeatured@...

<*> To unsubscribe from this group, send an email to:
ocaml_beginners-unsubscribe@...

<*> Your use of Yahoo! Groups is subject to:
http://docs.yahoo.com/info/terms/

Re: "ocaml_beginners"::[] Problem in Bigarray-Module underIntel64-Bit?

2009-12-03T02:58:00Z

Hello,

Am Mittwoch, den 02.12.2009, 16:53 +0000 schrieb Richard Jones:

> There's not much to go on. At the very least we'd want to see the
> contents of registers when it segfaults. However it's not likely that

Hmm, ok.

> anyone can fix the problem unless you can write a small reproducer
> program (and/or release your program's source code).

I will try to reduce the program as small as possible.

There was an additional fact found, if we start the compiled program on
a clean system (fresh booted linux), the program will be died as
described.

But if you run the program twice, it will be run without segfaults.

Because the same effect does not occur on an AMD-32bit system (fresh
compiled), it could have something to do with loading a library into the
memory, I think.

The problem is hard to trigger down, I will sent more information as
soon as possible.

Bye Andreas

--
Andreas Romeyke
- Abteilung Blindenschrift -
Deutsche Zentralbücherei für Blinde zu Leipzig (DZB)
Gustav-Adolf-Straße 7, 04105 Leipzig
Tel: +49 341 7113-..., Fax: +49 341 7113-125
Internet: www.dzb.de
E-Mail: andreas.romeyke@...

[Non-text portions of this message have been removed]

Re: "ocaml_beginners"::[] Toplevel: loading Random

2009-12-03T02:57:39Z

On Thu, Dec 3, 2009 at 4:07 PM, Hugo Ferreira <hmf@...> wrote:
> Hello,
>
> I tried the example of loading the Num module as indicated
> in:
> http://www.cocan.org/tips_for_using_the_ocaml_toplevel
>
> Cannot seem to load the Random module.
> What am I doing wrong?

Random seems to be available by default. Also, if you do #use
"topfind";; #list;; there is no random listed.

martin

"ocaml_beginners"::[] Toplevel: loading Random

2009-12-03T02:37:00Z

Hello,

I tried the example of loading the Num module as indicated
in:
http://www.cocan.org/tips_for_using_the_ocaml_toplevel

Cannot seem to load the Random module.
What am I doing wrong?

TIA,
Hugo F.

:~$ ocaml
Objective Caml version 3.10.2

# #use "topfind" ;;
- : unit = ()
Findlib has been successfully loaded. Additional directives:
#require "package";; to load a package
#list;; to list the available packages
#camlp4o;; to load camlp4 (standard syntax)
#camlp4r;; to load camlp4 (revised syntax)
#predicates "p,q,...";; to set these predicates
Topfind.reset();; to force that packages will be reloaded
#thread;; to enable threads

- : unit = ()
# #require "random" ;;
No such package: random
# #require "num" ;;
/home/hugof/ocaml/godi/lib/ocaml/std-lib/nums.cma: loaded
/home/hugof/ocaml/godi/lib/ocaml/pkg-lib/num-top: added to search path
/home/hugof/ocaml/godi/lib/ocaml/pkg-lib/num-top/num_top.cma: loaded
/home/hugof/ocaml/godi/lib/ocaml/pkg-lib/num: added to search path

------------------------------------

Archives up to December 31, 2008 are also downloadable at http://www.connettivo.net/cntprojects/ocaml_beginners/
The archives of the very official ocaml list (the seniors' one) can be found at http://caml.inria.fr
Attachments are banned and you're asked to be polite, avoid flames etc.Yahoo! Groups Links

<*> To visit your group on the web, go to:
http://groups.yahoo.com/group/ocaml_beginners/

<*> Your email settings:
Individual Email | Traditional

<*> To change settings online go to:
http://groups.yahoo.com/group/ocaml_beginners/join
(Yahoo! ID required)

<*> To change settings via email:
ocaml_beginners-digest@...
ocaml_beginners-fullfeatured@...

<*> To unsubscribe from this group, send an email to:
ocaml_beginners-unsubscribe@...

<*> Your use of Yahoo! Groups is subject to:
http://docs.yahoo.com/info/terms/

Re: "ocaml_beginners"::[] Problem in Bigarray-Module under Intel64-Bit?

2009-12-02T08:53:26Z

On Tue, Dec 01, 2009 at 09:06:35AM +0100, Romeyke, Andreas wrote:
> my team mate is triggered in a possible bug by compiling an
> ocaml-program under ocaml 11.1 using Bigarray-module.
[...]
> Do you have any hints to fix this problem or do you know a workaround?
> Do you need additional information?

There's not much to go on. At the very least we'd want to see the
contents of registers when it segfaults. However it's not likely that
anyone can fix the problem unless you can write a small reproducer
program (and/or release your program's source code).

Rich.

--
Richard Jones
Red Hat

"ocaml_beginners"::[] Re: Iterating over pairs within a list

2009-12-02T08:30:48Z

Hi,

Just in case you might prefer fold:

----
let any2 f l = List.fold_right (fun x r -> List.iter (f x) r; x::r) l []; ()
----

Cheers
Zheng

rixed@... wrote:

>
>
> Let's say I have a list, and want to code a function that calls a user
> function
> for each possible pairs of distinct elements of the list, once.
>
> Something like :
>
> let iterpairs f l =
> List.iter (fun a -> List.iter (fun b -> f a b) l) l
>
> is not correct since f will be called for a = b and twice for any given
> a and b
> (once with a and b and once later with b and a).
>
> What I wanted at first was a way to compare the addresses of the list cons
> cells, so that I call only f with a and b such that a cell's address is
> lower
> than b cell's address for instance. Or, since I couldn't find a way to reach
> the cons cell from iter's callback, to do this using a and b addresses
> (provided the list elements are boxed).
>
> The problem is : f is likelly to do something that will trigger the GC which
> can move things around, so the whole address comparison trick seams dubious.
>
> Do you know of an other way to do that ?
>
> (Note: I want to do this for elements that are not meaningfully orderable).

Re: "ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T08:13:35Z

Wonderful solutions.

Thank you !

Re: "ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T07:37:35Z

rixed@... wrote:
> Let's say I have a list, and want to code a function that calls a user function
> for each possible pairs of distinct elements of the list, once.

Here is my version:

let rec iter f = function
[] -> ()
| x :: l ->
List.iter (f x) l;
iter f l

# iter (fun i j -> Printf.printf "(%i, %i)\n" i j) [ 1; 2; 3 ];;
(1, 2)
(1, 3)
(2, 3)
- : unit = ()

Martin

--
http://mjambon.com/

Re: "ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T07:29:14Z

On Wed, Dec 02, 2009 at 10:16:00AM -0500, Eric Cooper wrote:
> let iterpairs f lst =
> List.iter
> (fun x -> List.iter (fun y -> if x <> y then f x y) lst)
> lst

Sorry, that should be "<" (or ">") rather than "<>". It's structural
comparison, so GC triggered by f isn't a problem.

Re: "ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T07:22:44Z

rixed@... wrote:

> Let's say I have a list, and want to code a function that calls a user function
> for each possible pairs of distinct elements of the list, once.
>
> Something like :
>
> let iterpairs f l =
> List.iter (fun a -> List.iter (fun b -> f a b) l) l
>
> is not correct since f will be called for a = b and twice for any given a and b
> (once with a and b and once later with b and a).
>

$ ocaml
Objective Caml version 3.10.2

# let f acc e1 e2 = (Printf.sprintf "(%d, %d)" e1 e2) :: acc

let fold_pairs f l =
let rec loop l acc =
match l with
| h :: t ->
let acc = List.fold_left (fun acc e -> f acc h e) acc t in
loop t acc
| [] -> acc
in
loop l []

let l = fold_pairs f [ 1 ; 2 ; 3 ] ;;
val f : string list -> int -> int -> string list = <fun>
val fold_pairs : ('a list -> 'b -> 'b -> 'a list) -> 'b list -> 'a list =
<fun>
val l : string list = ["(2, 3)"; "(1, 3)"; "(1, 2)"]

> What I wanted at first was a way to compare the addresses of the list cons
> cells, so that I call only f with a and b such that a cell's address is lower
> than b cell's address for instance. Or, since I couldn't find a way to reach
> the cons cell from iter's callback, to do this using a and b addresses
> (provided the list elements are boxed).
>
> The problem is : f is likelly to do something that will trigger the GC which
> can move things around, so the whole address comparison trick seams dubious.
>
> Do you know of an other way to do that ?
>
> (Note: I want to do this for elements that are not meaningfully orderable).
>
>
>
> ------------------------------------
>
> Archives up to December 31, 2008 are also downloadable at http://www.connettivo.net/cntprojects/ocaml_beginners/
> The archives of the very official ocaml list (the seniors' one) can be found at http://caml.inria.fr
> Attachments are banned and you're asked to be polite, avoid flames etc.Yahoo! Groups Links
>
>
>

Re: "ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T07:21:27Z

let rec iterpairs f l =
match l with
| [] -> ();
| x :: xs ->
begin
List.iter (f x) xs;
iterpairs f xs
end
in
let p x y = Printf.printf "(%d %d)" x y in
iterpairs p [1; 2; 3; 4; 5]

martin

On Wed, Dec 2, 2009 at 8:26 PM, <rixed@...> wrote:

>
>
>
> Let's say I have a list, and want to code a function that calls a user function
> for each possible pairs of distinct elements of the list, once.
>
> Something like :
>
> let iterpairs f l =
> List.iter (fun a -> List.iter (fun b -> f a b) l) l
>
> is not correct since f will be called for a = b and twice for any given a and b
> (once with a and b and once later with b and a).
>
> What I wanted at first was a way to compare the addresses of the list cons
> cells, so that I call only f with a and b such that a cell's address is lower
> than b cell's address for instance. Or, since I couldn't find a way to reach
> the cons cell from iter's callback, to do this using a and b addresses
> (provided the list elements are boxed).
>
> The problem is : f is likelly to do something that will trigger the GC which
> can move things around, so the whole address comparison trick seams dubious.
>
> Do you know of an other way to do that ?
>
> (Note: I want to do this for elements that are not meaningfully orderable).
>
>

------------------------------------

Archives up to December 31, 2008 are also downloadable at http://www.connettivo.net/cntprojects/ocaml_beginners/
The archives of the very official ocaml list (the seniors' one) can be found at http://caml.inria.fr
Attachments are banned and you're asked to be polite, avoid flames etc.Yahoo! Groups Links

<*> To visit your group on the web, go to:
http://groups.yahoo.com/group/ocaml_beginners/

<*> Your email settings:
Individual Email | Traditional

<*> To change settings online go to:
http://groups.yahoo.com/group/ocaml_beginners/join
(Yahoo! ID required)

<*> To change settings via email:
ocaml_beginners-digest@...
ocaml_beginners-fullfeatured@...

<*> To unsubscribe from this group, send an email to:
ocaml_beginners-unsubscribe@...

<*> Your use of Yahoo! Groups is subject to:
http://docs.yahoo.com/info/terms/

Re: "ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T07:16:00Z

On Wed, Dec 02, 2009 at 03:56:46PM +0100, rixed@... wrote:
> Let's say I have a list, and want to code a function that calls a
> user function for each possible pairs of distinct elements of the
> list, once.

let iterpairs f lst =
List.iter
(fun x -> List.iter (fun y -> if x <> y then f x y) lst)
lst

"ocaml_beginners"::[] Iterating over pairs within a list

2009-12-02T06:56:46Z

Let's say I have a list, and want to code a function that calls a user function
for each possible pairs of distinct elements of the list, once.

Something like :

let iterpairs f l =
List.iter (fun a -> List.iter (fun b -> f a b) l) l

is not correct since f will be called for a = b and twice for any given a and b
(once with a and b and once later with b and a).

What I wanted at first was a way to compare the addresses of the list cons
cells, so that I call only f with a and b such that a cell's address is lower
than b cell's address for instance. Or, since I couldn't find a way to reach
the cons cell from iter's callback, to do this using a and b addresses
(provided the list elements are boxed).

The problem is : f is likelly to do something that will trigger the GC which
can move things around, so the whole address comparison trick seams dubious.

Do you know of an other way to do that ?

(Note: I want to do this for elements that are not meaningfully orderable).

"ocaml_beginners"::[] Problem in Bigarray-Module under Intel64-Bit?

2009-12-01T00:06:35Z

Hello,

my team mate is triggered in a possible bug by compiling an
ocaml-program under ocaml 11.1 using Bigarray-module.

The ocaml-package is self-compiled with configure with standard options,
downloaded from http://caml.inria.fr directly.

The program could be compiled and runs stable with ocaml 3.10.2 (debian)
and 3.11.1 (selfcompiled) under AMD Sempron(tm) Processor LE-1150
(32bit).

In both cases the same input files are used.

I have attached the output of "ocamlopt -v", the output of
Linux /proc/cpuinfo and the first lines of GDB backtrace.

The ocamlopt is called with this compile-options: '-g -pp
"camlp4o"' (camlp4 is not really used, only used for better error
reports)

Do you have any hints to fix this problem or do you know a workaround?
Do you need additional information?

Bye Andreas

---- 8>< ---- 8>< ---- 8>< ---- 8>< ----
ocamlopt -v
The Objective Caml native-code compiler, version 3.11.1
Standard library directory: /usr/local/lib/ocaml
---- ><8 ---- ><8 ---- ><8 ---- ><8 ----

---- 8>< ---- 8>< ---- 8>< ---- 8>< ----
/proc/cpuinfo
processor : 0
vendor_id : GenuineIntel
cpu family : 6
model : 23
model name : Intel(R) Core(TM)2 Duo CPU E8600 @ 3.33GHz
stepping : 10
cpu MHz : 2000.000
cache size : 6144 KB
physical id : 0
siblings : 2
core id : 0
cpu cores : 2
apicid : 0
initial apicid : 0
fpu : yes
fpu_exception : yes
cpuid level : 13
wp : yes
flags : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge
mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2ss ht tm pbe
syscall nx lm constant_tsc arch_perfmon pebs bts rep_good nopl pni
monitor ds_cpl vmx smx est tm2 ssse3 cx16 xtpr sse4_1 lahf_lm
bogomips : 6665.88
clflush size : 64
cache_alignment : 64
address sizes : 36 bits physical, 48 bits virtual
power management:

processor : 1
vendor_id : GenuineIntel
cpu family : 6
model : 23
model name : Intel(R) Core(TM)2 Duo CPU E8600 @ 3.33GHz
stepping : 10
cpu MHz : 2000.000
cache size : 6144 KB
physical id : 0
siblings : 2
core id : 1
cpu cores : 2
apicid : 1
initial apicid : 1
fpu : yes
fpu_exception : yes
cpuid level : 13
wp : yes
flags : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge
mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2ss ht tm pbe
syscall nx lm constant_tsc arch_perfmon pebs bts rep_good nopl pni
monitor ds_cpl vmx smx est tm2 ssse3 cx16 xtpr sse4_1 lahf_lm
bogomips : 6665.90
clflush size : 64
cache_alignment : 64
address sizes : 36 bits physical, 48 bits virtual
power management:
---- ><8 ---- ><8 ---- ><8 ---- ><8 ----

---- 8>< ---- 8>< ---- 8>< ---- 8>< ----
Program received signal SIGSEGV, Segmentation
fault.
0x0000000000443fb2 in caml_ba_get_N
()
Current language: auto; currently
asm
(gdb)
bt
#0 0x0000000000443fb2 in caml_ba_get_N ()
#1 0x0000000000444113 in caml_ba_get_2 ()
#2 0x0000000000454e00 in caml_c_call ()
#3 0x00007ffff7fd3fb8 in ?? ()
#4 0x000000000041419a in camlSpeedseg__flood_368 ()
#5 0x0000000000000141 in ?? ()
#6 0x000000000000013f in ?? ()
#7 0x0000000000000689 in ?? ()
#8 0x00007ffff7fd3ea8 in ?? ()
#9 0x0000000000000009 in ?? ()
#10 0x0000000000414237 in camlSpeedseg__flood_368 ()
#11 0x0000000000000001 in ?? ()
#12 0x0000000000000141 in ?? ()
#13 0x0000000000000689 in ?? ()
#14 0x00007ffff7fd3ea8 in ?? ()
#15 0x0000000000000009 in ?? ()
#16 0x000000000041424f in camlSpeedseg__flood_368 ()
#17 0x0000000000000001 in ?? ()
#18 0x000000000000013f in ?? ()
#19 0x0000000000000689 in ?? ()
#20 0x00007ffff7fd3ea8 in ?? ()
#21 0x0000000000000009 in ?? ()
#22 0x000000000041424f in camlSpeedseg__flood_368 ()
#23 0x0000000000000001 in ?? ()
#24 0x000000000000013d in ?? ()
#25 0x0000000000000689 in ?? ()
#26 0x00007ffff7fd3ea8 in ?? ()
#27 0x0000000000000009 in ?? ()
#28 0x000000000041424f in camlSpeedseg__flood_368 ()
#29 0x0000000000000001 in ?? ()
#30 0x000000000000013b in ?? ()
#31 0x0000000000000689 in ?? ()
#32 0x00007ffff7fd3ea8 in ?? ()
#33 0x0000000000000009 in ?? ()
#34 0x000000000041424f in camlSpeedseg__flood_368 ()
#35 0x0000000000000001 in ?? ()
#36 0x0000000000000139 in ?? ()
#37 0x0000000000000689 in ?? ()
#38 0x00007ffff7fd3ea8 in ?? ()
#39 0x0000000000000009 in ?? ()
---- ><8 ---- ><8 ---- ><8 ---- ><8 ----
--
Andreas Romeyke
- Abteilung Blindenschrift -
Deutsche Zentralbücherei für Blinde zu Leipzig (DZB)
Gustav-Adolf-Straße 7, 04105 Leipzig
Tel: +49 341 7113-..., Fax: +49 341 7113-125
Internet: www.dzb.de
E-Mail: andreas.romeyke@...

[Non-text portions of this message have been removed]

Re: "ocaml_beginners"::[] Creating Library

2009-11-30T04:22:08Z

On Mon, Nov 30, 2009 at 12:01:37PM +0100, Romeyke, Andreas wrote:

[...]
> How to do this correctly?

If you really want to do this I think your best bet is to use the C
preprocessor:

ocamlc -pp cpp [...]

and then use #include directives as necessary.

In general (except for the case of -for-pack / -pack) it's better to
use one source file per module. If the source file is too big, use a
folding editor to manage it:

http://en.wikipedia.org/wiki/Code_folding

Rich.

--
Richard Jones
Red Hat

Re: "ocaml_beginners"::[] Creating Library

2009-11-30T03:53:15Z

Romeyke, Andreas wrote:

> Hello,
>
> Am Montag, den 30.11.2009, 11:32 +0000 schrieb Hugo Ferreira:
>
>> I don't know how to create libraries but note that whenever
>> you create a file you are in effect creating a module with the
>> name of that file (capitalize first letter). So all of the
>> of the functions in say "experts/expert_isunknown.ml" should
>> be invoked with "Expert_isunknown." preceding the function name
>> or alternatively with "open Expert_isunknown".
>
> That I am already know.
>> That being said you can try to :
>> a) Create a Expert module that _includes_ all others
>
> I would avoid this to allow independent development of expert-modules
>
>> b) Pack those modules via compilation into a single one
>
> I already compiled alle experts/expert_*.ml into one expert.cmxa using
> interface-file experts.mli
>

Their is a compilation option that does this [see 1 section 11.2 ]. As I
said I don't know how this works but maybe someone more knowledgeable
can help.

R,
Hugo F.

[1] http://caml.inria.fr/pub/docs/manual-ocaml/manual025.html

> But how can I avoid to use something like
>
> "open Expert_isunknown"
> "open Expert_ispage"
> ...
> and so on
>
> in my foo.ml file? Or in other words, if experts.cmxa is my library and
> experts.mli is my interface, what I need to do compiling foo.ml right?
>
> Bye Andreas
>

Re: "ocaml_beginners"::[] Creating Library

2009-11-30T03:40:58Z

Hello,

Am Montag, den 30.11.2009, 11:32 +0000 schrieb Hugo Ferreira:

>
> I don't know how to create libraries but note that whenever
> you create a file you are in effect creating a module with the
> name of that file (capitalize first letter). So all of the
> of the functions in say "experts/expert_isunknown.ml" should
> be invoked with "Expert_isunknown." preceding the function name
> or alternatively with "open Expert_isunknown".

That I am already know.
>
> That being said you can try to :
> a) Create a Expert module that _includes_ all others

I would avoid this to allow independent development of expert-modules

> b) Pack those modules via compilation into a single one

I already compiled alle experts/expert_*.ml into one expert.cmxa using
interface-file experts.mli

But how can I avoid to use something like

"open Expert_isunknown"
"open Expert_ispage"
...
and so on

in my foo.ml file? Or in other words, if experts.cmxa is my library and
experts.mli is my interface, what I need to do compiling foo.ml right?

Bye Andreas

--
Andreas Romeyke
- Abteilung Blindenschrift -
Deutsche Zentralbücherei für Blinde zu Leipzig (DZB)
Gustav-Adolf-Straße 7, 04105 Leipzig
Tel: +49 341 7113-..., Fax: +49 341 7113-125
Internet: www.dzb.de
E-Mail: andreas.romeyke@...

[Non-text portions of this message have been removed]

Re: "ocaml_beginners"::[] Creating Library

2009-11-30T03:32:40Z

Hi Andreas,

Romeyke, Andreas wrote:

> Hello,
>
> My project has different Modules and compilation and linking works well.
> Now I want to split a module "experts.ml" into many different
> module-parts under directory "experts/":
>
> experts/expert_isunknown.ml
> experts/expert_ispage.ml
> experts/expert_isnum.ml
> ...
>
> But the other modules (foo.ml) tries to open the original "experts.ml",
> which should be replaced by a library of the new expert-module-parts.
>
> First I have defined a new experts.mli file, the file "experts.cmxa" is
> built correctly with
> ocamlopt -a -o experts.cmxa expert_isunknown.ml expert_ispage.ml ...
>
> but ocaml now triggers following error by compiling foo.ml with
> experts.cmxa:
>
> Unbound module Experts
>
> How to do this correctly?
>

I don't know how to create libraries but note that whenever
you create a file you are in effect creating a module with the
name of that file (capitalize first letter). So all of the
of the functions in say "experts/expert_isunknown.ml" should
be invoked with "Expert_isunknown." preceding the function name
or alternatively with "open Expert_isunknown".

That being said you can try to :
a) Create a Expert module that _includes_ all others
b) Pack those modules via compilation into a single one

Maybe as a beginner solution (a) may be easiest.

Regards,
Hugo F.

> Bye Andreas

"ocaml_beginners"::[] Creating Library

2009-11-30T03:01:37Z

Hello,

My project has different Modules and compilation and linking works well.
Now I want to split a module "experts.ml" into many different
module-parts under directory "experts/":

experts/expert_isunknown.ml
experts/expert_ispage.ml
experts/expert_isnum.ml
...

But the other modules (foo.ml) tries to open the original "experts.ml",
which should be replaced by a library of the new expert-module-parts.

First I have defined a new experts.mli file, the file "experts.cmxa" is
built correctly with
ocamlopt -a -o experts.cmxa expert_isunknown.ml expert_ispage.ml ...

but ocaml now triggers following error by compiling foo.ml with
experts.cmxa:

Unbound module Experts

How to do this correctly?

Bye Andreas
--
Andreas Romeyke
- Abteilung Blindenschrift -
Deutsche Zentralbücherei für Blinde zu Leipzig (DZB)
Gustav-Adolf-Straße 7, 04105 Leipzig
Tel: +49 341 7113-..., Fax: +49 341 7113-125
Internet: www.dzb.de
E-Mail: andreas.romeyke@...

[Non-text portions of this message have been removed]

strange expression type mismatch

2009-11-27T07:29:31Z

Hi all !
First of all please excuse me for my bad english...

I have this noobish problem...
I have a function in file B that has as formal parameters, variables
of type A.a1, A.a2 and so on .
When i try to call this function from file A i get this compilation error :

File "A.ml", line 88, characters 63-64:
Error: This expression has type
instruction = inst_type * element * element * element
but an expression was expected of type
A.instruction =
A.inst_type * A.element *
A.element * A.element

instruction as you can imagine is defined in A as
type instruction = inst_type * element * element * element.

Ah and before i forget, the types instruction, inst_type,element are the types A.a1,A.a,...
I mentioned before.

Thanks you all for your help !!

"ocaml_beginners"::[] Re: indentation question

2009-11-26T14:02:58Z

Hi

--- In ocaml_beginners@..., Martin DeMello <martindemello@...> wrote:
>
> is this an omlet.vim bug, or am i doing something stylistically wrong?
> i expected the 'done' matching the 'for j' to outdent.

It works perfectly well on my machine.
I think you should not use omlet : it has been integrated into vim quite a long time ago.
Omlet is probably outdated now w.r.t. the standard vim-ocaml plugin.

V.

Re: "ocaml_beginners"::[] indentation question

2009-11-26T10:56:42Z

On Thu, Nov 26, 2009 at 10:37:35PM +0530, Martin DeMello wrote:

> is this an omlet.vim bug, or am i doing something stylistically wrong?
> i expected the 'done' matching the 'for j' to outdent.
>
> let refresh_board screen cfg q =
> acquire_screen();
>
> for i = 0 to (cfg.m - 1) do
> for j = 0 to (cfg.n - 1) do
> let col = board_color q.board.(i).(j) in
> let x1, y1, x2, y2 = cell_boundaries i j in
> rectfill screen x1 y1 x2 y2 col
> done
> done;
>
> release_screen()

I'd say that's a vim bug. Here's how emacs / tuareg-mode formats it:

let refresh_board screen cfg q =
acquire_screen();

for i = 0 to (cfg.m - 1) do
for j = 0 to (cfg.n - 1) do
let col = board_color q.board.(i).(j) in
let x1, y1, x2, y2 = cell_boundaries i j in
rectfill screen x1 y1 x2 y2 col
done
done;

release_screen()

Rich.

--
Richard Jones
Red Hat

Re: "ocaml_beginners"::[] indentation question

2009-11-26T09:12:08Z

oops, looks like gmail destroyed the formatting. here's a pastie:
http://pastebin.org/57496
martin

On Thu, Nov 26, 2009 at 10:37 PM, Martin DeMello
<martindemello@...> wrote:

>
>
>
> is this an omlet.vim bug, or am i doing something stylistically wrong?
> i expected the 'done' matching the 'for j' to outdent.
>
> let refresh_board screen cfg q =
> acquire_screen();
>
> for i = 0 to (cfg.m - 1) do
> for j = 0 to (cfg.n - 1) do
> let col = board_color q.board.(i).(j) in
> let x1, y1, x2, y2 = cell_boundaries i j in
> rectfill screen x1 y1 x2 y2 col
> done
> done;
>
> release_screen()
>
>

"ocaml_beginners"::[] indentation question

2009-11-26T09:07:35Z

is this an omlet.vim bug, or am i doing something stylistically wrong?
i expected the 'done' matching the 'for j' to outdent.

let refresh_board screen cfg q =
acquire_screen();

for i = 0 to (cfg.m - 1) do
for j = 0 to (cfg.n - 1) do
let col = board_color q.board.(i).(j) in
let x1, y1, x2, y2 = cell_boundaries i j in
rectfill screen x1 y1 x2 y2 col
done
done;

release_screen()

"ocaml_beginners"::[] Re: Combinations of lists -- tail recursive

2009-11-26T09:07:04Z

Hi,

I came up with the following snippet. Hopefully it's tail recursive and can save you a few list flips.

---- code ----
open List
let comb lol =
let _,lol = fold_left (fun (r,a) l -> not r, (if r then rev l else l)::a) (true,[]) lol in
fold_left (fun ll -> fold_left (fun tl e -> fold_left (fun t l -> (e::l)::t) tl ll) []) [[]] lol
--------------

and

---- test ----
# comb[[1;2]];;
- : int list list = [[1]; [2]]
# comb[[1;2];[3;4;5]];;
- : int list list = [[1; 3]; [1; 4]; [1; 5]; [2; 3]; [2; 4]; [2; 5]]
# comb[[1;2];[3;4;5];[6;7]];;
- : int list list =
[[1; 3; 6]; [1; 3; 7]; [1; 4; 6]; [1; 4; 7]; [1; 5; 6]; [1; 5; 7]; [2; 3; 6];
[2; 3; 7]; [2; 4; 6]; [2; 4; 7]; [2; 5; 6]; [2; 5; 7]]
--------------

Cheers
Zheng

citromatik wrote:

> In a previous post some weeks ago, I asked for advice in getting a function
> that gets all possible combinations of a list of lists using 1 element of
> each sublist. i.e.
>
> # comb;;
> comb: 'a list list -> 'a list list
> # comb [[1;2];[3;4;5];[6;7]];;
> [[1;3;6];[1;3;7];[1;4;6];[1;4;7];[1;5;6];[1;5;7];[2;3;6];[2;3;7]...]
>
> A couple of possible solutions were given (thanks to all who replied), but
> unfortunately I am getting stack overflows in complex (real) list of lists.
> So I think I need a tail recursive solution.
>
> Also I was told to write functions that does the job for a list with n
> elements (sublists) and write one (using the former) for a list with
> n+1 elements. And finally, turn this into a recursive function.
> That is what I tried:
>
> (* Function that build a lol adding the element e to each element of l *)
> let combo1N e l =
> List.map (fun x -> x::e::[]) l
>
> (* Combinations of 2 lists using the former *)
> let comboNN l1 l2 =
> let rec aux acc l =
> match l with
> [] -> List.flatten acc
> | h::t -> aux ((combo1N h l2)::acc) t
> in aux [] l1
>
> (* Combinations of 3 lists using the former *)
> let comboNNN l1 l2 l3 =
> let rec aux acc l =
> match l with
> [] -> List.flatten acc
> | h::t -> aux ((List.fold_left (fun acc x -> (h::x)::acc) [] (comboNN l2
> l3))::acc) t
> in aux [] l1
>
> Having that I end up with a recursive function that does the job:
>
> (* Combinations of lol -- recursive *)
> let rec combo (lol:'a list list) =
> match lol with
> | x::y::[] -> List.fold_left (fun acc e -> ((List.map (fun x -> x::e::[]))
> x)@acc) [] y (* = comboNN x y *)
> | l::lot ->
> let rec aux acc l =
> match l with
> | [] -> List.flatten acc
> | h::t -> aux ((List.fold_left (fun acc x -> (h::x)::acc) [] (combo
> lot))::acc) t
> in aux [] l
>
> Unfortunately, there are still cases where I get an stack overflow error, so
> I need to write the function in a tail recursive form.
> My last attempt was this:
>
> let combo (lol:'a list list) =
> let rec aux1 acc1 (l1:'a list list) =
> match l1 with
> | [] -> acc1
> | x::[] -> comboNN x (List.flatten acc1)
> | h1::t1::tl ->
> aux1 ((
> let rec aux2 acc2 (l2:'a list) =
> match l2 with
> [] -> List.flatten acc2
> | h2::t2 -> aux2 ((List.fold_left (fun acc x -> (h2::x)::acc) []
> (aux1 ([t1]) tl))::acc2) t2
> in aux2 [] h1)@acc1) (t1::tl)
> in aux1 [(List.hd lol)] (List.tl lol)
>
> But this doesn't work. I'm trying to bend my mind a bit more, but any help
> would be appreciated.
>
> Thanks in advance,
>
> M;
>

Re: "ocaml_beginners"::[] Combinations of lists -- tail recursive

2009-11-26T06:16:23Z

Martin Jambon wrote:

> citromatik wrote:
>> In a previous post some weeks ago, I asked for advice in getting a function
>> that gets all possible combinations of a list of lists using 1 element of
>> each sublist. i.e.
>>
>> # comb;;
>> comb: 'a list list -> 'a list list
>> # comb [[1;2];[3;4;5];[6;7]];;
>> [[1;3;6];[1;3;7];[1;4;6];[1;4;7];[1;5;6];[1;5;7];[2;3;6];[2;3;7]...]
>>
>> A couple of possible solutions were given (thanks to all who replied), but
>> unfortunately I am getting stack overflows in complex (real) list of lists.
>> So I think I need a tail recursive solution.
>>
>> Also I was told to write functions that does the job for a list with n
>> elements (sublists) and write one (using the former) for a list with
>> n+1 elements. And finally, turn this into a recursive function.
>> That is what I tried:
>>
>> (* Function that build a lol adding the element e to each element of l *)
>> let combo1N e l =
>> List.map (fun x -> x::e::[]) l
>>
>> (* Combinations of 2 lists using the former *)
>> let comboNN l1 l2 =
>> let rec aux acc l =
>> match l with
>> [] -> List.flatten acc
>> | h::t -> aux ((combo1N h l2)::acc) t
>> in aux [] l1
>>
>> (* Combinations of 3 lists using the former *)
>> let comboNNN l1 l2 l3 =
>> let rec aux acc l =
>> match l with
>> [] -> List.flatten acc
>> | h::t -> aux ((List.fold_left (fun acc x -> (h::x)::acc) [] (comboNN l2
>> l3))::acc) t
>> in aux [] l1
>>
>> Having that I end up with a recursive function that does the job:
>>
>> (* Combinations of lol -- recursive *)
>> let rec combo (lol:'a list list) =
>> match lol with
>> | x::y::[] -> List.fold_left (fun acc e -> ((List.map (fun x -> x::e::[]))
>> x)@acc) [] y (* = comboNN x y *)
>> | l::lot ->
>> let rec aux acc l =
>> match l with
>> | [] -> List.flatten acc
>> | h::t -> aux ((List.fold_left (fun acc x -> (h::x)::acc) [] (combo
>> lot))::acc) t
>> in aux [] l
>>
>> Unfortunately, there are still cases where I get an stack overflow error, so
>> I need to write the function in a tail recursive form.
>> My last attempt was this:
>>
>> let combo (lol:'a list list) =
>> let rec aux1 acc1 (l1:'a list list) =
>> match l1 with
>> | [] -> acc1
>> | x::[] -> comboNN x (List.flatten acc1)
>> | h1::t1::tl ->
>> aux1 ((
>> let rec aux2 acc2 (l2:'a list) =
>> match l2 with
>> [] -> List.flatten acc2
>> | h2::t2 -> aux2 ((List.fold_left (fun acc x -> (h2::x)::acc) []
>> (aux1 ([t1]) tl))::acc2) t2
>> in aux2 [] h1)@acc1) (t1::tl)
>> in aux1 [(List.hd lol)] (List.tl lol)
>>
>> But this doesn't work. I'm trying to bend my mind a bit more, but any help
>> would be appreciated.
>
>
> I did not follow the thread at the time, but here is what I would do:
>
>
> let iter_product f ll =
> let aa = Array.map Array.of_list (Array.of_list ll) in
> let n = Array.length aa in
> let zero = Array.make n 0 in
> let rec next p q =
> (f q : unit);
> (try
> for i = 0 to n - 1 do
> let pi = p.(i) + 1 in
> let m = Array.length aa.(i) in
> if pi >= m then (
> p.(i) <- 0;
> q.(i) <- aa.(i).(0)
> )
> else (
> p.(i) <- pi;
> q.(i) <- aa.(i).(pi);
> raise Exit
> )
> done
> with Exit -> ()
> );
> if p <> zero then
> next p q
> in
> next (Array.make n 0) (Array.init n (fun i -> aa.(i).(0)))
>
> let build_product ll =
> let accu = ref [] in
> iter_product (fun p -> accu := Array.copy p :: !accu) ll;
> !accu

Or this ;-) :

let flatten ll =
List.rev (List.fold_left (fun accu l -> List.rev_append l accu) [] ll)

let map f l =
List.rev (List.rev_map f l)

let combine ll =
let rec comb accu = function
[] -> accu
| l :: ll ->
let accu =
flatten (
map (fun x -> map (fun l -> x :: l) accu) l
)
in
comb accu ll
in
comb [[]] (List.rev ll)

Martin

--
http://mjambon.com/