bound together
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 902
Together with Gikoneko 0.1.2.4
Together with Gikoneko allows users to show Gikoneko, a famous mascot of 2ch everywhere in firefox. more>>
Together with Gikoneko allows users to show Gikoneko, a famous mascot of 2ch everywhere in firefox.
Show Gikoneko, a famous mascot of 2ch everywhere in firefox. Materials used are Shirasus works. No English version available.
You cannot enable both Together with Foxkeh and this at the same time.
<<lessShow Gikoneko, a famous mascot of 2ch everywhere in firefox. Materials used are Shirasus works. No English version available.
You cannot enable both Together with Foxkeh and this at the same time.
Download (0.038MB)
Added: 2007-03-31 License: MPL (Mozilla Public License) Price:
940 downloads
Cache::Bounded 1.03
Cache::Bounded is a size-aware in-memory cache optimized for speed. more>>
Cache::Bounded is a size-aware in-memory cache optimized for speed.
SYNOPSIS
Cache::Bounded is designed for caching items into memory in a very fast but rudimentarily size-aware fashion.
Most intelligent caches take either a size-aware or use-aware approach. They do so by either anlysing the size of all the elements in the cache or their frequency of usage before determining which elements to drop from the cache. Unfortunately, the processing overhead for this logic (usually applied on insert) will often slow these caches singnificantly when frequent insertions are needed.
This module was designed address when this speed-penalty becomes a problem. Specifically, it is a rudimentarily size-aware cache that is optimized to be very fast.
For its size analysis, this module merely checks the number of elements in the cache against a raw size limit. (The default limit is 500,000) Additionally, to aid speed, the "size" check doesnt occur on every insertion. Only after a count of a certain number of insertions (default 1,000) is the size check performed. If the size limit has been exceeded, the entire cache is purged. (Since there is no usage analysis, there is no other logical depreciation that can be applied)
This produces a very fast in-memory cache that you can tune to approximate size based upon your data elements.
USAGE
my $cache = new Cache::Bounded;
$cache->set($key,$value);
my $value = $cache->get($key);
<<lessSYNOPSIS
Cache::Bounded is designed for caching items into memory in a very fast but rudimentarily size-aware fashion.
Most intelligent caches take either a size-aware or use-aware approach. They do so by either anlysing the size of all the elements in the cache or their frequency of usage before determining which elements to drop from the cache. Unfortunately, the processing overhead for this logic (usually applied on insert) will often slow these caches singnificantly when frequent insertions are needed.
This module was designed address when this speed-penalty becomes a problem. Specifically, it is a rudimentarily size-aware cache that is optimized to be very fast.
For its size analysis, this module merely checks the number of elements in the cache against a raw size limit. (The default limit is 500,000) Additionally, to aid speed, the "size" check doesnt occur on every insertion. Only after a count of a certain number of insertions (default 1,000) is the size check performed. If the size limit has been exceeded, the entire cache is purged. (Since there is no usage analysis, there is no other logical depreciation that can be applied)
This produces a very fast in-memory cache that you can tune to approximate size based upon your data elements.
USAGE
my $cache = new Cache::Bounded;
$cache->set($key,$value);
my $value = $cache->get($key);
Download (0.004MB)
Added: 2007-05-28 License: Perl Artistic License Price:
879 downloads
Duplicate Music Matcher 2.3
Duplicate Music Matcher is a script to quickly find duplicate MP3 files based on letter matching. more>>
Duplicate Music Matcher is a script to quickly find duplicate MP3 files based on letter matching.
Duplicate Music Matcher is helpful for weeding out duplicates that may not be of the same encoding, format, or even the same filename.
Enhancements:
- pymad pyvorbis python-flac deps were all removed in favor of mutagen
- GUI code was updated (no more SimpleGladeApp)
- Delete key have been bound in the GUI
- More accurate matching for ogg and flac files
- The filename column is now resizable
- The GUI play and stop buttons now use audacious.FLAC should now also give a length value
- Some oggs might have a huge bitrate value due to a bug in mutagen.
<<lessDuplicate Music Matcher is helpful for weeding out duplicates that may not be of the same encoding, format, or even the same filename.
Enhancements:
- pymad pyvorbis python-flac deps were all removed in favor of mutagen
- GUI code was updated (no more SimpleGladeApp)
- Delete key have been bound in the GUI
- More accurate matching for ogg and flac files
- The filename column is now resizable
- The GUI play and stop buttons now use audacious.FLAC should now also give a length value
- Some oggs might have a huge bitrate value due to a bug in mutagen.
Download (0.010MB)
Added: 2007-04-04 License: GPL (GNU General Public License) Price:
942 downloads
Data::Page::Viewport 1.02
Data::Page::Viewport is a Perl module to scroll thru data a page, or just an item, at a time. more>>
Data::Page::Viewport is a Perl module to scroll thru data a page, or just an item, at a time.
Synopsis
This is a complete, tested, runnable program.
#!/usr/bin/perl
use strict;
use warnings;
use Data::Page::Viewport;
# -----------------------------------------------
my(@data) = (qw/zero one two three four five six
seven eight nine ten eleven twelve thirteen fourteen/);
my($page) = Data::Page::Viewport -> new
(
data_size => scalar @data,
page_size => 4
);
print "Data bounds: 0 .. $#data. n";
print "Data: ", join(, , @data), ". n";
print "Page bounds: 0 .. 3. n";
print "Page data: ", join(, , @data[0 .. 3]), ". n";
print "n";
my(@bound);
for (-2, 1, 4, 4, 1, 3, 3, -2, 1, 2, 1, -4, -4,
-1, 1, 2, -1, -2, -2, -1, -4, 4, 4, 4)
{
print "Offset: $_. n";
@bound = $page -> offset($_) -> bounds();
print "Page bounds: $bound[0] .. $bound[1]. n";
print Page data: ,
join(, , @data[$bound[0] .. $bound[1] ]),
". n";
print - x 50, "n";
}
Data::Page::Viewport is a pure Perl module.
This module keeps track of what items are on the current page, when you scroll forwards or backwards within a data set.
Similarly to Data::Page, you can call sub offset(N), for + or - N, to scroll thru the data a page at a time.
And, like Set::Window, you can call sub offset(N), for + or - 1, to scroll thru the data an item at a time.
Clearly, N does not have to be fixed.
The viewport provides access to the current page, and the code shifts indexes into and out of the viewport, according to the parameter passed to sub offset().
Note that the data is not passed into this module. The module only keeps track of the indexes within the viewport, i.e. indexes on the current page.
You call sub bounds() on the object (of type Set::Window) returned by sub offset(), to determine what indexes are on the current page at any particular point in time.
Also note that, unlike Set::Window, the boundaries of the viewport are rigid, so that changes to the indexes caused by sub offset() are limited by the size of the data set.
This means, if you do this:
my($page) = Data::Page::Viewport -> new
(
data_size => $#data, # 0 .. $#data.
page_size => $page_size, # 1 .. N.
);
my(@bound) = $page -> offset(- 1) -> bounds();
the call to sub offset(- 1) will have no effect.
That is, when trying to go back past the beginning of the data set, the bounds will be locked to values within 0 .. data_size.
Similarly, a call which would go beyond the other end of the data set, will lock the bounds to the same range.
In short, you cant fall off the edge by calling sub offset().
This in turn means that the values returned by sub bounds() will always be valid indexes within the range 0 .. data_size.
The module implements this by building 2 objects of type Set::Window, one for the original data set (which never changes), and one for the current page, which changes each time sub offset() is called (until the boundaries are hit, of course).
Note: No range checking is performed on the parameters to sub new().
Note: It should be obvious by now that this module differs from Data::Page, and indeed all such modules, in that they never change the items which are on a given page. They only allow you to change the page known as the current page. This module differs, in that, by calling sub offset(+ or - N), you are effectively changing the items which are deemed to be on the current page.
<<lessSynopsis
This is a complete, tested, runnable program.
#!/usr/bin/perl
use strict;
use warnings;
use Data::Page::Viewport;
# -----------------------------------------------
my(@data) = (qw/zero one two three four five six
seven eight nine ten eleven twelve thirteen fourteen/);
my($page) = Data::Page::Viewport -> new
(
data_size => scalar @data,
page_size => 4
);
print "Data bounds: 0 .. $#data. n";
print "Data: ", join(, , @data), ". n";
print "Page bounds: 0 .. 3. n";
print "Page data: ", join(, , @data[0 .. 3]), ". n";
print "n";
my(@bound);
for (-2, 1, 4, 4, 1, 3, 3, -2, 1, 2, 1, -4, -4,
-1, 1, 2, -1, -2, -2, -1, -4, 4, 4, 4)
{
print "Offset: $_. n";
@bound = $page -> offset($_) -> bounds();
print "Page bounds: $bound[0] .. $bound[1]. n";
print Page data: ,
join(, , @data[$bound[0] .. $bound[1] ]),
". n";
print - x 50, "n";
}
Data::Page::Viewport is a pure Perl module.
This module keeps track of what items are on the current page, when you scroll forwards or backwards within a data set.
Similarly to Data::Page, you can call sub offset(N), for + or - N, to scroll thru the data a page at a time.
And, like Set::Window, you can call sub offset(N), for + or - 1, to scroll thru the data an item at a time.
Clearly, N does not have to be fixed.
The viewport provides access to the current page, and the code shifts indexes into and out of the viewport, according to the parameter passed to sub offset().
Note that the data is not passed into this module. The module only keeps track of the indexes within the viewport, i.e. indexes on the current page.
You call sub bounds() on the object (of type Set::Window) returned by sub offset(), to determine what indexes are on the current page at any particular point in time.
Also note that, unlike Set::Window, the boundaries of the viewport are rigid, so that changes to the indexes caused by sub offset() are limited by the size of the data set.
This means, if you do this:
my($page) = Data::Page::Viewport -> new
(
data_size => $#data, # 0 .. $#data.
page_size => $page_size, # 1 .. N.
);
my(@bound) = $page -> offset(- 1) -> bounds();
the call to sub offset(- 1) will have no effect.
That is, when trying to go back past the beginning of the data set, the bounds will be locked to values within 0 .. data_size.
Similarly, a call which would go beyond the other end of the data set, will lock the bounds to the same range.
In short, you cant fall off the edge by calling sub offset().
This in turn means that the values returned by sub bounds() will always be valid indexes within the range 0 .. data_size.
The module implements this by building 2 objects of type Set::Window, one for the original data set (which never changes), and one for the current page, which changes each time sub offset() is called (until the boundaries are hit, of course).
Note: No range checking is performed on the parameters to sub new().
Note: It should be obvious by now that this module differs from Data::Page, and indeed all such modules, in that they never change the items which are on a given page. They only allow you to change the page known as the current page. This module differs, in that, by calling sub offset(+ or - N), you are effectively changing the items which are deemed to be on the current page.
Download (0.008MB)
Added: 2006-10-03 License: Perl Artistic License Price:
1117 downloads
SportsTracker 2.5.1
SportsTracker is an application for recording sporting activities. more>>
SportsTracker is an application for people which want to record their sporting activities. SportsTracker is not bound to a specific kind of sport, the user can create categories for all sport types which are endurance related, such as cycling, running or swimming.
The main advantage is a good overview of your exercises and you can easily create diagrams and statistics for specific time ranges and sport types.
If you own a heartrate monitor with a computer interface you can organize the recorded exercise files by attaching them to the exercise entries and view them on demand. You can also import the data from the exercise files. Users of a Polar device should install PolarViewer for this feature.
All the application data is stored in XML files. So it should be easy to access it with other tools or to write importers and exporters for other applications.
<<lessThe main advantage is a good overview of your exercises and you can easily create diagrams and statistics for specific time ranges and sport types.
If you own a heartrate monitor with a computer interface you can organize the recorded exercise files by attaching them to the exercise entries and view them on demand. You can also import the data from the exercise files. Users of a Polar device should install PolarViewer for this feature.
All the application data is stored in XML files. So it should be easy to access it with other tools or to write importers and exporters for other applications.
Download (0.28MB)
Added: 2007-06-04 License: GPL (GNU General Public License) Price:
878 downloads

