mirror of
https://github.com/nim-lang/Nim.git
synced 2026-04-26 09:14:00 +00:00
added operateOn to sugar.nim to give Nim the chaining mechanism it de… (#13092)
* implemented the with stdlib module as specified in https://github.com/nim-lang/RFCs/issues/193 * change sugar.outplace to sugar.dup according to https://github.com/nim-lang/RFCs/issues/193 * changelog update
This commit is contained in:
38
lib/std/private/underscored_calls.nim
Normal file
38
lib/std/private/underscored_calls.nim
Normal file
@@ -0,0 +1,38 @@
|
||||
|
||||
#
|
||||
#
|
||||
# Nim's Runtime Library
|
||||
# (c) Copyright 2020 Andreas Rumpf
|
||||
#
|
||||
# See the file "copying.txt", included in this
|
||||
# distribution, for details about the copyright.
|
||||
#
|
||||
|
||||
## This is an internal helper module. Do not use.
|
||||
|
||||
import macros
|
||||
|
||||
proc underscoredCall*(n, arg0: NimNode): NimNode =
|
||||
proc underscorePos(n: NimNode): int =
|
||||
for i in 1 ..< n.len:
|
||||
if n[i].eqIdent("_"): return i
|
||||
return -1
|
||||
|
||||
if n.kind in nnkCallKinds:
|
||||
result = copyNimNode(n)
|
||||
result.add n[0]
|
||||
|
||||
let u = underscorePos(n)
|
||||
if u < 0:
|
||||
result.add arg0
|
||||
for i in 1..n.len-1: result.add n[i]
|
||||
else:
|
||||
for i in 1..u-1: result.add n[i]
|
||||
result.add arg0
|
||||
for i in u+1..n.len-1: result.add n[i]
|
||||
else:
|
||||
# handle e.g. 'x.dup(sort)'
|
||||
result = newNimNode(nnkCall, n)
|
||||
result.add n
|
||||
result.add arg0
|
||||
|
||||
Reference in New Issue
Block a user