Free slots 2 software for linux

GPC-Slots 2 is a more advanced GPC-Slots.
NOTE: Run in Gnome-Terminal with Linux Colors set as the color scheme or the Console for the sake of perty colors (Xterm uses a diffrent color scheme that looks less good IMHO for some unknown reason) (gpcslots2 --gnome-terminal). Alternatively, KDEs konsole can be used (gpcslots2 --konsole).
NOTE: entering "a" at the slot macines will execute the previous command again.
Main features:
- 5 slot machines
- Progressive jackpot added to by all machines
- 2 roulette games
- 2 dice games
- Status print out to HTML
Enhancements:
- html status output graph improvements.
- new ways to bet in roulette game

XLObject is a clone of basic services offered by the Qt object model, redesigned around modern features of the C++ language. Signals and slots are used for communication between objects. There are instances when we want some objects to know the changes of a particular object without having to write code for each interested object.
This design is common in GUI programming, where another widget needs to be notified implicitly of the change of one widget. Since the widget needs to be usable everywhere, the design should be as generic as possible. The event-generating widget should not need to know how or which widgets are informed of the event.
In older C-based toolkits, this functionality is achieved by using "callbacks" - registering pointers to functions to a processing function. The problem with callbacks is that they are not type safe, prone to crashes, and are strongly tied to the processing function.
Signal and Slots is an implementation of the Observer design pattern made popular by the Qt toolkit. It provides a much safer alternative to callbacks in addition to being built on the principles of object-oriented programming. Qt implemented this feature by dynamically adding extra information to classes during compile time with the help of an external meta object compiler.
XL Signal and Slots achieves the same functionality without the meta compiler by taking advantage of C++ templates. This direct approach is very fast compared to Qts string-based approach with the added benefit of:
Allowing all member functions to be treated as slots.
No longer needing specification of non-standard macros during class definitions.
At the same time, the library tries to follow the design of Qt as closely as possible where it:
Automatically severs the connection if either receiver or sender is destroyed so your program does not crash during the process of emitting a signal.
Lets receiver objects know which sender Object emitted the signal
Lets the compiler catch type mismatches.
Allows a slot to have a shorter signature than the signal without having to rebind types.
Optionally allows objects to be organized as object trees and achieving a concept that is more or less similar to garbage-collection.
The library aims to achieve the core signal and slots functionality very well and at the same time be as less complicated as possible. In around a thousand lines of code, the library is capable of being embedded into the application in a very tiny amount of space.
Enhancements:
- This release fixes a severe memory leak in the thread class.
- The documentation was improved in some of the utility classes.
- Options are provided to specify an optional address in server sockets.
- Some additional fixes were made in the core socket classes.

This are Hyriands UNOFFICIAL PySoulSeek patches.
PySoulSeek major features:
- Total queue size limiter
- Option to disable queue size limits for buddies
- Placeholder icons for tabs, so pyslsk doesnt ahve to re-layour (tnx hdhg)
- Faster connection to firewalled users if youre not firewalled yourself (enable "I can receive direct connections" in the server tab of the configuration screen)
- Run a command when a transfer or directory finishes (to auto-enqueue in xmms for example) (filename is properly escaped etc). Thanks Danial
- "Download to".. Select a download folder "on the fly"...
- Auto-reply when away.. Send a canned message to user that send you a private message when you are away..
- Incomplete dir. All incomplete files will be stored here and moved to the download directory when finished.
- Regexp filter in/out. This is an advanced option you should only use if you know what regexps are. You can enable it in the Misc tab of the settings screen.
- PM history (will show the last 15 lines of a conversation if loggin is enabled)
- Search filtering (see new help screen)
- Buttons on the user info are placed nicer
- Set the maximum number of upload slots to use
- Recursive directory downloading (thanks to geertk)
- Command aliasing.. Create your own / commands. See below for syntaxis
- GB/MB/KB filesizes in the transfers list
- Locale-independant decimal separators
- Configurable text colours for chats and search results
- Allow people on your user list to be scheduled for uploads ahead of regular users (see the transfers tab in the settings dialog)
Main features:
- Added features from Hyriands patch:
- Pyslsk will ping the server every 30 seconds (rewrote it to be gui-independent)
- Search history (remembers 10 last searches)
- Log window is now collapsable (state is remembered between sessions), rewrote it to look prettier than hyriands version
- Resizable panels arent deleted anymore when made really small
- Userinfo and browse tabs show user status
- /clear /c will clear a chat screen
- version in the window title
Enhancements:
- Code speedups, wxPython 2.6 fixes, and Unicode/character encoding fixes were made.
- Support for remotely-initiated uploads was added.
- An ignore button was added to searches.
- Graying out was re-enabled for users who left in the chat room.

