I sent an end answer in issue about S3:
https://github.com/silvioprog/brookframework/issues/14
Sorry for my delays in answer please.
--
Silvio Clécio
My public projects - github.com/silvioprog
___
fpc-pascal maillist - fpc-pascal@lists.freepascal.or
Am 22.03.2013 02:32 schrieb "Xiangrong Fang" :
>
> Hi,
>
> I missed the key point. This bug should be fixed in 2.7.1, but I am now
using 2.6.0. Now there is another problem:
>
> If I change my code to this:
>
>
> TTreapEnumerator = class
> FStack: TStack;
> FCurrent: PNode;
Hi,
I missed the key point. This bug should be fixed in 2.7.1, but I am now
using 2.6.0. Now there is another problem:
If I change my code to this:
TTreapEnumerator = class
FStack: TStack;
FCurrent: PNode;
public
*constructor Create(root: PNode);*
de
Hi,
I try to do exactly the same as show here:
QUOTE:
http://svn.freepascal.org/svn/fpc/trunk/packages/fcl-stl/src/gvector.pp
generic TVector = class
... ...
type
TVectorEnumerator = class
private
FVector: TVector;
FPosition: SizeUInt;
FFirstDone: Boolean;
fu
--- On Thu, 3/21/13, kyan wrote:
>
> HTH
>
> Constantine
Are you the man who created Kyan Pascal? I used that many
years ago.
___
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal
Already reported as bug #0023357 in the bugtracker.
Bart
On 3/21/13, Daniel Gaspary wrote:
> The page "Command-line options and switches Reference chart.. "[1]
> referenced at Manuals page[2] seems to be buggy.
>
> [1] http://www.freepascal.org/docs-html/chart/chart.html
> [2] http://www.freepas
On 3/21/2013 09:59, Xiangrong Fang wrote:
I am not creating a new thread, but just replied it.
your post did not contain a references control line pointing to the post you
were replying to... that breaks the linking and it won't be placed in the tree...
my 2 centavos...
My question is abou
2013/3/21 Flávio Etrusco
> On Thu, Mar 21, 2013 at 1:39 PM, silvioprog wrote:
> > 2013/3/21 Marcos Douglas
> >>
> >> On Thu, Mar 21, 2013 at 12:30 PM, silvioprog
> wrote:
> >> > 2013/3/21 Sven Barth
> >> > (...)
> >>
> >> As I said to you, I can help to codify this part... but you didn't
> >>
On Thu, Mar 21, 2013 at 1:39 PM, silvioprog wrote:
> 2013/3/21 Marcos Douglas
>>
>> On Thu, Mar 21, 2013 at 12:30 PM, silvioprog wrote:
>> > 2013/3/21 Sven Barth
>> > (...)
>>
>> As I said to you, I can help to codify this part... but you didn't
>> answer my last question (link #14) and now you
On Thu, Mar 21, 2013 at 1:39 PM, silvioprog wrote:
> 2013/3/21 Marcos Douglas
>>
>> On Thu, Mar 21, 2013 at 12:30 PM, silvioprog wrote:
>> > 2013/3/21 Sven Barth
>> >>
>> >> Am 20.03.2013 09:18, schrieb Michael Schnell:
>> >>
>> >>> Of course Android is a rather hot topic in the fpc and Lazarus
Make the enumerator class nested in the generic class. Inspiration:
http://svn.freepascal.org/svn/fpc/trunk/packages/fcl-stl/src/gvector.pp
--
View this message in context:
http://free-pascal-general.1045716.n5.nabble.com/enumerate-generic-trees-tp5713735p5713739.html
Sent from the Free Pascal
The page "Command-line options and switches Reference chart.. "[1]
referenced at Manuals page[2] seems to be buggy.
[1] http://www.freepascal.org/docs-html/chart/chart.html
[2] http://www.freepascal.org/docs-html/
___
fpc-pascal maillist - fpc-pascal@l
2013/3/21 Marcos Douglas
> On Thu, Mar 21, 2013 at 12:30 PM, silvioprog wrote:
> > 2013/3/21 Sven Barth
> >>
> >> Am 20.03.2013 09:18, schrieb Michael Schnell:
> >>
> >>> Of course Android is a rather hot topic in the fpc and Lazarus
> >>> developer's forums. There are pages in the fpc / Lazaru
On Thu, Mar 21, 2013 at 12:30 PM, silvioprog wrote:
> 2013/3/21 Sven Barth
>>
>> Am 20.03.2013 09:18, schrieb Michael Schnell:
>>
>>> Of course Android is a rather hot topic in the fpc and Lazarus
>>> developer's forums. There are pages in the fpc / Lazarus Wiki on Android.
>>
>> Ehm... you do kn
Hi There,
I encountered a problem writing enumerator for my generic tree. The
enumerator class looks like this:
TTreapEnumerator = class
FStack: TStack;
FCurrent: TTreap.PNode;
public
constructor Create(ANode: TTreap.PNode);
destructor Destroy; override;
function MoveNext:
Tomas Hajny wrote:
What I was expecting is that the compilation fails in all cases.
Is there some flag that I failed to specify?
You can add {$X-} to the top (i.e. disable the so-called extended syntax
allowing to treat functions like procedures) and then it fails. However, I
think that it shoul
Oops, I forgot the link:
https://github.com/silvioprog/brookframework/issues/14
2013/3/21 silvioprog
> 2013/3/21 Sven Barth
>
>> Am 20.03.2013 09:18, schrieb Michael Schnell:
>>
>> Of course Android is a rather hot topic in the fpc and Lazarus
>>> developer's forums. There are pages in the fp
2013/3/21 Sven Barth
> Am 20.03.2013 09:18, schrieb Michael Schnell:
>
> Of course Android is a rather hot topic in the fpc and Lazarus
>> developer's forums. There are pages in the fpc / Lazarus Wiki on Android.
>>
> Ehm... you do know that "Amazon S3" <> "Samsung Galaxy S3"? Amazon S3 is
> the
Gerhard Scholz wrote:
This must be read as follows:
function Tmp: Double;
begin
Result := 10; // there is a semicolon (mispelling?) [statement 1]
+ Element;[statement 2]
end;
So, Result becomes 10.
Yes, that's what happens and, yes it's a miss
I am not creating a new thread, but just replied it. My question is about
algorithm not syntax. I will try the sample program by Kyan.
Thanks.
2013/3/21 Michael Schnell
> I have read this. My question is not about how to write enumerator, but
>> how to do this for TREEs
>>
>
> Xiangrong Fan
On Thu, March 21, 2013 10:53, OBones wrote:
Hello,
> I'm using FPC 2.6.0 and have the following test program :
>
> program test;
>
> function Element: Double;
> begin
>Result := 4;
> end;
>
> function Tmp: Double;
> begin
>Result := 10; + Element;
> end;
>
> begin
>WriteLn(Tmp);
> en
This must be read as follows:
function Tmp: Double;
begin
Result := 10; // there is a semicolon (mispelling?) [statement 1]
+ Element;[statement 2]
end;
So, Result becomes 10.
The next line is a function call without storing the result. The lea
I was told that it will be possible in 2.7...
If you like, take a look at my TTreap class, which can be used as a hash
table:
https://github.com/xrfang/fpcollection/blob/master/src/units/treap.pas
2013/3/21 S. Fisher
> Is there any way to iterate over a TFPDataHashTable ?
>
> _
On Thu, Mar 21, 2013 at 7:58 AM, Sven Barth wrote:
> Am 20.03.2013 09:18, schrieb Michael Schnell:
>
>> Of course Android is a rather hot topic in the fpc and Lazarus developer's
>> forums. There are pages in the fpc / Lazarus Wiki on Android.
>
> Ehm... you do know that "Amazon S3" <> "Samsung Ga
Am 20.03.2013 09:18, schrieb Michael Schnell:
Of course Android is a rather hot topic in the fpc and Lazarus
developer's forums. There are pages in the fpc / Lazarus Wiki on Android.
Ehm... you do know that "Amazon S3" <> "Samsung Galaxy S3"? Amazon S3 is
the cloud storage solution by Amazon. Se
Is there any way to iterate over a TFPDataHashTable ?
___
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal
On 21-3-2013 2:14, S. Fisher wrote:
> Not actually a hash-table, but an AvgLvlTree, which can be used the
> same way. The AvgLvlTree unit comes with Lazarus; if you don't have
> that, you can download avglvltree.pas here:
>
> http://svn.freepascal.org/cgi-bin/viewvc.cgi/trunk/components/lazutils/
I have read this. My question is not about how to write enumerator,
but how to do this for TREEs
Xiangrong Fang: Please anser to a message instead of creating a new thread !
There might be no necessary sort order of a tree.
So you first need to invent a usable sort order and set up the enumera
On 03/21/2013 04:11 AM, Xiangrong Fang wrote:
Now I don't know how to write an enumerator for it. ...
Syntax or algorithm ?
-Michael
___
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal
Not actually a hash-table, but an AvgLvlTree, which can be used the
same way. The AvgLvlTree unit comes with Lazarus; if you don't have
that, you can download avglvltree.pas here:
http://svn.freepascal.org/cgi-bin/viewvc.cgi/trunk/components/lazutils/avglvltree.pas?root=lazarus&view=log
There do
Of course Android is a rather hot topic in the fpc and Lazarus
developer's forums. There are pages in the fpc / Lazarus Wiki on Android.
-Michael
___
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/f
On Thu, Mar 21, 2013 at 10:32 AM, Xiangrong Fang wrote:
> I have read this. My question is not about how to write enumerator, but how
> to do this for TREEs
Usually linearizing recursion is done with a stack. Here's a sample
implementation that will give you an in-order tree traversal (Left -
Par
Hello all,
I'm using FPC 2.6.0 and have the following test program :
program test;
function Element: Double;
begin
Result := 4;
end;
function Tmp: Double;
begin
Result := 10; + Element;
end;
begin
WriteLn(Tmp);
end.
And quite surprisingly to me, both ppc386 and pccrossx64 compile it
s
I have read this. My question is not about how to write enumerator, but how to
do this for TREEs
Thanks
发送自魅族MX
原始邮件
发件人：Mattias Gaertner
时间：3月21日 15:39 周四
收件人：fpc-pascal@lists.freepascal.org
主题：Re: [fpc-pascal] How To write an enumerator for trees
>On Thu, 21 Mar 2013 11:1
On 21-3-2013 9:10, Michael Van Canneyt wrote:
>
>
> On Thu, 21 Mar 2013, Reinier Olislagers wrote:
>
>> On 20-3-2013 21:30, Michael Van Canneyt wrote:
>>> On Wed, 20 Mar 2013, Reinier Olislagers wrote:
The program below works fine on Windows for reading e.g. info on
explorer.exe
I
On Thu, 21 Mar 2013, Reinier Olislagers wrote:
On 20-3-2013 21:30, Michael Van Canneyt wrote:
On Wed, 20 Mar 2013, Reinier Olislagers wrote:
The program below works fine on Windows for reading e.g. info on
explorer.exe
It fails on Linux (FPC trunk x64, compiled 2013/03/14) when testing with
On Thu, 21 Mar 2013 11:11:49 +0800
Xiangrong Fang wrote:
> Hi,
>
> I would like to add enumerator support for my TTreap implementation (
> https://github.com/xrfang/fpcollection/blob/master/src/units/treap.pas).
>
> The tree nodes are defined as:
>
> PNode = ^TNode;
> TNode = recor
37 matches
Mail list logo
