├── doc └── intro.md ├── .gitignore ├── src └── clojure_noob │ ├── core.clj │ ├── example.clj │ ├── distn.clj │ ├── ipart.clj │ ├── huffman.clj │ └── shax.clj ├── test └── clojure_noob │ └── core_test.clj ├── project.clj ├── README.md └── LICENSE /doc/intro.md: -------------------------------------------------------------------------------- 1 | # Introduction to clojure-noob 2 | 3 | TODO: write [great documentation](http://jacobian.org/writing/what-to-write/) 4 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | /classes 3 | /checkouts 4 | pom.xml 5 | pom.xml.asc 6 | *.jar 7 | *.class 8 | /.lein-* 9 | /.nrepl-port 10 | .hgignore 11 | .hg/ 12 | .*.swp 13 | -------------------------------------------------------------------------------- /src/clojure_noob/core.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.core 2 | (:gen-class)) 3 | 4 | (defn -main 5 | "I don't do a whole lot ... yet." 6 | [& args] 7 | (println "Hello, World!")) 8 | -------------------------------------------------------------------------------- /test/clojure_noob/core_test.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.core-test 2 | (:require [clojure.test :refer :all] 3 | [clojure-noob.core :refer :all])) 4 | 5 | (deftest a-test 6 | (testing "FIXME, I fail." 7 | (is (= 0 1)))) 8 | -------------------------------------------------------------------------------- /src/clojure_noob/example.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.example 2 | (:gen-class) 3 | (:use [clojure-noob.distn] 4 | [clojure-noob.huffman])) 5 | 6 | (defn -main 7 | [& args] 8 | (let [source-text "iamtheverymodelofamodernmajorgeneral" 9 | source-coll (map #(symbol (str %)) (seq source-text)) 10 | source-freqs (count-instances source-coll) 11 | my-tree (huffman-build source-freqs) 12 | my-paths (paths my-tree) 13 | huff-codes (into (sorted-map) (map #(vector (apply str (map name (% 0))) (% 1)) my-paths)) ] 14 | (println huff-codes))) 15 | -------------------------------------------------------------------------------- /project.clj: -------------------------------------------------------------------------------- 1 | (defproject clojure-noob "0.1.0-SNAPSHOT" 2 | :description "FIXME: write description" 3 | :url "http://example.com/FIXME" 4 | :license {:name "Eclipse Public License" 5 | :url "http://www.eclipse.org/legal/epl-v10.html"} 6 | :dependencies [[org.clojure/clojure "1.6.0"] 7 | [org.clojure/core.typed "0.3.9"] 8 | [org.clojure/data.priority-map "0.0.7"] 9 | [org.clojure/data.xml "0.0.8"] 10 | [org.clojure/data.zip "0.1.1"]] 11 | :main ^:skip-aot clojure-noob.example 12 | :target-path "target/%s" 13 | :profiles {:uberjar {:aot :all}}) 14 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # clojure-noob 2 | 3 | FIXME: description 4 | 5 | ## Installation 6 | 7 | Download from http://example.com/FIXME. 8 | 9 | ## Usage 10 | 11 | FIXME: explanation 12 | 13 | $ java -jar clojure-noob-0.1.0-standalone.jar [args] 14 | 15 | ## Options 16 | 17 | FIXME: listing of options this app accepts. 18 | 19 | ## Examples 20 | 21 | ... 22 | 23 | ### Bugs 24 | 25 | ... 26 | 27 | ### Any Other Sections 28 | ### That You Think 29 | ### Might be Useful 30 | 31 | ## License 32 | 33 | Copyright © 2015 FIXME 34 | 35 | Distributed under the Eclipse Public License either version 1.0 or (at 36 | your option) any later version. 37 | -------------------------------------------------------------------------------- /src/clojure_noob/distn.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.distn 2 | ) 3 | 4 | (defn to-pdf 5 | [counts] 6 | (let [invalid #(or (not (number? %)) (< % 0)) 7 | included (fn [[_ x]] (> x 0)) 8 | sum (reduce + 0 (vals counts))] 9 | (when (not (empty? (filter invalid (vals counts)))) 10 | (throw (IllegalArgumentException. "relative frequencies must be numbers >= 0"))) 11 | (into {} (map (fn [[k v]] [k (/ v sum)]) (filter included counts))))) 12 | 13 | (defn pdf-to-cdf 14 | [pdf] 15 | ((reduce (fn [[cum cdf] [y py]] 16 | (let [cpy (+ cum py)] 17 | [cpy (cons [y cpy] cdf)])) 18 | [0 ()] 19 | pdf) 1)) 20 | 21 | (defn pdf-to-icdf 22 | [pdf] 23 | (into (sorted-map) (map (fn [[a b]] [b a]) (pdf-to-cdf pdf)))) 24 | 25 | (defn sample-icdf 26 | ([icdf] 27 | (sample-icdf icdf (rand))) 28 | ([icdf q] 29 | (let [[y py] (first (subseq icdf >= q))] 30 | py))) 31 | 32 | (defn count-instances [coll] 33 | (reduce #(assoc %1 %2 (inc (%1 %2 0))) (sorted-map) coll)) 34 | 35 | -------------------------------------------------------------------------------- /src/clojure_noob/ipart.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.ipart) 2 | 3 | (defn integer-partition-helper 4 | "Returns all integer partitions of n where no partition is larger than m." 5 | [n m] 6 | (cond 7 | (= n 0) '(()) 8 | (= m 0) '() 9 | true (let 10 | [upper (min n m) 11 | subpart (fn [k] (map #(conj % k) (ipart (- n k) k)))] 12 | (mapcat subpart (range upper 0 -1))))) 13 | 14 | (defn iparts 15 | "Returns all integer partitions of n." 16 | [n] 17 | (ipart-helper n n)) 18 | 19 | (defn choose [n k] 20 | "Binomial coefficient" 21 | (let [rprod (fn [a b] (reduce * (range a (inc b))))] 22 | (/ (rprod (- n k -1) n) (rprod 1 k)))) 23 | 24 | (defn factorial 25 | [n] 26 | (cond (< n 1) 1 27 | true (* n (factorial (dec n))))) 28 | 29 | (defn tails 30 | "Returns seq of all suffixes of the input seq" 31 | [lst] 32 | (cond (empty? lst) '(()) 33 | true (conj (tails (rest lst)) lst))) 34 | 35 | (defn ways 36 | "Given an integer partition of n, counts up the way that you could assign n 37 | distinct objects to non-distinct partitions. " 38 | [partition] 39 | (let [N (reduce + 0 partition) 40 | dup-sizes (map count (vals (group-by (fn[x] x) partition))) 41 | dup-denominator (reduce * (map factorial dup-sizes)) 42 | untaken (map #(reduce + 0 %) (tails partition)) 43 | elts (map choose untaken partition)] 44 | (/ (reduce * elts) dup-denominator) 45 | )) 46 | 47 | (defn ways-distinct-partitions 48 | "Given an integer partition of n, counts up the way that you could assign n 49 | distinct objects to distinct partitions. " 50 | [partition] 51 | (let [untaken (map #(reduce + 0 %) (tails partition)) 52 | elts (map choose untaken partition)] 53 | (reduce * elts) 54 | )) 55 | 56 | 57 | 58 | -------------------------------------------------------------------------------- /src/clojure_noob/huffman.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.huffman 2 | (:use clojure.data.priority-map)) 3 | 4 | (defn huffman-combine 5 | [nodes0 key-combine] 6 | (let [[key0 val0] (peek nodes0) 7 | nodes1 (pop nodes0) 8 | [key1 val1] (peek nodes1) 9 | nodes2 (pop nodes1) 10 | new-key (key-combine key0 key1)] 11 | (assoc nodes2 new-key (+ val0 val1)))) 12 | 13 | (defn huffman-key-combine [left right] {:0 left :1 right}) 14 | 15 | (defn huffman-build 16 | [symbol-freq-map] 17 | (loop [trees (into (priority-map) symbol-freq-map)] 18 | (if (< (count trees) 2) 19 | ((first trees) 0) 20 | (recur (huffman-combine trees huffman-key-combine))))) 21 | 22 | 23 | (comment 24 | "if we could define different function clauses based on destructuring and not just arity, we'd do the following (and it would be very elegant):" 25 | (defn huffman-bitseq-grow 26 | ([bit [bits sym]] [(conj bits bit) sym]) 27 | ([bit sym] [(list bit) sym])) 28 | ) 29 | 30 | (defn huffman-bitseq-grow 31 | [bit vec-or-sym] 32 | (if (vector? vec-or-sym) 33 | (let [[bits sym] vec-or-sym] 34 | [(conj bits bit) sym]) 35 | [(list bit) vec-or-sym])) 36 | 37 | (comment "old and busted" 38 | (defn predicate-split 39 | [predicate stuff] 40 | (let [reduction (fn [result-map [satisfies? item]] 41 | (assoc result-map 42 | satisfies? 43 | (conj (result-map satisfies? []) item))) 44 | reduced (reduce reduction {} (map #(vector (predicate %) %) stuff))] 45 | [(reduced false) (reduced true)])) 46 | ) 47 | 48 | (defn predicate-split 49 | [predicate stuff] 50 | (let [{nonmatching false matching true} (group-by predicate stuff)] 51 | (list nonmatching matching))) 52 | 53 | (defn leaves 54 | [m] 55 | (let [[immediate-leaves branches] (predicate-split map? (vals m))] 56 | (apply concat (cons immediate-leaves (map leaves branches))) 57 | )) 58 | 59 | (comment "oy" 60 | (defn leaves 61 | [map] 62 | (let [[immed-leaves branches] (predicate-split map? (vals map))] 63 | (apply concat (conj (map leaves branches) immed-leaves)))) 64 | 65 | (defn branches 66 | [m] 67 | (predicate-split map? (vals m))) 68 | ) 69 | 70 | (defn combine-path-and-leaf 71 | [step [rest-of-path leaf]] 72 | [(conj step rest-of-path) leaf]) 73 | 74 | (defn paths 75 | [tree] 76 | (let [leaf-to-path (fn [[key leaf]] [(list key) leaf]) 77 | branch-to-path (fn [key [path leaf]] [(conj path key) leaf]) 78 | expand-branch (fn [[key subtree]] (map #(branch-to-path key %) (paths subtree))) 79 | [leaves branches] (predicate-split #(map? (% 1)) tree)] 80 | 81 | (concat (mapcat expand-branch branches) (map leaf-to-path leaves)) 82 | )) 83 | 84 | 85 | -------------------------------------------------------------------------------- /src/clojure_noob/shax.clj: -------------------------------------------------------------------------------- 1 | (ns clojure-noob.shax 2 | (:require 3 | [clojure.zip :as zip] 4 | [clojure.data.zip :as dzip] 5 | [clojure.data.xml :as xml] 6 | [clojure.data.zip.xml :as zipxml] 7 | [clojure.xml :as xmll] 8 | [clojure.string :as s])) 9 | 10 | (defn force-parse [source] 11 | (let [result (xml/parse source) 12 | ignored (.toString result)] 13 | result)) 14 | 15 | 16 | (def tree 17 | (with-open [source (java.io.FileReader. "./as_you_like_it.xml")] 18 | (zip/xml-zip (force-parse source)))) 19 | 20 | (defn at-tag-of [tag-kw] 21 | (fn [zipper] (= (:tag (zip/node zipper)) tag-kw))) 22 | 23 | (defn descendants-of-tag [tag-kw zipper] 24 | (->> zipper 25 | (dzip/descendants) 26 | (filter (at-tag-of tag-kw)))) 27 | 28 | (defn first-tag-up [tag-kw zipper] 29 | (first (filter (at-tag-of tag-kw) (dzip/ancestors zipper)))) 30 | 31 | (defn first-tag-down [tag-kw zipper] 32 | (first (filter (at-tag-of tag-kw) (dzip/descendants zipper)))) 33 | 34 | (defn zipp [& stuff] 35 | (apply map (conj stuff vector))) 36 | 37 | (defn with-act [init zipper] 38 | (let [acts (descendants-of-tag :ACT zipper) 39 | get-title #(->> % 40 | (first-tag-down :TITLE) 41 | (zip/node) 42 | (:content) 43 | (:apply str)) 44 | ctx-of #(->> % 45 | (get-title) 46 | (assoc init :ACT))] 47 | (zipp acts (map ctx-of acts)))) 48 | 49 | (defn with-scene [init zipper] 50 | (let [scenes (descendants-of-tag :SCENE zipper) 51 | get-title #(->> % 52 | (first-tag-down :TITLE) 53 | (zip/node) 54 | (:content) 55 | (:apply str)) 56 | ctx-of #(->> % 57 | (get-title) 58 | (assoc init :SCENE))] 59 | (zipp scenes (map ctx-of scenes)))) 60 | 61 | (defn with-speech [init zipper] 62 | (let [speeches (descendants-of-tag :SPEECH zipper) 63 | get-speaker #(->> % 64 | (first-tag-down :SPEAKER) 65 | (zip/node) 66 | (:content) 67 | (apply str)) 68 | ctx-of #(->> % 69 | (get-speaker) 70 | (assoc init :SPEAKER))] 71 | (zipp speeches (map ctx-of speeches)))) 72 | 73 | (defn get-line-text [zipper] 74 | (let [lines (descendants-of-tag :LINE zipper) 75 | get-line #(->> % 76 | (zip/node) 77 | (:content) 78 | (apply str))] 79 | (apply str (interpose " " (map get-line lines))))) 80 | 81 | (defn lines-with-context [zipper] 82 | (->> zipper 83 | (with-act {}) 84 | (mapcat #(with-scene (% 1) (% 0))) 85 | (mapcat #(with-speech (% 1) (% 0))) 86 | (map #(assoc (% 1) 87 | :LINE 88 | (get-line-text (% 0)))))) 89 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC 2 | LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM 3 | CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 4 | 5 | 1. DEFINITIONS 6 | 7 | "Contribution" means: 8 | 9 | a) in the case of the initial Contributor, the initial code and 10 | documentation distributed under this Agreement, and 11 | 12 | b) in the case of each subsequent Contributor: 13 | 14 | i) changes to the Program, and 15 | 16 | ii) additions to the Program; 17 | 18 | where such changes and/or additions to the Program originate from and are 19 | distributed by that particular Contributor. A Contribution 'originates' from 20 | a Contributor if it was added to the Program by such Contributor itself or 21 | anyone acting on such Contributor's behalf. Contributions do not include 22 | additions to the Program which: (i) are separate modules of software 23 | distributed in conjunction with the Program under their own license 24 | agreement, and (ii) are not derivative works of the Program. 25 | 26 | "Contributor" means any person or entity that distributes the Program. 27 | 28 | "Licensed Patents" mean patent claims licensable by a Contributor which are 29 | necessarily infringed by the use or sale of its Contribution alone or when 30 | combined with the Program. 31 | 32 | "Program" means the Contributions distributed in accordance with this 33 | Agreement. 34 | 35 | "Recipient" means anyone who receives the Program under this Agreement, 36 | including all Contributors. 37 | 38 | 2. GRANT OF RIGHTS 39 | 40 | a) Subject to the terms of this Agreement, each Contributor hereby grants 41 | Recipient a non-exclusive, worldwide, royalty-free copyright license to 42 | reproduce, prepare derivative works of, publicly display, publicly perform, 43 | distribute and sublicense the Contribution of such Contributor, if any, and 44 | such derivative works, in source code and object code form. 45 | 46 | b) Subject to the terms of this Agreement, each Contributor hereby grants 47 | Recipient a non-exclusive, worldwide, royalty-free patent license under 48 | Licensed Patents to make, use, sell, offer to sell, import and otherwise 49 | transfer the Contribution of such Contributor, if any, in source code and 50 | object code form. This patent license shall apply to the combination of the 51 | Contribution and the Program if, at the time the Contribution is added by the 52 | Contributor, such addition of the Contribution causes such combination to be 53 | covered by the Licensed Patents. The patent license shall not apply to any 54 | other combinations which include the Contribution. No hardware per se is 55 | licensed hereunder. 56 | 57 | c) Recipient understands that although each Contributor grants the licenses 58 | to its Contributions set forth herein, no assurances are provided by any 59 | Contributor that the Program does not infringe the patent or other 60 | intellectual property rights of any other entity. Each Contributor disclaims 61 | any liability to Recipient for claims brought by any other entity based on 62 | infringement of intellectual property rights or otherwise. As a condition to 63 | exercising the rights and licenses granted hereunder, each Recipient hereby 64 | assumes sole responsibility to secure any other intellectual property rights 65 | needed, if any. For example, if a third party patent license is required to 66 | allow Recipient to distribute the Program, it is Recipient's responsibility 67 | to acquire that license before distributing the Program. 68 | 69 | d) Each Contributor represents that to its knowledge it has sufficient 70 | copyright rights in its Contribution, if any, to grant the copyright license 71 | set forth in this Agreement. 72 | 73 | 3. REQUIREMENTS 74 | 75 | A Contributor may choose to distribute the Program in object code form under 76 | its own license agreement, provided that: 77 | 78 | a) it complies with the terms and conditions of this Agreement; and 79 | 80 | b) its license agreement: 81 | 82 | i) effectively disclaims on behalf of all Contributors all warranties and 83 | conditions, express and implied, including warranties or conditions of title 84 | and non-infringement, and implied warranties or conditions of merchantability 85 | and fitness for a particular purpose; 86 | 87 | ii) effectively excludes on behalf of all Contributors all liability for 88 | damages, including direct, indirect, special, incidental and consequential 89 | damages, such as lost profits; 90 | 91 | iii) states that any provisions which differ from this Agreement are offered 92 | by that Contributor alone and not by any other party; and 93 | 94 | iv) states that source code for the Program is available from such 95 | Contributor, and informs licensees how to obtain it in a reasonable manner on 96 | or through a medium customarily used for software exchange. 97 | 98 | When the Program is made available in source code form: 99 | 100 | a) it must be made available under this Agreement; and 101 | 102 | b) a copy of this Agreement must be included with each copy of the Program. 103 | 104 | Contributors may not remove or alter any copyright notices contained within 105 | the Program. 106 | 107 | Each Contributor must identify itself as the originator of its Contribution, 108 | if any, in a manner that reasonably allows subsequent Recipients to identify 109 | the originator of the Contribution. 110 | 111 | 4. COMMERCIAL DISTRIBUTION 112 | 113 | Commercial distributors of software may accept certain responsibilities with 114 | respect to end users, business partners and the like. While this license is 115 | intended to facilitate the commercial use of the Program, the Contributor who 116 | includes the Program in a commercial product offering should do so in a 117 | manner which does not create potential liability for other Contributors. 118 | Therefore, if a Contributor includes the Program in a commercial product 119 | offering, such Contributor ("Commercial Contributor") hereby agrees to defend 120 | and indemnify every other Contributor ("Indemnified Contributor") against any 121 | losses, damages and costs (collectively "Losses") arising from claims, 122 | lawsuits and other legal actions brought by a third party against the 123 | Indemnified Contributor to the extent caused by the acts or omissions of such 124 | Commercial Contributor in connection with its distribution of the Program in 125 | a commercial product offering. The obligations in this section do not apply 126 | to any claims or Losses relating to any actual or alleged intellectual 127 | property infringement. In order to qualify, an Indemnified Contributor must: 128 | a) promptly notify the Commercial Contributor in writing of such claim, and 129 | b) allow the Commercial Contributor tocontrol, and cooperate with the 130 | Commercial Contributor in, the defense and any related settlement 131 | negotiations. The Indemnified Contributor may participate in any such claim 132 | at its own expense. 133 | 134 | For example, a Contributor might include the Program in a commercial product 135 | offering, Product X. That Contributor is then a Commercial Contributor. If 136 | that Commercial Contributor then makes performance claims, or offers 137 | warranties related to Product X, those performance claims and warranties are 138 | such Commercial Contributor's responsibility alone. Under this section, the 139 | Commercial Contributor would have to defend claims against the other 140 | Contributors related to those performance claims and warranties, and if a 141 | court requires any other Contributor to pay any damages as a result, the 142 | Commercial Contributor must pay those damages. 143 | 144 | 5. NO WARRANTY 145 | 146 | EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON 147 | AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER 148 | EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR 149 | CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A 150 | PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the 151 | appropriateness of using and distributing the Program and assumes all risks 152 | associated with its exercise of rights under this Agreement , including but 153 | not limited to the risks and costs of program errors, compliance with 154 | applicable laws, damage to or loss of data, programs or equipment, and 155 | unavailability or interruption of operations. 156 | 157 | 6. DISCLAIMER OF LIABILITY 158 | 159 | EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY 160 | CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, 161 | SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION 162 | LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 163 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 164 | ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE 165 | EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY 166 | OF SUCH DAMAGES. 167 | 168 | 7. GENERAL 169 | 170 | If any provision of this Agreement is invalid or unenforceable under 171 | applicable law, it shall not affect the validity or enforceability of the 172 | remainder of the terms of this Agreement, and without further action by the 173 | parties hereto, such provision shall be reformed to the minimum extent 174 | necessary to make such provision valid and enforceable. 175 | 176 | If Recipient institutes patent litigation against any entity (including a 177 | cross-claim or counterclaim in a lawsuit) alleging that the Program itself 178 | (excluding combinations of the Program with other software or hardware) 179 | infringes such Recipient's patent(s), then such Recipient's rights granted 180 | under Section 2(b) shall terminate as of the date such litigation is filed. 181 | 182 | All Recipient's rights under this Agreement shall terminate if it fails to 183 | comply with any of the material terms or conditions of this Agreement and 184 | does not cure such failure in a reasonable period of time after becoming 185 | aware of such noncompliance. If all Recipient's rights under this Agreement 186 | terminate, Recipient agrees to cease use and distribution of the Program as 187 | soon as reasonably practicable. However, Recipient's obligations under this 188 | Agreement and any licenses granted by Recipient relating to the Program shall 189 | continue and survive. 190 | 191 | Everyone is permitted to copy and distribute copies of this Agreement, but in 192 | order to avoid inconsistency the Agreement is copyrighted and may only be 193 | modified in the following manner. The Agreement Steward reserves the right to 194 | publish new versions (including revisions) of this Agreement from time to 195 | time. No one other than the Agreement Steward has the right to modify this 196 | Agreement. The Eclipse Foundation is the initial Agreement Steward. The 197 | Eclipse Foundation may assign the responsibility to serve as the Agreement 198 | Steward to a suitable separate entity. Each new version of the Agreement will 199 | be given a distinguishing version number. The Program (including 200 | Contributions) may always be distributed subject to the version of the 201 | Agreement under which it was received. In addition, after a new version of 202 | the Agreement is published, Contributor may elect to distribute the Program 203 | (including its Contributions) under the new version. Except as expressly 204 | stated in Sections 2(a) and 2(b) above, Recipient receives no rights or 205 | licenses to the intellectual property of any Contributor under this 206 | Agreement, whether expressly, by implication, estoppel or otherwise. All 207 | rights in the Program not expressly granted under this Agreement are 208 | reserved. 209 | 210 | This Agreement is governed by the laws of the State of New York and the 211 | intellectual property laws of the United States of America. No party to this 212 | Agreement will bring a legal action under this Agreement more than one year 213 | after the cause of action arose. Each party waives its rights to a jury trial 214 | in any resulting litigation. 215 | --------------------------------------------------------------------------------