Merge pull request #78 from jsealey1/master

#44 and #77 fixed
Adds Buffered input to Gets

This is the buffered input object I thought about for #73.
Merge pull request #79 from pyrated/master

Fixed the string input buffer
Working on conversion of the deque to an array base queue
Deque

Deque is now working as an array, push back, pop front work as expected.

Internally the array is resized and setup so that after a resize the
whole array is reordered with the front at index 0 and the back at the
last position. This means that after a resize all insertions will work
as intended.
The grow ability only happens as a last resort. It is only triggered in
an overflow situation.
One issue it does not handle is if it was unable to grow.
Deque Finished

Deque is finished for now.

It uses an array as the internal structure. This gives the following
advantages.
We can mitigate the need to allocate after every push, and deallocate
after every pop.
We gain the reusability of nodes this way

We can initialize the queue to any arbitrary size using the
hkl_deque_new_sized.
This means that if given a relatively ballparked estimate for the memory
needs of a queue
we are able to minimize the calls to malloc to 1 or slightly more.

We are able to use the deque to implement internal arrays in our
langague. They are dynamically sized and therefore will allow HKL to use
them as much as needed.

We can locate the nth item in the array given an index such that -size
<= index < size.

We can locate the nth item in the array given that the queue isn't
empty. This means that cyclical arrays are now as easy to implement as a
single for loop with no extra work required.
Deque is finished for now.

It uses an array as the internal structure. This gives the following
advantages.
We can mitigate the need to allocate after every push, and deallocate
after every pop.
We gain the reusability of nodes this way

We can initialize the queue to any arbitrary size using the
hkl_deque_new_sized.
This means that if given a relatively ballparked estimate for the memory
needs of a queue
we are able to minimize the calls to malloc to 1 or slightly more.

We are able to use the deque to implement internal arrays in our
langague. They are dynamically sized and therefore will allow HKL to use
them as much as needed.

We can locate the nth item in the array given an index such that -size
<= index < size.

We can locate the nth item in the array given that the queue isn't
empty. This means that cyclical arrays are now as easy to implement as a
single for loop with no extra work required.
enter the commit message for your changes. Lines starting

FIXED Issues with not compiling on warnings.
Merge pull request #80 from thebearbear/master

Deque finished
Rewrites build-env in ruby
Updates travis to handle build-env.rb
Merge pull request #81 from cknadler/master

build-env in ruby
Updates readme with build-env.rb
Spruces up build-env with sweet colors
Merge pull request #82 from cknadler/master

Updates readme with build-env.rb
Adds HklValue and reimplements basic expressions.
Error tastic hkl_expression!
Fixes bug in string causing expression to fail.
Also adds new example and completes implementation on binary expression
(add). This commit was a joint effort with @pyrated.
Merge pull request #83 from cknadler/master

Adds HklValue and reimplements basic expressions
Adds hklr statement to print runtime information
Adds Operation Count to hklr statement