Completed

Java Name Reference, Open Source

I am trying to build a caching system for a gui component, This is a JList and a JTextField, Its basically an incremental searching wigit. This system will cache views of the list data as nodes in a tree. This is not the same thing as implementing a tree datastructure on the list. Though we may consider that as an additional enhancement. As the user types the list is narrowed, similar to MS Help UI. However Java needs optimization for list larger than 100,000 list items. So my solution is to use a tree for the cache made of HashMap's where there are N-Branches per node. On initial startup of the application 2 levels of cache will automatically be generated for a-z keyboard entries, and we may look at automatically generating deeper levels on list larger than 1000. Each cache entry will be a key value pare, 'a' character + value( an array of Index objects) Index objects simply hold a location in the master array for the item and return the toString of that item. I have a ListModel which handles Index objects.

The idea here is to gain enough efficiency to handle lightning fast incremental searches of very large list of say 1,000,000 items. We will see what it handles after this optimization.

You will be enhancing source from an open source [url removed, login to view] will also need to use and modify some batch files I have to setup a release file for this IncrementalSearchBean. I might even pay extra to have you complete the filtering, which is basically a query mechanism. But the idea is lightweight, and not dependent on 3rd party libs for the query, and fast. I'm currently comparing bitsets for the query filter.

NOTE: in the zip file provided look in the net/sourceforge/javaref/search folder for the IncrementalSearchBean classes.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.

b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.

3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

* * *This broadcast message was sent to all bidders on Monday Jan 17, 2005 12:29:33 PM:

I'm posting this bid because I am working many hours on my new job, and I've begun to run out of spare time for the Common Public License open source projects that I've been wanting to see completed to a better state.

This IncrementalSearchBean is an artifact I'm spinning off of this Java Name Reference project. I need this bean most desperately for the Java Name Reference project, but I plan on using it for many other things, as well as offering it to anyone for thier open source or comercial use.

I'm asking for a lot of work for the $100, not just creating a data structure or a method or a single object. But to fix and finish up this more complex set of objects. But primarily to implement this caching feature and integrate it into the currently working search and filter mechanism. You may think this works ok, but try it with list as large as 30,000 or 100,0 00 or 1,000,000 and it doesnt.

thanks

* * *This broadcast message was sent to all bidders on Monday Jan 17, 2005 12:30:32 PM:

I'm posting this bid because I am working many hours on my new job, and I've begun to run out of spare time for the Common Public License open source projects that I've been wanting to see completed to a better state.

This IncrementalSearchBean is an artifact I'm spinning off of this Java Name Reference project. I need this bean most desperately for the Java Name Reference project, but I plan on using it for many other things, as well as offering it to anyone for thier open source or comercial use.

I'm asking for a lot of work for the $100, not just creating a data structure or a method or a single object. But to fix and finish up this more complex set of objects. But primarily to implement this caching feature and integrate it into the currently working search and filter mechanism. You may think this works ok, but try it with list as large as 30,000 or 100,0 00 or 1,000,000 and it doesnt.

thanks

## Platform

System Independent, any OS

Skills: Java, PHP

See more: single name reference java, work reference, working after hours job, where to hire a coder to help you, what is tree in data structure, what is tree data structure, what is system ui, what is searching in data structure, what is ms project plan, what is a tree node, what is a tree in data structure, what is a tree data structure, what is a data structure, what are the types of data structure, what are the application of data structure, what are data structure, use of tree data structure, types of tree in data structure, types of searching in data structure, types of data structure

About the Employer:
( 6 reviews ) Delaware AR, United States

Project ID: #3510821

Awarded to:

lument

See private message.

$42.5 USD in 90 days
(2 Reviews)
1.5

5 freelancers are bidding on average $68 for this job

bizteche

See private message.

$42.5 USD in 90 days
(24 Reviews)
4.0
oxygenteam

See private message.

$85 USD in 90 days
(13 Reviews)
3.9
poweribo

See private message.

$85 USD in 90 days
(1 Review)
1.9
DoomDoomDev

See private message.

$85 USD in 90 days
(1 Review)
1.3