- About the design and implementation - 1 Update
- A more optimized StringTree - 1 Update
- About my StringTree and benchmark - 1 Update
| Ramine <ramine@1.1>: Feb 18 02:46PM -0800 Hello, As you have noticed i have implemented a really fast StringTree that is considered a good industrial library because of its quality, you have to understand me, the important factor that pushed me to design and implement such library is that i wanted to design a kind of graphical interface that in text mode for my parallel archiver, but what i have noticed, is that programming is really interesting , cause an efficient programming have to use divide an conquer methods to design those libraries, the divide and conquer methods do permit us to reduce the complexity of programming, for example to design a kind of text mode graphical interface for my parallel archiver i have to use my Winmenus library and use my new StringTree Library and use of course my parallel archiver library, but the divide and conquer methods have allowed me to reduce the complexity of the design and implementation of my projects, because this divide and conquer methods allow us to apply reusability to reduce the complexity, and allow us also to divide the projects efficiently between different members of the devellopement team, and this is really efficient, cause this divide and conquer methods look like parallel programming where each individual of the team is considered a thread that implement a part of the project and that have to present to the rest of the team the "interface" of its objects and and libraries that will permit his objects and libraries to interconnect with the rest of the team's objects and libraries really efficiently, and this way of designing and implementing is really efficient and it reduces the complexity and it cuts on the time of the design and implemention. Thank you for your time. Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Feb 18 02:13PM -0800 Hello, I have optimized more my StringTree, now adding files to directories is faster... I have redone a benchmark for my new StringTree, and i have created 10 directories with 100000 file each, on my CPU Quadcore Q6600 clocked at 2.4 Ghz and it has scored only 2.4 seconds to create the one million files, my previous version of StringTree have scored 2.8 seconds, so my new version is really very fast ! and i have done a FindFile() on a file's name that is contained in each directory that contains 100000 files and it has took 7200 microseconds, the delete's methods are also really very fast, so my StringTree library is really very fast and it can be considered to have the same level of quality as a good industrial library. You can download my StringTree from, the new version is still at 1.0: https://sites.google.com/site/aminer68/stringtree Thank you, Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Feb 18 10:21AM -0800 The delete's methods are very fast also... |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment