Cutlery/calibre
1
0
Fork 0
mirror of https://github.com/kovidgoyal/calibre.git synced 2025-07-09 03:04:10 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update RapydScript

Browse Source
This commit is contained in:
Kovid Goyal 2015-08-27 17:19:27 +05:30
parent 4abda0ad43
commit 77c7a231d6
2 changed files with 22 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
resources/rapydscript/compiler.js.xz
View File

Binary file not shown.

44
resources/rapydscript/lib/re.pyj
View File

@ -32,7 +32,7 @@ supports_unicode = RegExp.prototype.unicode is not undefined
_RE_ESCAPE = /[-\/\\^$*+?.()|[\]{}]/g _RE_ESCAPE = /[-\/\\^$*+?.()|[\]{}]/g
_re_cache_map = {} _re_cache_map = {}
_re_cache_items = JS('[]') _re_cache_items = v'[]'
error = SyntaxError # This is the error JS throws for invalid regexps error = SyntaxError # This is the error JS throws for invalid regexps
@ -41,7 +41,7 @@ def _expand(groups, repl, group_name_map):
def next(): def next():
nonlocal i nonlocal i
return JS('repl[i++]') return v'repl[i++]'
def peek(): def peek():
return repl[i] return repl[i]
@ -139,7 +139,7 @@ def transform_regex(source, flags):
group_count = 0 group_count = 0
while pos < source.length: while pos < source.length:
ch = JS('source[pos++]') ch = v'source[pos++]'
if previous_backslash: if previous_backslash:
ans += '\\' + ch ans += '\\' + ch
previous_backslash = False previous_backslash = False
@ -175,7 +175,7 @@ def transform_regex(source, flags):
if close == -1: if close == -1:
raise SyntaxError('Expecting a closing )') raise SyntaxError('Expecting a closing )')
flgs = source[pos+1:close] flgs = source[pos+1:close]
for JS('var i = 0; i < flgs.length; i++'): for v'var i = 0; i < flgs.length; i++':
q = flgs[i] # noqa:undef q = flgs[i] # noqa:undef
if not flag_map.hasOwnProperty(q): if not flag_map.hasOwnProperty(q):
raise SyntaxError('Invalid flag: ' + q) raise SyntaxError('Invalid flag: ' + q)
@ -195,8 +195,8 @@ def transform_regex(source, flags):
raise SyntaxError('Named group not closed, expecting >') raise SyntaxError('Named group not closed, expecting >')
name = source[pos+1:close] name = source[pos+1:close]
if not Object.prototype.hasOwnProperty.call(group_map, name): if not Object.prototype.hasOwnProperty.call(group_map, name):
group_map[name] = JS('[]') group_map[name] = v'[]'
group_map[name].push(JS('++group_count')) group_map[name].push(v'++group_count')
pos = close + 1 pos = close + 1
elif q == '=': elif q == '=':
close = source.indexOf(')', pos) close = source.indexOf(')', pos)
@ -235,14 +235,14 @@ class MatchObject:
def _compute_extents(self): def _compute_extents(self):
# compute start/end for each group # compute start/end for each group
match = self._groups match = self._groups
self._start = JS('Array(match.length)') self._start = v'Array(match.length)'
self._end = JS('Array(match.length)') self._end = v'Array(match.length)'
self._start[0] = self._start_pos self._start[0] = self._start_pos
self._end[0] = self._start_pos + match[0].length self._end[0] = self._start_pos + match[0].length
offset = self._start_pos offset = self._start_pos
extent = match[0] extent = match[0]
loc = 0 loc = 0
for JS('var i = 1; i < match.length; i++'): for v'var i = 1; i < match.length; i++':
g = match[i] g = match[i]
loc = extent.indexOf(g, loc) loc = extent.indexOf(g, loc)
if loc == -1: if loc == -1:
@ -254,8 +254,8 @@ class MatchObject:
self._end[i] = offset + loc # noqa:undef self._end[i] = offset + loc # noqa:undef
def groups(self, defval=None): def groups(self, defval=None):
ans = JS('[]') ans = v'[]'
for JS('var i = 1; i < self._groups.length; i++'): for v'var i = 1; i < self._groups.length; i++':
val = self._groups[i] # noqa:undef val = self._groups[i] # noqa:undef
if val is undefined: if val is undefined:
val = defval val = defval
@ -283,8 +283,8 @@ class MatchObject:
def group(self): def group(self):
if arguments.length == 0: if arguments.length == 0:
return self._groups[0] return self._groups[0]
ans = JS('[]') ans = v'[]'
for JS('var i = 0; i < arguments.length; i++'): for v'var i = 0; i < arguments.length; i++':
q = arguments[i] # noqa:undef q = arguments[i] # noqa:undef
ans.push(self._group_val(q, None)) ans.push(self._group_val(q, None))
return ans[0] if ans.length == 1 else ans return ans[0] if ans.length == 1 else ans
@ -315,7 +315,7 @@ class MatchObject:
gnm = self.re.group_name_map gnm = self.re.group_name_map
names = Object.keys(gnm) names = Object.keys(gnm)
ans = {} ans = {}
for JS("var i = 0; i < names.length; i++"): for v"var i = 0; i < names.length; i++":
name = names[i] # noqa:undef name = names[i] # noqa:undef
if Object.prototype.hasOwnProperty.call(gnm, name): if Object.prototype.hasOwnProperty.call(gnm, name):
val = self._groups[gnm[name][-1]] val = self._groups[gnm[name][-1]]
@ -329,7 +329,7 @@ class MatchObject:
if not Object.prototype.hasOwnProperty.call(self.re.group_name_map, group_name): if not Object.prototype.hasOwnProperty.call(self.re.group_name_map, group_name):
return ans return ans
groups = self.re.group_name_map[group_name] groups = self.re.group_name_map[group_name]
for JS('var i = 0; i < groups.length; i++'): for v'var i = 0; i < groups.length; i++':
val = self._groups[groups[i]] # noqa:undef val = self._groups[groups[i]] # noqa:undef
if val is not undefined: if val is not undefined:
ans.push(val) ans.push(val)
@ -339,7 +339,7 @@ class MatchObject:
gnm = self.re.group_name_map gnm = self.re.group_name_map
names = Object.keys(gnm) names = Object.keys(gnm)
ans = {} ans = {}
for JS("var i = 0; i < names.length; i++"): for v'var i = 0; i < names.length; i++':
name = names[i] # noqa:undef name = names[i] # noqa:undef
ans[name] = self.captures(name) ans[name] = self.captures(name)
return ans return ans
@ -381,7 +381,7 @@ class RegexObject:
def findall(self, string): def findall(self, string):
self._pattern.lastIndex = 0 self._pattern.lastIndex = 0
return _$rapyd$_list_decorate(string.match(self._pattern) or JS('[]')) return _$rapyd$_list_decorate(string.match(self._pattern) or v'[]')
def finditer(self, string): def finditer(self, string):
pat = RegExp(this._pattern.source, this._modifiers) # We have to do this since lastIndex is mutable pat = RegExp(this._pattern.source, this._modifiers) # We have to do this since lastIndex is mutable
@ -403,7 +403,7 @@ class RegexObject:
expand = def(m, repl, gnm): return '' + repl(MatchObject(self, m, 0, None)) expand = def(m, repl, gnm): return '' + repl(MatchObject(self, m, 0, None))
this._pattern.lastIndex = 0 this._pattern.lastIndex = 0
num = 0 num = 0
matches = JS('[]') matches = v'[]'
while count < 1 or num < count: while count < 1 or num < count:
m = this._pattern.exec(string) m = this._pattern.exec(string)
@ -412,7 +412,7 @@ class RegexObject:
matches.push(m) matches.push(m)
num += 1 num += 1
for JS('var i = matches.length - 1; i > -1; i--'): for v'var i = matches.length - 1; i > -1; i--':
m = matches[i] # noqa:undef m = matches[i] # noqa:undef
start = m.index start = m.index
end = start + m[0].length end = start + m[0].length
@ -425,11 +425,11 @@ class RegexObject:
def _get_from_cache(pattern, flags): def _get_from_cache(pattern, flags):
if isinstance(pattern, RegExp): if isinstance(pattern, RegExp):
pattern = pattern.source pattern = pattern.source
key = JSON.stringify(JS('[pattern, flags]')) key = JSON.stringify(v'[pattern, flags]')
if Object.prototype.hasOwnProperty.call(_re_cache_map, key): if Object.prototype.hasOwnProperty.call(_re_cache_map, key):
return _re_cache_map[key] return _re_cache_map[key]
if _re_cache_items.length >= 100: if _re_cache_items.length >= 100:
JS('delete _re_cache_map[_re_cache_items.shift()]') v'delete _re_cache_map[_re_cache_items.shift()]'
ans = RegexObject(pattern, flags) ans = RegexObject(pattern, flags)
_re_cache_map[key] = ans _re_cache_map[key] = ans
_re_cache_items.push(key) _re_cache_items.push(key)
@ -465,4 +465,4 @@ def escape(string):
def purge(): def purge():
nonlocal _re_cache_map, _re_cache_items nonlocal _re_cache_map, _re_cache_items
_re_cache_map = {} _re_cache_map = {}
_re_cache_items = JS('[]') _re_cache_items = v'[]'