Skip to content

Commit c4f912a

Browse files
committed
Create gh-pages branch via GitHub
1 parent ba6977f commit c4f912a

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

index.html

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ <h1>
4747
<p>DataStructures is a JavaScript library where you can find the most common data structures and also other data
4848
structures more advanced. Various method are also provided in order to manipulate data structures.</p>
4949

50-
<p>This library implements also the <a href="http://en.wikipedia.org/wiki/Iterator_pattern">iterator</a> pattern in order to hide
50+
<p>This library implements the <a href="http://en.wikipedia.org/wiki/Iterator_pattern">iterator</a> pattern in order to hide
5151
the data structure that work for storing your data.</p>
5252

5353
<h2>
@@ -70,7 +70,7 @@ <h2>
7070
<a name="how-to-use" class="anchor" href="#how-to-use"><span class="octicon octicon-link"></span></a>How to use</h2>
7171

7272
<ol>
73-
<li><p>Download the minimized library <a href="https://github.com/Bishop92/JavaScript-Data-Structures/blob/master/DataStructuresMinimized.js">here</a>;</p></li>
73+
<li><p>Download the minimized library <a href="https://raw.githubusercontent.com/Bishop92/JavaScript-Data-Structures/master/DataStructuresMinimized.js">here</a> (right click and save as...);</p></li>
7474
<li><p>Include the file in your project;</p></li>
7575
<li><p>Start to use it as any other class.</p></li>
7676
</ol><p>Example</p>

params.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1 +1 @@
1-
{"name":"Javascript-data-structures","tagline":"A library for data structure in JavaScript","body":"[Data Structures](https://github.com/Bishop92/JavaScript-Data-Structures)\r\n=================\r\n**A library for data structures in JavaScript**\r\n\r\nDataStructures is a JavaScript library where you can find the most common data structures and also other data\r\nstructures more advanced. Various method are also provided in order to manipulate data structures.\r\n\r\nThis library implements also the [iterator] (http://en.wikipedia.org/wiki/Iterator_pattern) pattern in order to hide\r\nthe data structure that work for storing your data.\r\n\r\nSupported data structures\r\n-------------------------\r\n- [Stack](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Stack.html)\r\n- [Queue](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Queue.html)\r\n- [Priority Queue](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/PriorityQueue.html)\r\n- [Circular Buffer](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/CircularBuffer.html)\r\n- [Hash Table](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/HashTable.html)\r\n- [Linked List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/LinkedList.html)\r\n- [Double Linked List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/DoubleLinkedList.html)\r\n- [Binary Search Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BSTree.html)\r\n- [Red-Black Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTree.html)\r\n- [Red-Black Tree List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTreeList.html)\r\n- [B-Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BTree.html)\r\n- [Set](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Set.html)\r\n\r\nHow to use\r\n----------\r\n1. Download the minimized library [here](https://github.com/Bishop92/JavaScript-Data-Structures/blob/master/DataStructuresMinimized.js);\r\n\r\n2. Include the file in your project;\r\n\r\n3. Start to use it as any other class.\r\n\r\nExample\r\n\r\n```JavaScript\r\nvar listA = new DoubleLinkedList();\r\nvar listB = new DoubleLinkedList();\r\nlistA.fromArray([0, 1]);\r\nlistB.fromArray([2, 3]);\r\nlistA.join(listB);\r\nlistA.toArray(); // [0, 1, 2, 3]\r\n```\r\n\r\nDocumentation\r\n-------------\r\nFollow this [link](https://github.com/Bishop92/JavaScript-Data-Structures/wiki) to read the full documentation.\r\nFollow this [link](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/index.html) to read the JSDoc.\r\n\r\nHistory\r\n-------\r\n\r\n### Future implementations\r\n\r\n- Persistence for data structures like array and lists.\r\n\r\n### Current state of the art\r\n- v 1.0.0 First release of the library.\r\n\r\nSupport\r\n-------\r\nBattistella Stefano, [stefano.battistella.92@gmail.com](mailto:stefano.battistella.92@gmail.com)","google":"","note":"Don't delete this file! It's used internally to help with page regeneration."}
1+
{"name":"Javascript-data-structures","tagline":"A library for data structure in JavaScript","body":"[Data Structures](https://github.com/Bishop92/JavaScript-Data-Structures)\r\n=================\r\n**A library for data structures in JavaScript**\r\n\r\nDataStructures is a JavaScript library where you can find the most common data structures and also other data\r\nstructures more advanced. Various method are also provided in order to manipulate data structures.\r\n\r\nThis library implements the [iterator] (http://en.wikipedia.org/wiki/Iterator_pattern) pattern in order to hide\r\nthe data structure that work for storing your data.\r\n\r\nSupported data structures\r\n-------------------------\r\n- [Stack](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Stack.html)\r\n- [Queue](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Queue.html)\r\n- [Priority Queue](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/PriorityQueue.html)\r\n- [Circular Buffer](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/CircularBuffer.html)\r\n- [Hash Table](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/HashTable.html)\r\n- [Linked List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/LinkedList.html)\r\n- [Double Linked List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/DoubleLinkedList.html)\r\n- [Binary Search Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BSTree.html)\r\n- [Red-Black Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTree.html)\r\n- [Red-Black Tree List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTreeList.html)\r\n- [B-Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BTree.html)\r\n- [Set](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Set.html)\r\n\r\nHow to use\r\n----------\r\n1. Download the minimized library [here](https://raw.githubusercontent.com/Bishop92/JavaScript-Data-Structures/master/DataStructuresMinimized.js) (right click and save as...);\r\n\r\n2. Include the file in your project;\r\n\r\n3. Start to use it as any other class.\r\n\r\nExample\r\n\r\n```JavaScript\r\nvar listA = new DoubleLinkedList();\r\nvar listB = new DoubleLinkedList();\r\nlistA.fromArray([0, 1]);\r\nlistB.fromArray([2, 3]);\r\nlistA.join(listB);\r\nlistA.toArray(); // [0, 1, 2, 3]\r\n```\r\n\r\nDocumentation\r\n-------------\r\nFollow this [link](https://github.com/Bishop92/JavaScript-Data-Structures/wiki) to read the full documentation.\r\nFollow this [link](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/index.html) to read the JSDoc.\r\n\r\nHistory\r\n-------\r\n\r\n### Future implementations\r\n\r\n- Persistence for data structures like array and lists.\r\n\r\n### Current state of the art\r\n- v 1.0.0 First release of the library.\r\n\r\nSupport\r\n-------\r\nBattistella Stefano, [stefano.battistella.92@gmail.com](mailto:stefano.battistella.92@gmail.com)","google":"","note":"Don't delete this file! It's used internally to help with page regeneration."}

0 commit comments

Comments
 (0)