Objects and Hash tables in JavaScript

Hash tables share many similarities with objects, like storing data in key-value pairs and having the same syntax to add and retrieve elements. We can think of hash tables as a dictionary where you can look up a word definition using just the letter/letters, except for hashing the key string into a series of numbers that will be used to access the value in the array that holds the values.

So in general, we should use hash tables instead of objects because they provide a very fast access to the data stored within.

Comments

Stack vs. Queue

Stack is like a pile of books placed on top of each other. We can add new books to the top and can remove them from only the top because stacks are LIFO which means last-in, first-out. Queues on the other hand are the opposite, which is FIFO meaning first-in, first-out. So adding an element to the queue will be the same but removing will happen to the first element not the last one. An example of a queue would be the wait line in front of any kind of service we see around us like the bus station or the shops,....etc.

Middlewares

Middlewares in Javascript are functions that come in the middle of the request-response cycle. They have access to both the request and the response object as well as the next middleware function to be executed; usually called next(). Popular examples on middleware include: body-parser, cors, session, cookie-seesion and cookie-parser.

colorfulMinds

Search This Blog