queue

Author: Carlos Green

Chapter5Queues/Dancing.js

@@ -0,0 +1,8 @@
+function Dancer(name, sex) {
+  this.name = name
+  this.sex = sex;
+}
+
+function getDancer(males, females) {
+  var names = console.
+}

Chapter5Queues/priorityQueues.js

@@ -0,0 +1,40 @@
+const Queue = require('./queue.js');
+
+function Patient(name, code) {
+  this.name = name;
+  this.code = code;
+}
+
+var p = new Patient('Smith', 5);
+var ed = new Queue();
+
+ed.enqueue(p);
+
+p = new Patient('Jones', 4);
+ed.enqueue(p);
+
+p = new Patient('Fehrenbach', 6);
+ed.enqueue(p);
+
+p = new Patient('Brown', 1);
+ed.enqueue(p);
+
+p = new Patient('Ingram', 1);
+ed.enqueue(p);
+
+var seen = ed.dequeue();
+console.log(seen, 'seen');
+console.log(' ');
+console.log('Patient being treated: ' + seen[0].name);
+console.log(' ');
+console.log('Patients waiting to be seen: ');
+console.log(' ');
+console.log(ed.toString(), 'string');
+
+/*
+var seen = ed.dequeue()
+console.log(seen, 'seen')
+console.log("Patient being treated: " + seen[0].name)
+console.log("Patients waiting to be seen: ")
+console.log(ed.toString(), 'string')
+*/

Chapter5Queues/queue.js

@@ -0,0 +1,50 @@
+function Queue() {
+  this.dataStore = []
+  this.enqueue = (element) => {
+    this.dataStore.push(element)
+  } 
+  this.dequeue = () => {
+    //return this.dataStore.shift() // not priority queue
+    var priority = this.dataStore[0].code
+    for (var i = 1; i < this.dataStore.length; ++i) {
+      if (this.dataStore[i].code < priority) {
+        priority = i
+      }
+    }
+    return this.dataStore.splice(priority, 1)
+  }
+  this.front = () => {
+    return this.dataStore[0]
+  }
+  this.back = () => {
+    return this.dataStore[this.dataStore.length - 1]
+  }
+  this.toString = () => {
+    var priority = this.dataStore[0].code
+    for (var i = 1; i < this.dataStore.length; ++i) {
+      if (this.dataStore[i].code < priority) {
+        priority = i
+      }
+    }
+    return this.dataStore.splice(priority, 1)
+  }
+  /*
+   * Not priority queue
+  this.toString = () => {
+    var retStr = ""
+    for (var i = 0; i < this.dataStore.length; ++i) {
+      retStr += this.dataStore[i] + "\n"
+    }
+    return retStr
+  }
+  */
+  this.empty = () => {
+    if (this.dataStore.length == 0) {
+      return true
+    } else {
+      return false
+    }
+  }
+}
+
+module.exports = Queue 

Chapter5Queues/sortingQueues.js

@@ -0,0 +1,46 @@
+const Queue = require("./queue.js")
+
+function distribute(nums, queues, n, digit) {
+  for (var i = 0; i < n; i++) {
+    if (digit == 1) {
+      queues[nums[i]%10].enqueue(nums[i])
+    } else {
+      queues[Math.floor(nums[i] / 10)].enqueue(nums[i])
+    } 
+  }
+}
+
+function collect(queues, nums) {
+  var i = 0;
+  for (var digit = 0; digit < 10; ++digit) {
+    while(!queues[digit].empty()) {
+      nums[i++] = queues[digit].dequeue()
+    }
+  }
+}
+
+function disArray(arr) {
+  for (var i = 0; i < arr.length; ++i) {
+    console.log(arr[i] + " ")
+  }
+}
+
+var queues = []
+
+for (var i = 0; i < 10; ++i) {
+  queues[i] = new Queue()
+}
+
+var nums = []
+for (var i = 0; i < 10; ++i) {
+  nums[i] = Math.floor(Math.floor(Math.random() * 101))
+}
+
+console.log("Before radix sort: ")
+console.log(disArray(nums))
+console.log(distribute(nums, queues, 10, 1))
+console.log(collect(queues, nums))
+console.log(distribute(nums, queues, 10, 10))
+console.log(collect(queues, nums))
+
+console.log(disArray(nums))