items
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 862
Memo 2.0
Memo is a small utility which you can use to store appointments and TODO items. more>>
Memo is a small utility which you can use to store appointments and TODO items. Memo displays the next few entries in a small window, and can also be instructed to bring up alert windows at set times.
If you have a D-BUS notification service available then it will use that to display alerts. Otherwise, it will use a built-in dialog box.
<<lessIf you have a D-BUS notification service available then it will use that to display alerts. Otherwise, it will use a built-in dialog box.
Download (0.032MB)
Added: 2007-01-03 License: GPL (GNU General Public License) Price:
1026 downloads
Brim Lite 1.2.3
Booby is a Web-based personal information manager for bookmarks, calendar, contacts etc. more>>
Brim is an application suite that allows you to manage all your personal items online. No need to syncronize your bookmarks and favorites and contacts, you can now keep them well-secured online in one single place.
Additionally, Brim provides a calendar, a task manager, notes, a password manager etc. all behind a single logon.
Brim is an opensource Webbased Information Manager, formerly known as Booby, with support for bookmarks, calendar, contacts, notes, news, passwords and tasks and more.
Brim is written in PHP, has an underlying Model-View-Controller (MVC - Model II) framework based on items with a hierarchical relationship, has support for internationlization (i18n) with over 15 translations available, has multiple themes and is database independant. In short; a multi-thingy something.
Main features:
- Support for unlimited users
- Tested on IE5, IE6, Opera 7.5, Firefox 1.0, Netscape/Mozilla and more
- Plugin support (bookmarks, calendar events, news items, notes, tasks and a webtools plugin)
- Support for unlimited items per plugin
- Support for multiple languages:
English
Czech
German
Esperanto
Spanish
French
Hebrew
Italian
Dutch
Norwegian
Polish
Portuguese Brazilian
Portuguese
Russian
Swedish
Tradition Chinese
- Support for multiple themes (check the demo site!)
- Support to publish items (public vs. private items)
Enhancements:
- Template rework (working towards version 2.0)
- Work on making templates fully HTML compliant (tx Ryan)
- Replaced dojo by jQuery
- Danish language update (tx to Rene Pedersen)
- Changed template texts from import, export, delete and default to importTxt, exportTxt, deleteTxt and defaultTxt
- MagpieRSS moved from ext to plugins/news/util directory
<<lessAdditionally, Brim provides a calendar, a task manager, notes, a password manager etc. all behind a single logon.
Brim is an opensource Webbased Information Manager, formerly known as Booby, with support for bookmarks, calendar, contacts, notes, news, passwords and tasks and more.
Brim is written in PHP, has an underlying Model-View-Controller (MVC - Model II) framework based on items with a hierarchical relationship, has support for internationlization (i18n) with over 15 translations available, has multiple themes and is database independant. In short; a multi-thingy something.
Main features:
- Support for unlimited users
- Tested on IE5, IE6, Opera 7.5, Firefox 1.0, Netscape/Mozilla and more
- Plugin support (bookmarks, calendar events, news items, notes, tasks and a webtools plugin)
- Support for unlimited items per plugin
- Support for multiple languages:
English
Czech
German
Esperanto
Spanish
French
Hebrew
Italian
Dutch
Norwegian
Polish
Portuguese Brazilian
Portuguese
Russian
Swedish
Tradition Chinese
- Support for multiple themes (check the demo site!)
- Support to publish items (public vs. private items)
Enhancements:
- Template rework (working towards version 2.0)
- Work on making templates fully HTML compliant (tx Ryan)
- Replaced dojo by jQuery
- Danish language update (tx to Rene Pedersen)
- Changed template texts from import, export, delete and default to importTxt, exportTxt, deleteTxt and defaultTxt
- MagpieRSS moved from ext to plugins/news/util directory
Download (2.6MB)
Added: 2007-01-10 License: GPL (GNU General Public License) Price:
1018 downloads
Data::Validator::Item 0.75
Data::Validator::Item is a Factory Class to validate data items. more>>
Data::Validator::Item is a Factory Class to validate data items.
This is an attempt to create an object which will permit semi-automatic verification of a data value.
SYNOPSIS
use Data::Validator::Item;
my $item = Data::Validator::Item->new(); #Create a new Data::Validator::Item, called $item.
#Set values
$item->name(fred);
$item->values([1,2,3]); or $item->values(@array);
$item->missing(*); or $item->missing(); #undef is unlikely to be sensible!
$item->min(0); $item->max(100);
$item->verify($reference_to_subroutine); #Used in the $item->validate() function
$item->transform($reference_to_subroutine); #Used in the $item->put() function
#Get values
my $name = $item->name();
my @values = $item->values();
my $missing = $item->missing();
etc...
#Use it.. $item->validate(); #Returns 1 for success, 0 for failure $item->error(); #Returns the correct error message $item->put();
USAGE
Many people work with data organised as records, each containing (potentially many) variables. It is often necessary to process files of such records, and to test every variable within every record to ensure that each one is valid. I do this before putting data from very large flat files into my databases. For each variable I had a need to define specific, sometimes complex rules for validity, then implement them, and check them. This is what Data::Validator::Item is for.
Note carefully that Data::Validator::Item handles only one scalar vlaue at a time. This value could come from a file, a database, an array, a hash or your grannys parrot. Data::Validator::Item doesnt care.
I use Data::Validator::Item as follows. I create one for every named variable in my data file. In many real applications most of this setup can be done by looping over a list of variable names, creating many Data::Validator::Items each named for the corresponding variable. Common features, like missing values, and names can be set in this loop.
Specifics, like values(), min(), max(), verify() and so on can be set individually. I then create a hash to hold all of the Data::Validator::Items for a particular data source, The keys of this hash are the names of the variables, and the values are the Data:Validators themselves. Y.M.M.V.
<<lessThis is an attempt to create an object which will permit semi-automatic verification of a data value.
SYNOPSIS
use Data::Validator::Item;
my $item = Data::Validator::Item->new(); #Create a new Data::Validator::Item, called $item.
#Set values
$item->name(fred);
$item->values([1,2,3]); or $item->values(@array);
$item->missing(*); or $item->missing(); #undef is unlikely to be sensible!
$item->min(0); $item->max(100);
$item->verify($reference_to_subroutine); #Used in the $item->validate() function
$item->transform($reference_to_subroutine); #Used in the $item->put() function
#Get values
my $name = $item->name();
my @values = $item->values();
my $missing = $item->missing();
etc...
#Use it.. $item->validate(); #Returns 1 for success, 0 for failure $item->error(); #Returns the correct error message $item->put();
USAGE
Many people work with data organised as records, each containing (potentially many) variables. It is often necessary to process files of such records, and to test every variable within every record to ensure that each one is valid. I do this before putting data from very large flat files into my databases. For each variable I had a need to define specific, sometimes complex rules for validity, then implement them, and check them. This is what Data::Validator::Item is for.
Note carefully that Data::Validator::Item handles only one scalar vlaue at a time. This value could come from a file, a database, an array, a hash or your grannys parrot. Data::Validator::Item doesnt care.
I use Data::Validator::Item as follows. I create one for every named variable in my data file. In many real applications most of this setup can be done by looping over a list of variable names, creating many Data::Validator::Items each named for the corresponding variable. Common features, like missing values, and names can be set in this loop.
Specifics, like values(), min(), max(), verify() and so on can be set individually. I then create a hash to hold all of the Data::Validator::Items for a particular data source, The keys of this hash are the names of the variables, and the values are the Data:Validators themselves. Y.M.M.V.
Download (0.011MB)
Added: 2007-02-28 License: Perl Artistic License Price:
969 downloads
Dicop::Item::Template 3.04
Dicop::Item::Template is an object defining Dicop::Item subclasses. more>>
Dicop::Item::Template is an object defining Dicop::Item subclasses.
SYNOPSIS
use Dicop::Request::Template
push @templates, Dicop::Item::Template->new (
class => Dicop::Item::Subclass,
fields => "name => { maxlen => 128, def => some name }",
);
<<lessSYNOPSIS
use Dicop::Request::Template
push @templates, Dicop::Item::Template->new (
class => Dicop::Item::Subclass,
fields => "name => { maxlen => 128, def => some name }",
);
Download (0.11MB)
Added: 2006-11-03 License: Perl Artistic License Price:
1086 downloads
PHP Gift Registry 1.5.2
PHP Gift Registry is a a Web-enabled database. more>>
PHP Gift Registry is a a Web-enabled database that allows members to keep track of the gifts theyd like to receive and see what items other members would like to receive. Private reservations ensure gifts are not bought twice.
Main features:
- A single unifying view of items on your own list and people whose lists you can view.
- A now-optional request/permit system by which you can control who can see your list.
- A "checkin/checkout" system which allows you to reserve items on someones list.
- An in-system messaging system by which users can be informed of item deletions or custom announcements.
- New users can request accounts. Optionally, administrators will be informed about the request, and they can then approve or reject the request. Either way, the user will be informed by e-mail.
- A site-customizable ranking system for items.
- An events system for users to add significant (read: gift-bearing) events which will show up on others displays when the event nears.
<<lessMain features:
- A single unifying view of items on your own list and people whose lists you can view.
- A now-optional request/permit system by which you can control who can see your list.
- A "checkin/checkout" system which allows you to reserve items on someones list.
- An in-system messaging system by which users can be informed of item deletions or custom announcements.
- New users can request accounts. Optionally, administrators will be informed about the request, and they can then approve or reject the request. Either way, the user will be informed by e-mail.
- A site-customizable ranking system for items.
- An events system for users to add significant (read: gift-bearing) events which will show up on others displays when the event nears.
Download (0.058MB)
Added: 2005-11-18 License: GPL (GNU General Public License) Price:
1442 downloads
Prima::Lists 1.20
Prima::Lists is a Perl module for user-selectable item list widgets. more>>
Prima::Lists is a Perl module for user-selectable item list widgets.
The module provides classes for several abstraction layers of item representation. The hierarchy of classes is as follows:
AbstractListViewer
AbstractListBox
ListViewer
ProtectedListBox
ListBox
The root class, Prima::AbstractListViewer, provides common interface, while by itself it is not directly usable. The main differences between classes are centered around the way the item list is stored. The simplest organization of a text-only item list, provided by Prima::ListBox, stores an array of text scalars in a widget.
More elaborated storage and representation types are not realized, and the programmer is urged to use the more abstract classes to derive own mechanisms. For example, for a list of items that contain text strings and icons see "Prima::DirectoryListBox" in Prima::FileDialog.
To organize an item storage, different from Prima::ListBox, it is usually enough to overload either the Stringify, MeasureItem, and DrawItem events, or their method counterparts: get_item_text, get_item_width, and draw_items.
<<lessThe module provides classes for several abstraction layers of item representation. The hierarchy of classes is as follows:
AbstractListViewer
AbstractListBox
ListViewer
ProtectedListBox
ListBox
The root class, Prima::AbstractListViewer, provides common interface, while by itself it is not directly usable. The main differences between classes are centered around the way the item list is stored. The simplest organization of a text-only item list, provided by Prima::ListBox, stores an array of text scalars in a widget.
More elaborated storage and representation types are not realized, and the programmer is urged to use the more abstract classes to derive own mechanisms. For example, for a list of items that contain text strings and icons see "Prima::DirectoryListBox" in Prima::FileDialog.
To organize an item storage, different from Prima::ListBox, it is usually enough to overload either the Stringify, MeasureItem, and DrawItem events, or their method counterparts: get_item_text, get_item_width, and draw_items.
Download (1.4MB)
Added: 2006-08-29 License: Perl Artistic License Price:
1151 downloads
NCXmms 0.8
NCXmms is an XMMS frontend based on ncurses. more>>
NCXmms is an XMMS frontend based on ncurses. Feature highlights include its ability to control XMMS from a text environment using comfortable menu library widgets.
It can also quickly find items in the playlist after the user enters part of the name.
Enhancements:
- Entries in playlist can be moved. Directories can be bookmarked and assigned to shortcuts. The ability to add URL entered from keyboard was added.
<<lessIt can also quickly find items in the playlist after the user enters part of the name.
Enhancements:
- Entries in playlist can be moved. Directories can be bookmarked and assigned to shortcuts. The ability to add URL entered from keyboard was added.
Download (0.035MB)
Added: 2005-05-20 License: GPL (GNU General Public License) Price:
1618 downloads
Dijjer this! 0.1.2
Dijjer this! is a new context-menu item to download link with Dijjer for Firefox webbrowser. more>>
Dijjer this! is a new context-menu item to download link with Dijjer for Firefox webbrowser.
<<less Download (0.008MB)
Added: 2007-06-28 License: MPL (Mozilla Public License) Price:
848 downloads
Mac::iTunes::Playlist 0.86
Mac::iTunes::Playlist is a Perl module for iTunes playlists. more>>
Mac::iTunes::Playlist is a Perl module for iTunes playlists.
SYNOPSIS
use Mac::iTunes::Playlist;
my $playlist = Mac::iTunes::Playlist->new( @items );
METHODS
new( TITLE, ARRAYREF )
new_from_directory( TITLE, DIRECTORY )
Create a playlist from all of the MP3 files in the named directory.
title
Returns the title of the playlist.
items
In list context, returns a list of the items in the playlist.
In scalar context, returns the number of items in the playlist.
next_item
Not implemented
previous_item
Not implemented
add_item( OBJECT )
Adds the Mac::iTunes::Item object to the playlist.
Returns undef or the empty list if the argument is not a Mac::iTunes::Item object.
delete_item( INDEX )
Deletes the item at index INDEX (counting from zero).
Returns false is the INDEX is greater than the index of the last item. Returns true otherwise.
merge( PLAYLIST )
Adds the items in PLAYLIST to the current playlist and returns the number of items added.
Returns undefined (or the empty list) if the argument is not the right sort of object. Returns 0 if no items were added (which might not be an error).
This method does a deep copy of the Items object. Identical items show up as different objects in each playlist so that the playlists do not refer to each other.
random_item
In scalar context, returns a random item from the playlist.
In list context, returns the item, the index of the item, and the total count of items.
Returns false or the empty list if the playlist has no items.
copy
Return a deep copy of the playlist. The returned object will not refer (as in, point to the same data) as the original object.
Publisher
publish( FORMAT [, FIELDS_REF [, ORDER_REF ] ] )
Output the playlist in some format.
Not implemented.
<<lessSYNOPSIS
use Mac::iTunes::Playlist;
my $playlist = Mac::iTunes::Playlist->new( @items );
METHODS
new( TITLE, ARRAYREF )
new_from_directory( TITLE, DIRECTORY )
Create a playlist from all of the MP3 files in the named directory.
title
Returns the title of the playlist.
items
In list context, returns a list of the items in the playlist.
In scalar context, returns the number of items in the playlist.
next_item
Not implemented
previous_item
Not implemented
add_item( OBJECT )
Adds the Mac::iTunes::Item object to the playlist.
Returns undef or the empty list if the argument is not a Mac::iTunes::Item object.
delete_item( INDEX )
Deletes the item at index INDEX (counting from zero).
Returns false is the INDEX is greater than the index of the last item. Returns true otherwise.
merge( PLAYLIST )
Adds the items in PLAYLIST to the current playlist and returns the number of items added.
Returns undefined (or the empty list) if the argument is not the right sort of object. Returns 0 if no items were added (which might not be an error).
This method does a deep copy of the Items object. Identical items show up as different objects in each playlist so that the playlists do not refer to each other.
random_item
In scalar context, returns a random item from the playlist.
In list context, returns the item, the index of the item, and the total count of items.
Returns false or the empty list if the playlist has no items.
copy
Return a deep copy of the playlist. The returned object will not refer (as in, point to the same data) as the original object.
Publisher
publish( FORMAT [, FIELDS_REF [, ORDER_REF ] ] )
Output the playlist in some format.
Not implemented.
Download (0.11MB)
Added: 2006-11-15 License: Perl Artistic License Price:
1077 downloads
Algorithm::Pair::Best 1.010
Algorithm::Pair::Best is a Perl module to select pairings (designed for Go tournaments, but can be used for anything, really). more>>
Algorithm::Pair::Best is a Perl module to select pairings (designed for Go tournaments, but can be used for anything, really).
SYNOPSIS
use Algorithm::Pair::Best;
my $pair = Algorithm::Pair::Best->new( ? options ? );
$pair->add( item, ? item, ... ? );
@pairList = $pair->pick( ? $window ? );
After creating an Algorithm::Pair::Best->new object, add a list of items (players) to be paired. add connects the new items into a linked list. The linked list must consist of an even number of items or youll get an error when you try to pick the pairs.
Pairings are determined partially by the original order items were added, but more importantly, items are paired based on scores which are determined by an info hash used to attach any random data to the item, and user supplied functions to provide a score for each item in relation to other items. It may be convenient to add access methods to the Algorithm::Pair::Best package from the main namespace (see the scoreSubs option to new below for an example).
Algorithm::Pair::Best->pick explores all combinations of items and returns the pairing with the best (highest) score. This can be an expensive proposition - the number of combinations goes up very fast with respect to the number of items:
items combinations
2 1 (1)
4 3 (1 * 3)
6 15 (1 * 3 * 5)
8 105 (1 * 3 * 5 * 7)
10 945 (1 * 3 * 5 * 7 * 9
12 10395 (1 * 3 * 5 * 7 * 9 * 11)
14 135135 (1 * 3 * 5 * 7 * 9 * 11 * 13)
It is clearly unreasonable to try to pair a significant number of items. On my system it takes about 2 seconds to pair 12 items (6 pairs), and 20 seconds to pair 14 items (with no negative scores only optimization). Trying to completely pair even 30 items would take too long.
Fortunately, there is a way to get pretty good results for large numbers, even if theyre not perfect. Instead of trying to pair the whole list at once, Algorithm::Pair::Best->pick pairs a series of smaller groups to get good local results. The new method accepts a window option to limit the number of pairs in each window. The window option can also be overridden by calling pick with an explicit window argument:
$pair->pick($window);
See the description of the window option below.
<<lessSYNOPSIS
use Algorithm::Pair::Best;
my $pair = Algorithm::Pair::Best->new( ? options ? );
$pair->add( item, ? item, ... ? );
@pairList = $pair->pick( ? $window ? );
After creating an Algorithm::Pair::Best->new object, add a list of items (players) to be paired. add connects the new items into a linked list. The linked list must consist of an even number of items or youll get an error when you try to pick the pairs.
Pairings are determined partially by the original order items were added, but more importantly, items are paired based on scores which are determined by an info hash used to attach any random data to the item, and user supplied functions to provide a score for each item in relation to other items. It may be convenient to add access methods to the Algorithm::Pair::Best package from the main namespace (see the scoreSubs option to new below for an example).
Algorithm::Pair::Best->pick explores all combinations of items and returns the pairing with the best (highest) score. This can be an expensive proposition - the number of combinations goes up very fast with respect to the number of items:
items combinations
2 1 (1)
4 3 (1 * 3)
6 15 (1 * 3 * 5)
8 105 (1 * 3 * 5 * 7)
10 945 (1 * 3 * 5 * 7 * 9
12 10395 (1 * 3 * 5 * 7 * 9 * 11)
14 135135 (1 * 3 * 5 * 7 * 9 * 11 * 13)
It is clearly unreasonable to try to pair a significant number of items. On my system it takes about 2 seconds to pair 12 items (6 pairs), and 20 seconds to pair 14 items (with no negative scores only optimization). Trying to completely pair even 30 items would take too long.
Fortunately, there is a way to get pretty good results for large numbers, even if theyre not perfect. Instead of trying to pair the whole list at once, Algorithm::Pair::Best->pick pairs a series of smaller groups to get good local results. The new method accepts a window option to limit the number of pairs in each window. The window option can also be overridden by calling pick with an explicit window argument:
$pair->pick($window);
See the description of the window option below.
Download (0.010MB)
Added: 2007-05-17 License: Perl Artistic License Price:
891 downloads
eeStock 4.0
eeStock project is a Web application for managing an inventory. more>>
eeStock project is a Web application for managing an inventory.
eeStock is a free software which allows you to manage your stocks (items).
Its written in PHP4 and uses a PostgreSQL or MySQL database to store data.
Its divided in 2 sections:
- a user section
- an administration section
In the Stock managing section, users can:
.browse items by manufacturer, category, owner or location
.search items using a keyword
.borrow an item if this one is free
.return their items
.access to their profile
In the Administration section you can (if you have administrator or superuser rights):
.create, modify, duplicate, delete items
.browse all items (list)
.create, modify, delete categories (each category can have a parent category)
.create, modify, delete locations (each location can have a parent location)
.create, modify, delete manufacturers
.create, modify, delete users who will be owners of item(s) (only superusers)
System requirements:
- Apache (required)
- PHP (required)
- MySQL (optional)
- PostgreSQL (optional)
Install database
Create the eestock database (MySQL root user password required)
$ mysqladmin -h localhost -u root -p create eestock
Create the user "eestock" (MySQL root user password required)
$ mysql -h localhost -u root -D mysql -p < admin/utils/mysql/create_user.mysql
Create tables (MySQL root user password required)
$ mysql -h localhost -u root -D eestock -p < admin/utils/mysql/init_db.mysql
Edit file admin/config.inc to change the eestock user password.
<<lesseeStock is a free software which allows you to manage your stocks (items).
Its written in PHP4 and uses a PostgreSQL or MySQL database to store data.
Its divided in 2 sections:
- a user section
- an administration section
In the Stock managing section, users can:
.browse items by manufacturer, category, owner or location
.search items using a keyword
.borrow an item if this one is free
.return their items
.access to their profile
In the Administration section you can (if you have administrator or superuser rights):
.create, modify, duplicate, delete items
.browse all items (list)
.create, modify, delete categories (each category can have a parent category)
.create, modify, delete locations (each location can have a parent location)
.create, modify, delete manufacturers
.create, modify, delete users who will be owners of item(s) (only superusers)
System requirements:
- Apache (required)
- PHP (required)
- MySQL (optional)
- PostgreSQL (optional)
Install database
Create the eestock database (MySQL root user password required)
$ mysqladmin -h localhost -u root -p create eestock
Create the user "eestock" (MySQL root user password required)
$ mysql -h localhost -u root -D mysql -p < admin/utils/mysql/create_user.mysql
Create tables (MySQL root user password required)
$ mysql -h localhost -u root -D eestock -p < admin/utils/mysql/init_db.mysql
Edit file admin/config.inc to change the eestock user password.
Download (0.043MB)
Added: 2007-02-16 License: GPL (GNU General Public License) Price:
980 downloads
Convert::Wiki::Node::Item 0.05
Convert::Wiki::Node::Item is a Perl module that represents an item in a list (aka < li > or *). more>>
Convert::Wiki::Node::Item is a Perl module that represents an item in a list (aka < li > or *).
SYNOPSIS
use Convert::Wiki::Node::Item;
my $para = Convert::Wiki::Node->new( txt => Foo is a foobar., type => item );
print $para->as_wiki(); # print something like "* Foo is a foorbarn"
A Convert::Wiki::Node::Item represents an item in a list (aka the equivalent of < li > or *.
<<lessSYNOPSIS
use Convert::Wiki::Node::Item;
my $para = Convert::Wiki::Node->new( txt => Foo is a foobar., type => item );
print $para->as_wiki(); # print something like "* Foo is a foorbarn"
A Convert::Wiki::Node::Item represents an item in a list (aka the equivalent of < li > or *.
Download (0.019MB)
Added: 2006-08-21 License: Perl Artistic License Price:
1159 downloads
WebmailCompose 0.6.5
WebmailCompose is an extension which makes mailto: links load your webmails compose page. more>>
WebmailCompose is an extension which makes mailto: links load your webmails compose page.
Makes mailto: links load your webmails compose page and adds a Compose link to the context menu.
Also (optionally) overlays the Mail Button, Send Link and Send Image context menu items.
<<lessMakes mailto: links load your webmails compose page and adds a Compose link to the context menu.
Also (optionally) overlays the Mail Button, Send Link and Send Image context menu items.
Download (0.017MB)
Added: 2007-04-10 License: MPL (Mozilla Public License) Price:
934 downloads
MyNews 1.2b1
MyNews provides a Web news grabber. more>>
MyNews provides a Web news grabber.
MyNews is a program that scans selected Web sites for recent news. News items are stored in a database.#
MyNews users can subsribe to Web sites to receive email when recent news items have been added. The MyNews script requires the MN Perl module.
<<lessMyNews is a program that scans selected Web sites for recent news. News items are stored in a database.#
MyNews users can subsribe to Web sites to receive email when recent news items have been added. The MyNews script requires the MN Perl module.
Download (0.009MB)
Added: 2007-02-13 License: GPL (GNU General Public License) Price:
985 downloads
Bloglines applet 1.0.0
Bloglines Notifier is a Gnome panel applet that monitors a Bloglines account and displays an alert when there new items. more>>
Bloglines Notifier is a Gnome panel applet that monitors a Bloglines account and displays an alert when there new items.
When there are new items the applet displays a tooltip with the count of unread items. Also one can double click on the applet in order to launch a web browser and point it at the Bloglines account being monitored.
<<lessWhen there are new items the applet displays a tooltip with the count of unread items. Also one can double click on the applet in order to launch a web browser and point it at the Bloglines account being monitored.
Download (0.35MB)
Added: 2005-07-29 License: GPL (GNU General Public License) Price:
1547 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 items 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