Bazaar Explorer 0.5
desktop application providing an easy-to-use interface to the Bazaar version control system more>>
Bazaar Explorer 0.5 is a simple to use, yet sophisticated desktop application with an easy-to-use interface for the Bazaar version control system. It is designed to be simple enough for casual users of version control, yet powerful enough for experts to be productive. To see BzrExplorer in action, see Bazaar Explorer by Pictures or browse the screenshots.
Unlike many other version control applications, BzrExplorer puts the focus on managing branches and changes, rather than directories and files. (If you prefer the latter, you may find an extension to the File Manager provided as part of the operating system more to your liking, e.g. TortoiseBzr.)
Major Features:
- Cross Platform
- Based on Nokia's Qt technology, BzrExplorer runs on all popular desktops including GNOME, KDE, Windows and Mac OS X. In each environment, it provides a native look-and-feel and adjusts its menu to meet the UI design guidelines for that platform.
- Application Suites
- BzrExplorer provides most of its functionality by calling out to mini-applications provided by "application suites", namely the QBzr and bzr-gtk plugins. QBzr is required while bzr-gtk is optional. If both are installed, you can choose which application suite to use.
- Note: Different application suites provide different amounts of coverage of Bazaar's functionality. If you expect an action to be enabled and it isn't, it's probably because the application suite is yet to provide that feature.
- Location Views:
- BzrExplorer supports 4 kinds of Bazaar locations:
-
- repositories
- branches
- bound branches (also called heavyweight checkouts in Bazaar 1.x)
- checkouts.
- The summary view and actions available depend on the location kind. For example, opening a repository shows the interesting locations nested within it while opening a branch shows the working tree "status" summary.
- Note: Strictly speaking, "repositories" are actually called shared repositories and "checkouts" are actually called lightweight checkouts. Those more-precise terms are avoided in the BzrExplorer user interface to Keep It Simple for casual users.
- Change Management: Here's the most commonly used recipe by BzrExplorer users:
- Open a branch
- Change some files
- Select Refresh on the toolbar (F5), confirming the overall status
- Select Diff on the toolbar (F3), checking the changes
- Select Commit on the toolbar (F4)
- Enter a commit message and select OK
- Select Refresh on the toolbar (F5), confirming there are no outstanding changes
- Remote Locations
- While primarily designed for working on local branches, BzrExplorer lets you open remote locations, e.g. branches on Launchpad. The set of actions available is masked accordingly.
- Settings Management
- BzrExplorer provides easy access to all of Bazaar's configuration files. Custom dialogs are provided by the various application suites for nice editing of some of these. For others, a (configurable) text editor is launched.
- Troubleshooting
- BzrExplorer provides easy access to Bazaar's log file and the Launchpad pages for reporting bugs and asking questions about BzrExplorer. A diagnostic mode can also be enabled in which selecting an action simply shows what Bazaar command would actually be run, together with the options and parameters that would be passed to it.
Added: 2009-07-21 License: GPL Price: FREE
14 downloads
libpropc++ 1.0 beta
libpropc++ is template C++ library for adding properties to Standard C++. more>>
libpropc++ is template C++ library for adding properties to Standard C++. Properties are pseudo-variables, getting/setting values of which causes certain actions. In the following example assignment to a property would change widget color:
widget.color = "red";
Properties can be bound with other properties to automatically synchronize their values (so that when one property changes, the other changes accordingly).
libpropc++ supports many different kinds of binding properties including one-directional and two-directional bindings, bindings properties of different value types and binding with a value transformation (by a function or an other kind of functor).
See Binding Properties article for detailed discussions about binding properties in general.
<<lesswidget.color = "red";
Properties can be bound with other properties to automatically synchronize their values (so that when one property changes, the other changes accordingly).
libpropc++ supports many different kinds of binding properties including one-directional and two-directional bindings, bindings properties of different value types and binding with a value transformation (by a function or an other kind of functor).
See Binding Properties article for detailed discussions about binding properties in general.
Download (0.26MB)
Added: 2005-09-29 License: LGPL (GNU Lesser General Public License) Price:
1485 downloads
Chaussette 1.0
Chaussette is a PHP/MySQL Web group calendar using Ajax. With it, friends can share events and chat together. more>>
Chaussette is a MySQL/PHP Web group calendar using Ajax.
With it, friends can share events and chat together.
<<lessWith it, friends can share events and chat together.
Download (2.6MB)
Added: 2006-05-10 License: GPL (GNU General Public License) Price:
1262 downloads
OMnAdren 0.7.3
OMnAdren is a scripting language that resembles C. more>>
OMnAdren is a scripting language that resembles C.
Computer languages are created for varying purposes and tasks — different kinds and styles of programming. One common programming task is known as scripting, or connecting diverse pre-existing components to accomplish a new related task. Those languages which are suited to scripting are typically called scripting languages. Many languages for this purpose have common properties: they favor rapid development over efficiency of execution; they are often implemented with interpreters rather than compilers; and they are strong at communication with program components written in other languages.
Many scripting languages emerged as tools for executing one-off tasks, particularly in system administration. One way of looking at scripts is as "glue" that puts several components together; thus they are widely used for creating graphical user interfaces or executing a series of commands that might otherwise have to be entered interactively through keyboard at the command prompt. The operating system usually offers some type of scripting language by default, widely known as a shell script language.
Scripts are typically stored only in their plain text form (as ASCII) and interpreted, or compiled each time prior to being invoked.
Some scripting languages are designed for a specific domain, but often it is possible to write more general programs in that language. In many large-scale projects, a scripting language and a lower level programming language are used together, each lending its particular strengths to solve specific problems. Scripting languages are often designed for interactive use, having many commands that can execute individually, and often have very high level operations (for example, in the classic UNIX shell (sh), most operations are programs themselves).
Such high level commands simplify the process of writing code. Programming features such as automatic memory management and bounds checking can be taken for granted. In a lower level or non-scripting language, managing memory and variables and creating data structures tends to consume more programmer effort and lines of code to complete a given task. In some situations this is well worth it for the resulting fine-grained control. The scripter typically has less flexibility to optimize a program for speed or to conserve memory.
For the reasons noted above, it is usually faster to program in a scripting language, and script files are typically much smaller than, say, equivalent C program files. The flip side can be a performance penalty: scripting languages, often interpreted, may be significantly slower to execute and may consume more memory when running. In many relevant cases, however, e.g. with small scripts of some tens of lines, the write-time advantage far outweighs the run-time disadvantage. Also, this argument gets stronger with rising programmer salaries and falling hardware costs.
However, the boundary between scripting languages and regular programming languages tends to be vague, and is blurring ever more with the emergence of new languages and integrations in this fast-changing area. In some scripting languages, an experienced programmer can accomplish a good deal of optimization if they choose. And in general, it is possible to write a script in any language (including C or assembly language). In most modern systems, the latter case is very seldom recommendable, since one or more suitable script languages is usually available.
<<lessComputer languages are created for varying purposes and tasks — different kinds and styles of programming. One common programming task is known as scripting, or connecting diverse pre-existing components to accomplish a new related task. Those languages which are suited to scripting are typically called scripting languages. Many languages for this purpose have common properties: they favor rapid development over efficiency of execution; they are often implemented with interpreters rather than compilers; and they are strong at communication with program components written in other languages.
Many scripting languages emerged as tools for executing one-off tasks, particularly in system administration. One way of looking at scripts is as "glue" that puts several components together; thus they are widely used for creating graphical user interfaces or executing a series of commands that might otherwise have to be entered interactively through keyboard at the command prompt. The operating system usually offers some type of scripting language by default, widely known as a shell script language.
Scripts are typically stored only in their plain text form (as ASCII) and interpreted, or compiled each time prior to being invoked.
Some scripting languages are designed for a specific domain, but often it is possible to write more general programs in that language. In many large-scale projects, a scripting language and a lower level programming language are used together, each lending its particular strengths to solve specific problems. Scripting languages are often designed for interactive use, having many commands that can execute individually, and often have very high level operations (for example, in the classic UNIX shell (sh), most operations are programs themselves).
Such high level commands simplify the process of writing code. Programming features such as automatic memory management and bounds checking can be taken for granted. In a lower level or non-scripting language, managing memory and variables and creating data structures tends to consume more programmer effort and lines of code to complete a given task. In some situations this is well worth it for the resulting fine-grained control. The scripter typically has less flexibility to optimize a program for speed or to conserve memory.
For the reasons noted above, it is usually faster to program in a scripting language, and script files are typically much smaller than, say, equivalent C program files. The flip side can be a performance penalty: scripting languages, often interpreted, may be significantly slower to execute and may consume more memory when running. In many relevant cases, however, e.g. with small scripts of some tens of lines, the write-time advantage far outweighs the run-time disadvantage. Also, this argument gets stronger with rising programmer salaries and falling hardware costs.
However, the boundary between scripting languages and regular programming languages tends to be vague, and is blurring ever more with the emergence of new languages and integrations in this fast-changing area. In some scripting languages, an experienced programmer can accomplish a good deal of optimization if they choose. And in general, it is possible to write a script in any language (including C or assembly language). In most modern systems, the latter case is very seldom recommendable, since one or more suitable script languages is usually available.
Download (0.076MB)
Added: 2005-10-19 License: GPL (GNU General Public License) Price:
1466 downloads
Glib Binding Properties 0.9.1
Glib Binding Properties is a system that allows developers to bind properties of GLib and GTK+ objects. more>>
Glib Binding Properties library adds an implementation of binding properties to GLib / GTK+ library (it also includes Ada 95 for GtkAda GTK bindings, GtkAda was made by ACT corp.)
Binding properties is automatic synchronizing values of several properties to keep their values correspondingly to each other, so that when a property changes properties bound with it automatically change accordingly. Also bindings with value transformation functions are supported.
Binding properties much reduces development time of desktop applications and increases reliability as frees you from time consuming and error-prone writing callback handlers of property changes. (Probably wrong property change handlers is the most often cause of errors in GUI applications!)
Current version 0.9.1 is an alpha version. Please test it.
<<lessBinding properties is automatic synchronizing values of several properties to keep their values correspondingly to each other, so that when a property changes properties bound with it automatically change accordingly. Also bindings with value transformation functions are supported.
Binding properties much reduces development time of desktop applications and increases reliability as frees you from time consuming and error-prone writing callback handlers of property changes. (Probably wrong property change handlers is the most often cause of errors in GUI applications!)
Current version 0.9.1 is an alpha version. Please test it.
Download (0.32MB)
Added: 2006-03-24 License: LGPL (GNU Lesser General Public License) Price:
1310 downloads
The Spider 1.71
The Spider project is a complete object-oriented environment for machine learning in Matlab. more>>
The Spider project is a complete object-oriented environment for machine learning in Matlab.
Aside from ease of use for base learning algorithms, algorithms can be plugged together and can be compared with, for example, model selection, statistical tests, and visual plots.
This gives all the power of objects (reusability, the ability to plug together, sharing of code), but also all the power of Matlab for machine learning research.
Enhancements:
- A WEKA interface was added, supporting decision trees.
- Additional code, documentation, and demos were added.
<<lessAside from ease of use for base learning algorithms, algorithms can be plugged together and can be compared with, for example, model selection, statistical tests, and visual plots.
This gives all the power of objects (reusability, the ability to plug together, sharing of code), but also all the power of Matlab for machine learning research.
Enhancements:
- A WEKA interface was added, supporting decision trees.
- Additional code, documentation, and demos were added.
Download (4.2MB)
Added: 2006-07-27 License: GPL (GNU General Public License) Price:
1185 downloads
Cabextract menu
Cabextract menu is just a little service menu that I put together for extracting MS .cab files. more>>
Cabextract menu is just a little service menu that I put together for extracting MS .cab files.
It creates a directory with the same base name in the same directory as the .cab file and extracts to it. To use it, you have to have cabextract installed (and can be found here http://www.kyz.uklinux.net/cabextract.php.
<<lessIt creates a directory with the same base name in the same directory as the .cab file and extracts to it. To use it, you have to have cabextract installed (and can be found here http://www.kyz.uklinux.net/cabextract.php.
Download (MB)
Added: 2007-03-13 License: GPL (GNU General Public License) Price:
963 downloads
gtk-splitter 2.2
gtk-splitter can split files into smaller pieces. more>>
gtk-splitter can split files into smaller pieces and combine them back together. It can also generate a DOS batch file so that the split files can be combined on DOS/Windows systems. gtk-splitter is good for working around file limitations with floppy disks, email attachments, etc.
Dependencies:
- GTK+ 2.x
- mhash [optional]
<<lessDependencies:
- GTK+ 2.x
- mhash [optional]
Download (0.03MB)
Added: 2005-04-08 License: GPL (GNU General Public License) Price:
1677 downloads
gwt-hibernate 2007-03-30
gwt-hibernate is a library that will bind your hibernate POJOs to GWT widgets. more>>
gwt-hibernate is a library that will bind your hibernate POJOs to GWT widgets.
This project provides the basics to create a web application that uses GWT on the front end and Hibernate on the back end.
It provides code generation templates and support classes that allow introspection, data binding, and validation of POJOs in the browser. Data-bound Form and Grid widgets are included.
Initial code and javadoc has been posted now, see the subversion repository. The code is has been evolved over about two months and is in a "works for me" state. We are using it internally on a project and will update it as we fix bugs and extend it.
You might want to use this library as inspiration for your own GWT data binding setup. Better yet, use the library directly and contribute changes!
<<lessThis project provides the basics to create a web application that uses GWT on the front end and Hibernate on the back end.
It provides code generation templates and support classes that allow introspection, data binding, and validation of POJOs in the browser. Data-bound Form and Grid widgets are included.
Initial code and javadoc has been posted now, see the subversion repository. The code is has been evolved over about two months and is in a "works for me" state. We are using it internally on a project and will update it as we fix bugs and extend it.
You might want to use this library as inspiration for your own GWT data binding setup. Better yet, use the library directly and contribute changes!
Download (MB)
Added: 2007-04-10 License: LGPL (GNU Lesser General Public License) Price:
560 downloads

NINJAM Client for Linux 0.06 beta
It allows people to make real music together via the Internet. more>> NINJAM is a program to allow people to make real music together via the Internet. Every participant can hear every other participant. Each user can also tweak their personal mix to his or her liking. NINJAM is cross-platform, with clients available for Mac OS X and Windows.<<less
Download (71KB)
Added: 2009-04-28 License: Freeware Price: Free
189 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above bound together search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed