Copyright / license

h2/src/docsrc/html/license.html

@@ -17,7 +17,14 @@ License
 
 <h1>License</h1>
 
-<h2>Summary and License FAQ</h2>
+<a href="#summary">
+    Summary and License FAQ</a><br />
+<a href="#h2_license">
+    H2 License - Version 1.0</a><br />
+<a href="#eclipse_license">
+    Eclipse Public License - Version 1.0</a><br />
+
+<h2 id="summary">Summary and License FAQ</h2>
 <p>
 H2 is dual licensed and available under a modified version of the
 MPL 1.1  (<a href="http://www.mozilla.org/MPL">Mozilla Public License</a>)
@@ -43,7 +50,7 @@ About porting the source code to another language (for example C# or C++): conve
 copyright and license as the original code. The copyright of the ported source code does not (automatically) go to the person who ported the code.
 </p>
 
-<h2>H2 License, Version 1.0</h2>
+<h2 id="h2_license">H2 License - Version 1.0</h2>
 
 <h3 id = "section-1">1. Definitions</h3>
 <p id = "section-1.0.1"><b>1.0.1. "Commercial Use"</b>
@@ -472,7 +479,7 @@ and under the Eclipse Public License, Version 1.0
 Initial Developer: H2 Group
 </pre>
 
-<h2>Eclipse Public License - Version 1.0</h2>
+<h2 id="eclipse_license">Eclipse Public License - Version 1.0</h2>
 <p>
 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE
 PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF

h2/src/main/org/h2/compress/CompressLZF.java

@@ -2,6 +2,23 @@
  * Copyright 2004-2010 H2 Group. Multiple-Licensed under the H2 License,
  * Version 1.0, and under the Eclipse Public License, Version 1.0
  * (http://h2database.com/html/license.html).
+ *
+ * This code is based on the LZF algorithm from Marc Lehmann. It is a
+ * re-implementation of the C code:
+ * http://cvs.schmorp.de/liblzf/lzf_c.c?view=markup
+ * http://cvs.schmorp.de/liblzf/lzf_d.c?view=markup
+ *
+ * According to a mail from Marc Lehmann, it's OK to use his algorithm:
+ * Date: 2010-07-15 15:57
+ * Subject: Re: Question about LZF licensing
+ * ...
+ * The algorithm is not copyrighted (and cannot be copyrighted afaik) - as long
+ * as you wrote everything yourself, without copying my code, that's just fine
+ * (looking is of course fine too).
+ * ...
+ *
+ * Still I would like to keep his copyright info:
+ *
  * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de>
  * Copyright (c) 2005 Oren J. Maurice <oymaurice@hazorea.org.il>
  *
@@ -171,7 +188,7 @@ public final class CompressLZF implements Compressor {
                 // move one byte forward to allow for a literal run control byte
                 outPos++;
                 inPos += len;
-                // Rebuild the future, and store the last bytes to the hashtable.
+                // rebuild the future, and store the last bytes to the hashtable.
                 // Storing hashes of the last bytes in back-reference improves
                 // the compression ratio and only reduces speed slightly.
                 future = first(in, inPos);

h2/src/main/org/h2/util/Permutations.java

@@ -3,6 +3,21 @@
  * Version 1.0, and under the Eclipse Public License, Version 1.0
  * (http://h2database.com/html/license.html).
  * Initial Developer: H2 Group
+ *
+ * According to a mail from Alan Tucker to Chris H Miller from IBM,
+ * the algorithm is in the public domain:
+ *
+ * Date: 2010-07-15 15:57
+ * Subject: Re: Applied Combinatorics Code
+ *
+ * Chris,
+ * The combinatorics algorithms in my textbook are all not under patent
+ * or copyright. They are as much in the public domain as the solution to any
+ * common question in an undergraduate mathematics course, e.g., in my
+ * combinatorics course, the solution to the problem of how many arrangements
+ * there are of the letters in the word MATHEMATICS. I appreciate your due
+ * diligence.
+ * -Alan
  */
 package org.h2.util;