Comments on: An efficient and simple object factory for PureBasic http://gushh.net/blog/2009/05/03/object-factory-for-purebasic/ This blog is about software, electronics and game development. Mon, 23 Aug 2010 18:55:07 +0000 hourly 1 http://wordpress.org/?v=3.0.1 By: GuShH http://gushh.net/blog/2009/05/03/object-factory-for-purebasic/comment-page-1/#comment-178 GuShH Mon, 23 Aug 2010 18:55:07 +0000 http://gushh.net/blog/?p=65#comment-178 Updated the code, there was a slight bug in one of the examples (number 3) -- Thanks to Richard for pointing it out! Same link as before: http://gushh.net/dls/easyobject.zip I might refactor the code for 4.50 now that dynamic lists are available, but we'll see when I get the time! Cheers. Updated the code, there was a slight bug in one of the examples (number 3) — Thanks to Richard for pointing it out!

Same link as before: http://gushh.net/dls/easyobject.zip

I might refactor the code for 4.50 now that dynamic lists are available, but we’ll see when I get the time!

Cheers.

]]> By: GuShH http://gushh.net/blog/2009/05/03/object-factory-for-purebasic/comment-page-1/#comment-67 GuShH Thu, 06 Aug 2009 11:49:44 +0000 http://gushh.net/blog/?p=65#comment-67 You're right about DeleteElement - I'll fix it later - I'm not used to PB's linked-lists mainly because I use my own (I find little use on static lists). Only recently they became faster due to the fact that they're using a memory pool (afaik) but that's not the end of the world. Eventually I'll post most of my libs in here. You’re right about DeleteElement – I’ll fix it later – I’m not used to PB’s linked-lists mainly because I use my own (I find little use on static lists). Only recently they became faster due to the fact that they’re using a memory pool (afaik) but that’s not the end of the world.

Eventually I’ll post most of my libs in here.

]]> By: andrew http://gushh.net/blog/2009/05/03/object-factory-for-purebasic/comment-page-1/#comment-66 andrew Wed, 05 Aug 2009 21:02:05 +0000 http://gushh.net/blog/?p=65#comment-66 hi i used a shift-add algorithm to generate the hash, and implemented a Get_#_type( name$ ) function that returns the address of the #_type item; it returns zero if it doesn't exist. the hash collisions are handled through the table (actually an array) with a jump-to index for items with identical hashes one thing i found out though DeleteElement should be used with the optional parameter in case the 1st element is being deleted hi i used a shift-add algorithm to generate the hash, and implemented a Get_#_type( name$ ) function that returns the address of the #_type item; it returns zero if it doesn’t exist. the hash collisions are handled through the table (actually an array) with a jump-to index for items with identical hashes

one thing i found out though DeleteElement should be used with the optional parameter in case the 1st element is being deleted

]]> By: admin http://gushh.net/blog/2009/05/03/object-factory-for-purebasic/comment-page-1/#comment-65 admin Wed, 05 Aug 2009 12:18:58 +0000 http://gushh.net/blog/?p=65#comment-65 Sounds like a useful feature, what kind of hashing algo did you use?, how are you dealing with collisions?. Sounds like a useful feature, what kind of hashing algo did you use?, how are you dealing with collisions?.

]]> By: andrew http://gushh.net/blog/2009/05/03/object-factory-for-purebasic/comment-page-1/#comment-64 andrew Tue, 04 Aug 2009 19:01:25 +0000 http://gushh.net/blog/?p=65#comment-64 thanks, the object factory is great; bolted a hash table to it so that i can address the objects by name, yay thanks, the object factory is great; bolted a hash table to it so that i can address the objects by name, yay

]]>