That’s right, run PyGame (in all it’s Pythonic glory) IN THE BROWSER! All in all, it’s a rough draft. The code isn’t fully documented because really, it’s ported from other places where there IS documentation (pygame, gamejs, etc.) Anywhere where the functions/classes don’t QUITE act like their pygame equivalent I make a note of though, so that you aren’t tripped up.
asherwunk/phabstractic now implements a common event object, useful in the “Universal Event System”. The Universal Event System What I call the universal event system is basically several constructs built on top of the Publisher/Observer design...
I decided that, for future projects, I needed to port asherwunk/phabstractic to the Python programming language (pyabstractic). Well, phabstractic relies on a couple packages itself that are in the PHP domain. One of these packages is zend-config, which is part of the Zend Framework programming library.
Observers and Publisher design patterns are very important in that they enable a certain amount of reactive programming. When you only want something to execute or occur when a particular event occurs it makes more sense to just test for state change then to hard code in an if clause for every step.
Doubly linked lists are important data structures for they enable a range of data to be stored in sequential order in memory without necessarily having to be spaced next to each other, or worry about a particular size. There are many advantages to storing data outside of an array like this, including the dynamic nature of its allocation and flexibility of editing the order of elements (including the addition and subtraction of elements).
Object stores, associative arrays, and Maps are important data structures. They are useful in statistical analysis, as well as for in memory database storage, such as a Redis implementation. The advantage of a map is that you don’t have to remember cryptic index values, as well it allows you to establish an abstract association between two data objects.
Priority Queues are very useful and usually, are implemented using heaps. This Priority Queue is implemented using an array that sorts itself rather than an overly complicated binary tree or heap. A priority queue is very useful for event-oriented programming, multitasking processes, and online message queues.
Self-sorting lists can be very handy. For instance, we could easily implement a priority queue by utilizing a sorted list, and that’s something we’re going to do, simply using the comparison method on competing priorities. Self-sorting arrays make putting everything in order in a messaging queue fairly simple.
Many programming techniques and data structures – including rope (data structure), lazy evaluation, class hierarchy (see below), arbitrary-precision arithmetic, CDR coding, the indirection bit and other kinds of tagged pointers, etc. – are usually implemented using some sort of tagged union.
Sets are very important mathematical constructions, and enable the computation of many other abstract data types. A set can have singularly exclusive values, or can have multiples of the same value in them. Sets can be compared using algebraic operators, and can exist as subsets of other sets. Set abstract data types can hold references as the data of an element, enabling some interesting behavior.
The feature defines a static property for the using class. This static counter remains unique on each poll for a new identity (in this case it’s an integer). The $identityCounter must be ‘increasable’, that is, every time its accessed or ‘advanced’ it must be unique from all the identity values before it. Counting up is a very easy way to accomplish this.
PHP doesn’t have an enumeration data type, so I built an enumeration generator of my own. It actually won an award on phpclasses.org! It has been refactored to use the Configuration feature, formatted to follow the PSR standards as best it can, and relicensed under the MIT License.