1
edit
Community:SummerOfCode07:Brainstorming: Difference between revisions
Jump to navigation
Jump to search
Community:SummerOfCode07:Brainstorming (view source)
Revision as of 10:06, 26 March 2007
, 26 March 2007→Suggestion List
(Move duplicate bug detection across) |
|||
| Line 163: | Line 163: | ||
| valign="top" | Looking for mentor | | valign="top" | Looking for mentor | ||
| valign="top" |Places will add exciting capabilities to firefox. Indexing visited pages is a consistent demand seen in the wikis. Further users spend a lot of time on re-finding information on the web. A feature like this will enhance his user-experience. Sooner or later, competiting browsers will implement this feature. An early start on this will make firefox even more competitive compared to its rival browsers. | | valign="top" |Places will add exciting capabilities to firefox. Indexing visited pages is a consistent demand seen in the wikis. Further users spend a lot of time on re-finding information on the web. A feature like this will enhance his user-experience. Sooner or later, competiting browsers will implement this feature. An early start on this will make firefox even more competitive compared to its rival browsers. | ||
|- | |||
| valign = "top" | CRON-like repeatable event specification in Sunbird | |||
| valign = "top" | Desktop calendar applications use repeatable event specification where a user can '''exclusively''' choose one of the following repeat patterns: daily, weekly, monthly, yearly. Server-side deamon CRON uses more sophisticated way of repeat pattern specification. One can mix daily patterns with weekly patterns and etc. in one event specification. | |||
The project's aim is to implement CRON-like pattern specification in Desktop calendar application Sunbird. The idea is new and not seen in any other calendaring application due to the following reason. CRON uses on-line algorithm: checks every minute if current time/date matches any of the list of patterns. Desktop calendar however, needs daily, weekly, monthly (and sometimes yearly) view. Generating all occurrences of a pattern within a specified time bound is not an easy task. I have been doing research in this topic and came up with an idea of doing this kind of computation efficiently. I managed to implement it in a commercial system that is not a calendaring application but has similar functional requirements. I have put algorithmic design into a [http://www.genijusz.org/zalewski07calendar.pdf whitepaper] that explains all the details. | |||
Now I would like to implement this algorithm in an open source calendaring application as a proof of concept of my algorithm. | |||
| valign = "top" | [http://wiki.mozilla.org/User:Dominikz Dominik Zalewski] | |||
| valign = "top" | Looking for mentor | |||
| valign = "top" | | |||
|} | |} | ||