Easy way to copy a file?

[alkis]

An array that is able to double its length (with realloc) works best here.
My 'ls' works like that, starting with 100 length.

[AGS]

Reallocating would mean to copy all current contents, doesn't it?

[alkis]

means AllocDoubleMem/CopyMem/FreeOldMem yeah
But it's a win speedwise, I've tested when I was fiddling with an 'ls' kind of program.

[AGS]

Ok. I am going to use an array. For 10 bytes of content per object an overhead of 8 further bytes for the minnode structure is too much.

Now this is the plan so far:

- when user clicks on "cut" or "copy", the list of selected filenames and the source dir path are temporary stored in the base structure of the filemanager class
- selecting other files and another click on these two buttons replaces the temporary list

- when user clicks "paste" that list is stepped through with Examine()
- each encountered file is shared-locked and stored in the array
- each dir encountered is also stored and locked, but triggers the ExAll() recursively on its contents
- any file or directory object found by that ExAll()s is locked and stored in the array

- each directory level of ExAll() gets it's own ExAllControl structure and ExAllBuffer, while that Buffer is allocated depending on free memory
- pointer to that structure, the current dir lock and the buffer pointer are stored on the stack (12 bytes per level)

[Thorham]

Reallocating an array and then copying it's contents isn't necessary. You can just allocate extra arrays as needed. The first long word in each array simply links to the next array. These link pointers are also used for freeing the arrays when they're no longer needed.

Easy

[AGS]

Perfect idea, thanks.

What I need is some current-position pointer or such.

[Thorham]

Originally Posted by AGS

What I need is some current-position pointer or such.

Yes, a current pointer is fine, especially because you can just use something simple like move.l d0,(a0)+.

[AGS]

And make each part of the array the same size and substract 1 from max items until the end is reached. then allocate next one.

[Thorham]

Originally Posted by AGS

And make each part of the array the same size and substract 1 from max items until the end is reached. then allocate next one.

Yes, nothing but a simple for loop, really.

[AGS]

And i am going to keep a pointer to the start of the current array to store the pointer to the next one there.

[Thorham]

Originally Posted by AGS

And i am going to keep a pointer to the start of the current array to store the pointer to the next one there.

Yes, very simple stuff

[AGS]

Implementing drag and drop would be the next step after this... yet not so easy but I did it once and it can only become better as I learned from that.

[alkis]

Originally Posted by Thorham

Reallocating an array and then copying it's contents isn't necessary. You can just allocate extra arrays as needed. The first long word in each array simply links to the next array. These link pointers are also used for freeing the arrays when they're no longer needed.

Easy

Well, having the pointers to the array in a continuous block in memory makes certain things easier. Like sorting. ;-)

But, here in this case, sorting might not be needed, so yeah...