kotarak-lazymap-767ecaf91c54/ 0002755 0001750 0001750 00000000000 13051151660 015707 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/t/ 0002755 0001750 0001750 00000000000 13051151660 016152 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/t/LazyMapEntry.t 0000755 0001750 0001750 00000003373 12117174335 020753 0 ustar apoikos apoikos #(comment
exec("java", "clojure.lang.Script", $0) or die "Cannot exec Java!";
__END__
)
;-
; Copyright 2008,2009 (c) Meikel Brandmeyer.
; All rights reserved.
;
; Permission is hereby granted, free of charge, to any person obtaining a copy
; of this software and associated documentation files (the "Software"), to deal
; in the Software without restriction, including without limitation the rights
; to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
; copies of the Software, and to permit persons to whom the Software is
; furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in
; all copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
; OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
; THE SOFTWARE.
(clojure.core/ns de.kotka.lazymap.test
(:require
[de.kotka.tap :as tap])
(:import
(de.kotka.lazymap LazyMapEntry)))
(tap/plan 5)
(def lme (new LazyMapEntry :foo (delay "Ok")))
(tap/is? (. lme getKey) :foo "getKey returns the key")
(tap/is? (. lme key) :foo "ditto for key")
(tap/is? (. lme getValue) "Ok" "getValue returns the Promised value")
(tap/is? (. lme val) "Ok" "ditto for val")
(tap/ok? (instance? clojure.lang.Delay (. lme getRawValue))
"getRawValue actually returns the delayed value")
(. java.lang.System exit 0)
; vim:ft=clojure:
kotarak-lazymap-767ecaf91c54/.hgtags 0000644 0001750 0001750 00000000520 12117174335 017166 0 ustar apoikos apoikos 6f629d6b99fa16a0116142d08c09e8cd02853de6 v1.0.0
99fd96a0d6acc779106086b5d0fba725dccf87ee v2.0.0
db654f5e445aa879b31b827e61681f11645c80ec v2.0.1
62119ab9a5a30112be4611a3c56e7d1d4f336aef v2.1.0
7623099c8d1790d8a82f17a0aea77f2291ead5ca v2.2.0
286adbe940fa51ba95cfaf4d96d2691dc6512944 v3.0.0
3d0b146019209df6a7faf29ee0ade2167e9ab449 v3.1.0
kotarak-lazymap-767ecaf91c54/.hg_archival.txt 0000644 0001750 0001750 00000000172 12117174335 021001 0 ustar apoikos apoikos repo: 2385fe5a508de9fc44b000ba827de37963d01a02
node: 767ecaf91c54954aa4577919902545c034f585fb
branch: default
tag: v3.1.1
kotarak-lazymap-767ecaf91c54/settings.gradle 0000644 0001750 0001750 00000000035 12117174335 020731 0 ustar apoikos apoikos rootProject.name = 'lazymap'
kotarak-lazymap-767ecaf91c54/README.markdown 0000644 0001750 0001750 00000001634 12117174335 020420 0 ustar apoikos apoikos # lazymap – take the strictness out of maps
## Description
LazyMap is a transparent wrapper around the map types of Clojure. It works
similar to lazy-seq for sequences: the value associated with a key via
lazy-assoc is not evaluated until it is actually accessed. So if the value is
dissoc'd before it is accessed the code necessary to generate the value is not
executed at all.
## Usage
user=> (use 'lazymap.core)
nil
user=> (def m (lazy-hash-map :x (do (println :a) :y)))
#'user/m
user=> (get m :x)
:a
:y
user=> (get m :x)
:y
user=>
### Gradle
dependencies { compile 'de.kotka:lazymap:3.0.0' }
### Maven
de.kotka
lazymap
3.0.0
### Leiningen
:dependencies [[de.kotka/lazymap "3.0.0"]]
Meikel Brandmeyer ,
Frankfurt am Main, 2011
kotarak-lazymap-767ecaf91c54/gradle/ 0002755 0001750 0001750 00000000000 13051151660 017145 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/gradle/wrapper/ 0002755 0001750 0001750 00000000000 13051151660 020625 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/gradle/wrapper/gradle-wrapper.properties 0000644 0001750 0001750 00000000345 12117174335 025665 0 ustar apoikos apoikos #Tue Jan 29 23:19:04 CET 2013
distributionBase=GRADLE_USER_HOME
distributionPath=wrapper/dists
zipStoreBase=GRADLE_USER_HOME
zipStorePath=wrapper/dists
distributionUrl=http\://services.gradle.org/distributions/gradle-1.3-bin.zip
kotarak-lazymap-767ecaf91c54/LICENSE.txt 0000644 0001750 0001750 00000002100 12117174335 017527 0 ustar apoikos apoikos Copyright 2008-2011 (c) Meikel Brandmeyer.
All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
kotarak-lazymap-767ecaf91c54/src/ 0002755 0001750 0001750 00000000000 13051151660 016476 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/src/main/ 0002755 0001750 0001750 00000000000 13051151660 017422 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/src/main/clojure/ 0002755 0001750 0001750 00000000000 13051151660 021065 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/src/main/clojure/lazymap/ 0002755 0001750 0001750 00000000000 13051151660 022542 5 ustar apoikos apoikos kotarak-lazymap-767ecaf91c54/src/main/clojure/lazymap/core.clj 0000644 0001750 0001750 00000026065 12117174335 024201 0 ustar apoikos apoikos ;-
; Copyright 2008-2011 (c) Meikel Brandmeyer.
; All rights reserved.
;
; Permission is hereby granted, free of charge, to any person obtaining a copy
; of this software and associated documentation files (the "Software"), to deal
; in the Software without restriction, including without limitation the rights
; to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
; copies of the Software, and to permit persons to whom the Software is
; furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in
; all copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
; OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
; THE SOFTWARE.
(ns lazymap.core
"Lazymap is to maps what lazy-seq is to lists. It allows to store values
with evaluating them. This is only done in case the value is really accessed.
Lazymap works with any map type (hash-map, sorted-map, struct-map) and may
be used as a drop-in replacement everywhere where a normal map type may be
used.
Available macros:
lazy-hash-map, lazy-sorted-map, lazy-struct-map, lazy-struct, lazy-assoc
and their * counterpart functions."
(:import
clojure.lang.IObj
clojure.lang.IFn
clojure.lang.ILookup
clojure.lang.IMapEntry
clojure.lang.IPersistentMap
clojure.lang.IPersistentVector
clojure.lang.ASeq
clojure.lang.ISeq
clojure.lang.Seqable
clojure.lang.SeqIterator))
(defprotocol ILazyMapEntry
"ILazyMapEntry describes the behaviour of a lazy MapEntry. It provides
an additional method (over IMapEntry), which returns the raw delay object
and not the forced value."
(get-key [lazy-map-entry] "Return the key of the map entry.")
(get-raw-value [lazy-map-entry] "Return the underlying delay object."))
; Extend the IMapEntry interface to act also like ILazyMapEntry.
; For a IMapEntry get-raw-value just returns the given value as
; wrapped in a delay. Similar a vector of two elements might be
; used in place of a IMapEntry.
(extend-protocol ILazyMapEntry
IMapEntry
(get-key [#^IMapEntry this] (.getKey this))
(get-raw-value [#^IMapEntry this] (let [v (.getValue this)] (delay v)))
IPersistentVector
(get-key [this]
(when-not (= (count this) 2)
(throw (IllegalArgumentException.
"Vector used as IMapEntry must be a pair")))
(this 0))
(get-raw-value
[this]
(when-not (= (count this) 2)
(throw (IllegalArgumentException.
"Vector used as IMapEntry must be a pair")))
(let [v (this 1)]
(delay v))))
(defprotocol ILazyPersistentMap
"ILazyPersistentMap extends IPersistentMap with a method to allow
transportation of the underlying delaying objects."
(delay-assoc [lazy-map key delay] "Associates the given delay/future in the map."))
(deftype LazyMapEntry [k v]
ILazyMapEntry
(get-key [_] k)
(get-raw-value [_] v)
IMapEntry
(key [_] k)
(getKey [_] k)
(val [_] (deref v))
(getValue [_] (deref v))
Object
(toString [_] (str \[ (pr-str k) \space (pr-str (deref v)) \])))
(defmethod print-method LazyMapEntry
[this #^java.io.Writer w]
(.write w (str this)))
(defn create-lazy-map-seq
([inner-seq]
(create-lazy-map-seq inner-seq nil))
([inner-seq metadata]
(proxy [ASeq] [metadata]
; ISeq
(first []
(let [first-val (first inner-seq)]
(LazyMapEntry. (key first-val) (val first-val))))
(next []
(when-let [inner-rest (next inner-seq)]
(create-lazy-map-seq inner-rest metadata)))
(more [] (lazy-seq (next this))))))
(declare create-lazy-map)
(deftype LazyPersistentMap
[base metadata]
ILazyPersistentMap
(delay-assoc [this k v] (create-lazy-map (assoc base k v) metadata))
IPersistentMap
(assoc [this k v] (create-lazy-map (assoc base k (delay v)) metadata))
(assocEx
[this k v]
(when (contains? base k)
(throw (Exception. (str "Key already present in map: " k))))
(.assoc this k v))
(without [this k] (create-lazy-map (dissoc base k) metadata))
; Associative
(containsKey [this k] (contains? base k))
(entryAt [this k] (when-let [v (base k)] (LazyMapEntry. k v)))
; IPersistentCollection
(count [this] (count base))
(cons
[this o]
(if (satisfies? ILazyMapEntry o)
(delay-assoc this (get-key o) (get-raw-value o))
(into this o)))
(empty [this] (create-lazy-map (empty base) nil))
ILookup
(valAt [this k] (.valAt this k nil))
(valAt
[this k not-found]
(if (contains? base k)
(-> base (get k) deref)
not-found))
IFn
(invoke [this k] (.valAt this k nil))
(invoke [this k not-found] (.valAt this k not-found))
(applyTo
[this args]
(let [[k v & rest-args :as args] (seq args)]
(when (or (not args) rest-args)
(throw (Exception. "lazy map must be called with one or two arguments")))
(.valAt this k v)))
Seqable
(seq
[this]
(when-let [inner-seq (seq base)]
(create-lazy-map-seq inner-seq)))
IObj
(withMeta [this new-metadata] (create-lazy-map base new-metadata))
; IMeta
(meta [this] metadata)
Iterable
(iterator [this] (-> this .seq SeqIterator.)))
(defn create-lazy-map
([base]
(create-lazy-map base nil))
([base metadata]
(LazyPersistentMap. base metadata)))
(defn- quote-values
[kvs ctor]
(assert (even? (count kvs)))
(mapcat (fn [[k v]] [k `(~ctor ~v)]) (partition 2 kvs)))
(defn delayed-assoc
"delayed-assoc is like lazy-assoc but a function and takes values as delays
or futures instead of expanding into a delay/future of val."
[m & kvs]
(assert (even? (count kvs)))
(reduce (fn [m [k v]] (delay-assoc m k v)) m (partition 2 kvs)))
(defn delayed-hash-map
"delayed-hash-map is the same as lazy-hash-map except that its a function
and it takes a seq of keys-delayed-value pairs."
[& kvs]
(create-lazy-map (apply hash-map kvs)))
(defn delayed-sorted-map
"delayed-sorted-map is the same as lazy-sorted-map except that its a
function and it takes a seq of keys-delayed-value pairs."
[& kvs]
(create-lazy-map (apply sorted-map kvs)))
(defn delayed-struct-map
"delayed-struct-map is the same as lazy-struct-map except that its a
function and it takes a seq of keys-delayed-value pairs together with the
struct basis."
[s & kvs]
(create-lazy-map (apply struct-map s kvs)))
(defn delayed-struct
"delayed-struct is the same as lazy-struct except that its a function and
it takes a seq of delayed value together with the struct basis."
[s & vs]
(create-lazy-map (apply struct s vs)))
(defn lazy-assoc*
"lazy-assoc* is like lazy-assoc but a function and takes values as delays
instead of expanding into a delay of val.
Deprecated: Use delayed-assoc instead."
{:deprecated true}
[m & kvs]
(apply delayed-assoc m kvs))
(defmacro lazy-assoc
"lazy-assoc associates new values to the given keys in the given lazy map.
The values are not evaluated, before their first retrieval. They are
evaluated at most once."
[m & kvs]
`(delayed-assoc ~m ~@(quote-values kvs `delay)))
(defn lazy-hash-map*
"lazy-hash-map* is the same as lazy-hash-map except that its a function
and it takes a seq of keys-delayed-value pairs.
Deprecated: Use delayed-hash-map."
{:deprecated true}
[& kvs]
(apply delayed-hash-map kvs))
(defmacro lazy-hash-map
"lazy-hash-map creates a map. The values are not evaluated before their
first retrieval. Each value is evaluated at most once. The underlying map
is a hash map."
[& kvs]
`(delayed-hash-map ~@(quote-values kvs `delay)))
(defn lazy-sorted-map*
"lazy-sorted-map* is the same as lazy-sorted-map except that its a
function and it takes a seq of keys-delayed-value pairs.
Deprecated: Use delayed-sorted-map"
{:deprecated true}
[& kvs]
(apply delayed-sorted-map kvs))
(defmacro lazy-sorted-map
"lazy-sorted-map creates a map. The values are not evaluated before their
first retrieval. Each value is evaluated at most once. The underlying map
is a sorted map."
[& kvs]
`(delayed-sorted-map ~@(quote-values kvs `delay)))
(defn lazy-struct-map*
"lazy-struct-map* is the same as lazy-struct-map except that its a
function and it takes a seq of keys-delayed-value pairs together with the
struct basis.
Deprecated: Use delayed-struct-map"
{:deprecated true}
[s & kvs]
(apply delayed-struct-map s kvs))
(defmacro lazy-struct-map
"lazy-struct-map creates a map. The values are not evaluated before their
first retrieval. Each value is evaluated at most once. The underlying map
is a struct map according to the provided structure s."
[s & kvs]
`(delayed-struct-map ~s ~@(quote-values kvs `delay)))
(defn lazy-struct*
"lazy-struct* is the same as lazy-struct except that its a function and
it takes a seq of delayed value together with the struct basis.
Deprecated: Use delayed-struct"
{:deprecated true}
[s & vs]
(apply delayed-struct s vs))
(defmacro lazy-struct
"lazy-struct creates a map. The values are not evaluated before their
first retrieval. Each value is evaluated at most once. The underlying map
is a struct map according to the provided structure s. As with Clojure's
struct the values have to appear in the order of the keys in the structure."
[s & vs]
(let [vs (map (fn [v] `(delay ~v)) vs)]
`(delayed-struct ~s ~@vs)))
(defmacro future-assoc
"future-assoc associates new values to the given keys in the given lazy map.
The values are evaluated in a separate thread. They are evaluated at most
once."
[m & kvs]
`(delayed-assoc ~m ~@(quote-values kvs `future)))
(defmacro future-hash-map
"future-hash-map creates a map. The values are evaluated in a separate
thread. Each value is evaluated at most once. The underlying map is a
hash map."
[& kvs]
`(delayed-hash-map ~@(quote-values kvs `future)))
(defmacro future-sorted-map
"future-hash-map creates a map. The values are evaluated in a separate
thread. Each value is evaluated at most once. The underlying map is a
sorted map."
[& kvs]
`(delayed-sorted-map ~@(quote-values kvs `future)))
(defmacro future-struct-map
"future-hash-map creates a map. The values are evaluated in a separate
thread. Each value is evaluated at most once. The underlying map is a
struct map according to the provided structure s."
[s & kvs]
`(delayed-struct-map ~s ~@(quote-values kvs `future)))
(defmacro future-struct
"future-hash-map creates a map. The values are evaluated in a separate
thread. Each value is evaluated at most once. The underlying map is a
struct map according to the provided structure s. As with Clojure's
struct the values have to appear in the order of the keys in the structure."
[s & vs]
(let [vs (map (fn [v] `(future ~v)) vs)]
`(delayed-struct ~s ~@vs)))
kotarak-lazymap-767ecaf91c54/.hgignore 0000644 0001750 0001750 00000000053 12117174335 017514 0 ustar apoikos apoikos syntax: glob
build/*
.gradle
local.gradle
kotarak-lazymap-767ecaf91c54/gradlew 0000755 0001750 0001750 00000011727 12117174335 017276 0 ustar apoikos apoikos #!/bin/bash
##############################################################################
##
## Gradle start up script for UN*X
##
##############################################################################
# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
DEFAULT_JVM_OPTS=""
APP_NAME="Gradle"
APP_BASE_NAME=`basename "$0"`
# Use the maximum available, or set MAX_FD != -1 to use that value.
MAX_FD="maximum"
warn ( ) {
echo "$*"
}
die ( ) {
echo
echo "$*"
echo
exit 1
}
# OS specific support (must be 'true' or 'false').
cygwin=false
msys=false
darwin=false
case "`uname`" in
CYGWIN* )
cygwin=true
;;
Darwin* )
darwin=true
;;
MINGW* )
msys=true
;;
esac
# For Cygwin, ensure paths are in UNIX format before anything is touched.
if $cygwin ; then
[ -n "$JAVA_HOME" ] && JAVA_HOME=`cygpath --unix "$JAVA_HOME"`
fi
# Attempt to set APP_HOME
# Resolve links: $0 may be a link
PRG="$0"
# Need this for relative symlinks.
while [ -h "$PRG" ] ; do
ls=`ls -ld "$PRG"`
link=`expr "$ls" : '.*-> \(.*\)$'`
if expr "$link" : '/.*' > /dev/null; then
PRG="$link"
else
PRG=`dirname "$PRG"`"/$link"
fi
done
SAVED="`pwd`"
cd "`dirname \"$PRG\"`/"
APP_HOME="`pwd -P`"
cd "$SAVED"
CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar
# Determine the Java command to use to start the JVM.
if [ -n "$JAVA_HOME" ] ; then
if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
# IBM's JDK on AIX uses strange locations for the executables
JAVACMD="$JAVA_HOME/jre/sh/java"
else
JAVACMD="$JAVA_HOME/bin/java"
fi
if [ ! -x "$JAVACMD" ] ; then
die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
Please set the JAVA_HOME variable in your environment to match the
location of your Java installation."
fi
else
JAVACMD="java"
which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
Please set the JAVA_HOME variable in your environment to match the
location of your Java installation."
fi
# Increase the maximum file descriptors if we can.
if [ "$cygwin" = "false" -a "$darwin" = "false" ] ; then
MAX_FD_LIMIT=`ulimit -H -n`
if [ $? -eq 0 ] ; then
if [ "$MAX_FD" = "maximum" -o "$MAX_FD" = "max" ] ; then
MAX_FD="$MAX_FD_LIMIT"
fi
ulimit -n $MAX_FD
if [ $? -ne 0 ] ; then
warn "Could not set maximum file descriptor limit: $MAX_FD"
fi
else
warn "Could not query businessSystem maximum file descriptor limit: $MAX_FD_LIMIT"
fi
fi
# For Darwin, add options to specify how the application appears in the dock
if $darwin; then
GRADLE_OPTS="$GRADLE_OPTS \"-Xdock:name=$APP_NAME\" \"-Xdock:icon=$APP_HOME/media/gradle.icns\""
fi
# For Cygwin, switch paths to Windows format before running java
if $cygwin ; then
APP_HOME=`cygpath --path --mixed "$APP_HOME"`
CLASSPATH=`cygpath --path --mixed "$CLASSPATH"`
# We build the pattern for arguments to be converted via cygpath
ROOTDIRSRAW=`find -L / -maxdepth 1 -mindepth 1 -type d 2>/dev/null`
SEP=""
for dir in $ROOTDIRSRAW ; do
ROOTDIRS="$ROOTDIRS$SEP$dir"
SEP="|"
done
OURCYGPATTERN="(^($ROOTDIRS))"
# Add a user-defined pattern to the cygpath arguments
if [ "$GRADLE_CYGPATTERN" != "" ] ; then
OURCYGPATTERN="$OURCYGPATTERN|($GRADLE_CYGPATTERN)"
fi
# Now convert the arguments - kludge to limit ourselves to /bin/sh
i=0
for arg in "$@" ; do
CHECK=`echo "$arg"|egrep -c "$OURCYGPATTERN" -`
CHECK2=`echo "$arg"|egrep -c "^-"` ### Determine if an option
if [ $CHECK -ne 0 ] && [ $CHECK2 -eq 0 ] ; then ### Added a condition
eval `echo args$i`=`cygpath --path --ignore --mixed "$arg"`
else
eval `echo args$i`="\"$arg\""
fi
i=$((i+1))
done
case $i in
(0) set -- ;;
(1) set -- "$args0" ;;
(2) set -- "$args0" "$args1" ;;
(3) set -- "$args0" "$args1" "$args2" ;;
(4) set -- "$args0" "$args1" "$args2" "$args3" ;;
(5) set -- "$args0" "$args1" "$args2" "$args3" "$args4" ;;
(6) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" ;;
(7) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" ;;
(8) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" ;;
(9) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" "$args8" ;;
esac
fi
# Split up the JVM_OPTS And GRADLE_OPTS values into an array, following the shell quoting and substitution rules
function splitJvmOpts() {
JVM_OPTS=("$@")
}
eval splitJvmOpts $DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS
JVM_OPTS[${#JVM_OPTS[*]}]="-Dorg.gradle.appname=$APP_BASE_NAME"
exec "$JAVACMD" "${JVM_OPTS[@]}" -classpath "$CLASSPATH" org.gradle.wrapper.GradleWrapperMain "$@"
kotarak-lazymap-767ecaf91c54/build.gradle 0000644 0001750 0001750 00000002476 12117174335 020203 0 ustar apoikos apoikos buildscript {
dependencies {
classpath project.files("gradle/plugins/clojuresque-1.5.4.jar")
classpath project.files("gradle/plugins/clojars-1.0.0.jar")
classpath project.files("gradle/plugins/local-dotgradle-1.0.0.jar")
}
}
repositories {
flatDir { dir project.file("gradle/plugins") }
}
apply plugin: 'clojure'
apply plugin: clojuresque.ClojarsPlugin
apply plugin: 'local-dotgradle'
apply plugin: 'signing'
group = 'de.kotka'
version = '3.1.1'
defaultRepositories {
mavenCentral()
}
dependencies {
compile 'org.clojure:clojure:1.2.0'
}
signing {
sign configurations.archives
}
clojars {
deploy(uploadArchives) {
project {
licenses {
license {
name 'MIT License'
url 'http://opensource.org/licenses/MIT'
distribution 'repo'
}
}
description "A lazy map implementation for Clojure"
url "http://bitbucket.org/kotarak/lazymap"
scm {
connection 'scm:hg:hg@bitbucket.org:kotarak/lazymap'
developerConnection 'scm:hg:hg@bitbucket.org:kotarak/lazymap'
url 'hg@bitbucket.org:kotarak/lazymap'
}
}
}
}
task wrapper(type: Wrapper) {
gradleVersion = "1.3"
}
kotarak-lazymap-767ecaf91c54/gradlew.bat 0000644 0001750 0001750 00000004544 12117174335 020037 0 ustar apoikos apoikos @if "%DEBUG%" == "" @echo off
@rem ##########################################################################
@rem
@rem Gradle startup script for Windows
@rem
@rem ##########################################################################
@rem Set local scope for the variables with windows NT shell
if "%OS%"=="Windows_NT" setlocal
@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
set DEFAULT_JVM_OPTS=
set DIRNAME=%~dp0
if "%DIRNAME%" == "" set DIRNAME=.
set APP_BASE_NAME=%~n0
set APP_HOME=%DIRNAME%
@rem Find java.exe
if defined JAVA_HOME goto findJavaFromJavaHome
set JAVA_EXE=java.exe
%JAVA_EXE% -version >NUL 2>&1
if "%ERRORLEVEL%" == "0" goto init
echo.
echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
echo.
echo Please set the JAVA_HOME variable in your environment to match the
echo location of your Java installation.
goto fail
:findJavaFromJavaHome
set JAVA_HOME=%JAVA_HOME:"=%
set JAVA_EXE=%JAVA_HOME%/bin/java.exe
if exist "%JAVA_EXE%" goto init
echo.
echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%
echo.
echo Please set the JAVA_HOME variable in your environment to match the
echo location of your Java installation.
goto fail
:init
@rem Get command-line arguments, handling Windowz variants
if not "%OS%" == "Windows_NT" goto win9xME_args
if "%@eval[2+2]" == "4" goto 4NT_args
:win9xME_args
@rem Slurp the command line arguments.
set CMD_LINE_ARGS=
set _SKIP=2
:win9xME_args_slurp
if "x%~1" == "x" goto execute
set CMD_LINE_ARGS=%*
goto execute
:4NT_args
@rem Get arguments from the 4NT Shell from JP Software
set CMD_LINE_ARGS=%$
:execute
@rem Setup the command line
set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar
@rem Execute Gradle
"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %CMD_LINE_ARGS%
:end
@rem End local scope for the variables with windows NT shell
if "%ERRORLEVEL%"=="0" goto mainEnd
:fail
rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
rem the _cmd.exe /c_ return code!
if not "" == "%GRADLE_EXIT_CONSOLE%" exit 1
exit /b 1
:mainEnd
if "%OS%"=="Windows_NT" endlocal
:omega