\n\nif exists(\"g:autoloaded_timl_type\")\n finish\nendif\nlet g:autoloaded_timl_type = 1\n\nfunction! s:freeze(...) abort\n return a:000\nendfunction\n\nif !exists('g:timl#nil')\n let g:timl#nil = s:freeze()\n lockvar 1 g:timl#nil\nendif\n\n\" Section: Blessing\n\nif !exists('g:timl_tag_sentinel')\n let g:timl_tag_sentinel = s:freeze('blessed object')\n lockvar 1 g:timl_tag_sentinel\nendif\n\nif !exists('s:types')\n let s:types = {}\nendif\n\nfunction! timl#type#find(name) abort\n return get(s:types, timl#string#coerce(a:name), g:timl#nil)\nendfunction\n\nfunction! timl#type#create(name, ...) abort\n let munged = tr(a:name, '-./', '_##')\n if !has_key(s:types, a:name)\n let s:types[a:name] = timl#type#bless(s:type_type, {\n \\ 'str': a:name,\n \\ 'location': 'g:'.munged,\n \\ 'slots': g:timl#nil,\n \\ '__call__': function('timl#type#constructor')})\n endif\n let s:types[a:name].slots = a:0 ? a:1 : g:timl#nil\n let g:{munged} = s:types[a:name]\n return s:types[a:name]\nendfunction\n\nfunction! timl#type#core_create(name, ...) abort\n return timl#type#create('timl.lang/'.a:name, a:0 ? a:1 : g:timl#nil)\nendfunction\n\nfunction! timl#type#core_define(name, slots, methods) abort\n let ns = timl#namespace#create(timl#symbol#intern('timl.core'))\n let type = timl#type#core_create(a:name, a:slots)\n for [k, v] in items(a:methods)\n call timl#type#define_method(ns, timl#symbol#intern(k), type, function(v))\n endfor\n return type\nendfunction\n\nfunction! timl#type#constructor(_) dict abort\n if get(self, 'slots') is# g:timl#nil\n throw 'timl: constructor not implemented'\n endif\n if len(a:_) != len(self.slots)\n throw 'timl: arity error'\n endif\n let object = {}\n for i in range(len(a:_))\n let object[self.slots[i]] = a:_[i]\n endfor\n return timl#type#bless(self, object)\nendfunction\n\nif !has_key(s:types, 'timl.lang/Type')\n let s:types['timl.lang/Type'] = {\n \\ 'str': 'timl.lang/Type',\n \\ 'location': 'g:timl#lang#Type',\n \\ 'slots': g:timl#nil,\n \\ '__call__': function('timl#type#constructor')}\nendif\nlet s:type_type = s:types['timl.lang/Type']\nfunction! timl#type#define(ns, var, slots) abort\n let str = timl#namespace#name(a:ns).name . '/' . timl#symbol#cast(a:var).name\n let type = timl#type#create(str)\n if a:slots isnot# g:timl#nil\n let type.slots = map(timl#array#coerce(a:slots), 'timl#symbol#cast(v:val).name')\n endif\n return timl#namespace#intern(a:ns, a:var, type)\nendfunction\n\nlet s:builtins = {\n \\ 0: 'vim/Number',\n \\ 1: 'vim/String',\n \\ 2: 'vim/Funcref',\n \\ 3: 'vim/List',\n \\ 4: 'vim/Dictionary',\n \\ 5: 'vim/Float'}\n\nfunction! timl#type#objectp(obj) abort\n return type(a:obj) == type({}) && get(a:obj, '__flag__') is g:timl_tag_sentinel\nendfunction\n\nfunction! timl#type#string(val) abort\n let type = get(s:builtins, type(a:val), 'vim/Unknown')\n if a:val is# g:timl#nil\n return 'timl.lang/Nil'\n elseif type ==# 'vim/Dictionary'\n if get(a:val, '__flag__') is g:timl_tag_sentinel\n return a:val.__type__.str\n endif\n endif\n return type\nendfunction\n\nlet s:proto = {\n \\ '__call__': function('timl#type#dispatch_call'),\n \\ '__flag__': g:timl_tag_sentinel}\nfunction! timl#type#bless(type, ...) abort\n let obj = a:0 ? a:1 : {}\n call extend(obj, s:proto, 'keep')\n let obj.__type__ = a:type\n return obj\nendfunction\n\nfunction! timl#type#dispatch_call(_) dict\n return g:timl#core.call.__call__([self, a:_])\nendfunction\n\ncall timl#type#bless(s:type_type, s:type_type)\n\n\" Section: Hierarchy\n\" Cribbed from clojure.core\n\nfunction! timl#type#parents(key) abort\n return timl#set#coerce(values(get(g:timl_hierarchy.parents, timl#string#coerce(a:key), {})))\nendfunction\n\nfunction! timl#type#ancestors(key) abort\n return timl#set#coerce(values(get(g:timl_hierarchy.ancestors, timl#string#coerce(a:key), {})))\nendfunction\n\nfunction! timl#type#descendants(key) abort\n return timl#set#coerce(values(get(g:timl_hierarchy.descendants, timl#string#coerce(a:key), {})))\nendfunction\n\nfunction! s:tf(m, source, sources, target, targets) abort\n for k in [a:source] + values(get(a:sources, a:source[0], {}))\n if !has_key(a:targets, k[0])\n let a:targets[k[0]] = {}\n endif\n let a:targets[k[0]][a:target[0]] = a:target\n for j in values(get(a:targets, a:target[0], {}))\n let a:targets[k[0]][j[0]] = j\n endfor\n endfor\nendfunction\n\nfunction! s:isap(tag, parent) abort\n return a:tag ==# a:parent || has_key(get(g:timl_hierarchy.ancestors, a:tag, {}), a:parent)\nendfunction\n\nfunction! timl#type#isap(tag, parent) abort\n return timl#keyword#cast(a:tag) is# timl#keyword#cast(a:parent)\n \\ || has_key(get(g:timl_hierarchy.ancestors, a:tag[0], {}), a:parent[0])\nendfunction\n\nfunction! timl#type#derive(tag, parent) abort\n let tp = g:timl_hierarchy.parents\n let td = g:timl_hierarchy.descendants\n let ta = g:timl_hierarchy.ancestors\n let tag = timl#keyword#cast(a:tag)\n let parent = timl#keyword#cast(a:parent)\n if !has_key(tp, tag[0])\n let tp[tag[0]] = {}\n endif\n if !has_key(tp[tag[0]], parent[0])\n if has_key(get(ta, tag[0], {}), parent[0])\n throw \"timl#type: :\".tag[0].\" already has :\".parent[0].\" as ancestor\"\n endif\n if has_key(get(ta, parent[0], {}), tag[0])\n throw \"timl#type: :\".parent[0].\" has :\".tag[0].\" as ancestor\"\n endif\n let tp[tag[0]][parent[0]] = parent\n call s:tf(ta, tag, td, parent, ta)\n call s:tf(td, parent, ta, tag, td)\n endif\n let g:timl_hierarchy = copy(g:timl_hierarchy) \" expire caches\n return g:timl_hierarchy\nendfunction\n\n\" Section: Dispatch\n\nfunction! timl#type#canp(obj, this) abort\n return s:get_method(a:this, timl#type#string(a:obj)) isnot# g:timl#nil\nendfunction\n\nfunction! s:get_method(this, type) abort\n if a:this.hierarchy isnot# g:timl_hierarchy\n let a:this.cache = {}\n let a:this.hierarchy = g:timl_hierarchy\n endif\n if !has_key(a:this.cache, a:type)\n let _ = {'preferred': g:timl#nil}\n for [_.type, _.fn] in items(a:this.methods)\n if s:isap(a:type, _.type)\n if _.preferred is g:timl#nil || s:isap(_.type, _.preferred[0])\n let _.preferred = [_.type, _.fn]\n elseif !s:isap(_.preferred[0], _.type)\n throw 'timl#type: ambiguous'\n endif\n endif\n endfor\n if _.preferred is# g:timl#nil\n let a:this.cache[a:type] = get(a:this.methods, ' ', g:timl#nil)\n else\n let a:this.cache[a:type] = _.preferred[1]\n endif\n endif\n return get(a:this.cache, a:type, g:timl#nil)\nendfunction\n\nlet s:t_function = type(function('tr'))\nlet s:t_dict = type({})\nfunction! timl#type#apply(_) dict abort\n let type = timl#type#string(a:_[0])\n if self.hierarchy isnot# g:timl_hierarchy\n let self.cache = {}\n let self.hierarchy = g:timl_hierarchy\n endif\n let Dispatch = has_key(self.cache, type) ? self.cache[type] : s:get_method(self, type)\n let t = type(Dispatch)\n if t == s:t_function\n return call(Dispatch, a:_)\n elseif t == s:t_dict\n return Dispatch.__call__(a:_)\n endif\n throw 'timl#type: no '.self.ns.__name__[0].'/'.self.name[0].' dispatch for '.type\nendfunction\n\nfunction! timl#type#dispatch(this, _) abort\n return call('timl#type#apply', [a:_], a:this)\nendfunction\n\n\" Section: Method Creation\n\nfunction! timl#type#define_method(ns, name, type, fn) abort\n let var = timl#namespace#maybe_resolve(a:ns, timl#symbol#cast(a:name))\n if var is# g:timl#nil || timl#type#string(timl#var#get(var)) isnot# 'timl.lang/MultiFn'\n unlet var\n if !empty(a:name.namespace)\n throw \"timl: no such method \".a:name.str\n endif\n let fn = timl#type#bless(s:multifn_type, {\n \\ '__call__': function('timl#type#apply'),\n \\ 'ns': a:ns,\n \\ 'name': a:name,\n \\ 'cache': {},\n \\ 'hierarchy': g:timl_hierarchy,\n \\ 'methods': {}})\n let var = timl#namespace#intern(a:ns, a:name, fn)\n endif\n let multi = timl#var#get(var)\n let multi.methods[a:type is# g:timl#nil ? ' ' : a:type.str] = a:fn\n let multi.cache = {}\n return var\nendfunction\nlet s:multifn_type = timl#type#core_create('MultiFn')\n\n\" Section: Initialization\n\nif !exists('g:timl_hierarchy')\n let g:timl_hierarchy = {'parents': {}, 'descendants': {}, 'ancestors': {}}\nendif\n\n\" vim:set et sw=2:\n"
},
{
"path": "autoload/timl/var.vim",
"content": "\" Maintainer: Tim Pope \n\nif exists('g:autoloaded_timl_var')\n finish\nendif\nlet g:autoloaded_timl_var = 1\n\nfunction! timl#var#get(var) abort\n return eval(a:var.location)\nendfunction\n\nfunction! timl#var#call(var, _) abort\n return timl#call(eval(a:var.location), a:_)\nendfunction\n\nfunction! timl#var#test(this) abort\n return timl#type#string(a:this) ==# 'timl.lang/Var'\nendfunction\n\nfunction! timl#var#find(sym) abort\n let sym = timl#symbol#cast(a:sym)\n let ns = empty(sym.namespace) ? timl#namespace#name(g:timl#core._STAR_ns_STAR_).str : sym.namespace\n return get(timl#namespace#find(ns).__mappings__, sym.name, g:timl#nil)\nendfunction\n\nfunction! timl#var#funcref(var) abort\n return function(a:var.munged)\nendfunction\n\nfunction! timl#var#reset_meta(var, meta) abort\n let a:var.meta = a:meta\n return a:var\nendfunction\n\n\" Section: Munging\n\n\" From clojure/lang/Compiler.java\nlet s:munge = {\n \\ '.': \"#\",\n \\ ',': \"_COMMA_\",\n \\ ':': \"_COLON_\",\n \\ '+': \"_PLUS_\",\n \\ '>': \"_GT_\",\n \\ '<': \"_LT_\",\n \\ '=': \"_EQ_\",\n \\ '~': \"_TILDE_\",\n \\ '!': \"_BANG_\",\n \\ '@': \"_CIRCA_\",\n \\ \"'\": \"_SINGLEQUOTE_\",\n \\ '\"': \"_DOUBLEQUOTE_\",\n \\ '%': \"_PERCENT_\",\n \\ '^': \"_CARET_\",\n \\ '&': \"_AMPERSAND_\",\n \\ '*': \"_STAR_\",\n \\ '|': \"_BAR_\",\n \\ '{': \"_LBRACE_\",\n \\ '}': \"_RBRACE_\",\n \\ '[': \"_LBRACK_\",\n \\ ']': \"_RBRACK_\",\n \\ '/': \"_SLASH_\",\n \\ '\\\\': \"_BSLASH_\",\n \\ '?': \"_QMARK_\"}\n\nlet s:demunge = {}\nfor s:key in keys(s:munge)\n let s:demunge[s:munge[s:key]] = s:key\nendfor\nunlet! s:key\n\nfunction! timl#var#munge(var) abort\n let var = type(a:var) == type('') ? a:var : a:var[0]\n return tr(substitute(substitute(var, '[^[:alnum:]:#_-]', '\\=get(s:munge,submatch(0), submatch(0))', 'g'), '_SLASH_\\ze.', '.', ''), '-', '_')\nendfunction\n\nfunction! timl#var#demunge(var) abort\n let var = type(a:var) == type('') ? a:var : a:var[0]\n return tr(substitute(var, '_\\(\\u\\+\\)_', '\\=get(s:demunge, submatch(0), submatch(0))', 'g'), '_', '-')\nendfunction\n"
},
{
"path": "autoload/timl/vector.vim",
"content": "\" Maintainer: Tim Pope \n\nif exists('g:autoloaded_timl_vector')\n finish\nendif\nlet g:autoloaded_timl_vector = 1\n\nfunction! timl#vector#test(obj) abort\n return timl#type#canp(a:obj, g:timl#core.nth)\nendfunction\n\nlet s:type = timl#type#core_create('Vector')\nfunction! timl#vector#claim(array) abort\n lockvar 1 a:array\n let vector = timl#type#bless(s:type, {'array': a:array})\n lockvar 1 vector\n return vector\nendfunction\n\nfunction! timl#vector#coerce(seq) abort\n if a:seq is# g:timl#nil\n return s:empty\n elseif type(a:seq) ==# type([])\n return timl#vector#claim(copy(a:seq))\n elseif timl#type#string(a:seq) ==# s:type.str\n return a:seq\n endif\n let array = []\n let _ = {'seq': timl#coll#seq(a:seq)}\n while _.seq isnot# g:timl#nil\n call add(array, timl#coll#first(_.seq))\n let _.seq = timl#coll#next(_.seq)\n endwhile\n return timl#vector#claim(array)\nendfunction\n\nfunction! timl#vector#seq(this) abort\n return timl#array#seq(a:this.array)\nendfunction\n\nfunction! timl#vector#length(this) abort\n return len(a:this.array)\nendfunction\n\nfunction! timl#vector#car(this) abort\n return get(a:this.array, 0, g:timl#nil)\nendfunction\n\nfunction! timl#vector#cdr(this) abort\n return len(a:this.array) <= 1 ? g:timl#empty_list : timl#array_seq#create(a:this.array, 1)\nendfunction\n\nfunction! timl#vector#lookup(this, idx, ...) abort\n if type(a:idx) == type(0) && a:idx >= 0\n return get(a:this.array, a:idx, a:0 ? a:1 : g:timl#nil)\n endif\n return a:0 ? a:1 : g:timl#nil\nendfunction\n\nfunction! timl#vector#nth(this, idx, ...) abort\n let idx = timl#number#int(a:idx)\n if a:0\n return get(a:this.array, idx, a:1)\n else\n return a:this.array[idx]\n endif\nendfunction\n\nfunction! timl#vector#conj(this, ...) abort\n return timl#vector#claim(a:this.array + a:000)\nendfunction\n\nlet s:empty = timl#vector#claim([])\nfunction! timl#vector#empty(this) abort\n return s:empty\nendfunction\n\nfunction! timl#vector#transient(this) abort\n return copy(a:this.array)\nendfunction\n\nfunction! timl#vector#sub(this, start, ...) abort\n let array = timl#vector#coerce(a:this).array\n if a:0 && a:1 == 0\n return s:empty\n elseif a:0\n return timl#vector#claim(array[a:start : (a:1 < 0 ? a:1 : a:1-1)])\n else\n return timl#vector#claim(array[a:start :])\n endif\nendfunction\n\nfunction! timl#vector#call(this, _) abort\n return call('timl#vector#lookup', [a:this] + a:_)\nendfunction\n"
},
{
"path": "autoload/timl.vim",
"content": "\" Maintainer: Tim Pope \n\nif exists(\"g:autoloaded_timl\")\n finish\nendif\nlet g:autoloaded_timl = 1\n\n\" Section: Util {{{1\n\nfunction! timl#truth(val) abort\n return a:val isnot# g:timl#nil && a:val isnot# g:timl#false\nendfunction\n\nfunction! timl#keyword(str) abort\n return timl#keyword#intern(a:str)\nendfunction\n\nfunction! timl#symbol(str) abort\n return timl#symbol#intern(a:str)\nendfunction\n\n\" }}}1\n\" Section: Lists {{{1\n\nfunction! timl#seq(coll) abort\n return timl#coll#seq(a:coll)\nendfunction\n\nfunction! timl#first(coll) abort\n return timl#coll#first(a:coll)\nendfunction\n\nfunction! timl#rest(coll) abort\n return timl#coll#rest(a:coll)\nendfunction\n\nfunction! timl#next(coll) abort\n return timl#coll#seq(timl#coll#rest(rest))\nendfunction\n\nfunction! timl#list(...) abort\n return timl#list#create(a:000)\nendfunction\n\n\" }}}1\n\" Section: Invocation {{{1\n\nfunction! timl#call(Func, args, ...) abort\n if type(a:Func) == type(function('tr'))\n return call(a:Func, a:args, a:0 ? a:1 : {})\n else\n return a:Func.__call__(a:args)\n endif\nendfunction\n\nfunction! timl#invoke(Func, ...) abort\n if type(a:Func) == type(function('tr'))\n return call(a:Func, a:000, {})\n else\n return a:Func.__call__(a:000)\n endif\nendfunction\n\n\" }}}1\n\" Section: Evaluation {{{1\n\nfunction! timl#eval(x) abort\n return timl#loader#eval(a:x)\nendfunction\n\nfunction! timl#re(str) abort\n return timl#eval(timl#reader#read_string(a:str))\nendfunction\n\nfunction! timl#rep(str) abort\n return timl#printer#string(timl#re(a:str))\nendfunction\n\n\" }}}1\n\nruntime! autoload/timl/bootstrap.vim\n\n\" vim:set et sw=2:\n"
},
{
"path": "doc/timl.txt",
"content": "*timl.txt* TimL\n\nAuthor: Tim Pope \nRepo: https://github.com/tpope/timl\nLicense: EPL (http://opensource.org/licenses/eclipse-1.0.php)\n\nUSAGE *timl*\n\nTimL files have an extension of \".tim\" and a |filetype| of \"timl\". If they\nare placed in \"autoload/\" in 'runtimepath', Vim's |autoload| will load them\njust the same as \".vim\" files.\n\n *:TLrepl*\n:TLrepl [ns] Start a REPL.\n\n:source {file} Load a TimL file.\n\n:Wepl In a TimL file, write, source, and start a REPL in\n that namespace.\n\nSYNTAX *timl-syntax*\n\nIt's Lisp. TimL files are just sequences of forms. Evaluation essentially\nentails replacing symbols with their values and lists with the result of\ncalling the first element as function with the remaining elements as\narguments. An informal summary of the various forms follows:\n\nNotation Description ~\n; linewise comment\n#! linewise comment (for shebangs)\n#_ skip next form\nnil |timl-nil|\nfalse |timl-boolean|\ntrue |timl-boolean|\n\\d... |timl-number| (see |expr-number|)\n\\k... |timl-symbol|\n:... |timl-keyword|\n\"...\" |timl-string| (see double quoted strings under |expr-string|)\n#\"...\" |timl-regexp|\n(...) |timl-list|\n[...] |timl-vector|\n{...} |timl-map|\n#{...} |timl-set|\n#(...) |timl-fn|\n#*symbol |timl-funcref|\n#*[...] |timl-array|\n#*{...} |timl-dictionary|\n^... |timl-metadata|\n' |timl-quote|\n` |timl-syntax-quote|\n~ |timl-unquote|\n~@ |timl-unquote-splicing|\n@ |g:timl#core.deref|\n\nTYPES *timl-types*\n\n *timl-number*\nNumbers ~\nSame as Vim. See |expr-number|.\n\n *timl-strings*\nStrings ~\nSame as strings in Vim. The literal syntax is the same as the double quoted\nstrings under |expr-string|.\n\n *timl-regexps*\nRegular Expressions ~\nThere's not a proper regexp type, but #\"...\" compiles down to a string of a\nvery magic |/\\v| case sensitive |\\/C| regexp string. Unlike with regular\nstring literals, you don't need to double your backslashes.\n\n *timl-arrays*\nArrays ~\nTimL arrays are actually Vim |Lists|. They have been rebranded arrays to\navoid confusion with the core Lisp data structure of a singly linked list.\nArrays participate in the expected collection abstractions, but be aware they\nmutate, and thus are best avoided except when dealing with interop.\n\nArrays are shown as #*[...] when printed. The reader respects this syntax,\nbut it is preferrable to use |g:timl#core.array| to create a array.\n\n *timl-dictionary* *timl-dictionaries*\nDictionaries ~\nTimL dictionaries are Vim |Dictionaries|. TimL uses dictionaries in the\nimplementation of its type system, so \"TimL dictionary\" refers to a dictionary\nthat has not been blessed as any particular type. Dictionaries can be treated\nas maps with forced string keys.\n\nDictionaries are shown as #*{...} when printed. The reader respects this\nsyntax, but it is preferrable to use |g:timl#core.dict| to create a\ndictionary.\n\n *timl-funcrefs*\nFuncrefs ~\nTimL provides a special #*symbol syntax for creating a Vim |Funcref|.\nFuncrefs can be called like any other function: (#*bufnr \"%\"). Vim imposes\ncertain restrictions on assigning funcrefs to variables, so beware of using\nthem with |timl-set!| and |timl-def|.\n\n *timl-nil*\nNil ~\nVimL has no concept of nil, so this is actually just a special singleton\nobject. The literal form is \"nil\".\n\n *timl-booleans*\nBooleans ~\nBooleans are the canonical truth values. There's a literal for each: \"true\"\nand \"false\". Nil and false are the only false values in TimL. Note that in\nVimL, zero is false, and built-in Vim functions return that as their false\nvalue. Compose with |g:timl#core.nonzero_QMARK_| if you want to use the\nresult of a built-in Vim function in a conditional.\n\n *timl-symbols*\nSymbols ~\nAny sequence of identifier characters that doesn't start with a number.\nIdentifier characters include alphanumerics and the special characters\n\"-_?!*+/<>\". \":\" and \"#\" are reserved for internal use and can be used to\nrefer to Vim variables (|b:var,| |w:var|, |t:var|, |g:var|, |v:var|).\n\nSince symbols evaluate, you'll need to |timl-quote| one if you want it as a\nvalue: 'symbol.\n\n *timl-keywords*\nKeywords ~\nKeywords look like symbols preceded by a colon. Unlike symbols, they evaluate\nto themselves, making them good |timl-map| keys. Calling a keyword as a\nfunction tries to retrieve it from the given collection using\n|g:timl#core.get|.\n\n *timl-lists*\nLists ~\nLists are linked lists under the hood, and have a syntax literal of zero or more forms enclosed in parentheses (). Lists evaluate to a function\ncall of the first element with the remaining elements as args. To create a\nlist value, |timl-quote| it (also prevents evaluation of elements) or use\n|g:timl#core.list|.\n\n *timl-vectors*\nVectors ~\nAn ordered, indexed collection intended for random access. Created literally\nby enclosing zero or more forms in brackets. Evaluates to a new vector of the\nevaluation of the contained elements.\n\n *timl-maps*\nMaps ~\nMaps are associative, unordered collections. The syntax literal is {...}.\nThe definining method of a map is |g:timl#core.dissoc|.\n\n *timl-sets*\nSets ~\nA set is an unordered collection of values, and can be thought of as a map\nwhere the keys and values are the same. The syntax literal is #{...}. The\ndefining method of a set is |g:timl#core.disj|.\n\nEVALUATION *timl-evaluation*\n\nIt's Lisp.\n\nSymbols evaluate to their value in lexical scope (from let or fn) or the\ncurrent namespace. Symbols evaluating to special forms are handled as\nexplained under |timl-special-forms|.\n\nLists evaluate to a function call. Dictionaries evaluate their\nvalues. Everything else evaluates to itself.\n\nSPECIAL FORMS *timl-special-forms*\n\n *timl-if*\n(if {cond} {then} {else}?) ~\nIf {cond} is true, evaluate {then}, else evaluate {else}.\n\n *timl-do*\n(do {form} ...) ~\nEvaluate a series of forms and return the result of the last one.\n\n *timl-let*\n(let [{symbol} {value} ...] {body} ...) ~\nBind the given symbols lexically for the scope of the given body.\n\n *timl-fn*\n(fn {name}? [{param} ...] {body} ...) ~\n#(... % %2 %3 ... %&) ~\nCreate an anonymous function.\n\n *timl-recur*\nIn tail position, re-calls the current function or |timl#core#loop| construct\nwith the given parameters. See Clojure's documentation at\nhttp://clojure.org/special_forms#recur .\n\n *timl-def*\n(def {var} {value}) ~\nDefine a variable or function.\n\n *timl-set!*\n(set! {var} {value}) ~\nSet a Vim variable, in a manner similar to |:let|. |g:var|, |b:var|, |w:var|,\n|t:var|, |v:var|, |expr-option|, and variables in the current namespace are\nsupported. >\n (set! b:did_ftplugin 1)\n (set! &shiftwidth 2)\n (set! *ns* (the-ns 'user))\n<\n *timl-quote*\n(quote {form}) ~\n'{form} ~\nReturn {form} unevaluated.\n\n *timl-function*\n(function {form}) ~\n#*{form} ~\nReturn a |Funcref| for a built-in or user defined Vim function. Can be called\nlike any other function.\n\n *timl-try* *timl-catch* *timl-finally*\n(try {body} ... (catch {pattern} {e} {body} ...) ... (finally {body} ...) ...) ~\nWrap a set of forms in a |:try| block. The {pattern} is a regexp to match\nthe string exception as explained under |:catch|, or can also be a Vim error\nnumber. You can access |v:exception| and |v:throwpoint| for information about\nthe exception, or look in dictionary {e}.\n\n *timl-throw*\n(throw {string}) ~\nPass the given {string} to |:throw|.\n\n *timl-execute*\n(execute {string}) ~\nRun the given string with |:execute|.\n\n *timl-.* *timl-dot*\n(. {dict} -{key}) ~\nRetrieve the given key of the given dict.\n\nNAMESPACES *timl-namespaces* *timl-ns*\n\nNamespaces take the Clojure model and adapt it to fit the VimL |autoload|\nfeature.\n>\n (ns foo.bar)\n (def baz 1)\n (in-ns 'user)\n foo.bar/baz ; evaluates to 1\n (alias 'quux 'foo.bar)\n quux/baz ; evaluates to 1\n (refer 'foo.bar)\n baz ; evaluates to 1\n<\nYou can also use the ns macro from Clojure.\n>\n (ns my.ns\n (:refer-timl :exclude [+])\n (:use timl.repl)\n (:require [timl.file :as file]))\n<\nTimL files placed in the |autoload| directory will automatically be loaded in\nthe correct namespace.\n\n vim:tw=78:et:ft=help:norl:\n"
},
{
"path": "doc/timl_core.txt",
"content": " *g:timl#core.array*\n(timl.core/array & elems) Create a |timl-array| containing elems.\n\n *g:timl#core.dict*\n(timl.core/dict map) Convert a map to a |timl-dictionary|.\n(timl.core/dict keyvals) Create a |timl-dictionary| from keyvals.\n(timl.core/dict & keyvals) Create a |timl-dictionary| from keyvals.\n\n vim:tw=78:sw=8:et:ft=help:norl:\n"
},
{
"path": "epl-v10.html",
"content": "\n\n\n\n\n\nEclipse Public License - Version 1.0\n\n\n\n\n\n\nEclipse Public License - v 1.0
\n\nTHE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE\nPUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR\nDISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS\nAGREEMENT.
\n\n1. DEFINITIONS
\n\n"Contribution" means:
\n\na) in the case of the initial Contributor, the initial\ncode and documentation distributed under this Agreement, and
\nb) in the case of each subsequent Contributor:
\ni) changes to the Program, and
\nii) additions to the Program;
\nwhere such changes and/or additions to the Program\noriginate from and are distributed by that particular Contributor. A\nContribution 'originates' from a Contributor if it was added to the\nProgram by such Contributor itself or anyone acting on such\nContributor's behalf. Contributions do not include additions to the\nProgram which: (i) are separate modules of software distributed in\nconjunction with the Program under their own license agreement, and (ii)\nare not derivative works of the Program.
\n\n"Contributor" means any person or entity that distributes\nthe Program.
\n\n"Licensed Patents" mean patent claims licensable by a\nContributor which are necessarily infringed by the use or sale of its\nContribution alone or when combined with the Program.
\n\n"Program" means the Contributions distributed in accordance\nwith this Agreement.
\n\n"Recipient" means anyone who receives the Program under\nthis Agreement, including all Contributors.
\n\n2. GRANT OF RIGHTS
\n\na) Subject to the terms of this Agreement, each\nContributor hereby grants Recipient a non-exclusive, worldwide,\nroyalty-free copyright license to reproduce, prepare derivative works\nof, publicly display, publicly perform, distribute and sublicense the\nContribution of such Contributor, if any, and such derivative works, in\nsource code and object code form.
\n\nb) Subject to the terms of this Agreement, each\nContributor hereby grants Recipient a non-exclusive, worldwide,\nroyalty-free patent license under Licensed Patents to make, use, sell,\noffer to sell, import and otherwise transfer the Contribution of such\nContributor, if any, in source code and object code form. This patent\nlicense shall apply to the combination of the Contribution and the\nProgram if, at the time the Contribution is added by the Contributor,\nsuch addition of the Contribution causes such combination to be covered\nby the Licensed Patents. The patent license shall not apply to any other\ncombinations which include the Contribution. No hardware per se is\nlicensed hereunder.
\n\nc) Recipient understands that although each Contributor\ngrants the licenses to its Contributions set forth herein, no assurances\nare provided by any Contributor that the Program does not infringe the\npatent or other intellectual property rights of any other entity. Each\nContributor disclaims any liability to Recipient for claims brought by\nany other entity based on infringement of intellectual property rights\nor otherwise. As a condition to exercising the rights and licenses\ngranted hereunder, each Recipient hereby assumes sole responsibility to\nsecure any other intellectual property rights needed, if any. For\nexample, if a third party patent license is required to allow Recipient\nto distribute the Program, it is Recipient's responsibility to acquire\nthat license before distributing the Program.
\n\nd) Each Contributor represents that to its knowledge it\nhas sufficient copyright rights in its Contribution, if any, to grant\nthe copyright license set forth in this Agreement.
\n\n3. REQUIREMENTS
\n\nA Contributor may choose to distribute the Program in object code\nform under its own license agreement, provided that:
\n\na) it complies with the terms and conditions of this\nAgreement; and
\n\nb) its license agreement:
\n\ni) effectively disclaims on behalf of all Contributors\nall warranties and conditions, express and implied, including warranties\nor conditions of title and non-infringement, and implied warranties or\nconditions of merchantability and fitness for a particular purpose;
\n\nii) effectively excludes on behalf of all Contributors\nall liability for damages, including direct, indirect, special,\nincidental and consequential damages, such as lost profits;
\n\niii) states that any provisions which differ from this\nAgreement are offered by that Contributor alone and not by any other\nparty; and
\n\niv) states that source code for the Program is available\nfrom such Contributor, and informs licensees how to obtain it in a\nreasonable manner on or through a medium customarily used for software\nexchange.
\n\nWhen the Program is made available in source code form:
\n\na) it must be made available under this Agreement; and
\n\nb) a copy of this Agreement must be included with each\ncopy of the Program.
\n\nContributors may not remove or alter any copyright notices contained\nwithin the Program.
\n\nEach Contributor must identify itself as the originator of its\nContribution, if any, in a manner that reasonably allows subsequent\nRecipients to identify the originator of the Contribution.
\n\n4. COMMERCIAL DISTRIBUTION
\n\nCommercial distributors of software may accept certain\nresponsibilities with respect to end users, business partners and the\nlike. While this license is intended to facilitate the commercial use of\nthe Program, the Contributor who includes the Program in a commercial\nproduct offering should do so in a manner which does not create\npotential liability for other Contributors. Therefore, if a Contributor\nincludes the Program in a commercial product offering, such Contributor\n("Commercial Contributor") hereby agrees to defend and\nindemnify every other Contributor ("Indemnified Contributor")\nagainst any losses, damages and costs (collectively "Losses")\narising from claims, lawsuits and other legal actions brought by a third\nparty against the Indemnified Contributor to the extent caused by the\nacts or omissions of such Commercial Contributor in connection with its\ndistribution of the Program in a commercial product offering. The\nobligations in this section do not apply to any claims or Losses\nrelating to any actual or alleged intellectual property infringement. In\norder to qualify, an Indemnified Contributor must: a) promptly notify\nthe Commercial Contributor in writing of such claim, and b) allow the\nCommercial Contributor to control, and cooperate with the Commercial\nContributor in, the defense and any related settlement negotiations. The\nIndemnified Contributor may participate in any such claim at its own\nexpense.
\n\nFor example, a Contributor might include the Program in a commercial\nproduct offering, Product X. That Contributor is then a Commercial\nContributor. If that Commercial Contributor then makes performance\nclaims, or offers warranties related to Product X, those performance\nclaims and warranties are such Commercial Contributor's responsibility\nalone. Under this section, the Commercial Contributor would have to\ndefend claims against the other Contributors related to those\nperformance claims and warranties, and if a court requires any other\nContributor to pay any damages as a result, the Commercial Contributor\nmust pay those damages.
\n\n5. NO WARRANTY
\n\nEXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS\nPROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS\nOF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION,\nANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY\nOR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely\nresponsible for determining the appropriateness of using and\ndistributing the Program and assumes all risks associated with its\nexercise of rights under this Agreement , including but not limited to\nthe risks and costs of program errors, compliance with applicable laws,\ndamage to or loss of data, programs or equipment, and unavailability or\ninterruption of operations.
\n\n6. DISCLAIMER OF LIABILITY
\n\nEXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT\nNOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT,\nINCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING\nWITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR\nDISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED\nHEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
\n\n7. GENERAL
\n\nIf any provision of this Agreement is invalid or unenforceable under\napplicable law, it shall not affect the validity or enforceability of\nthe remainder of the terms of this Agreement, and without further action\nby the parties hereto, such provision shall be reformed to the minimum\nextent necessary to make such provision valid and enforceable.
\n\nIf Recipient institutes patent litigation against any entity\n(including a cross-claim or counterclaim in a lawsuit) alleging that the\nProgram itself (excluding combinations of the Program with other\nsoftware or hardware) infringes such Recipient's patent(s), then such\nRecipient's rights granted under Section 2(b) shall terminate as of the\ndate such litigation is filed.
\n\nAll Recipient's rights under this Agreement shall terminate if it\nfails to comply with any of the material terms or conditions of this\nAgreement and does not cure such failure in a reasonable period of time\nafter becoming aware of such noncompliance. If all Recipient's rights\nunder this Agreement terminate, Recipient agrees to cease use and\ndistribution of the Program as soon as reasonably practicable. However,\nRecipient's obligations under this Agreement and any licenses granted by\nRecipient relating to the Program shall continue and survive.
\n\nEveryone is permitted to copy and distribute copies of this\nAgreement, but in order to avoid inconsistency the Agreement is\ncopyrighted and may only be modified in the following manner. The\nAgreement Steward reserves the right to publish new versions (including\nrevisions) of this Agreement from time to time. No one other than the\nAgreement Steward has the right to modify this Agreement. The Eclipse\nFoundation is the initial Agreement Steward. The Eclipse Foundation may\nassign the responsibility to serve as the Agreement Steward to a\nsuitable separate entity. Each new version of the Agreement will be\ngiven a distinguishing version number. The Program (including\nContributions) may always be distributed subject to the version of the\nAgreement under which it was received. In addition, after a new version\nof the Agreement is published, Contributor may elect to distribute the\nProgram (including its Contributions) under the new version. Except as\nexpressly stated in Sections 2(a) and 2(b) above, Recipient receives no\nrights or licenses to the intellectual property of any Contributor under\nthis Agreement, whether expressly, by implication, estoppel or\notherwise. All rights in the Program not expressly granted under this\nAgreement are reserved.
\n\nThis Agreement is governed by the laws of the State of New York and\nthe intellectual property laws of the United States of America. No party\nto this Agreement will bring a legal action under this Agreement more\nthan one year after the cause of action arose. Each party waives its\nrights to a jury trial in any resulting litigation.
\n\n\n\n\n"
},
{
"path": "ftplugin/timl.tim",
"content": "(ns ftplugin.timl)\n(use 'timl.ftplugin)\n(include-guard)\n\n(setlocal comments=\":; ,:;;; ,:;; \" commentstring=\"; %s\")\n(setlocal define=\"^\\\\s*(def\\\\k*\")\n(setlocal formatoptions+=cql)\n(setlocal omnifunc=timl#interactive#omnicomplete)\n\n(execute \"nnoremap cp :set opfunc=timl#interactive#eval_opfuncg@\")\n(execute \"nnoremap cpp :call timl#interactive#eval_opfunc(v:count)\")\n(execute \"nnoremap K :execute 'help' ftplugin#timl#cursor_keyword()\")\n(defn cursor-keyword []\n (let [kw (#*expand \"\")\n ns (the-ns (symbol (#*timl#interactive#ns_for_cursor)))]\n (cond\n (re-find \"^#\\\\*\" kw) (str (subs kw 2) \"()\")\n (re-find \"^&\" kw) (str \"'\" (subs kw 1) \"'\")\n (special-symbol? (symbol kw)) (str \"timl-\" kw)\n (ns-resolve ns (symbol kw)) (. (ns-resolve ns (symbol kw)) munged)\n :else kw)))\n"
},
{
"path": "indent/timl.tim",
"content": "(ns indent.timl)\n(execute \"runtime! indent/clojure.vim\")\n"
},
{
"path": "plugin/timl.vim",
"content": "\" timl.vim - TimL\n\" Maintainer: Tim Pope \n\nif exists(\"g:loaded_timl\") || v:version < 700 || &cp\n finish\nendif\nlet g:loaded_timl = 1\n\nif &maxfuncdepth == 100\n set maxfuncdepth=200\nendif\n\naugroup timl\n autocmd!\n autocmd BufNewFile,BufReadPost *.tim set filetype=timl\n autocmd BufNewFile,BufReadPost *\n \\ if getline(1) =~# '^#!' && getline(2) =~# ';.*\\'))\n autocmd SourceCmd *.tim call timl#loader#source(expand(\"\"))\n autocmd FuncUndefined *#* call s:autoload(expand(''))\n autocmd VimEnter * nested\n \\ if exists('s:source') |\n \\ redraw! |\n \\ execute 'TLsource '.s:source |\n \\ unlet! s:source |\n \\ endif\naugroup END\n\ncommand! -bar -nargs=? TLrepl :execute timl#interactive#repl()\ncommand! -bar TLscratch :execute timl#interactive#scratch()\ncommand! -nargs=1 -complete=expression TLinspect :echo timl#printer#string()\ncommand! -nargs=1 -complete=customlist,timl#interactive#input_complete TLeval\n \\ try |\n \\ echo timl#rep() |\n \\ catch |\n \\ unlet! g:timl#core._STAR_e |\n \\ let g:timl#core._STAR_e = timl#exception#build(v:exception, v:throwpoint) |\n \\ echoerr v:exception |\n \\ endtry\ncommand! -bar TLcopen :call timl#interactive#copen(get(g:, 'timl#core#_STAR_e', []))\ncommand! -bang -nargs=? -complete=file TLsource\n \\ if has('vim_starting') |\n \\ let s:source = |\n \\ else |\n \\ call timl#loader#source(expand(empty() ? '%' : )) |\n \\ endif\n\nfunction! s:load_filetype(ft) abort\n if empty(a:ft)\n return ''\n endif\n let ft = split(a:ft)[0]\n for kind in ['ftplugin', 'indent']\n for file in findfile(kind.'/'.ft.'.tim', &rtp, -1)\n try\n call timl#loader#source(file)\n catch\n unlet! g:timl#core._STAR_e\n let g:timl#core._STAR_e = timl#exception#build(v:exception, v:throwpoint) |\n echohl WarningMSG\n echomsg v:exception\n echohl NONE\n endtry\n endfor\n endfor\nendfunction\n\nif !exists('g:timl_requires')\n let g:timl_requires = {}\nendif\n\nfunction! s:file4ns(ns) abort\n if !exists('s:tempdir')\n let s:tempdir = tempname()\n endif\n let file = s:tempdir . '/' . a:ns . '.vim'\n if !isdirectory(fnamemodify(file, ':h'))\n call mkdir(fnamemodify(file, ':h'), 'p')\n endif\n return file\nendfunction\n\nfunction! s:autoload(function) abort\n let var = matchstr(a:function, '.*\\ze#')\n let ns = tr(var, '#_', '.-')\n let base = tr(ns, '.-', '/_')\n\n if !has_key(g:timl_requires, ns)\n if !empty(findfile('autoload/'.base.'.vim'))\n let g:timl_requires[ns] = 1\n else\n for file in findfile('autoload/'.base.'.tim', &rtp, -1)\n call timl#loader#source(file)\n let g:timl_requires[ns] = 1\n break\n endfor\n endif\n endif\n\n let key = matchstr(a:function, '.*#\\zs.*')\n if has_key(g:, var) && has_key(g:{var}, key) && timl#type#canp(g:{var}[key], g:timl#core.call)\n let body = [\"function \".a:function.\"(...)\",\n \\ \" return timl#call(g:\".var.\".\".key.\", a:000)\",\n \\ \"endfunction\"]\n let file = s:file4ns(base)\n call writefile(body, file)\n exe 'source '.file\n endif\nendfunction\n"
},
{
"path": "syntax/timl.vim",
"content": "\" Vim syntax file\n\" Language: TimL\n\" Maintainer: Tim Pope \n\" Filenames: *.timl\n\nif exists(\"b:current_syntax\")\n finish\nendif\n\nsyntax sync minlines=100\n\nif !exists('s:functions')\n let s:file = readfile(findfile('syntax/vim.vim', &rtp))\n let s:options = split(join(map(filter(copy(s:file), 'v:val =~# \"^syn keyword vimOption contained\\t[^in]\"'), 'substitute(v:val, \"^.*\\t\", \"\", \"g\")'), ' '), '\\s\\+')\n let s:functions = split(join(map(filter(copy(s:file), 'v:val =~# \"^syn keyword vimFuncName contained\\t[^in]\"'), 'substitute(v:val, \"^.*\\t\", \"\", \"g\")'), ' '), ' ')\nendif\n\nsetl iskeyword+=?,!,#,$,%,&,*,+,.,/,<,>,:,=,45\nlet b:syntax_ns_str = timl#interactive#ns_for_cursor(0)\nlet b:syntax_vars = keys(timl#namespace#map(timl#namespace#find(b:syntax_ns_str)))\n\nlet b:current_syntax = \"timl\"\n\nfunction! s:syn_keyword(group, keywords) abort\n if !empty(a:keywords)\n exe 'syntax keyword '.a:group.' '.join(a:keywords, ' ')\n endif\nendfunction\ncall s:syn_keyword('timlSymbol', b:syntax_vars)\ncall s:syn_keyword('timlDefine', filter(copy(b:syntax_vars), 'v:val =~# \"^def\\\\%(ault\\\\)\\\\@!\"'))\nsyntax keyword timlSpecialParam & &form &env\n\nsyntax keyword timlConditional if\nsyntax keyword timlDefine def deftype* set! declare\nsyntax keyword timlRepeat loop recur\nsyntax keyword timlStatement do let fn . execute\nsyntax keyword timlSpecial let* fn* var function\nsyntax keyword timlException try catch finally throw\n\nsyntax keyword timlConstant nil\nsyntax keyword timlBoolean false true\nsyntax match timlKeyword \":\\k\\+\"\nsyntax match timlCharacter \"\\\\\\%(space\\|tab\\|newline\\|return\\|formfeed\\|backspace\\|.\\)\"\nsyntax match timlNumber \"\\<[-+]\\=0\\o\\+\\>\"\nsyntax match timlNumber \"\\<[-+]\\=0x\\x\\+\\>\"\nsyntax match timlNumber \"\\<[-+]\\=\\%([1-9]\\d*\\|0\\)\\%(\\.\\d\\+\\)\\=\\%([Ee]\\d\\+\\)\\=\\>\"\nsyntax keyword timlNumber Infinity -Infinity +Infinity NaN\nsyntax region timlString start=/\"/ skip=/\\\\\\\\\\|\\\\\"/ end=/\"/ contains=timlStringEscape,@Spell\nsyntax match timlStringEscape \"\\v\\\\%([uU]\\x{4}|[0-3]\\o{2}|\\o\\{1,2}|[xX]\\x{1,2}|[befnrt\\\\\"]|\\<[[:alnum:]-]+\\>)\" contained\nsyntax region timlRegexp start=/#\"/ skip=/\\\\\\\\\\|\\\\\"/ end=/\"/ contains=timlRegexpSpecial\n\nsyntax match timlFuncref \"\\<#\\*\" nextgroup=timlVimFunction\nsyntax match timlVarref \"\\<#'\" nextgroup=timlSymbol\nsyntax match timlQuote \"'\"\nsyntax match timlSyntaxQuote \"`\"\nsyntax match timlUnquote \"\\~@\\=\"\nsyntax match timlDeref \"@\"\nsyntax match timlMeta \"\\^\"\n\nsyntax region timlList matchgroup=timlGroup start=\"(\" end=\")\" contains=TOP,@Spell\nsyntax region timlVector matchgroup=timlGroup start=\"\\[\" end=\"]\" contains=TOP,@Spell\nsyntax region timlMap matchgroup=timlGroup start=\"{\" end=\"}\" contains=TOP,@Spell\nsyntax region timlSet matchgroup=timlGroup start=\"#{\" end=\"}\" contains=TOP,@Spell\nsyntax region timlFn matchgroup=timlGroup start=\"#(\" end=\")\" contains=TOP,@Spell\nsyntax match timlSymbol '\\<%[1-9]\\d*\\>'\nsyntax match timlSymbol '\\<%&\\=\\>'\n\nsyntax match timlComment \"\\<#_\"\nsyntax match timlComment \";.*$\"\nsyntax match timlComment \";= \"\nsyntax match timlComment \";! \" nextgroup=timlError\nsyntax match timlError \".*$\" contained\nsyntax match timlComment \"#!.*$\"\nsyntax match timlComment \";;.*$\" contains=@Spell\n\ncall s:syn_keyword('timlVimOption', map(copy(s:options), \"'&'.v:val\"))\ncall s:syn_keyword('timlVimOption', map(copy(s:options), \"'&l:'.v:val\"))\ncall s:syn_keyword('timlVimOption', map(copy(s:options), \"'&g:'.v:val\"))\nexe 'syn match timlVimFunction contained \"\\%('.join(s:functions, '\\|').'\\)\\>\"'\nsyntax match timlVar '\\<[glabwtv]:\\k\\+\\>'\n\nhi def link timlDefine Define\nhi def link timlSymbol Identifier\nhi def link timlSpecialParam Special\nhi def link timlConditional Conditional\nhi def link timlRepeat Repeat\nhi def link timlStatement Statement\nhi def link timlException Exception\nhi def link timlBoolean Boolean\nhi def link timlConstant Constant\nhi def link timlKeyword Constant\nhi def link timlCharacter Character\nhi def link timlString String\nhi def link timlRegexp String\nhi def link timlStringEscape Special\nhi def link timlRegexpSpecial Special\nhi def link timlNumber Number\nhi def link timlSpecial Special\nhi def link timlFuncref Special\nhi def link timlVarref Special\nhi def link timlQuote Special\nhi def link timlSyntaxQuote Special\nhi def link timlUnquote Special\nhi def link timlDeref Special\nhi def link timlMeta Special\nhi def link timlGroup Special\nhi def link timlComment Comment\nhi def link timlError WarningMsg\n\nhi def link timlVimFunction Function\nhi def link timlVimOption Type\n\n\" vim:set et sw=2:\n"
},
{
"path": "test/timl/core_coll_test.tim",
"content": "(ns timl.core-coll-test)\n(use 'timl.test)\n\n(assert (= 3 (count (list 1 2 3))))\n(assert (= 1 (count (dict \"a\" \"b\"))))\n\n(assert (= (list) (empty (list 1 2 3))))\n(assert (= (dict) (empty (dict \"a\" \"b\"))))\n(assert (= \"\" (empty \"string\")))\n(assert (nil? (empty 'symbol)))\n(assert (nil? (empty 0)))\n\n(assert (= (list 2 3 4) (map (partial + 1) (list 1 2 3))))\n(assert (= (list \"a\") (map first (dict \"a\" \"b\"))))\n\n(assert (= 6 (reduce + (list 1 2 3))))\n"
},
{
"path": "test/timl/core_test.tim",
"content": "(ns timl.core-test)\n(use 'timl.test)\n\n(let [sentinel (dict)]\n (assert (identical? sentinel ((constantly sentinel)))))\n\n(assert (= \"42\\n\" (with-out-str (println 42))))\n"
},
{
"path": "test/timl/number_test.tim",
"content": "(ns timl.number-test)\n(use 'timl.test)\n\n(assert (number? 3))\n(assert (number? 3.0))\n(assert (not (number? \"\")))\n(assert (integer? 3))\n(assert (not (integer? 3.0)))\n(assert (not (integer? \"\")))\n(assert (not (float? 3)))\n(assert (float? 3.0))\n(assert (not (integer? \"\")))\n\n(assert (= 0 (+)))\n(assert (= 1 (+ 1)))\n(assert (= 3 (+ 1 2)))\n(assert (= 6 (+ 1 2 3)))\n(assert (= 4 (inc 3)))\n\n(assert (= -1 (- 1)))\n(assert (= 0 (- 3 1 2)))\n(assert (= 2 (dec 3)))\n\n(assert (= 1 (*)))\n(assert (= 6 (* 1 2 3)))\n\n(assert (= 0 (/ 2)))\n(assert (= 0.5 (/ 2.0)))\n(assert (= 0.5 (/ 1 2.0)))\n(assert (= 0.25 (/ 1 2.0 2.0)))\n\n(assert (= 1 (rem 4 3)))\n(assert (= -1 (rem -4 3)))\n(assert (= 1 (mod 4 3)))\n(assert (= 2 (mod -4 3)))\n(assert (= 0 (mod 0 3)))\n(assert (= -2 (mod 4 -3)))\n(assert (= 1.0 (quot 3.0 2)))\n\n(assert (= 7 (max 3 7 2 4)))\n(assert (= 2 (min 3 7 2 4)))\n\n(assert (= -1 (bit-not 0)))\n(assert (= 5 (bit-xor 7 3 1)))\n(assert (= 4 (bit-and 7 6 5)))\n(assert (= 7 (bit-or 1 2 4)))\n(assert (= 6 (bit-and-not 7 1 8)))\n(assert (= 8 (bit-shift-left 1 3)))\n(assert (= 1 (bit-shift-right 8 3)))\n(assert (= 3 (bit-flip 1 1)))\n(assert (= 3 (bit-set 1 1)))\n(assert (= 1 (bit-clear 3 1)))\n(assert (bit-test 3 1))\n(assert (not (bit-test 5 1)))\n\n(assert (= nil (not-negative -1)))\n(assert (= 0 (not-negative 0)))\n(assert (zero? 0))\n(assert (not (zero? 1)))\n(assert (nonzero? 1))\n(assert (not (nonzero? 0)))\n(assert (even? 2))\n(assert (not (even? 3)))\n(assert (odd? 3))\n(assert (not (odd? 2)))\n\n(assert (> 3 2 1))\n(assert (not (> 3 2 2)))\n(assert (< 1 2 3))\n(assert (not (< 1 2 2)))\n(assert (>= 3 2 2))\n(assert (not (>= 3 1 2)))\n(assert (<= 1 2 2))\n(assert (not (< 1 3 2)))\n(assert (== 0 0.0 0))\n(assert (not (== 0 0.0 1)))\n\n(defn fact [x]\n (loop [n x\n f 1]\n (if (<= n 1) f (recur (dec n) (* f n)))))\n\n(defn fib [n]\n (first\n (loop [xs [1 0]]\n (if (< (count xs) n)\n (recur (cons (+ (first xs) (second xs)) xs))\n xs))))\n\n(assert (= 120 (fact 5)))\n"
}
]