Evocosm is a C++ Framework for Evolutionary Computing library.
Evocosm is a set of classes that abstract the fundamental components of an evolutionary algorithm. Ill list the components here with a bit of introduction; you can review the details of the classes by downloading the code archives or by reviewing the online documentation (see the menu at the articles beginning for code and documentation links.)
All class documentation was generated from source code comments using doxygen. These docs have not been thoroughly proofread, so they may contain a few typos and minor errors. Self-publishing has taught me the value of a good proofreader.
Evolutionary algorithms come in a variety of shapes and flavors, but at their core, they all share certain characteristics: populations that reproduce and mutate through a series of generations, producing future generations based on some measure of fitness. An amazing variety of algorithms can be built on that general framework, which leads me to construct a set of core classes as the basis for future applications.
The classes include:
Random Numbers
Evocosm relies on the code in The Twisted Road to to Randomness for random number generation. The Mersenne Twister algorithm is particularly well-suited to evolutionary algorithms, based on its long period, granularity, "randomness", and speed. As of the 2.1.0 release of libevocosm, the mtprng class resides in libcoyote, and not libevocosm as it did earlier. This means that any program using libevocosm must also link against libcoyote.
Validation
To validate function arguments, Evocosm uses the code I describe in Beyond Assert; this code is part of libcoyote. Any program using libevocosm must also link against libcoyote.
Floating- Point Chromosomes
Evcosom supports the crossover and mutation of IEEE-754 floating-point numbers, using an algorithm I invented in the mid-1990s. This topic is covered in detail here.
Roulette Wheels
The roulette_wheel class implements the concept of a "software roulette wheel" for Evocosm. This is a tool for natural selection, wherein the fitness of an organism determines the width of its "slot" on an imaginary roulette wheel.
Organisms
Think of an "organism" as an answer to a problem posed by a fitness landscape; "genes" define its behavior and an associated fitness value is assigned by an evocosm during testing. Evocosm provides the freedom to define organisms as almost anything: bit strings, floating-point numbers, finite state machines, LISP programs, or external robots controlled via radio waves. In A Complexity of Options, I used an Evocosm-derived GA to determine the gcc options that produce the faster code.
Fitness Landscapes
A "fitness landscape" defines the environment where organisms "live" or a problem that they are tested against. The landscape is intimately tied to the nature of the organism; think of an organism as a potential solution to a problem implemented by the landscape. A floating-point organism, for example, could be tested by a fitness landscape that represents a function to be maximized. Or, an organism describing the shape of wing could be tested by a landscape that simulates a wind tunnel.
Evocosms
The evocosm class binds a population of organisms to a set of objects that define the rules of survival and reproduction. An evocosm will have one or more populations, which will evolve against population-unique and shared (common) fitness landscapes; breeding is controlled by a set of class objects from the following classes.
Fitness Scaling
As a population converges on an "answer", the difference between fitness values often becomes very small; this prevents the best solutions from having a significant advantage in reproduction. Fitness scaling solves this problem by adjusting the fitness values to the advantage of the most-fit chromosomes. Evocosm includes a variety of fitness scaling algorithms.
Migration
A migrator removes individuals (via "emigration") from a population of organisms, transferring them to another population (via "immigration"). The only concrete implementation of this interface is random_pool_migrator, which defines a specific number of organisms that may migrate from each population to another. When creating a random_pool_migrator, specify the number of organisms that can migrate from each population. Migration is, of course, meaningless in any application that has only one population.
Selecting Survivors
A selector decides which organisms survive from one generation to the next. Some evolutionary algorithms will not use a selector; other will. In general, it is effective to keep the "best" organisms from one generation to the next, so that good genes do not become lost at random. This is, of course, an improvement on nature, where being "the best" doesnt guarantee survival.
Reproduction
In most cases, a reproducer generates new organisms using parents selected (by fitness) from an existing population. In some singular (and probably rare) cases, a reproducer might generate new, random organisms in order to keep diversity high. Reproduction techniques can include crossover and asexual, sexual and (my favorite) try-sexual models.
Mutation Operators
A mutator applies mutations (random, usually small changes) to a set of organisms. Mutation is highly dependent on the type of organism. In traditional genetic algorithms, a mutation flips one or more bits in an integer (i.e., chromosome). Evolving a path for the Traveling Salesman Problem involves complex mutations that maintain valid permutations of destination points; in the case of floating-point numbers, Ive provided utilities for mutating and crossing IEC-60559 (IEEE- 754) float and double types.
Enhancements:
- Minor bugfixes, code cleanups, and changes to pseudo-random number generators.
- Now includes Visual Studio 2005 projects along with GNU build files.

The SlotSig library is a library that provides type-safe connections between C++ classes.
When programming in C, its usual to use callback functions (moreover when you do GUI stuffs). In C++, we prefer to encapsulate things into classes, and usually we want a rather type-safety.
This small library attempt to provide an easy-to-use, type-safe, C++-friendly solution to the problem. The idea is to define slots, either as global functions or member methods, that will be called when some signals are emitted The signals and slots do not need to really know about each other, only a pointer and a compatible signature is required.
Inconsistent connections (when return type or parameters do not match) should be detected at compile-time.
If youve heard about the Qt, libsigc++, Sigslot or boost libraries, or any other Im not aware of (if this is the case, let me know !), maybe you wonder why yet another signals lib. Here are the main reasons :
- Qts system needs a preprocessor (called moc, for Meta-Object Compiler) that will produce additionnal code to enable the connections and handle the signal emitting ; its quite simple to use, but you cant use templates on signal/slot-enabled classes, and inconsistencies are not detected at compile time but at runtime ;
- I found libsig++ a great thing, but a little bit to complex to use, and I dislike some casts done into it ; I also dislike the fact that a function (or method) connected twice will be called twice when emitting the signal ;
- Boost is fine, but to use the signals module you also need a rather large part of the whole lib ; theres nothing really wrong with that, I just wanted something smaller â and easier to use ;
- It was fun to code, and because I did it, I find SlotSig the simplest signal/slot library available.
Enhancements:
- Incorporated the Makefile from Leopold Palomo-Avellaneda, to generate a global shared library containing the very small amount of static code.
- Updated benchmarks. The 1.x versions of SlotSig will remain binary-compatible. No major new feature is expected, mainly cosmetic changes and bugfixes. The main line of development will be done in a 1.99.x branch, maybe leading someday to a 2.0 version.

