307 |
308 |
309 |
310 |
311 |
312 |
313 |
314 |
315 |
316 |
317 |
318 |
319 |
320 |
321 |
322 |
323 |
324 |
--------------------------------------------------------------------------------
/js/lib/rangy-1.3.0/rangy-highlighter.js:
--------------------------------------------------------------------------------
1 | /**
2 | * Highlighter module for Rangy, a cross-browser JavaScript range and selection library
3 | * https://github.com/timdown/rangy
4 | *
5 | * Depends on Rangy core, ClassApplier and optionally TextRange modules.
6 | *
7 | * Copyright 2015, Tim Down
8 | * Licensed under the MIT license.
9 | * Version: 1.3.0
10 | * Build date: 10 May 2015
11 | */
12 | (function(factory, root) {
13 | if (typeof define == "function" && define.amd) {
14 | // AMD. Register as an anonymous module with a dependency on Rangy.
15 | define(["./rangy-core"], factory);
16 | } else if (typeof module != "undefined" && typeof exports == "object") {
17 | // Node/CommonJS style
18 | module.exports = factory( require("rangy") );
19 | } else {
20 | // No AMD or CommonJS support so we use the rangy property of root (probably the global variable)
21 | factory(root.rangy);
22 | }
23 | })(function(rangy) {
24 | rangy.createModule("Highlighter", ["ClassApplier"], function(api, module) {
25 | var dom = api.dom;
26 | var contains = dom.arrayContains;
27 | var getBody = dom.getBody;
28 | var createOptions = api.util.createOptions;
29 | var forEach = api.util.forEach;
30 | var nextHighlightId = 1;
31 |
32 | // Puts highlights in order, last in document first.
33 | function compareHighlights(h1, h2) {
34 | return h1.characterRange.start - h2.characterRange.start;
35 | }
36 |
37 | function getContainerElement(doc, id) {
38 | return id ? doc.getElementById(id) : getBody(doc);
39 | }
40 |
41 | /*----------------------------------------------------------------------------------------------------------------*/
42 |
43 | var highlighterTypes = {};
44 |
45 | function HighlighterType(type, converterCreator) {
46 | this.type = type;
47 | this.converterCreator = converterCreator;
48 | }
49 |
50 | HighlighterType.prototype.create = function() {
51 | var converter = this.converterCreator();
52 | converter.type = this.type;
53 | return converter;
54 | };
55 |
56 | function registerHighlighterType(type, converterCreator) {
57 | highlighterTypes[type] = new HighlighterType(type, converterCreator);
58 | }
59 |
60 | function getConverter(type) {
61 | var highlighterType = highlighterTypes[type];
62 | if (highlighterType instanceof HighlighterType) {
63 | return highlighterType.create();
64 | } else {
65 | throw new Error("Highlighter type '" + type + "' is not valid");
66 | }
67 | }
68 |
69 | api.registerHighlighterType = registerHighlighterType;
70 |
71 | /*----------------------------------------------------------------------------------------------------------------*/
72 |
73 | function CharacterRange(start, end) {
74 | this.start = start;
75 | this.end = end;
76 | }
77 |
78 | CharacterRange.prototype = {
79 | intersects: function(charRange) {
80 | return this.start < charRange.end && this.end > charRange.start;
81 | },
82 |
83 | isContiguousWith: function(charRange) {
84 | return this.start == charRange.end || this.end == charRange.start;
85 | },
86 |
87 | union: function(charRange) {
88 | return new CharacterRange(Math.min(this.start, charRange.start), Math.max(this.end, charRange.end));
89 | },
90 |
91 | intersection: function(charRange) {
92 | return new CharacterRange(Math.max(this.start, charRange.start), Math.min(this.end, charRange.end));
93 | },
94 |
95 | getComplements: function(charRange) {
96 | var ranges = [];
97 | if (this.start >= charRange.start) {
98 | if (this.end <= charRange.end) {
99 | return [];
100 | }
101 | ranges.push(new CharacterRange(charRange.end, this.end));
102 | } else {
103 | ranges.push(new CharacterRange(this.start, Math.min(this.end, charRange.start)));
104 | if (this.end > charRange.end) {
105 | ranges.push(new CharacterRange(charRange.end, this.end));
106 | }
107 | }
108 | return ranges;
109 | },
110 |
111 | toString: function() {
112 | return "[CharacterRange(" + this.start + ", " + this.end + ")]";
113 | }
114 | };
115 |
116 | CharacterRange.fromCharacterRange = function(charRange) {
117 | return new CharacterRange(charRange.start, charRange.end);
118 | };
119 |
120 | /*----------------------------------------------------------------------------------------------------------------*/
121 |
122 | var textContentConverter = {
123 | rangeToCharacterRange: function(range, containerNode) {
124 | var bookmark = range.getBookmark(containerNode);
125 | return new CharacterRange(bookmark.start, bookmark.end);
126 | },
127 |
128 | characterRangeToRange: function(doc, characterRange, containerNode) {
129 | var range = api.createRange(doc);
130 | range.moveToBookmark({
131 | start: characterRange.start,
132 | end: characterRange.end,
133 | containerNode: containerNode
134 | });
135 |
136 | return range;
137 | },
138 |
139 | serializeSelection: function(selection, containerNode) {
140 | var ranges = selection.getAllRanges(), rangeCount = ranges.length;
141 | var rangeInfos = [];
142 |
143 | var backward = rangeCount == 1 && selection.isBackward();
144 |
145 | for (var i = 0, len = ranges.length; i < len; ++i) {
146 | rangeInfos[i] = {
147 | characterRange: this.rangeToCharacterRange(ranges[i], containerNode),
148 | backward: backward
149 | };
150 | }
151 |
152 | return rangeInfos;
153 | },
154 |
155 | restoreSelection: function(selection, savedSelection, containerNode) {
156 | selection.removeAllRanges();
157 | var doc = selection.win.document;
158 | for (var i = 0, len = savedSelection.length, range, rangeInfo, characterRange; i < len; ++i) {
159 | rangeInfo = savedSelection[i];
160 | characterRange = rangeInfo.characterRange;
161 | range = this.characterRangeToRange(doc, rangeInfo.characterRange, containerNode);
162 | selection.addRange(range, rangeInfo.backward);
163 | }
164 | }
165 | };
166 |
167 | registerHighlighterType("textContent", function() {
168 | return textContentConverter;
169 | });
170 |
171 | /*----------------------------------------------------------------------------------------------------------------*/
172 |
173 | // Lazily load the TextRange-based converter so that the dependency is only checked when required.
174 | registerHighlighterType("TextRange", (function() {
175 | var converter;
176 |
177 | return function() {
178 | if (!converter) {
179 | // Test that textRangeModule exists and is supported
180 | var textRangeModule = api.modules.TextRange;
181 | if (!textRangeModule) {
182 | throw new Error("TextRange module is missing.");
183 | } else if (!textRangeModule.supported) {
184 | throw new Error("TextRange module is present but not supported.");
185 | }
186 |
187 | converter = {
188 | rangeToCharacterRange: function(range, containerNode) {
189 | return CharacterRange.fromCharacterRange( range.toCharacterRange(containerNode) );
190 | },
191 |
192 | characterRangeToRange: function(doc, characterRange, containerNode) {
193 | var range = api.createRange(doc);
194 | range.selectCharacters(containerNode, characterRange.start, characterRange.end);
195 | return range;
196 | },
197 |
198 | serializeSelection: function(selection, containerNode) {
199 | return selection.saveCharacterRanges(containerNode);
200 | },
201 |
202 | restoreSelection: function(selection, savedSelection, containerNode) {
203 | selection.restoreCharacterRanges(containerNode, savedSelection);
204 | }
205 | };
206 | }
207 |
208 | return converter;
209 | };
210 | })());
211 |
212 | /*----------------------------------------------------------------------------------------------------------------*/
213 |
214 | function Highlight(doc, characterRange, classApplier, converter, id, containerElementId) {
215 | if (id) {
216 | this.id = id;
217 | nextHighlightId = Math.max(nextHighlightId, id + 1);
218 | } else {
219 | this.id = nextHighlightId++;
220 | }
221 | this.characterRange = characterRange;
222 | this.doc = doc;
223 | this.classApplier = classApplier;
224 | this.converter = converter;
225 | this.containerElementId = containerElementId || null;
226 | this.applied = false;
227 | }
228 |
229 | Highlight.prototype = {
230 | getContainerElement: function() {
231 | return getContainerElement(this.doc, this.containerElementId);
232 | },
233 |
234 | getRange: function() {
235 | return this.converter.characterRangeToRange(this.doc, this.characterRange, this.getContainerElement());
236 | },
237 |
238 | fromRange: function(range) {
239 | this.characterRange = this.converter.rangeToCharacterRange(range, this.getContainerElement());
240 | },
241 |
242 | getText: function() {
243 | return this.getRange().toString();
244 | },
245 |
246 | containsElement: function(el) {
247 | return this.getRange().containsNodeContents(el.firstChild);
248 | },
249 |
250 | unapply: function() {
251 | this.classApplier.undoToRange(this.getRange());
252 | this.applied = false;
253 | },
254 |
255 | apply: function() {
256 | this.classApplier.applyToRange(this.getRange());
257 | this.applied = true;
258 | },
259 |
260 | getHighlightElements: function() {
261 | return this.classApplier.getElementsWithClassIntersectingRange(this.getRange());
262 | },
263 |
264 | toString: function() {
265 | return "[Highlight(ID: " + this.id + ", class: " + this.classApplier.className + ", character range: " +
266 | this.characterRange.start + " - " + this.characterRange.end + ")]";
267 | }
268 | };
269 |
270 | /*----------------------------------------------------------------------------------------------------------------*/
271 |
272 | function Highlighter(doc, type) {
273 | type = type || "textContent";
274 | this.doc = doc || document;
275 | this.classAppliers = {};
276 | this.highlights = [];
277 | this.converter = getConverter(type);
278 | }
279 |
280 | Highlighter.prototype = {
281 | addClassApplier: function(classApplier) {
282 | this.classAppliers[classApplier.className] = classApplier;
283 | },
284 |
285 | getHighlightForElement: function(el) {
286 | var highlights = this.highlights;
287 | for (var i = 0, len = highlights.length; i < len; ++i) {
288 | if (highlights[i].containsElement(el)) {
289 | return highlights[i];
290 | }
291 | }
292 | return null;
293 | },
294 |
295 | removeHighlights: function(highlights) {
296 | for (var i = 0, len = this.highlights.length, highlight; i < len; ++i) {
297 | highlight = this.highlights[i];
298 | if (contains(highlights, highlight)) {
299 | highlight.unapply();
300 | this.highlights.splice(i--, 1);
301 | }
302 | }
303 | },
304 |
305 | removeAllHighlights: function() {
306 | this.removeHighlights(this.highlights);
307 | },
308 |
309 | getIntersectingHighlights: function(ranges) {
310 | // Test each range against each of the highlighted ranges to see whether they overlap
311 | var intersectingHighlights = [], highlights = this.highlights;
312 | forEach(ranges, function(range) {
313 | //var selCharRange = converter.rangeToCharacterRange(range);
314 | forEach(highlights, function(highlight) {
315 | if (range.intersectsRange( highlight.getRange() ) && !contains(intersectingHighlights, highlight)) {
316 | intersectingHighlights.push(highlight);
317 | }
318 | });
319 | });
320 |
321 | return intersectingHighlights;
322 | },
323 |
324 | highlightCharacterRanges: function(className, charRanges, options) {
325 | var i, len, j;
326 | var highlights = this.highlights;
327 | var converter = this.converter;
328 | var doc = this.doc;
329 | var highlightsToRemove = [];
330 | var classApplier = className ? this.classAppliers[className] : null;
331 |
332 | options = createOptions(options, {
333 | containerElementId: null,
334 | exclusive: true
335 | });
336 |
337 | var containerElementId = options.containerElementId;
338 | var exclusive = options.exclusive;
339 |
340 | var containerElement, containerElementRange, containerElementCharRange;
341 | if (containerElementId) {
342 | containerElement = this.doc.getElementById(containerElementId);
343 | if (containerElement) {
344 | containerElementRange = api.createRange(this.doc);
345 | containerElementRange.selectNodeContents(containerElement);
346 | containerElementCharRange = new CharacterRange(0, containerElementRange.toString().length);
347 | }
348 | }
349 |
350 | var charRange, highlightCharRange, removeHighlight, isSameClassApplier, highlightsToKeep, splitHighlight;
351 |
352 | for (i = 0, len = charRanges.length; i < len; ++i) {
353 | charRange = charRanges[i];
354 | highlightsToKeep = [];
355 |
356 | // Restrict character range to container element, if it exists
357 | if (containerElementCharRange) {
358 | charRange = charRange.intersection(containerElementCharRange);
359 | }
360 |
361 | // Ignore empty ranges
362 | if (charRange.start == charRange.end) {
363 | continue;
364 | }
365 |
366 | // Check for intersection with existing highlights. For each intersection, create a new highlight
367 | // which is the union of the highlight range and the selected range
368 | for (j = 0; j < highlights.length; ++j) {
369 | removeHighlight = false;
370 |
371 | if (containerElementId == highlights[j].containerElementId) {
372 | highlightCharRange = highlights[j].characterRange;
373 | isSameClassApplier = (classApplier == highlights[j].classApplier);
374 | splitHighlight = !isSameClassApplier && exclusive;
375 |
376 | // Replace the existing highlight if it needs to be:
377 | // 1. merged (isSameClassApplier)
378 | // 2. partially or entirely erased (className === null)
379 | // 3. partially or entirely replaced (isSameClassApplier == false && exclusive == true)
380 | if ( (highlightCharRange.intersects(charRange) || highlightCharRange.isContiguousWith(charRange)) &&
381 | (isSameClassApplier || splitHighlight) ) {
382 |
383 | // Remove existing highlights, keeping the unselected parts
384 | if (splitHighlight) {
385 | forEach(highlightCharRange.getComplements(charRange), function(rangeToAdd) {
386 | highlightsToKeep.push( new Highlight(doc, rangeToAdd, highlights[j].classApplier, converter, null, containerElementId) );
387 | });
388 | }
389 |
390 | removeHighlight = true;
391 | if (isSameClassApplier) {
392 | charRange = highlightCharRange.union(charRange);
393 | }
394 | }
395 | }
396 |
397 | if (removeHighlight) {
398 | highlightsToRemove.push(highlights[j]);
399 | highlights[j] = new Highlight(doc, highlightCharRange.union(charRange), classApplier, converter, null, containerElementId);
400 | } else {
401 | highlightsToKeep.push(highlights[j]);
402 | }
403 | }
404 |
405 | // Add new range
406 | if (classApplier) {
407 | highlightsToKeep.push(new Highlight(doc, charRange, classApplier, converter, null, containerElementId));
408 | }
409 | this.highlights = highlights = highlightsToKeep;
410 | }
411 |
412 | // Remove the old highlights
413 | forEach(highlightsToRemove, function(highlightToRemove) {
414 | highlightToRemove.unapply();
415 | });
416 |
417 | // Apply new highlights
418 | var newHighlights = [];
419 | forEach(highlights, function(highlight) {
420 | if (!highlight.applied) {
421 | highlight.apply();
422 | newHighlights.push(highlight);
423 | }
424 | });
425 |
426 | return newHighlights;
427 | },
428 |
429 | highlightRanges: function(className, ranges, options) {
430 | var selCharRanges = [];
431 | var converter = this.converter;
432 |
433 | options = createOptions(options, {
434 | containerElement: null,
435 | exclusive: true
436 | });
437 |
438 | var containerElement = options.containerElement;
439 | var containerElementId = containerElement ? containerElement.id : null;
440 | var containerElementRange;
441 | if (containerElement) {
442 | containerElementRange = api.createRange(containerElement);
443 | containerElementRange.selectNodeContents(containerElement);
444 | }
445 |
446 | forEach(ranges, function(range) {
447 | var scopedRange = containerElement ? containerElementRange.intersection(range) : range;
448 | selCharRanges.push( converter.rangeToCharacterRange(scopedRange, containerElement || getBody(range.getDocument())) );
449 | });
450 |
451 | return this.highlightCharacterRanges(className, selCharRanges, {
452 | containerElementId: containerElementId,
453 | exclusive: options.exclusive
454 | });
455 | },
456 |
457 | highlightSelection: function(className, options) {
458 | var converter = this.converter;
459 | var classApplier = className ? this.classAppliers[className] : false;
460 |
461 | options = createOptions(options, {
462 | containerElementId: null,
463 | selection: api.getSelection(this.doc),
464 | exclusive: true
465 | });
466 |
467 | var containerElementId = options.containerElementId;
468 | var exclusive = options.exclusive;
469 | var selection = options.selection;
470 | var doc = selection.win.document;
471 | var containerElement = getContainerElement(doc, containerElementId);
472 |
473 | if (!classApplier && className !== false) {
474 | throw new Error("No class applier found for class '" + className + "'");
475 | }
476 |
477 | // Store the existing selection as character ranges
478 | var serializedSelection = converter.serializeSelection(selection, containerElement);
479 |
480 | // Create an array of selected character ranges
481 | var selCharRanges = [];
482 | forEach(serializedSelection, function(rangeInfo) {
483 | selCharRanges.push( CharacterRange.fromCharacterRange(rangeInfo.characterRange) );
484 | });
485 |
486 | var newHighlights = this.highlightCharacterRanges(className, selCharRanges, {
487 | containerElementId: containerElementId,
488 | exclusive: exclusive
489 | });
490 |
491 | // Restore selection
492 | converter.restoreSelection(selection, serializedSelection, containerElement);
493 |
494 | return newHighlights;
495 | },
496 |
497 | unhighlightSelection: function(selection) {
498 | selection = selection || api.getSelection(this.doc);
499 | var intersectingHighlights = this.getIntersectingHighlights( selection.getAllRanges() );
500 | this.removeHighlights(intersectingHighlights);
501 | selection.removeAllRanges();
502 | return intersectingHighlights;
503 | },
504 |
505 | getHighlightsInSelection: function(selection) {
506 | selection = selection || api.getSelection(this.doc);
507 | return this.getIntersectingHighlights(selection.getAllRanges());
508 | },
509 |
510 | selectionOverlapsHighlight: function(selection) {
511 | return this.getHighlightsInSelection(selection).length > 0;
512 | },
513 |
514 | serialize: function(options) {
515 | var highlighter = this;
516 | var highlights = highlighter.highlights;
517 | var serializedType, serializedHighlights, convertType, serializationConverter;
518 |
519 | highlights.sort(compareHighlights);
520 | options = createOptions(options, {
521 | serializeHighlightText: false,
522 | type: highlighter.converter.type
523 | });
524 |
525 | serializedType = options.type;
526 | convertType = (serializedType != highlighter.converter.type);
527 |
528 | if (convertType) {
529 | serializationConverter = getConverter(serializedType);
530 | }
531 |
532 | serializedHighlights = ["type:" + serializedType];
533 |
534 | forEach(highlights, function(highlight) {
535 | var characterRange = highlight.characterRange;
536 | var containerElement;
537 |
538 | // Convert to the current Highlighter's type, if different from the serialization type
539 | if (convertType) {
540 | containerElement = highlight.getContainerElement();
541 | characterRange = serializationConverter.rangeToCharacterRange(
542 | highlighter.converter.characterRangeToRange(highlighter.doc, characterRange, containerElement),
543 | containerElement
544 | );
545 | }
546 |
547 | var parts = [
548 | characterRange.start,
549 | characterRange.end,
550 | highlight.id,
551 | highlight.classApplier.className,
552 | highlight.containerElementId
553 | ];
554 |
555 | if (options.serializeHighlightText) {
556 | parts.push(highlight.getText());
557 | }
558 | serializedHighlights.push( parts.join("$") );
559 | });
560 |
561 | return serializedHighlights.join("|");
562 | },
563 |
564 | deserialize: function(serialized) {
565 | var serializedHighlights = serialized.split("|");
566 | var highlights = [];
567 |
568 | var firstHighlight = serializedHighlights[0];
569 | var regexResult;
570 | var serializationType, serializationConverter, convertType = false;
571 | if ( firstHighlight && (regexResult = /^type:(\w+)$/.exec(firstHighlight)) ) {
572 | serializationType = regexResult[1];
573 | if (serializationType != this.converter.type) {
574 | serializationConverter = getConverter(serializationType);
575 | convertType = true;
576 | }
577 | serializedHighlights.shift();
578 | } else {
579 | throw new Error("Serialized highlights are invalid.");
580 | }
581 |
582 | var classApplier, highlight, characterRange, containerElementId, containerElement;
583 |
584 | for (var i = serializedHighlights.length, parts; i-- > 0; ) {
585 | parts = serializedHighlights[i].split("$");
586 | characterRange = new CharacterRange(+parts[0], +parts[1]);
587 | containerElementId = parts[4] || null;
588 |
589 | // Convert to the current Highlighter's type, if different from the serialization type
590 | if (convertType) {
591 | containerElement = getContainerElement(this.doc, containerElementId);
592 | characterRange = this.converter.rangeToCharacterRange(
593 | serializationConverter.characterRangeToRange(this.doc, characterRange, containerElement),
594 | containerElement
595 | );
596 | }
597 |
598 | classApplier = this.classAppliers[ parts[3] ];
599 |
600 | if (!classApplier) {
601 | throw new Error("No class applier found for class '" + parts[3] + "'");
602 | }
603 |
604 | highlight = new Highlight(this.doc, characterRange, classApplier, this.converter, parseInt(parts[2]), containerElementId);
605 | highlight.apply();
606 | highlights.push(highlight);
607 | }
608 | this.highlights = highlights;
609 | }
610 | };
611 |
612 | api.Highlighter = Highlighter;
613 |
614 | api.createHighlighter = function(doc, rangeCharacterOffsetConverterType) {
615 | return new Highlighter(doc, rangeCharacterOffsetConverterType);
616 | };
617 | });
618 |
619 | return rangy;
620 | }, this);
621 |
--------------------------------------------------------------------------------
/js/lib/JSZip/LICENSE.markdown:
--------------------------------------------------------------------------------
1 | JSZip is dual licensed. You may use it under the MIT license *or* the GPLv3
2 | license.
3 |
4 | The MIT License
5 | ===============
6 |
7 | Copyright (c) 2009-2016 Stuart Knightley, David Duponchel, Franz Buchinger, António Afonso
8 |
9 | Permission is hereby granted, free of charge, to any person obtaining a copy
10 | of this software and associated documentation files (the "Software"), to deal
11 | in the Software without restriction, including without limitation the rights
12 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13 | copies of the Software, and to permit persons to whom the Software is
14 | furnished to do so, subject to the following conditions:
15 |
16 | The above copyright notice and this permission notice shall be included in
17 | all copies or substantial portions of the Software.
18 |
19 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 | THE SOFTWARE.
26 |
27 |
28 | GPL version 3
29 | =============
30 |
31 | GNU GENERAL PUBLIC LICENSE
32 | Version 3, 29 June 2007
33 |
34 | Copyright (C) 2007 Free Software Foundation, Inc.
35 | Everyone is permitted to copy and distribute verbatim copies
36 | of this license document, but changing it is not allowed.
37 |
38 | Preamble
39 |
40 | The GNU General Public License is a free, copyleft license for
41 | software and other kinds of works.
42 |
43 | The licenses for most software and other practical works are designed
44 | to take away your freedom to share and change the works. By contrast,
45 | the GNU General Public License is intended to guarantee your freedom to
46 | share and change all versions of a program--to make sure it remains free
47 | software for all its users. We, the Free Software Foundation, use the
48 | GNU General Public License for most of our software; it applies also to
49 | any other work released this way by its authors. You can apply it to
50 | your programs, too.
51 |
52 | When we speak of free software, we are referring to freedom, not
53 | price. Our General Public Licenses are designed to make sure that you
54 | have the freedom to distribute copies of free software (and charge for
55 | them if you wish), that you receive source code or can get it if you
56 | want it, that you can change the software or use pieces of it in new
57 | free programs, and that you know you can do these things.
58 |
59 | To protect your rights, we need to prevent others from denying you
60 | these rights or asking you to surrender the rights. Therefore, you have
61 | certain responsibilities if you distribute copies of the software, or if
62 | you modify it: responsibilities to respect the freedom of others.
63 |
64 | For example, if you distribute copies of such a program, whether
65 | gratis or for a fee, you must pass on to the recipients the same
66 | freedoms that you received. You must make sure that they, too, receive
67 | or can get the source code. And you must show them these terms so they
68 | know their rights.
69 |
70 | Developers that use the GNU GPL protect your rights with two steps:
71 | (1) assert copyright on the software, and (2) offer you this License
72 | giving you legal permission to copy, distribute and/or modify it.
73 |
74 | For the developers' and authors' protection, the GPL clearly explains
75 | that there is no warranty for this free software. For both users' and
76 | authors' sake, the GPL requires that modified versions be marked as
77 | changed, so that their problems will not be attributed erroneously to
78 | authors of previous versions.
79 |
80 | Some devices are designed to deny users access to install or run
81 | modified versions of the software inside them, although the manufacturer
82 | can do so. This is fundamentally incompatible with the aim of
83 | protecting users' freedom to change the software. The systematic
84 | pattern of such abuse occurs in the area of products for individuals to
85 | use, which is precisely where it is most unacceptable. Therefore, we
86 | have designed this version of the GPL to prohibit the practice for those
87 | products. If such problems arise substantially in other domains, we
88 | stand ready to extend this provision to those domains in future versions
89 | of the GPL, as needed to protect the freedom of users.
90 |
91 | Finally, every program is threatened constantly by software patents.
92 | States should not allow patents to restrict development and use of
93 | software on general-purpose computers, but in those that do, we wish to
94 | avoid the special danger that patents applied to a free program could
95 | make it effectively proprietary. To prevent this, the GPL assures that
96 | patents cannot be used to render the program non-free.
97 |
98 | The precise terms and conditions for copying, distribution and
99 | modification follow.
100 |
101 | TERMS AND CONDITIONS
102 |
103 | 0. Definitions.
104 |
105 | "This License" refers to version 3 of the GNU General Public License.
106 |
107 | "Copyright" also means copyright-like laws that apply to other kinds of
108 | works, such as semiconductor masks.
109 |
110 | "The Program" refers to any copyrightable work licensed under this
111 | License. Each licensee is addressed as "you". "Licensees" and
112 | "recipients" may be individuals or organizations.
113 |
114 | To "modify" a work means to copy from or adapt all or part of the work
115 | in a fashion requiring copyright permission, other than the making of an
116 | exact copy. The resulting work is called a "modified version" of the
117 | earlier work or a work "based on" the earlier work.
118 |
119 | A "covered work" means either the unmodified Program or a work based
120 | on the Program.
121 |
122 | To "propagate" a work means to do anything with it that, without
123 | permission, would make you directly or secondarily liable for
124 | infringement under applicable copyright law, except executing it on a
125 | computer or modifying a private copy. Propagation includes copying,
126 | distribution (with or without modification), making available to the
127 | public, and in some countries other activities as well.
128 |
129 | To "convey" a work means any kind of propagation that enables other
130 | parties to make or receive copies. Mere interaction with a user through
131 | a computer network, with no transfer of a copy, is not conveying.
132 |
133 | An interactive user interface displays "Appropriate Legal Notices"
134 | to the extent that it includes a convenient and prominently visible
135 | feature that (1) displays an appropriate copyright notice, and (2)
136 | tells the user that there is no warranty for the work (except to the
137 | extent that warranties are provided), that licensees may convey the
138 | work under this License, and how to view a copy of this License. If
139 | the interface presents a list of user commands or options, such as a
140 | menu, a prominent item in the list meets this criterion.
141 |
142 | 1. Source Code.
143 |
144 | The "source code" for a work means the preferred form of the work
145 | for making modifications to it. "Object code" means any non-source
146 | form of a work.
147 |
148 | A "Standard Interface" means an interface that either is an official
149 | standard defined by a recognized standards body, or, in the case of
150 | interfaces specified for a particular programming language, one that
151 | is widely used among developers working in that language.
152 |
153 | The "System Libraries" of an executable work include anything, other
154 | than the work as a whole, that (a) is included in the normal form of
155 | packaging a Major Component, but which is not part of that Major
156 | Component, and (b) serves only to enable use of the work with that
157 | Major Component, or to implement a Standard Interface for which an
158 | implementation is available to the public in source code form. A
159 | "Major Component", in this context, means a major essential component
160 | (kernel, window system, and so on) of the specific operating system
161 | (if any) on which the executable work runs, or a compiler used to
162 | produce the work, or an object code interpreter used to run it.
163 |
164 | The "Corresponding Source" for a work in object code form means all
165 | the source code needed to generate, install, and (for an executable
166 | work) run the object code and to modify the work, including scripts to
167 | control those activities. However, it does not include the work's
168 | System Libraries, or general-purpose tools or generally available free
169 | programs which are used unmodified in performing those activities but
170 | which are not part of the work. For example, Corresponding Source
171 | includes interface definition files associated with source files for
172 | the work, and the source code for shared libraries and dynamically
173 | linked subprograms that the work is specifically designed to require,
174 | such as by intimate data communication or control flow between those
175 | subprograms and other parts of the work.
176 |
177 | The Corresponding Source need not include anything that users
178 | can regenerate automatically from other parts of the Corresponding
179 | Source.
180 |
181 | The Corresponding Source for a work in source code form is that
182 | same work.
183 |
184 | 2. Basic Permissions.
185 |
186 | All rights granted under this License are granted for the term of
187 | copyright on the Program, and are irrevocable provided the stated
188 | conditions are met. This License explicitly affirms your unlimited
189 | permission to run the unmodified Program. The output from running a
190 | covered work is covered by this License only if the output, given its
191 | content, constitutes a covered work. This License acknowledges your
192 | rights of fair use or other equivalent, as provided by copyright law.
193 |
194 | You may make, run and propagate covered works that you do not
195 | convey, without conditions so long as your license otherwise remains
196 | in force. You may convey covered works to others for the sole purpose
197 | of having them make modifications exclusively for you, or provide you
198 | with facilities for running those works, provided that you comply with
199 | the terms of this License in conveying all material for which you do
200 | not control copyright. Those thus making or running the covered works
201 | for you must do so exclusively on your behalf, under your direction
202 | and control, on terms that prohibit them from making any copies of
203 | your copyrighted material outside their relationship with you.
204 |
205 | Conveying under any other circumstances is permitted solely under
206 | the conditions stated below. Sublicensing is not allowed; section 10
207 | makes it unnecessary.
208 |
209 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
210 |
211 | No covered work shall be deemed part of an effective technological
212 | measure under any applicable law fulfilling obligations under article
213 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
214 | similar laws prohibiting or restricting circumvention of such
215 | measures.
216 |
217 | When you convey a covered work, you waive any legal power to forbid
218 | circumvention of technological measures to the extent such circumvention
219 | is effected by exercising rights under this License with respect to
220 | the covered work, and you disclaim any intention to limit operation or
221 | modification of the work as a means of enforcing, against the work's
222 | users, your or third parties' legal rights to forbid circumvention of
223 | technological measures.
224 |
225 | 4. Conveying Verbatim Copies.
226 |
227 | You may convey verbatim copies of the Program's source code as you
228 | receive it, in any medium, provided that you conspicuously and
229 | appropriately publish on each copy an appropriate copyright notice;
230 | keep intact all notices stating that this License and any
231 | non-permissive terms added in accord with section 7 apply to the code;
232 | keep intact all notices of the absence of any warranty; and give all
233 | recipients a copy of this License along with the Program.
234 |
235 | You may charge any price or no price for each copy that you convey,
236 | and you may offer support or warranty protection for a fee.
237 |
238 | 5. Conveying Modified Source Versions.
239 |
240 | You may convey a work based on the Program, or the modifications to
241 | produce it from the Program, in the form of source code under the
242 | terms of section 4, provided that you also meet all of these conditions:
243 |
244 | a) The work must carry prominent notices stating that you modified
245 | it, and giving a relevant date.
246 |
247 | b) The work must carry prominent notices stating that it is
248 | released under this License and any conditions added under section
249 | 7. This requirement modifies the requirement in section 4 to
250 | "keep intact all notices".
251 |
252 | c) You must license the entire work, as a whole, under this
253 | License to anyone who comes into possession of a copy. This
254 | License will therefore apply, along with any applicable section 7
255 | additional terms, to the whole of the work, and all its parts,
256 | regardless of how they are packaged. This License gives no
257 | permission to license the work in any other way, but it does not
258 | invalidate such permission if you have separately received it.
259 |
260 | d) If the work has interactive user interfaces, each must display
261 | Appropriate Legal Notices; however, if the Program has interactive
262 | interfaces that do not display Appropriate Legal Notices, your
263 | work need not make them do so.
264 |
265 | A compilation of a covered work with other separate and independent
266 | works, which are not by their nature extensions of the covered work,
267 | and which are not combined with it such as to form a larger program,
268 | in or on a volume of a storage or distribution medium, is called an
269 | "aggregate" if the compilation and its resulting copyright are not
270 | used to limit the access or legal rights of the compilation's users
271 | beyond what the individual works permit. Inclusion of a covered work
272 | in an aggregate does not cause this License to apply to the other
273 | parts of the aggregate.
274 |
275 | 6. Conveying Non-Source Forms.
276 |
277 | You may convey a covered work in object code form under the terms
278 | of sections 4 and 5, provided that you also convey the
279 | machine-readable Corresponding Source under the terms of this License,
280 | in one of these ways:
281 |
282 | a) Convey the object code in, or embodied in, a physical product
283 | (including a physical distribution medium), accompanied by the
284 | Corresponding Source fixed on a durable physical medium
285 | customarily used for software interchange.
286 |
287 | b) Convey the object code in, or embodied in, a physical product
288 | (including a physical distribution medium), accompanied by a
289 | written offer, valid for at least three years and valid for as
290 | long as you offer spare parts or customer support for that product
291 | model, to give anyone who possesses the object code either (1) a
292 | copy of the Corresponding Source for all the software in the
293 | product that is covered by this License, on a durable physical
294 | medium customarily used for software interchange, for a price no
295 | more than your reasonable cost of physically performing this
296 | conveying of source, or (2) access to copy the
297 | Corresponding Source from a network server at no charge.
298 |
299 | c) Convey individual copies of the object code with a copy of the
300 | written offer to provide the Corresponding Source. This
301 | alternative is allowed only occasionally and noncommercially, and
302 | only if you received the object code with such an offer, in accord
303 | with subsection 6b.
304 |
305 | d) Convey the object code by offering access from a designated
306 | place (gratis or for a charge), and offer equivalent access to the
307 | Corresponding Source in the same way through the same place at no
308 | further charge. You need not require recipients to copy the
309 | Corresponding Source along with the object code. If the place to
310 | copy the object code is a network server, the Corresponding Source
311 | may be on a different server (operated by you or a third party)
312 | that supports equivalent copying facilities, provided you maintain
313 | clear directions next to the object code saying where to find the
314 | Corresponding Source. Regardless of what server hosts the
315 | Corresponding Source, you remain obligated to ensure that it is
316 | available for as long as needed to satisfy these requirements.
317 |
318 | e) Convey the object code using peer-to-peer transmission, provided
319 | you inform other peers where the object code and Corresponding
320 | Source of the work are being offered to the general public at no
321 | charge under subsection 6d.
322 |
323 | A separable portion of the object code, whose source code is excluded
324 | from the Corresponding Source as a System Library, need not be
325 | included in conveying the object code work.
326 |
327 | A "User Product" is either (1) a "consumer product", which means any
328 | tangible personal property which is normally used for personal, family,
329 | or household purposes, or (2) anything designed or sold for incorporation
330 | into a dwelling. In determining whether a product is a consumer product,
331 | doubtful cases shall be resolved in favor of coverage. For a particular
332 | product received by a particular user, "normally used" refers to a
333 | typical or common use of that class of product, regardless of the status
334 | of the particular user or of the way in which the particular user
335 | actually uses, or expects or is expected to use, the product. A product
336 | is a consumer product regardless of whether the product has substantial
337 | commercial, industrial or non-consumer uses, unless such uses represent
338 | the only significant mode of use of the product.
339 |
340 | "Installation Information" for a User Product means any methods,
341 | procedures, authorization keys, or other information required to install
342 | and execute modified versions of a covered work in that User Product from
343 | a modified version of its Corresponding Source. The information must
344 | suffice to ensure that the continued functioning of the modified object
345 | code is in no case prevented or interfered with solely because
346 | modification has been made.
347 |
348 | If you convey an object code work under this section in, or with, or
349 | specifically for use in, a User Product, and the conveying occurs as
350 | part of a transaction in which the right of possession and use of the
351 | User Product is transferred to the recipient in perpetuity or for a
352 | fixed term (regardless of how the transaction is characterized), the
353 | Corresponding Source conveyed under this section must be accompanied
354 | by the Installation Information. But this requirement does not apply
355 | if neither you nor any third party retains the ability to install
356 | modified object code on the User Product (for example, the work has
357 | been installed in ROM).
358 |
359 | The requirement to provide Installation Information does not include a
360 | requirement to continue to provide support service, warranty, or updates
361 | for a work that has been modified or installed by the recipient, or for
362 | the User Product in which it has been modified or installed. Access to a
363 | network may be denied when the modification itself materially and
364 | adversely affects the operation of the network or violates the rules and
365 | protocols for communication across the network.
366 |
367 | Corresponding Source conveyed, and Installation Information provided,
368 | in accord with this section must be in a format that is publicly
369 | documented (and with an implementation available to the public in
370 | source code form), and must require no special password or key for
371 | unpacking, reading or copying.
372 |
373 | 7. Additional Terms.
374 |
375 | "Additional permissions" are terms that supplement the terms of this
376 | License by making exceptions from one or more of its conditions.
377 | Additional permissions that are applicable to the entire Program shall
378 | be treated as though they were included in this License, to the extent
379 | that they are valid under applicable law. If additional permissions
380 | apply only to part of the Program, that part may be used separately
381 | under those permissions, but the entire Program remains governed by
382 | this License without regard to the additional permissions.
383 |
384 | When you convey a copy of a covered work, you may at your option
385 | remove any additional permissions from that copy, or from any part of
386 | it. (Additional permissions may be written to require their own
387 | removal in certain cases when you modify the work.) You may place
388 | additional permissions on material, added by you to a covered work,
389 | for which you have or can give appropriate copyright permission.
390 |
391 | Notwithstanding any other provision of this License, for material you
392 | add to a covered work, you may (if authorized by the copyright holders of
393 | that material) supplement the terms of this License with terms:
394 |
395 | a) Disclaiming warranty or limiting liability differently from the
396 | terms of sections 15 and 16 of this License; or
397 |
398 | b) Requiring preservation of specified reasonable legal notices or
399 | author attributions in that material or in the Appropriate Legal
400 | Notices displayed by works containing it; or
401 |
402 | c) Prohibiting misrepresentation of the origin of that material, or
403 | requiring that modified versions of such material be marked in
404 | reasonable ways as different from the original version; or
405 |
406 | d) Limiting the use for publicity purposes of names of licensors or
407 | authors of the material; or
408 |
409 | e) Declining to grant rights under trademark law for use of some
410 | trade names, trademarks, or service marks; or
411 |
412 | f) Requiring indemnification of licensors and authors of that
413 | material by anyone who conveys the material (or modified versions of
414 | it) with contractual assumptions of liability to the recipient, for
415 | any liability that these contractual assumptions directly impose on
416 | those licensors and authors.
417 |
418 | All other non-permissive additional terms are considered "further
419 | restrictions" within the meaning of section 10. If the Program as you
420 | received it, or any part of it, contains a notice stating that it is
421 | governed by this License along with a term that is a further
422 | restriction, you may remove that term. If a license document contains
423 | a further restriction but permits relicensing or conveying under this
424 | License, you may add to a covered work material governed by the terms
425 | of that license document, provided that the further restriction does
426 | not survive such relicensing or conveying.
427 |
428 | If you add terms to a covered work in accord with this section, you
429 | must place, in the relevant source files, a statement of the
430 | additional terms that apply to those files, or a notice indicating
431 | where to find the applicable terms.
432 |
433 | Additional terms, permissive or non-permissive, may be stated in the
434 | form of a separately written license, or stated as exceptions;
435 | the above requirements apply either way.
436 |
437 | 8. Termination.
438 |
439 | You may not propagate or modify a covered work except as expressly
440 | provided under this License. Any attempt otherwise to propagate or
441 | modify it is void, and will automatically terminate your rights under
442 | this License (including any patent licenses granted under the third
443 | paragraph of section 11).
444 |
445 | However, if you cease all violation of this License, then your
446 | license from a particular copyright holder is reinstated (a)
447 | provisionally, unless and until the copyright holder explicitly and
448 | finally terminates your license, and (b) permanently, if the copyright
449 | holder fails to notify you of the violation by some reasonable means
450 | prior to 60 days after the cessation.
451 |
452 | Moreover, your license from a particular copyright holder is
453 | reinstated permanently if the copyright holder notifies you of the
454 | violation by some reasonable means, this is the first time you have
455 | received notice of violation of this License (for any work) from that
456 | copyright holder, and you cure the violation prior to 30 days after
457 | your receipt of the notice.
458 |
459 | Termination of your rights under this section does not terminate the
460 | licenses of parties who have received copies or rights from you under
461 | this License. If your rights have been terminated and not permanently
462 | reinstated, you do not qualify to receive new licenses for the same
463 | material under section 10.
464 |
465 | 9. Acceptance Not Required for Having Copies.
466 |
467 | You are not required to accept this License in order to receive or
468 | run a copy of the Program. Ancillary propagation of a covered work
469 | occurring solely as a consequence of using peer-to-peer transmission
470 | to receive a copy likewise does not require acceptance. However,
471 | nothing other than this License grants you permission to propagate or
472 | modify any covered work. These actions infringe copyright if you do
473 | not accept this License. Therefore, by modifying or propagating a
474 | covered work, you indicate your acceptance of this License to do so.
475 |
476 | 10. Automatic Licensing of Downstream Recipients.
477 |
478 | Each time you convey a covered work, the recipient automatically
479 | receives a license from the original licensors, to run, modify and
480 | propagate that work, subject to this License. You are not responsible
481 | for enforcing compliance by third parties with this License.
482 |
483 | An "entity transaction" is a transaction transferring control of an
484 | organization, or substantially all assets of one, or subdividing an
485 | organization, or merging organizations. If propagation of a covered
486 | work results from an entity transaction, each party to that
487 | transaction who receives a copy of the work also receives whatever
488 | licenses to the work the party's predecessor in interest had or could
489 | give under the previous paragraph, plus a right to possession of the
490 | Corresponding Source of the work from the predecessor in interest, if
491 | the predecessor has it or can get it with reasonable efforts.
492 |
493 | You may not impose any further restrictions on the exercise of the
494 | rights granted or affirmed under this License. For example, you may
495 | not impose a license fee, royalty, or other charge for exercise of
496 | rights granted under this License, and you may not initiate litigation
497 | (including a cross-claim or counterclaim in a lawsuit) alleging that
498 | any patent claim is infringed by making, using, selling, offering for
499 | sale, or importing the Program or any portion of it.
500 |
501 | 11. Patents.
502 |
503 | A "contributor" is a copyright holder who authorizes use under this
504 | License of the Program or a work on which the Program is based. The
505 | work thus licensed is called the contributor's "contributor version".
506 |
507 | A contributor's "essential patent claims" are all patent claims
508 | owned or controlled by the contributor, whether already acquired or
509 | hereafter acquired, that would be infringed by some manner, permitted
510 | by this License, of making, using, or selling its contributor version,
511 | but do not include claims that would be infringed only as a
512 | consequence of further modification of the contributor version. For
513 | purposes of this definition, "control" includes the right to grant
514 | patent sublicenses in a manner consistent with the requirements of
515 | this License.
516 |
517 | Each contributor grants you a non-exclusive, worldwide, royalty-free
518 | patent license under the contributor's essential patent claims, to
519 | make, use, sell, offer for sale, import and otherwise run, modify and
520 | propagate the contents of its contributor version.
521 |
522 | In the following three paragraphs, a "patent license" is any express
523 | agreement or commitment, however denominated, not to enforce a patent
524 | (such as an express permission to practice a patent or covenant not to
525 | sue for patent infringement). To "grant" such a patent license to a
526 | party means to make such an agreement or commitment not to enforce a
527 | patent against the party.
528 |
529 | If you convey a covered work, knowingly relying on a patent license,
530 | and the Corresponding Source of the work is not available for anyone
531 | to copy, free of charge and under the terms of this License, through a
532 | publicly available network server or other readily accessible means,
533 | then you must either (1) cause the Corresponding Source to be so
534 | available, or (2) arrange to deprive yourself of the benefit of the
535 | patent license for this particular work, or (3) arrange, in a manner
536 | consistent with the requirements of this License, to extend the patent
537 | license to downstream recipients. "Knowingly relying" means you have
538 | actual knowledge that, but for the patent license, your conveying the
539 | covered work in a country, or your recipient's use of the covered work
540 | in a country, would infringe one or more identifiable patents in that
541 | country that you have reason to believe are valid.
542 |
543 | If, pursuant to or in connection with a single transaction or
544 | arrangement, you convey, or propagate by procuring conveyance of, a
545 | covered work, and grant a patent license to some of the parties
546 | receiving the covered work authorizing them to use, propagate, modify
547 | or convey a specific copy of the covered work, then the patent license
548 | you grant is automatically extended to all recipients of the covered
549 | work and works based on it.
550 |
551 | A patent license is "discriminatory" if it does not include within
552 | the scope of its coverage, prohibits the exercise of, or is
553 | conditioned on the non-exercise of one or more of the rights that are
554 | specifically granted under this License. You may not convey a covered
555 | work if you are a party to an arrangement with a third party that is
556 | in the business of distributing software, under which you make payment
557 | to the third party based on the extent of your activity of conveying
558 | the work, and under which the third party grants, to any of the
559 | parties who would receive the covered work from you, a discriminatory
560 | patent license (a) in connection with copies of the covered work
561 | conveyed by you (or copies made from those copies), or (b) primarily
562 | for and in connection with specific products or compilations that
563 | contain the covered work, unless you entered into that arrangement,
564 | or that patent license was granted, prior to 28 March 2007.
565 |
566 | Nothing in this License shall be construed as excluding or limiting
567 | any implied license or other defenses to infringement that may
568 | otherwise be available to you under applicable patent law.
569 |
570 | 12. No Surrender of Others' Freedom.
571 |
572 | If conditions are imposed on you (whether by court order, agreement or
573 | otherwise) that contradict the conditions of this License, they do not
574 | excuse you from the conditions of this License. If you cannot convey a
575 | covered work so as to satisfy simultaneously your obligations under this
576 | License and any other pertinent obligations, then as a consequence you may
577 | not convey it at all. For example, if you agree to terms that obligate you
578 | to collect a royalty for further conveying from those to whom you convey
579 | the Program, the only way you could satisfy both those terms and this
580 | License would be to refrain entirely from conveying the Program.
581 |
582 | 13. Use with the GNU Affero General Public License.
583 |
584 | Notwithstanding any other provision of this License, you have
585 | permission to link or combine any covered work with a work licensed
586 | under version 3 of the GNU Affero General Public License into a single
587 | combined work, and to convey the resulting work. The terms of this
588 | License will continue to apply to the part which is the covered work,
589 | but the special requirements of the GNU Affero General Public License,
590 | section 13, concerning interaction through a network will apply to the
591 | combination as such.
592 |
593 | 14. Revised Versions of this License.
594 |
595 | The Free Software Foundation may publish revised and/or new versions of
596 | the GNU General Public License from time to time. Such new versions will
597 | be similar in spirit to the present version, but may differ in detail to
598 | address new problems or concerns.
599 |
600 | Each version is given a distinguishing version number. If the
601 | Program specifies that a certain numbered version of the GNU General
602 | Public License "or any later version" applies to it, you have the
603 | option of following the terms and conditions either of that numbered
604 | version or of any later version published by the Free Software
605 | Foundation. If the Program does not specify a version number of the
606 | GNU General Public License, you may choose any version ever published
607 | by the Free Software Foundation.
608 |
609 | If the Program specifies that a proxy can decide which future
610 | versions of the GNU General Public License can be used, that proxy's
611 | public statement of acceptance of a version permanently authorizes you
612 | to choose that version for the Program.
613 |
614 | Later license versions may give you additional or different
615 | permissions. However, no additional obligations are imposed on any
616 | author or copyright holder as a result of your choosing to follow a
617 | later version.
618 |
619 | 15. Disclaimer of Warranty.
620 |
621 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
622 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
623 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
624 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
625 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
626 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
627 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
628 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
629 |
630 | 16. Limitation of Liability.
631 |
632 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
633 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
634 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
635 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
636 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
637 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
638 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
639 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
640 | SUCH DAMAGES.
641 |
642 | 17. Interpretation of Sections 15 and 16.
643 |
644 | If the disclaimer of warranty and limitation of liability provided
645 | above cannot be given local legal effect according to their terms,
646 | reviewing courts shall apply local law that most closely approximates
647 | an absolute waiver of all civil liability in connection with the
648 | Program, unless a warranty or assumption of liability accompanies a
649 | copy of the Program in return for a fee.
650 |
651 | END OF TERMS AND CONDITIONS
652 |
--------------------------------------------------------------------------------
41 |