Logtalk 2.30.7 files.

git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1973 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
pmoura
2007-11-06 01:50:09 +00:00
parent 6c3aee8c63
commit 42aabce1bb
320 changed files with 2252 additions and 1289 deletions

View File

@@ -1,6 +1,6 @@
================================================================
Logtalk - Open source object-oriented logic programming language
Release 2.30.2
Release 2.30.7
Copyright (c) 1998-2007 Paulo Moura. All Rights Reserved.
================================================================
@@ -10,7 +10,7 @@ To load this example and for sample queries, please see the SCRIPT file.
This folder contains a multi-threading implementation of the merge sort
algorithm. Depending on the size of the lists that are ordered, using
only one thread can be faster. The number of threads to use in sorting
only one thread can be faster. The number of threads to be use in sorting
is set using the msort/1 object parameter. You may need to adjust the
size of the memory areas used by your Prolog compiler, depending on the
size of the lists you want to sort.
@@ -30,3 +30,7 @@ other purpose, you may find the following paper a worthwhile reading:
year = "1993",
url = "citeseer.ist.psu.edu/apt93modular.html" }
You probably want to play with the list sizes in order to find out when the
lists to be sorted are big enough to make the use of multi-threading worth
performance-wise (i.e. to compensate the overhead of thread creation and
management).

View File

@@ -1,6 +1,6 @@
================================================================
Logtalk - Open source object-oriented logic programming language
Release 2.30.2
Release 2.30.7
Copyright (c) 1998-2007 Paulo Moura. All Rights Reserved.
================================================================

View File

@@ -1,4 +1,4 @@
:- initialization((
logtalk_load(library(random_loader), [reload(skip)]),
logtalk_load(library(random_loader), [reload(skip)]), % allow for static binding
logtalk_load([generator, qsort, msort]))).