You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tdeaddons/noatun-plugins/dub
tpearson 7346aee26b
Trinity Qt initial conversion
15 years ago
..
dub Trinity Qt initial conversion 15 years ago
AUTHORS Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
BUGS Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
COPYING Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
ChangeLog Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
INSTALL Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
Makefile.am Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
NEWS Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
README Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
TODO Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
configure.in.in Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
design.txt Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago
dub.kdevprj Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. 15 years ago

README

Dub Playlist
------------

A directory based playlist that's meant to be fast, simple and with the
kind of functionality you'd expect from a digital player.

Dub name was inspired from the continuous automated mix of digital music
in Neuromancer. I'm not a Rasta but I still like that idea. As a tribute to
William Gibson I decided to actually write such a program. That's where this
code should be going! Read design.txt also.

Author's note: Those who turn tail-recursive functions into iterations will
be shot!  GCC has tail-recursion optimization.

Author's second note: Yes, I know other people have done things that an
automated dj program could be based on. I'm still more interested in playing
with a few clustering algorithms to get the result I want, I think deriving
the features isn't the hard part. Any ideas welcome.

__
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>