more draft content - short hand methods, stacks

Author: HansUXdev

00-Drafts/00-Iterables/loop-shorthand.js

@@ -0,0 +1,21 @@
+/**
+ * For
+ */
+const fruits = ['mango', 'peach', 'banana'];
+for (let fruit of fruits)
+  console.log(fruits)
+
+/**
+ * For IN
+ */
+const obj = {continent: 'Africa', country: 'Kenya', city: 'Nairobi'}
+for (let key in obj)
+  console.log(key) // output: continent, country, city
+
+
+/**
+ * ForEach
+ */
+const logArrayElements = (element, index, array) => console.log("a[" + index + "] = " + element);
+[2, 5, 9].forEach(logArrayElements);
+

00-Drafts/00-Iterables/readme.md

@@ -0,0 +1,78 @@
+---
+theme : "night"
+transition: "slide"
+highlightTheme: "monokai"
+logoImg: "logo.png"
+slideNumber: false
+title: "VSCode Reveal intro"
+---
+
+::: block
+*JavaScript Iterables* {style=background:red;width:500px}
+::: 
+
+
+---
+
+### ToDo List
+
+- [ ] Recurvive Functions
+- [ ] While VS Do While Loop
+- [ ] For Loop
+- [ ] For Each
+- [ ] Arrays - Map, reduce, etc
+- [ ] For of VS For of
+- [ ] For Await
+
+---
+
+### Recurvive Functions
+
+- [ ] Recurvive Functions
+- [ ] While VS Do While Loop
+- [ ] For Loop
+- [ ] For Each
+- [ ] Arrays
+- [ ] For of VS For of
+- [ ] For Await
+
+---
+
+### While VS Do While Loop
+
+- [ ] Recurvive Functions
+- [ ] While VS Do While Loop
+- [ ] For Loop
+- [ ] For Each
+- [ ] Arrays
+- [ ] For of VS For of
+- [ ] For Await
+
+---
+
+### For Loop
+- [ ] i
+- [ ] sematic naming
+- [ ] nested loops
+
+---
+
+
+### Arrays - ForEach, Map, reduce, etc
+
+- [ ] Callbacks
+
+---
+
+### Arrays -   For of VS For of
+
+- [ ] For of VS For of
+- [ ] For Await
+
+
+---
+
+### For Await
+
+- [ ] Generators 
+- [ ] For Await

00-Drafts/00-ShortHand/Loop.js

@@ -0,0 +1,21 @@
+/**
+ * For
+ */
+const fruits = ['mango', 'peach', 'banana'];
+for (let fruit of fruits)
+  console.log(fruits)
+
+/**
+ * For IN
+ */
+const obj = {continent: 'Africa', country: 'Kenya', city: 'Nairobi'}
+for (let key in obj)
+  console.log(key) // output: continent, country, city
+
+
+/**
+ * ForEach
+ */
+const logArrayElements = (element, index, array) => console.log("a[" + index + "] = " + element);
+[2, 5, 9].forEach(logArrayElements);
+

00-Drafts/00-Stacks/BigO.js

@@ -0,0 +1,165 @@
+/**
+ * Articles
+ * 1. Good Medium citation
+ * https://codeburst.io/js-data-structures-linked-list-3ed4d63e6571
+ */
+
+
+function LinkedList() {
+
+  let Node = function(element){
+      this.element = element;
+      this.next = null;
+  };
+
+  let length = 0;
+  let head = null;
+
+  this.append = function(element){
+
+      let node = new Node(element),
+          current;
+
+      if (head === null){ //first node on list
+          head = node;
+      } else {
+
+          current = head;
+
+          //loop the list until find last item
+          while(current.next){
+              current = current.next;
+          }
+
+          //get last item and assign next to added item to make the link
+          current.next = node;
+      }
+
+      length++; //update size of list
+  };
+
+  this.insert = function(position, element){
+
+      //check for out-of-bounds values
+      if (position >= 0 && position <= length){
+
+          let node = new Node(element),
+              current = head,
+              previous,
+              index = 0;
+
+          if (position === 0){ //add on first position
+
+              node.next = current;
+              head = node;
+
+          } else {
+              while (index++ < position){
+                  previous = current;
+                  current = current.next;
+              }
+              node.next = current;
+              previous.next = node;
+          }
+
+          length++; //update size of list
+
+          return true;
+
+      } else {
+          return false;
+      }
+  };
+
+  this.removeAt = function(position){
+
+      //check for out-of-bounds values
+      if (position > -1 && position < length){
+
+          let current = head,
+              previous,
+              index = 0;
+
+          //removing first item
+          if (position === 0){
+              head = current.next;
+          } else {
+
+              while (index++ < position){
+
+                  previous = current;
+                  current = current.next;
+              }
+
+              //link previous with current's next - skip it to remove
+              previous.next = current.next;
+          }
+
+          length--;
+
+          return current.element;
+
+      } else {
+          return null;
+      }
+  };
+
+  this.remove = function(element){
+
+      let index = this.indexOf(element);
+      return this.removeAt(index);
+  };
+
+  this.indexOf = function(element){
+
+      let current = head,
+          index = 0;
+
+      while (current) {
+          if (element === current.element) {
+              return index;
+          }
+          index++;
+          current = current.next;
+      }
+
+      return -1;
+  };
+
+  this.isEmpty = ()=>  length === 0;
+
+  this.size = ()=>  length;
+
+  this.getHead = ()=> head;
+
+  this.toString = function(){
+
+      let current = head,
+          string = '';
+
+      while (current) {
+          string += current.element + (current.next ? ', ' : '');
+          current = current.next;
+      }
+      return string;
+
+  };
+
+  this.print = function(){
+    console.log(this.toString());
+    // console.table(this);
+      let [...table] = this.toString()
+      console.table(table);
+      // console.table(Node());
+  };
+}
+
+let list = new LinkedList();
+list.append(15);
+list.print();
+console.log(list.indexOf(15));
+list.append(10);
+list.print();
+console.log(list.indexOf(10));
+list.append(13);
+list.print();

00-Drafts/00-Stacks/Screen Shot 2020-02-03 at 11.05.57 AM.png

@@ -0,0 +1,51 @@
+let Stack3 = (function () {
+
+  const items = new WeakMap();
+
+  class Stack3 {
+
+      constructor () {
+          items.set(this, []);
+      }
+
+      push(element){
+          let s = items.get(this);
+          s.push(element);
+      }
+
+      pop(){
+          let s = items.get(this);
+          let r = s.pop();
+          return r;
+      }
+
+      peek(){
+          let s = items.get(this);
+          return s[s.length-1];
+      }
+
+      isEmpty(){
+          return items.get(this).length == 0;
+      }
+
+      size(){
+          let s = items.get(this);
+          return s.length;
+      }
+
+      clear(){
+          items.set(this, []);
+      }
+
+      print(){
+          console.log(this.toString());
+      }
+
+      toString(){
+          return items.get(this).toString();
+      }
+  }
+
+  return Stack3;
+})();
+