| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | Wierd Watcom problem w/ DLLs |
On Sunday March 10 1996 at 04:20, Peter Fitzsimmons wrote to Coridon Henshaw: PF> If you gave me some idea of your API It's basicly a recursive file find function that populates an array with all the files found in and under a given path. Space for each file name is seperatly malloc()ed and a pointer to the name is stored in the array. The array is allocated by the caller passed to the function as a pointer. The function realloc()s the array if it runs out of space. I will be modifying the function to allocate the array itself and then adding a destroy API to free() the file names and the remainder of the array data. PF> i'd probably be able to suggest a logical "close" or "destroy" api. Yeah, I figured that one out a few hours after I wrote the message. I'm totally self-taught in programming (although I've been messing around for 5 years now, mostly with BASIC) so I tend to take a little longer to find a solution to a given problem. And the solution that I come up with is often unorthodox to say the least. This thing that I've been having problems with, which you may have seen floating around as FBDIFF, is only my 3rd non-trivial C program. PF> When you use C++ classes, this type of approach is a natural part of the PF> language. I've been learning C++, but I haven't done anything with it yet. The OO overhead doesn't seem to justify the easy of maintance just yet. --- GoldED/2 2.50 UNREG* Origin: For sale: 30 pieces of silver. Contact N. Gingrich. (1:250/820) SEEN-BY: 50/99 78/0 270/101 620/243 711/401 409 410 413 430 808 809 934 955 SEEN-BY: 712/407 515 517 628 713/888 800/1 7877/2809 @PATH: 250/820 501 99 3615/50 396/1 270/101 712/515 711/808 809 934 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.