Thread View: comp.lang.c++.leda
2 messages
2 total messages
Started by Chris Cross
Fri, 06 Oct 1995 12:30
long file names in DOS?
Author: Chris Cross
Date: Fri, 06 Oct 1995 12:30
Date: Fri, 06 Oct 1995 12:30
10 lines
740 bytes
740 bytes
I'm having trouble building 3.2 libraries in DOS due to long names for some of the files. The first one it hits is gen_array.h. I'm using the same tar.z I used to build leda on Unix, however, I unpacked it using gtar on OS/2, attempting to build in a VDM. Is there a different package that I should use for DOS or maybe a different method of unpacking? thanks, chris optik@nr.infi.net
R 3.3 Beta Release
Author: Christian Uhrig
Date: Fri, 20 Oct 1995 15:49
Date: Fri, 20 Oct 1995 15:49
86 lines
2883 bytes
2883 bytes
Hi,
we just put the version R-3.3b on our ftp server
(ftp.mpi-sb.mpg.de in /pub/LEAD).
You can find it in LEDA-R-3.3.b.tgz
It is a beta release but we hope that many of you will install it and
send us their comments.
The major changes are:
+==============================================================================+
| |
| LEDA-R 3.3 - beta |
| |
+==============================================================================+
- const-ref parameters
All parameterized data types now use const reference parameters
for argument passing. This avoids unnecessary copy operations
which is particularly important when using non-simple type parameters.
NOTE: There is a bug in the current version of the g++ compiler (2.6.3
and 2.7.0). When passing constants to functions with const-ref
parameters type conversion is not done properly. In particular,
constant 0 (NULL) cannot be passed to a function taking some
"const T*&" parameter. For instance when useing a list of type
list<char*> L; you cannot append the NULL-pointer by L.append(0);
You have to use a cast as in L.append((char*)0).
- set<T>
new operations for intersection, union, and difference of sets
- graphs
The implementation of graphs has been rewritten. Now undirected graphs
again have ordered adjacency lists (as in previous versions of LEDA)
and you can specify where a new edge is to be inserted into the adjacency
lists of both the source and target node of the edge.
Please read the manual pages for graphs !
- windows & panels
The window and panel types have been extended and (hopefully) improved.
Now panels and windows are essentially the same and you can include
panel items into your windows. A short description of the new features
can be found in "Changes.window" in this directory. Note that the current
implementation is still experimental.
- internals
change of some global function names
Copy --> leda_copy
Convert --> leda_cast
Access --> leda_access
Clear --> leda_clear
Create --> leda_create
Int_Type --> leda_itype
Type_Name --> leda_tname
Best regards,
Stefan N"aher
Christian Uhrig
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads