New to Ocaml

New to Ocaml

[chaithanya kr]

[-- Attachment #1: Type: text/plain, Size: 391 bytes --]

Hi all. I am new to Ocaml. Just started learning recently.

I was studying lists in ocaml. In that, suppose there is a list by name
singly_list, then by saying "List.length singly_list;;" I will get the
length of the linked list.

Similarly can anyone tell me as to how to sort a linked list using the
'sort' function? Please give me an example of using List.sort.

Thank you

Bye
Chaitanya

[-- Attachment #2: Type: text/html, Size: 442 bytes --]

Re: [Caml-list] New to Ocaml

[Erik de Castro Lopo]

chaithanya kr wrote:

> Hi all. I am new to Ocaml. Just started learning recently.
> 
> I was studying lists in ocaml. In that, suppose there is a list by name
> singly_list, then by saying "List.length singly_list;;" I will get the
> length of the linked list.
> 
> Similarly can anyone tell me as to how to sort a linked list using the
> 'sort' function? Please give me an example of using List.sort.

In Ocaml, lists are immutable (cannot be changed) and hence, sorting
a list results in a new list:

   let sorted_list = List.sort unsorted_list in ....

Erik
-- 
----------------------------------------------------------------------
Erik de Castro Lopo
http://www.mega-nerd.com/

Re: [Caml-list] New to Ocaml

[Miguel Pignatelli]

 >    let sorted_list = List.sort unsorted_list in ....

You should also provide to List.sort a function to compare the elements 
of the list, the function should have type:

'a -> 'a -> int

For basic types, like ints or chars the Pervasives.compare function 
would serve:

# let l  = ['g';'b';'f';'c';'a'];;
val l : char list = ['g'; 'b'; 'f'; 'c'; 'a']
# let sortedl = List.sort compare l;;
val sortedl : char list = ['a'; 'b'; 'c'; 'f'; 'g']

For user-defined types (or if you want to write your own comparison 
criteria) you should provide the comparison function. For example;

# let sortedl = List.sort (fun x y -> if x > y then 1 else 0) [5;3;7;1];;
val sortedl : int list = [1; 3; 5; 7]


Hope this helps,

M;


Erik de Castro Lopo wrote:
> chaithanya kr wrote:
> 
>> Hi all. I am new to Ocaml. Just started learning recently.
>>
>> I was studying lists in ocaml. In that, suppose there is a list by name
>> singly_list, then by saying "List.length singly_list;;" I will get the
>> length of the linked list.
>>
>> Similarly can anyone tell me as to how to sort a linked list using the
>> 'sort' function? Please give me an example of using List.sort.
> 
> In Ocaml, lists are immutable (cannot be changed) and hence, sorting
> a list results in a new list:
> 
>    let sorted_list = List.sort unsorted_list in ....
> 
> Erik

Re: [Caml-list] New to Ocaml

[Richard Jones]

On Mon, Feb 01, 2010 at 11:18:07PM -0500, chaithanya kr wrote:
> Hi all. I am new to Ocaml. Just started learning recently.

There's also a beginners group for learning OCaml:

Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Rich.

-- 
Richard Jones
Red Hat

Re: [Caml-list] New to Ocaml

[chaithanya kr]

[-- Attachment #1: Type: text/plain, Size: 413 bytes --]

I am thankful to all of you.

Bye
Chaitanya

On Tue, Feb 2, 2010 at 3:58 AM, Richard Jones <rich@annexia.org> wrote:

> On Mon, Feb 01, 2010 at 11:18:07PM -0500, chaithanya kr wrote:
> > Hi all. I am new to Ocaml. Just started learning recently.
>
> There's also a beginners group for learning OCaml:
>
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
>
> Rich.
>
> --
> Richard Jones
> Red Hat
>

[-- Attachment #2: Type: text/html, Size: 877 bytes --]