libsigc++ implements a full callback system for use in abstract interfaces and general programming. libsigc++ is the most complete library of its kind with the ability to connect an abstract callback to a class method, function, or function object.
It contains adaptor classes for connecting dissimilar callbacks and has an ease of use unmatched by other C++ callback libraries.
Main features:
- Compile time typesafe callbacks (faster than run time checks)
- Typesafety violations report line number correctly with template names (no tracing template failures into headers)
- No compiler extensions or meta compilers required
- Proper handling of dynamic objects and signals (deleted objects will not cause seg faults)
- Extendable API at any level: signal, slot, connection and trackable
- Extensions do not require alteration of basic components
- User definable accumulators
- A variety of adaptors to change the callback signature: bind, hide, retype, compose and lambda call groups
- Various compilers and platforms are supported: gcc, cygwin, mingw32, MS .NET 2003, Sun Forte C++, Compaq C++, Intel C++
libsigc++ is known to build and work with the following compilers:
- g++ (>= 3.2, including Apple and Cygwin versions)
- Microsoft Visual C++ .NET 2003
- Intel C++ compiler
- SUN Forte C++ CC
- IBM AIX xlC
- Tru64 C++
- IRIX MIPSpro

Crossfire TRT project is an advancement of the crossfire multi-user RPG game. Unlike the original project, it focuses mainly on stability and playability, but also adds modern technology such as map scripting, Perl server extensions, asynchronous I/O, higher resolution graphics, and better client support.
Main features:
- Death is not permanent, and you can get back all lost stats and experience by playing a game in a special place named Nimbus. You are teleported there when you die and you have to play a game (currently minesweeper) to get out.
- Friendly fire is disabled and playerkilling is also modified. You can only kill another player when you and the other player are hostile. To become hostile, you have to visit the church of Gorokh in Scorn and talk to the priest. To become peaceful again, visit the curch of Valriel and talk to its priest.
- Invitation of other players to where you are is possible with the invite command. You have to solve the invitor quest (see below in maps) to be able to use the command.
- You can follow other players with the follow command when you stand next to the player you want to follow.
- Pet monsters and summoned creatures will not stand in the way of other party members, making it bearable to play with summoning skills in a party.
- Map and graphics artists are working on improved graphics and new maps and quests.
- A new currency: the Royalty. Its worth 100 Platinum and is made of paper. (The bank script was completly rewritten in Perl)
- The communication commands have been rewritten in Perl and an ignore command was added.
- Trade shops have been implemented in Perl, which allows the player to trade items when they are offline.
- Big 64x64 faces and tiles have been introduced, which have a higher detail level than the old 32x32 tiles, and can be used with the CFPlus client.
Enhancements:
- optimised event invocation (non-wanted events can now be skipped with 4-5 inlined instructions).
- complete rewrite of town_portal: it now creates a portal to the "nearest" town only, travel is only possible to the town and back, anybody can use it (also removes one of the remaining syncpoints in the server).
- complete rewrite of the range/attack skill slot system: there are now two slots, one for combat, one for ranged attacks.
- introduce the concept of a current weapon (either a ranged or a combat weapon/skill/tool) and switch between them as needed.
- rewrite bow code so bows get more useful: apply damage, attacktype and other stats to the arrows and treat bows as weapons. also rebalance the missile weapons skill so its damage increases with level.
- rewrite the complete player speed logic: weapon_speed now works as documented and there are no unnatural speed boosts.
- implement a utility - cfutil - that simplifies arch and map installation, replacing the old collect scripts and simplying deployment by scaling and cutting faces as required.
- simplify the map protocol extensively by taking advantage of missing bigfaces, speeding up map generation immensely.
- implement inherit keyword allowing archetypes to inherit from other archetypes.
- rationalise archetype, region and treasurelist file format into a single file format and make them reloadable asynchronously.
- make the worldmap, facedata (smoothing, faces, magicmap) reloadable at runtime.
- implement 64x64 faceset support.
- implement fxixsx protocol that saves a lot of bandwidth over the old image/face/smooth packets and allows images > packetsize, incremental and background transfers.
- implement a bandwidth-saving smoothing protocol that works on a face basis as opposed to a mapspace basis.
- the server can now rate-limit image uploads to not exceed a certain (client-configurable) speed while guarenteeing full freedom of movement.
- implement new ex command to request item descriptions.
- implement new msg command for in-game messages with meta information (using xml).
- enforce utf-8 for all text messages.
- added micropather (not used yet).
- many, many bugfixes.