|
MahjongStacks 1.0
|
A challenging word game and puzzle where you move randomly stacked letters to form words. The computer selects words from categories such as Yellow Pages (tm), Common Words, Geography, French Words, etc and randomly places letters into stacks. You must reconstitute the words in the correct order. Play up to 8 words per round using 3 to 6 stacks. Various options.
Classic Solitaire is the most popular solitaire game. A minor change of the game rule makes the game more fun. The game can be paused at any moment and continued from where it is paused, so it is convenient for you to play the game on the go. The object of the game is to use all the cards in the deck of sever playing stacks to build up the four suit stacks in ascending order, beginning with the aces.
Spider Solitaire is the most fun solitaire game that is played with 104 cards in ten playing stacks. The object of the game is to remove all of the cards from the ten playing stacks. This Spider Solitaire games has three difficulty levels with one, two and four suites. Usually, it takes about 10 to 30 minutes to play the game for one round, depending on the selected difficulty level.
FmPro Migrator quickly and accurately migrates FileMaker database structure and data to MySQL, Oracle, Access, SQL Server, Sybase, DB2, OpenBase, PostgreSQL and FrontBase. -- Converts Layouts/Scripts to Revolution Stacks -- Migrates Access, Bento and SQL Server to FileMaker 9 -- Converts Bento Forms to FileMaker Layouts -- FileMaker Table Consolidations (Developer Edition) -- Generates Perl CGI scripts for all databases (except OpenBase) -- Repeating Fields Extraction -- Economical Single User License Free demo available for MacOS X and Windows.
frontbase, postgresql, sql server, access, blob, filemaker 7, perl cgi, container, bento, oracle, database, mysql, openbase
Create stacks in descending order by dragging and dropping cards. Move cards of the same suit into the top four piles, starting with the Ace. Play this addictive Solitaire game and have a lot of fun for FREE!
Stacks, Queues and Dequeues (using arrays or linked lists) * Sets (Pascal implementation, with union, difference, intersection, etc.) * Bags, Tables and Dictionaries * Priority Heaps (uses the MemSL multi-dimensional array allocator) * Priority Search Queue * Data Handling and User Defined Functions * Using Multiple MemSL Data Structures to Index the same Data * Portability * Memory Tracing/Debugging (C Only) * Runtime Memory Tracing/Debugging (C
hash tables, debugging, memory tracing, threaded binary trees, double linked lists, circular linked lists, priority heap, single linked lists, dequeues, avl balanced trees, stacks, queues