Impllementation of a Hash Bin for Phrase Parsing

This demonstrates parsing a phrase for hasing

by Ryan Brown

HTML

<form id="form">Enter Phrase.
    <br>
    <textarea id='phrase' rows='10' cols='50'>This is some sample text this is</textarea>
    <br>
    <input type="button" value="Parse Phrase" id="parse" onClick='parsePhrase();'>
</form>
<div id="output"></div>

JavaScript

var hashTable = new HashTable(); // Global
function parsePhrase() {
    var phrase = document.getElementById('phrase').value;
    var phraseAsStringArray = phrase.split(' ');
    var len = phraseAsStringArray.length;
    
    for (var i = 0; i < len; i++) {
        //alert(phraseAsStringArray[i]);
        hashTable.addWord(phraseAsStringArray[i]);
    };
}

function HashTable(){
    // Decide how to store the bins - add here
    // This will contain all the Words
    this.bins = []; // using array as example (list is better)
    this.addWord = function(word) {
        alert('Adding ' + word + ' to Hash Table, remove this alert in your submission');
        return word;
        // You will add a word to the HashTable
        // If word is in table add to Word
        // If not create new one    
    };
    
    this.hasWord = function(word) {
        // Implement
        return word;
    };
    
    this.addNewWord = function(word) {
        // Implement
        return word;
    };
    
    this.addExistingWord  = function(word) {
        // Adds Word to structure that already exists
        return word;
    };
}

function Word(word) {
    this.word = word; // store word
    this.indexes = []; // using array to store indexes
    
    // Probably want some logic here

    }