PureBasic Forums - English

I never use array, only linked list, it's so easy.

I will wait for native functions, i hope wishes will become reality

It's the need to mutex protect even read only linked lists when dealing with multithreads which leads me to always seek other data structures.

Denis wrote:I never use array, only linked list, it's so easy.

Usually easy things come at a price. A linked list has a lot of levels of indirection (memory access).
Arrays are a lot faster.
It's not without reason often you see heavy neural networks (an example so well suited to be represented with objects or some sort of linked lists), implemented as many parallel arrays (to optimize the speed of a factor of 3/5 times if not more).

So a sentence like yours "I never use array, only linked list" is a little scary.

I have nothing against linked lists by the way when they're not abused !

luis,
may be you're right, but that's how i code :roll:

To try to avoid heap fragmentation, i use HeapSetInformation API (Windows).

Denis wrote:luis,
may be you're right, but that's how i code :roll:

Whoops sorry, didn't want to perturb the status quo. (uhmmm I want to try the eye-rolling me too: :roll:. Nice!)

Denis wrote: To try to avoid heap fragmentation, i use HeapSetInformation API (Windows).

That completely address the multiple indirections argument ! Case closed !

Back to my hole playing with old fashioned arrays.

Denis wrote:luis,
may be you're right, but that's how i code :roll:

To try to avoid heap fragmentation, i use HeapSetInformation API (Windows).

Actually it is not needed anymore, as we do use custom, block optimized allocator: http://www.purebasic.fr/blog/?p=8

Fred wrote:

Denis wrote:luis,
may be you're right, but that's how i code :roll:

To try to avoid heap fragmentation, i use HeapSetInformation API (Windows).

Actually it is not needed anymore, as we do use custom, block optimized allocator: http://www.purebasic.fr/blog/?p=8

Ok Fred for linked list

In my project, i use a lot allocateMemory().
I will keept this API on.

srod wrote:Being able to embed dynamic lists / arrays / maps within arbitrary structures, for my money, is the most pressing requirement now for PB - at least in terms of the work I do. Not a complaint as such because PB is awesome and there are always ways around such things. In these cases I simply use a suite of utilities which I have built up over the years. Still, adding this natively to PB would, to my mind, plug the last remaining gap for me.

I agree, embedding lists, arrays and maps into structures would be extremely useful. Because it isn't possible at the moment, I had to write my own procedures for both linked lists and hash tables (maps). Implementing this would make things much easier for me, and probably for many others as well...

indeed.. that would be awesome.

c ya,
nco2k

srod wrote:Being able to embed dynamic lists / arrays / maps within arbitrary structures, for my money, is the most pressing requirement now for PB - at least in terms of the work I do. Not a complaint as such because PB is awesome and there are always ways around such things. In these cases I simply use a suite of utilities which I have built up over the years. Still, adding this natively to PB would, to my mind, plug the last remaining gap for me.

This is definitely the one feature I would like to see the most as well.

LinkedLists and Maps inside structures would be good, but IMHO not as good as multi-dimensional structures. In any case I have faith that fundamental things like this will be added sooner or later.

I want a teapot object generator!!!!

My wishlist for 4.50:
It`s not the last one.....

Only two guys are coding this very big thing (multi-plattform + 32-bit & 64-bit + etc....).
...Fred full-time and Freak is a student?

Min() Max() and predictable expression evaluation...

An easy way to create custom gadgets in PB.