Browse thread
Avoiding shared data
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Martin Chabr <martin_chabr@y...> |
| Subject: | Ant: Re: [Caml-list] Avoiding shared data |
Hello William, I am using a mutable record. I am programming this 90% in the imperative (non-functional) style, so that I can rewrite critical parts into Fortran easily. Another reason is, I am an intermediate user and finding out whether the recursion is a tail-one or not is difficult for me. This is a kind of number crunching problem and the data structures will be huge. Blessed are the creators of OCaml for the inclusion of all imperative constructs. Martin --- William Lovas <wlovas@stwing.upenn.edu> schrieb: > Hi Martin, > > On Sun, Sep 25, 2005 at 11:32:02PM +0200, Martin > Chabr wrote: > > [...] But I cannot use the same scheme to the > > array of the (int * record) structures, because I > do > > not know how to copy these structures to dissolve > the > > sharing. I do not even know how to copy records. > > [...] How can I produce completely > > unshared structures? > > Maybe i'm missing something, but if these are > unmutable records, then why > do you need to concern yourself with any potential > sharing? As long as the > array cells are not "shared" -- which they can't be, > as far as i know -- > you can update each one individually no matter what > the sharing status of > their contents is. > > If the records *are* mutable, then the suggestion to > use Array.init should > be sufficient. > > Hoping i might save you some work :) > > William > Martin Chabr Hochstrasse 28 8044 Zürich Schweiz / Switzerland Tel.P.: 01-261 17 24 ___________________________________________________________ Gesendet von Yahoo! Mail - Jetzt mit 1GB Speicher kostenlos - Hier anmelden: http://mail.yahoo.de