Free priority club software for linux

cpulimit is a simple program that attempts to limit the cpu usage of a process (expressed in percentage, not in cpu time). This is useful to control batch jobs, when you dont want they eat too much cpu.

cpulimit project does not act on the nice value or other scheduling priority stuff, but on the real cpu usage. Also, it is able to adapt itself to the overall system load, dynamically and quickly.

Audiality is a scalable and portable audio engine for music and sound effects. It is intended to play equally well in studios and inside games, in order to serve as a flexible tool for content creation, and for use in the final product.

Audiality uses MIDI files in combination with scripting and modular synthesis, to minimize file sizes and maximise flexibility. It is very portable, and supports both integer and floating point processing modes.

Scalability has been a major priority from the start. The current version will run on very low end Pentium systems, but can also produce high quality audio on more powerful hardware.
The main goal for the future is to extend the scalability of Audiality well into the range of serious home and professional studio use. The idea is to provide total control, a wide range of features, tools for fast and effective creation of original sounds, and excellent audio quality.

PKAudio library is a high performance signal/audio processing library that allows stream objects to be created and mixed without interrupting the main stream of audio.

The core library runs in pkaudiod, an executable that runs with realtime or high priority, and a single client can communicate with it via a tcp socket.

A python client is provided, and can be used to write clients in other languages if necessary. The API is small and the protocol is simple.

Installation:

There are two parts to pkaudio: the pkaudiod daemon executable and the python module to communicate with it. The daemon is written in C++ and is configured and compiled like and other make program. To install everything, all you have to do is use the install.py python script like any other extension module. Here are the simplest install instructions:

cd < source dir >
python install.py [-h]

Usage:

If Jack support is compiled into pkaudio, make sure you start the jack daemon before running pkaudiod. If you dont, there will be no audio output. You can start the jack server with at least something like this (-r 44100 is required):

jackd -d alsa -r 44100

The pkaudiod executable is installed in your path and can be executed explicitly from the command line, or implicitly with the python module:

pkaudiod --realtime

The "--realtime" option tells pkaudiod to run with realtime priority, or the highest priority possible if realtime shceduling is not available in the kernel. Most systems will only allow processes to be scheduled with realtime priority if they are executed by the superuser "root". If you want to run the daemon with realtime priority as a normal user, you have to set the owner of the file to root, and the suid bit to on, like this (this is automatically done in the install.py script):

su
chown root `which pkaudiod`
chmod +s `which pkaudiod`

The daemon will tell you if it is running with realtime priority, or if it is running with increased priority.

Using the Python Module:

A good way to learn how to use the python module is to look at test_unittest.py. But, the following code will start the pkaudiod daemon as a child process and play a wav file:

import time
import pkaudio
pkaudio.connect(startserver=1)

sid = pkaudio.createModule(Sample,
/home/ajole/wav/loops/Document 1.wav)
sample = pkaudio.getModuleInfo(sid)
mixer = pkaudio.getMainMixer(0)
pkaudio.getModuleInfo(mixer)
pkaudio.connectToMixer(mixer, sample[outs][0])
pkaudio.setProperty(sid, playing, pkaudio.TRUE)
pkaudio.setProperty(sid, looping, pkaudio.TRUE)
time.sleep(100)

Fortunately, all of this can be accomplished with the higher-level PKAudio module:

import time
import PKAudio

PKAudio.start_server()
d = PKAudio.Driver()
s = PKAudio.Sample("/home/me/my.wav")
m = d.getMixer(0)
m.connect(s.outputPort())
s.play()
while not s.atEnd():
time.sleep(1)

Wordplay is a game for Unix/GTK+. Wordplay is primarily aimed at Scrabble players looking to improve their anagramming and hooking skills, but can also be played for fun. The dictionary used is the full TWL98 word list (used for tournaments and club play in the U.S. and Canada).

Three types of games are available:

Word Mine: Find all words of a certain length which can be formed from the letters of a larger word. Letters may be repeated only as often as they appear in the given word.
Word Hooks: Find all words which "hook" off a given word: forming a new word by adding a letter to the beginning or end.
Bingos: Find all anagrams of the given (seven or more) letters. In a Scrabble game, playing a word which uses all letters on your rack is a bingo, netting you a 50-point bonus. The bingo puzzles included with wordplay comprise the 500 most statistically likely bingo-able 7-letter and 8-letter combinations, based on the standard Scrabble bag letter distribution.

CalorieKing Toolbar is a Firefox extension which lets you search CalorieKing.com.

The CalorieKing Toolbar puts an ultra-convenient toolbar right into FireFox which lets you search CalorieKing.com wherever you are on the Internet, all for free.

CalorieKing Club members get the benefit of additional quicklinks straight into their food and exercise diaries, check-ins and forums.

Memory Structures Library (MemSL) is a complete data structures/collection classes library with memory tracing, memory debugging, entry/exit tracing, exception handling, definable memory handlers, built-in thread support, and much more.

The project supports single, double, and circular linked lists, AVL balanced and threaded binary trees, dynamic hashing tables, stacks, queues and dequeues (using arrays or linked lists), sets (Pascal implementation, with union, difference, intersection, etc.), bags, tables and dictionaries, priority heaps, priority search queue, and more.

C Generic Library is a generic data structure library is a bunch of data structures that are designed and created in as generic a fashion as possible.
Each data structure will contain its own basic memory management, be able to handle any object type, and hopefully constraint to strict algorithmic constraints. When the library hits version 1.0, it will contain the following data structures:
- Doubly Linked List - Done
- List-based Queue - Done
- List-based Deque - Done
- List-based Stack - Done
- Vector - Done
- Vector-based Queue - Done
- Vector-based Deque - Done
- Vector-based Stack -Done
- Binary Tree - Done(No BFS/DFS iterators)
- Hash Table - In progress
- Priority Queue - In progress
- Heap - In progress
- Memory Manager
- Object Cache w/ Garbage Collection
- AB Tree
- Split Lists
- RB Tree
- AVL Tree
Enhancements:
- Support for compilation on Windows using VS.net was added.