68 |
69 |
70 |
71 |
72 |
73 |
74 |
75 |
76 |
77 |
--------------------------------------------------------------------------------
/style.css:
--------------------------------------------------------------------------------
1 | body {
2 | background: #000000;
3 | color: #eeeeee;
4 | overflow: hidden;
5 | text-align: center;
6 | font-family: monospace;
7 | }
8 |
9 | #visualize, #controls {
10 | display: inline-block;
11 | width: 48%;
12 | height: 100%;
13 | margin: 5px;
14 | }
15 |
16 | #visualize {
17 | float: left;
18 | }
19 |
20 | #controls {
21 | text-align: left
22 | }
23 |
24 | .key {
25 | padding: 5px 10px;
26 | border: solid 1px lime;
27 | font-weight: bold;
28 | color: lime;
29 | display: inline-block
30 | }
31 |
32 | h1 {
33 | color: lime;
34 | text-align: center;
35 | padding-bottom: 3px;
36 | border-bottom: dashed 3px lime;
37 | }
38 |
39 | h3 {
40 | margin: 5px;
41 | display: inline-block;
42 | vertical-align: middle;
43 | }
44 |
45 | h2 {
46 | border-left: solid 5px yellow;
47 | padding-left: 10px;
48 | color: yellow;
49 | }
50 |
51 | .slider {
52 | -webkit-appearance: none;
53 | height: 10px;
54 | background: black;
55 | border: solid 1px lime;
56 | outline: none;
57 | opacity: 0.8;
58 | -webkit-transition: .2s;
59 | transition: opacity .2s;
60 | margin: 5px;
61 | vertical-align: middle;
62 | border-radius: 8px;
63 | display: inline-block
64 | }
65 |
66 | .slider:hover {
67 | opacity: 1;
68 | }
69 |
70 | .slider::-webkit-slider-thumb {
71 | -webkit-appearance: none;
72 | appearance: none;
73 | width: 20px;
74 | height: 9px;
75 | border-radius: 18px;
76 | background: lime;
77 | cursor: pointer;
78 | }
79 |
80 | .slider::-moz-range-thumb {
81 | width: 20px;
82 | height: 9px;
83 | border-radius: 18px;
84 | background: lime;
85 | cursor: pointer;
86 | }
87 |
88 | .switch {
89 | position: relative;
90 | display: inline-block;
91 | width: 44px;
92 | height: 15px;
93 | vertical-align: middle;
94 | }
95 |
96 | .switch input {
97 | opacity: 0;
98 | width: 0;
99 | height: 0;
100 | }
101 |
102 | .sw {
103 | position: absolute;
104 | cursor: pointer;
105 | top: 0;
106 | left: 0;
107 | right: 0;
108 | bottom: 0;
109 | background-color: #828282;
110 | -webkit-transition: .4s;
111 | transition: .4s;
112 | }
113 |
114 | .sw:before {
115 | position: absolute;
116 | content: "";
117 | height: 10px;
118 | width: 10px;
119 | left: 3px;
120 | bottom: 3px;
121 | background-color: white;
122 | -webkit-transition: .4s;
123 | transition: .4s;
124 | }
125 |
126 | input:checked+.sw {
127 | background-color: lime;
128 | }
129 |
130 | input:focus+.sw {
131 | box-shadow: 0 0 1px #2196F3;
132 | }
133 |
134 | input:checked+.sw:before {
135 | -webkit-transform: translateX(26px);
136 | -ms-transform: translateX(26px);
137 | transform: translateX(26px);
138 | }
139 |
140 | .sw.round {
141 | border-radius: 34px;
142 | }
143 |
144 | .sw.round:before {
145 | border-radius: 50%;
146 | }
147 |
148 | .resetbutt {
149 | padding: 10px 40px;
150 | border: solid 3px red;
151 | color: red;
152 | font-weight: bolder;
153 | background: #000000;
154 | border-radius: 5px;
155 | margin-top: 20px;
156 | width: 30%;
157 | letter-spacing: 2px;
158 | cursor: pointer;
159 | -webkit-transition: .4s;
160 | transition: .4s;
161 | }
162 |
163 | .resetbutt:hover {
164 | background: red;
165 | color: black;
166 | }
167 |
168 | #myCanvas {
169 | cursor: pointer;
170 | }
171 |
172 | .pill {
173 | padding: 5px 10px;
174 | color: var(--data-color);
175 | border: solid 2px var(--data-color);
176 | border-radius: 20px;
177 | display: inline-block;
178 | -webkit-transition: .4s;
179 | transition: .4s;
180 | }
181 |
182 | .pill:hover {
183 | background: var(--data-color);
184 | color: black;
185 | }
186 |
187 | #heuristic {
188 | background: black;
189 | border: solid 1px lime;
190 | color: lime;
191 | text-transform: uppercase;
192 | width: 140px;
193 | }
194 |
195 | h5 {
196 | text-align: center;
197 | color: gray;
198 | margin: 5px;
199 | }
200 |
--------------------------------------------------------------------------------
/js/vars.js:
--------------------------------------------------------------------------------
1 | /*-----------------------------------------------------------------------------------*\
2 | |* NEEDED VARIABLES |
3 | \*-----------------------------------------------------------------------------------*/
4 |
5 | var g_animSpeedinp = document.getElementById('animspeed');
6 | var g_nodeSizeinp = document.getElementById('nodesize');
7 | var g_myCanvas = document.getElementById('myCanvas');
8 | var g_dbgInfoinp = document.getElementById('dbginfo');
9 | var g_diagnoalinp = document.getElementById('diagonal');
10 | g_myCanvas.height = document.getElementById('visualize').clientHeight;
11 | g_myCanvas.width = document.getElementById('visualize').clientWidth;
12 | var g_heuristicinp = document.getElementById('heuristic');
13 | var g_asv = document.getElementById('asv'); // animation speed value
14 | var g_adv = document.getElementById('adv'); // allow diagonal value
15 | var g_nsv = document.getElementById('nsv'); // node size value
16 | var g_dv = document.getElementById('dv'); // debug value
17 | var g_context = g_myCanvas.getContext('2d'); // Context
18 | var g_nodeWidth = 40; // Width of the node squares
19 | var g_numRows = parseInt(g_myCanvas.height/g_nodeWidth -1); // Total number of rows
20 | var g_numColumns = parseInt(g_myCanvas.width/g_nodeWidth -1); // Total number of columns
21 | var g_numNodes = g_numRows * g_numColumns; // Total number of nodes
22 | var g_FPS = 30; // Frame Per Second
23 | var g_timeInterval = 1000/g_FPS; // Time interval the gameloop is executed in ms
24 | var g_nodes = new Array(g_numNodes); // Holds all the nodes
25 | var g_mouseX = undefined; // Mouse Y Co-ordinate
26 | var g_mouseY = undefined; // Mouse X Co-ordinate
27 | var g_clickType = undefined; // "right" or "left"
28 | var g_currentKey = undefined; // Current key pressed!
29 | var g_selectedNode = undefined; // index of node currently selected
30 | var g_selectorWidth = 5; // lineWidth of the selector
31 | var g_object = undefined; // the object that lost it's home
32 | var g_startingNode = undefined; // Starting Node
33 | var g_endingNode = undefined; // Target node
34 | var g_openList = []; // OPEN LIST
35 | var g_closedList = []; // CLOSED LIST
36 | var g_pathFound = false; // if the path is found it changes to true
37 | var g_startSorting = false; // when set to true executes the path finder function
38 | var g_mainChild = undefined; // Used when tracing path
39 | var g_isDone = false; // Is the path finding function executed!
40 | var g_frameCount = 0; // Count Frames
41 | var g_timePassed = 0; // Count seconds
42 | var g_pathNodes = []; // path from start to end
43 | var g_currentNode = undefined; // the node being scanned
44 | var g_neighbours = []; // neighbours of the node scanned
45 | var g_animSpeed = 4 // time%fps/animSpeed, default: 4
46 | var g_showdbginfo = true // for now all that debug info shows or hides is the node id
47 | var g_heuristic = 'm' // 'm', 'e', 'c', 'o'. Default m
48 | var g_allowDiagonal = false // is diagonal movement allowed
49 | var g_reachedHome = false // object reached home
50 |
--------------------------------------------------------------------------------
/js/gameloop.js:
--------------------------------------------------------------------------------
1 | /*-----------------------------------------------------------------------------------*\
2 | |* EVENT LISTENERS & HANDLERS |
3 | \*-----------------------------------------------------------------------------------*/
4 |
5 | g_myCanvas.addEventListener('click', (l_event) => {
6 | // handle clicks
7 | g_mouseX = l_event.clientX - g_myCanvas.getBoundingClientRect().x
8 | g_mouseY = l_event.clientY - g_myCanvas.getBoundingClientRect().y
9 | g_clickType = "left";
10 | })
11 |
12 | g_myCanvas.addEventListener('contextmenu', (l_event) => {
13 | // handle clicks
14 | g_mouseX = l_event.clientX - g_myCanvas.getBoundingClientRect().x
15 | g_mouseY = l_event.clientY - g_myCanvas.getBoundingClientRect().y
16 | g_clickType = "right";
17 | l_event.preventDefault();
18 | })
19 |
20 | document.addEventListener('keydown', (l_event) => {
21 | if (l_event.key.toLowerCase() == 's'){
22 | g_currentKey = 's'; // start node
23 | } else if (l_event.key.toLowerCase() == 'e'){
24 | g_currentKey = 'e'; // end node
25 | } else if (l_event.key.toLowerCase() == 'd'){
26 | g_currentKey = 'o'; // obstacle
27 | } else if (l_event.keyCode == '37'){
28 | // left key... select previous
29 | g_currentKey = 'left';
30 | } else if (l_event.keyCode == '39'){
31 | // right key.. select next
32 | g_currentKey = 'right';
33 | } else if (l_event.keyCode == 38){
34 | g_currentKey = 'up';
35 | } else if (l_event.keyCode == 40){
36 | g_currentKey = 'down';
37 | } else if (l_event.key == ' '){
38 | g_startSorting = true;
39 | }
40 | })
41 |
42 | /*-----------------------------------------------------------------------------------*\
43 | |* GAME LOOP & Other init functions |
44 | \*-----------------------------------------------------------------------------------*/
45 |
46 | function f_gameLoop(){
47 | f_manageInputs();
48 | f_frameCounter();
49 | f_checkClick();
50 | f_checkKeys();
51 | f_findPath();
52 | f_TracePath();
53 | f_clearCanvas();
54 | f_drawObjects();
55 | f_drawSelector();
56 | f_endDrawings();
57 | }
58 |
59 | function f_resetSearch(){
60 | // reset flags
61 | g_mainChild = g_selectedNode = g_currentNode = undefined;
62 | g_pathNodes = [];
63 | g_openList = [];
64 | g_closedList = [];
65 | g_neighbours = [];
66 | g_isDone = g_pathFound = g_reachedHome = g_startSorting = false;
67 |
68 | // reset some properties of nodes
69 | for (var i=0; i {
27 | l_context.strokeStyle = (this.type == 's') ? "greenyellow" :
28 | (this.type == 'e') ? 'orange' :
29 | (this.type == 'o') ? 'red' :
30 | (this.isCurrent) ? 'white' :
31 | (this.isScanned) ? 'aqua' :
32 | (this.isNeighbour) ? 'blue' :
33 | "gray";
34 |
35 | l_context.fillStyle = (this.type == 's') ? "greenyellow" :
36 | (this.type == 'o') ? 'red' :
37 | (this.type == 'e') ? 'orange' :
38 | (this.isCurrent) ? 'white' :
39 | (this.isScanned) ? 'aqua' :
40 | (this.isNeighbour) ? 'blue' :
41 | "black";
42 |
43 | if (this.isPath){
44 | // fill style is lime if the node is a path
45 | l_context.fillStyle = "lime";
46 | }
47 | //l_context.fillRect(this.x+5, this.y+5, this.width-10, this.width-10)
48 | l_context.fillRect(this.x, this.y, this.width, this.width)
49 | l_context.strokeRect(this.x, this.y, this.width, this.width)
50 |
51 | // write the node ID in the center of the node
52 | if (l_showDBG){
53 | l_context.fillStyle = (this.type == 'empty' && !this.isPath && !this.isScanned) ? "white" : "black";
54 | l_context.font = this.fontSize + 'px monospace';
55 | l_context.textAlign = 'center'
56 | l_context.fillText(this.id, this.x+this.width/2, this.y+this.width/2)
57 | }
58 |
59 |
60 | if (this.type == 'o'){
61 | // node type = obstacle
62 | // draw the circle
63 | l_context.fillStyle = "red"
64 | l_context.beginPath();
65 | l_context.arc(
66 | this.x + this.width/2, this.y + this.width/2, this.width/2-3, 0, Math.PI * 2
67 | );
68 | l_context.fill();
69 | l_context.closePath();
70 |
71 | // draw the X
72 | l_context.strokeStyle = 'black';
73 | l_context.moveTo(this.x + this.width/4, this.y + this.width/4);
74 | l_context.lineTo(this.x+this.width-this.width/4, this.y+this.width-this.width/4)
75 | l_context.moveTo(this.x+this.width-this.width/4, this.y+this.width/4)
76 | l_context.lineTo(this.x+this.width/4, this.y+this.width-this.width/4)
77 | l_context.stroke();
78 | } else if (this.type == 'e' && l_reachedhome){
79 | // the ripple effect
80 | (this.rippleRad < this.width/2) ? this.rippleRad++ : this.rippleRad = 0;
81 | l_context.lineWidth = 3;
82 | l_context.strokeStyle = "black"
83 | l_context.beginPath();
84 | l_context.arc(
85 | this.x + this.width/2, this.y + this.width/2, this.rippleRad, 0, Math.PI * 2
86 | );
87 | l_context.stroke();
88 | l_context.closePath();
89 | l_context.lineWidth = 1;
90 | }
91 |
92 | /** // show g and h
93 | if (this.width > 70 && l_showDBG){
94 | if (this.h != undefined && this.g != undefined){
95 | l_context.font = '20px monospace';
96 | l_context.textAlign = 'left'
97 | l_context.fillText(this.h, this.x+5, this.y+30)
98 | }
99 | }
100 | **/
101 | }
102 | }
103 |
104 |
105 | function c_object(l_x, l_y, l_radius, l_color, l_speed){
106 | this.x = l_x;
107 | this.y = l_y;
108 | this.radius = l_radius;
109 | this.color = l_color;
110 | this.targetX = l_x;
111 | this.targetY = l_y;
112 | this.speed = l_speed;
113 | this.isDone = false;
114 | this.isMoving = false;
115 |
116 | this.m_draw = (l_context) => {
117 | if (!this.isDone){
118 | l_context.fillStyle = "black"
119 | l_context.beginPath();
120 | l_context.arc(this.x, this.y, this.radius, 0, Math.PI * 2);
121 | l_context.fill();
122 | l_context.closePath();}
123 | }
124 |
125 | this.m_move = () => {
126 | if (this.targetX > this.x){
127 | this.x += this.speed;
128 | this.isMoving = true;
129 | } else if (this.targetX < this.x){
130 | this.x -= this.speed;
131 | this.isMoving = true;
132 | }
133 |
134 | if (this.targetY > this.y){
135 | this.y += this.speed;
136 | this.isMoving = true;
137 | } else if (this.targetY < this.y){
138 | this.y -= this.speed;
139 | this.isMoving = true
140 | }
141 |
142 | if (this.x == this.targetX && this.y == this.targetY) {
143 | this.isMoving = false;
144 | }
145 | }
146 |
147 | }
--------------------------------------------------------------------------------
/js/algo.js:
--------------------------------------------------------------------------------
1 | // ------------------------------ [A L G O R I T H M] ---------------------------------
2 |
3 | function f_findPath(){
4 | if (g_startSorting){
5 | if (g_startingNode != undefined && g_endingNode != undefined && g_frameCount%parseInt(g_FPS/g_animSpeed) == 0 && g_isDone == false){
6 | // we have starting and ending nodes
7 | // ok let's start the sorting, first let's start with the starting node and find it's neighbours
8 | g_selectedNode = undefined;
9 | if (g_currentNode == undefined && g_openList.length ==0){
10 | g_openList.push(g_startingNode); // push starting node into the open list
11 | g_nodes[g_startingNode].g = 0; // set g of starting node to 0 so that the childs can have g += parent's g+1
12 | g_currentNode = g_openList[0] // current node to process
13 | l_isfound = false;
14 | }
15 |
16 |
17 | if (g_openList.length > 0){
18 |
19 | // remove self from open list
20 | for (var x=0; x g_nodes[g_neighbours[i]].h){
151 | l_retNeighbour = g_neighbours[i];
152 | }
153 | }
154 | }
155 | return [false, l_retNeighbour];
156 | }
157 |
158 | function f_calculateH(l_node){
159 | // H is the distance from the selected node to the ending node
160 | if (g_nodes[l_node].h != undefined){
161 | return g_nodes[l_node].h;
162 | } else {
163 | // we have to calculate it
164 | l_dx = Math.abs(g_nodes[l_node].column - g_nodes[g_endingNode].column)
165 | l_dy = Math.abs(g_nodes[l_node].row - g_nodes[g_endingNode].row)
166 |
167 | if (g_heuristic == 'm'){
168 | l_h = l_dx + l_dy; // menhattan
169 | } else if (g_heuristic == 'e'){
170 | l_h = Math.sqrt(l_dx * l_dx + l_dy * l_dy); // eucledian
171 | } else if (g_heuristic == 'o'){
172 | var F = Math.SQRT2 - 1;
173 | l_h = (l_dx < l_dy) ? F * l_dx + l_dy : F * l_dy + l_dx; //octile
174 | } else if (g_heuristic == 'c'){
175 | l_h = Math.max(l_dx, l_dy) //chebyshev
176 | }
177 | // set this.h
178 | g_nodes[l_node].h = l_h;
179 | return l_h;
180 | }
181 | }
182 |
183 | function f_findNeighbours(l_nodeIndex){
184 | // finds the neighbours of a specific node
185 | // returns with an array => [true/false, [n1, n2, n3]]
186 | // true if neighbour found and false if no neighbour is found
187 | g_neighbours = [];
188 | var l_currentNeighbour = l_nodeIndex -1;
189 |
190 | // check left (-1)
191 | if (f_validateNeighbour(l_currentNeighbour) && g_nodes[l_currentNeighbour].row == g_nodes[l_nodeIndex].row){
192 | f_pushNeighbour(l_currentNeighbour, l_nodeIndex);
193 | }
194 |
195 | // check Right (+1)
196 | l_currentNeighbour = l_nodeIndex + 1;
197 | if (f_validateNeighbour(l_currentNeighbour) && g_nodes[l_currentNeighbour].row == g_nodes[l_nodeIndex].row){
198 | f_pushNeighbour(l_currentNeighbour, l_nodeIndex);
199 | }
200 |
201 | // check Top (-columnCount)
202 | l_currentNeighbour = l_nodeIndex + g_numColumns;
203 | if (f_validateNeighbour(l_currentNeighbour)){
204 | f_pushNeighbour(l_currentNeighbour, l_nodeIndex);
205 | }
206 |
207 | // check Bottom (+ColumnCount)
208 | l_currentNeighbour = l_nodeIndex - g_numColumns;
209 | if (f_validateNeighbour(l_currentNeighbour)){
210 | f_pushNeighbour(l_currentNeighbour, l_nodeIndex);
211 | }
212 |
213 | // if allowed diagonal
214 | if (g_allowDiagonal){
215 | l_currentNeighbour = l_nodeIndex - g_numColumns + 1;
216 | try {
217 | if (f_validateNeighbour(l_currentNeighbour)){
218 | (g_nodes[l_currentNeighbour].row == g_nodes[l_nodeIndex-g_numColumns].row) ? f_pushNeighbour(l_currentNeighbour, l_nodeIndex) : null;
219 | }
220 | } catch {}
221 |
222 | l_currentNeighbour = l_nodeIndex - g_numColumns - 1;
223 | try {
224 | if (f_validateNeighbour(l_currentNeighbour)){
225 | (g_nodes[l_currentNeighbour].row == g_nodes[l_nodeIndex-g_numColumns].row) ? f_pushNeighbour(l_currentNeighbour, l_nodeIndex) : null;
226 | }
227 | } catch {}
228 |
229 | l_currentNeighbour = l_nodeIndex + g_numColumns + 1;
230 | try{
231 | if (f_validateNeighbour(l_currentNeighbour) && g_nodes[l_currentNeighbour].row == g_nodes[l_nodeIndex+g_numColumns].row){
232 | f_pushNeighbour(l_currentNeighbour, l_nodeIndex);
233 | }
234 | } catch {}
235 | l_currentNeighbour = l_nodeIndex + g_numColumns - 1;
236 | try {
237 | if (f_validateNeighbour(l_currentNeighbour) && g_nodes[l_currentNeighbour].row == g_nodes[l_nodeIndex+g_numColumns].row){
238 | f_pushNeighbour(l_currentNeighbour, l_nodeIndex);
239 | }
240 | } catch {}
241 | }
242 |
243 | // return the value
244 |
245 | return [((g_neighbours.length>0) ? true : false), g_neighbours]
246 |
247 | }
248 |
249 | function f_pushNeighbour(l_nid, l_pid){
250 | g_neighbours.push(l_nid);
251 | g_openList.push(l_nid);
252 | g_nodes[l_nid].parent = l_pid; // set the parent parameter
253 | g_nodes[l_nid].g = g_nodes[l_pid].g + 1; // set g val
254 | g_nodes[l_nid].isNeighbour = true;
255 | }
256 |
257 | function f_validateNeighbour(l_nid){
258 | // console.log('Validating: ' + l_nid);
259 | try {
260 | if (l_nid>=0 && !g_nodes[l_nid].isClosed && g_nodes[l_nid].type != 'o' && g_nodes[l_nid].parent == undefined && l_nid<=g_numNodes-1){
261 | return true;
262 | } else {
263 | return false;
264 | }
265 | } catch {
266 | return false;
267 | }
268 | }
269 |
--------------------------------------------------------------------------------
/js/functions.js:
--------------------------------------------------------------------------------
1 | // ------------------------------ [NODE Related] ------------------------------------
2 |
3 | function f_generateNodes(){
4 | // Generates nodes and the object
5 |
6 | var l_leftPadding = (g_myCanvas.width - (g_numColumns * g_nodeWidth))/2;
7 | var l_topPadding = (g_myCanvas.height - (g_numRows * g_nodeWidth))/2;
8 | var l_row = 1; // Keep track of current row num
9 |
10 | for (var n=0; n l_row*g_numColumns){
12 | l_row++
13 | }
14 |
15 | var l_column = ((n+1) - ((l_row-1)*g_numColumns)) // Column of the nide
16 |
17 | g_nodes[n] = new c_node(
18 | l_leftPadding + ((l_column-1) * g_nodeWidth), // x
19 | l_topPadding + (g_nodeWidth * (l_row-1)), // y
20 | g_nodeWidth, // width
21 | n, // ID
22 | l_row, // Row num
23 | l_column // Column num
24 | )
25 | }
26 |
27 | g_object = new c_object(0, 0, g_nodeWidth/4, "black", g_nodeWidth/8);
28 | }
29 |
30 | // ------------------------------- [User Input Handling]-----------------------------
31 |
32 | function f_checkClick(){
33 | if (g_isDone == true && g_mouseX != undefined && g_mouseY !== undefined){
34 | // alert('Refresh page to start a new session!');
35 | // reinit
36 | //f_init();
37 | g_mouseX = g_mouseY = undefined;
38 | return;
39 | }
40 |
41 | if (g_mouseX != undefined && g_mouseY !== undefined){
42 | // check which node was clicked on
43 | for (var n=0; n= g_nodes[n].x && g_mouseX <= g_nodes[n].x + g_nodes[n].width) &&
45 | (g_mouseY >= g_nodes[n].y && g_mouseY <= g_nodes[n].y + g_nodes[n].width)){
46 | if (g_clickType == 'left'){
47 | // node matched! let's reset isSelected flag of the previous node if it's not the current one
48 | (g_selectedNode != n && g_selectedNode != undefined) ? g_nodes[g_selectedNode].isSelected = false : null;
49 |
50 | g_nodes[n].isSelected = !(g_nodes[n].isSelected) ; // invert isSelected flag
51 | g_selectedNode = (g_selectedNode == n) ? undefined : n; // Set to undefined if it's already n else set value to n
52 | break;
53 | } else if (g_clickType == 'right'){
54 | (g_selectedNode == n) ? g_selectedNode == undefined : null;
55 | g_nodes[n].isSelected = false;
56 | g_nodes[n].type = "empty";
57 | }
58 | }
59 | }
60 | g_mouseX = g_mouseY = g_clickType = undefined;
61 | }
62 | }
63 |
64 | function f_checkKeys(){
65 | if (g_isDone == true && g_currentKey!=undefined){
66 | // alert('Refresh page to start a new session!');
67 | // f_init();
68 | g_currentKey = undefined;
69 | return;
70 | }
71 |
72 | if (g_currentKey!=undefined){
73 | if (g_currentKey == 'e' || g_currentKey == 'o' || g_currentKey == 's' && g_selectedNode != undefined){
74 | if (g_currentKey == 's' && g_startingNode != undefined) g_nodes[g_startingNode].type = 'empty'; // reset start
75 | if (g_currentKey == 'e' && g_endingNode != undefined) g_nodes[g_endingNode].type = 'empty'; // reset end
76 |
77 | g_nodes[g_selectedNode].type = g_currentKey;
78 |
79 | (g_currentKey == 's') ? g_startingNode = g_selectedNode : (g_currentKey == 'e') ? g_endingNode = g_selectedNode : null; // set the values of startingNode and endingNode if any.
80 |
81 | if (g_currentKey == 's') {
82 | // set object's x and y
83 | g_object.x = g_object.targetX = g_nodes[g_startingNode].x + g_nodeWidth/2;
84 | g_object.y = g_object.targetY = g_nodes[g_startingNode].y + g_nodeWidth/2;
85 | }
86 |
87 | g_currentKey = undefined;
88 | } else if (g_currentKey != undefined){
89 | // navigation
90 | if (g_currentKey == 'left'){
91 | (g_selectedNode != undefined) ? g_nodes[g_selectedNode].isSelected = false : null;
92 | g_selectedNode = (g_selectedNode>0 && g_selectedNode != undefined) ? g_selectedNode -= 1 : g_selectedNode = 0;
93 | g_nodes[g_selectedNode].isSelected = true;
94 | g_currentKey = undefined;
95 | } else if (g_currentKey == 'right') {
96 | (g_selectedNode != undefined) ? g_nodes[g_selectedNode].isSelected = false : null;
97 | g_selectedNode = (g_selectedNode0 && g_selectedNode != undefined) ? g_selectedNode -= g_numColumns : g_selectedNode = 0;
103 | g_nodes[g_selectedNode].isSelected = true;
104 | g_currentKey = undefined;
105 | } else if (g_currentKey == 'down'){
106 | (g_selectedNode != undefined) ? g_nodes[g_selectedNode].isSelected = false : null;
107 | g_selectedNode = (g_selectedNode+g_numColumns 0){
174 | // Draw the path
175 | g_context.moveTo(g_nodes[g_startingNode].x + g_nodes[g_startingNode].width/2, g_nodes[g_startingNode].y + g_nodes[g_startingNode].width/2);
176 | g_context.lineWidth = 5;
177 | g_context.strokeStyle = "black";
178 | for (var i=0; i= g_FPS){
242 | g_timePassed++
243 | g_frameCount = 0;
244 | }
245 | **/
246 | }
247 |
248 | // ---------------------------------- [HTML Stuffs] -----------------------------------
249 |
250 |
251 | function f_manageInputs(){
252 | if (g_nodeWidth != parseInt(g_nodeSizeinp.value)){
253 | f_init(parseInt(g_nodeSizeinp.value));
254 | }
255 | g_animSpeed = g_animSpeedinp.value;
256 | g_showdbginfo = g_dbgInfoinp.checked;
257 | g_heuristic = g_heuristicinp.value;
258 | g_allowDiagonal = g_diagnoalinp.checked;
259 | g_asv.innerHTML = "[ " + g_animSpeed + " ]";
260 | g_adv.innerHTML = "[ " + g_allowDiagonal + " ]";
261 | g_nsv.innerHTML = "[ " + g_nodeWidth + " ]";
262 | g_dv.innerHTML = "[ " + g_showdbginfo + " ]";
263 | g_dv.innerHTML = "[ " + g_showdbginfo + " ]";
264 | }
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------