We’ve covered the basic concepts of HTTP and the types of information that it deals with. We dealt with the parts of an HTTP request on a high level, all the different request types, and some of the other basic features and ideas of the HTTP (protocol).
With URIs we can reference and locate just about everything we need to on the internet, from books, videos, sites, and games. Without URIs we’d still be stuck in specific clunky ways to access specific things using specific clients and methods, instructions which I followed in many a book before URIs became a big thing. Now, it’s simple: http://wunk.me/
I came across this book in the Colorado State University library, one of my favorite places, and was intrigued. I was intrigued because it seemed that instead of relying on esoteric computational equations and such, talking about optimization, O notations, and such, this book instead took the approach of diving directly into straight implementation of a compiler and interpreter.
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.
It’s not too hard to set up a basic command line PHP coding environment using github, composer, and phpunit. This tutorial covered how to set up the development environment if you’re using php purely from the command line. This tutorial did not cover *AMP installations.
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.
As you can see binary arithmetic calculations are easy-peesy. I mean you only have to digits to worry about: 1 and 0. I remember learning my multiplication tables and 7 was the hardest for me to remember. I was never good at 7 until I was an adult. But, as a kid, I thought I had to know it all now… I couldn’t imagine myself as an adult.