Hello,
Say I want to implement a kind of linked list which node data may be anything.
Thus I cannot store data on place (in nodes), indeed; so it should be
referenced. But pointers themselves are supposed to be typed. So, how can I do
that?
type list = ^node;
node = record
data : ?
Hi,
I'm trying to update a set of database components (FBLib) used with tiOPF.
In FPC 2.2.0 (32bit linux) everything compiled and worked fine. Today I
tried to compile my latest version of FBLib (as is found in tiOPF
repository) with FPC 2.4.1 (64bit linux). I don't know if the following
problems
Mattias Gaertner het geskryf:
>
> No. The fcl-passrc is not optimized for speed (it uses TList and
> creates a lot of strings) and I would estimate it supports only
> half of the fpc languages features.
Excluding your comment on lacking fpc language features... Is the speed
difference between fc
On 23 Apr 2010, at 09:45, Graeme Geldenhuys wrote:
1) First I had the problem that FPC couldn't find 'Libc' unit used
in the
uses clause. No idea why - maybe Libc unit is only 32bit?
Yes, it is.
2) This got me a bit further, to the code shown below. Is there a
baseunix
equivalent to Lib
On Fri, 23 Apr 2010 09:58:25 +0200
Graeme Geldenhuys wrote:
> Mattias Gaertner het geskryf:
> >
> > No. The fcl-passrc is not optimized for speed (it uses TList and
> > creates a lot of strings) and I would estimate it supports only
> > half of the fpc languages features.
>
> Excluding your co
In our previous episode, Graeme Geldenhuys said:
> 1) First I had the problem that FPC couldn't find 'Libc' unit used in the
> uses clause. No idea why - maybe Libc unit is only 32bit? Anyway, I
> replaced 'Libc' in uses clause with 'baseunix' and continued...
In addition to Jonas:
Libc is a Lin
Try the following:
type list = ^node;
node = record
data : Variant;
next : list;
end;
Variant can store a lot pf data types, however please note that it's very
slow type.
You also must remember that Pascal is Strong typed, unlike C or duck type
languages.
The Pointer type st
Jonas Maebe het geskryf:
>> uses clause. No idea why - maybe Libc unit is only 32bit?
>
> Yes, it is.
What I expected due to Kylix compatibility.
> No, there is not. You have to manually import it from the C library.
> You can look at rtl/unix/cwstring.pp to see the declaration of this
> fu
Hi list.
Before I think about creating about report i better ask if it is
possible to have static string in a class. The following construct
fails using fpc 2.4.0 during the decrease of ansistring references.
When cl.free is called, the call to CleanupInstance correctly identifies
cl.c as a
On 4/23/2010 3:33 AM, spir ☣ wrote:
Say I want to implement a kind of linked list which node data may be anything.
Thus I cannot store data on place (in nodes), indeed; so it should be
referenced. But pointers themselves are supposed to be typed. So, how can I do
that?
The key to solving
Hallo,
Mar 30, Mar 30, Michael Van Canneyt wrote to lists.fpc-pas...@duinheks.nl...:
MVC > You must use -S2 or -Sd to see them. Or put {$mode objfpc} or {$mode
MVC > delphi}
MVC > in your sources.
I tried all the hints I got. But still no luck.
In all my sources include at the beginning:
{
On 23 Apr 2010, at 14:57, lists.fpc-pas...@duinheks.nl wrote:
I'm still stuck. Who can tell me what's wrong?
Without a self-contained compilable example that demonstrates the
problem: probably nobody.
Jonas
___
fpc-pascal maillist - fpc-pasca
On Fri, 23 Apr 2010 08:17:21 -0400
Doug Chamberlin wrote:
> On 4/23/2010 3:33 AM, spir ☣ wrote:
> > Say I want to implement a kind of linked list which node data may be
> > anything. Thus I cannot store data on place (in nodes), indeed; so it
> > should be referenced. But pointers themselves ar
1° Using the root class TObject might be a good alternative?
Storing any object within the structure is easy.
Getting the object back will need a type overwrite.
2° Concerning standard structures, you might want to look at TList, TObjectList,
TInterfacedList, TComponentList, TStringList which prov
On 23/04/2010 14:08, spir ☣ wrote:
On Fri, 23 Apr 2010 08:17:21 -0400
Doug Chamberlin wrote:
On 4/23/2010 3:33 AM, spir ☣ wrote:
Say I want to implement a kind of linked list which node data may be anything.
Thus I cannot store data on place (in nodes), indeed; so it should be
referenced.
15 matches
Mail list logo
