More descriptive names of test files (#9531)
* change generic `tissues` name to more specific * change `tvarious` to more specific names
This commit is contained in:
parent
8d9866a6d4
commit
1b17c9f693
20 changed files with 8 additions and 7 deletions
467
tests/concepts/tconcepts_issues.nim
Normal file
467
tests/concepts/tconcepts_issues.nim
Normal file
|
|
@ -0,0 +1,467 @@
|
|||
discard """
|
||||
file: "tissues.nim"
|
||||
output: '''
|
||||
20.0 USD
|
||||
Printable
|
||||
true
|
||||
true
|
||||
true
|
||||
true
|
||||
true
|
||||
f
|
||||
0
|
||||
10
|
||||
10
|
||||
5
|
||||
()
|
||||
false
|
||||
10
|
||||
true
|
||||
true
|
||||
true
|
||||
true
|
||||
p has been called.
|
||||
p has been called.
|
||||
implicit generic
|
||||
generic
|
||||
false
|
||||
true
|
||||
-1
|
||||
Meow
|
||||
'''
|
||||
"""
|
||||
|
||||
import macros, typetraits, os, posix
|
||||
|
||||
|
||||
block t5983:
|
||||
const currencies = ["USD", "EUR"] # in real code 120 currencies
|
||||
|
||||
type USD = distinct float # in real code 120 types generates using macro
|
||||
type EUR = distinct float
|
||||
|
||||
type CurrencyAmount = concept c
|
||||
type t = c.type
|
||||
const name = c.type.name
|
||||
name in currencies
|
||||
|
||||
proc `$`(x: CurrencyAmount): string =
|
||||
$float(x) & " " & x.name
|
||||
|
||||
let amount = 20.USD
|
||||
echo amount
|
||||
|
||||
|
||||
block t3414:
|
||||
type
|
||||
View[T] = concept v
|
||||
v.empty is bool
|
||||
v.front is T
|
||||
popFront v
|
||||
|
||||
proc find(view: View; target: View.T): View =
|
||||
result = view
|
||||
|
||||
while not result.empty:
|
||||
if view.front == target:
|
||||
return
|
||||
|
||||
mixin popFront
|
||||
popFront result
|
||||
|
||||
proc popFront[T](s: var seq[T]) = discard
|
||||
proc empty[T](s: seq[T]): bool = false
|
||||
|
||||
var s1 = @[1, 2, 3]
|
||||
let s2 = s1.find(10)
|
||||
|
||||
|
||||
|
||||
type
|
||||
Obj1[T] = object
|
||||
v: T
|
||||
converter toObj1[T](t: T): Obj1[T] =
|
||||
return Obj1[T](v: t)
|
||||
block t976:
|
||||
type
|
||||
int1 = distinct int
|
||||
int2 = distinct int
|
||||
int1g = concept x
|
||||
x is int1
|
||||
int2g = concept x
|
||||
x is int2
|
||||
|
||||
proc take[T: int1g](value: int1) =
|
||||
when T is int2:
|
||||
static: error("killed in take(int1)")
|
||||
|
||||
proc take[T: int2g](vale: int2) =
|
||||
when T is int1:
|
||||
static: error("killed in take(int2)")
|
||||
|
||||
var i1: int1 = 1.int1
|
||||
var i2: int2 = 2.int2
|
||||
|
||||
take[int1](i1)
|
||||
take[int2](i2)
|
||||
|
||||
template reject(e) =
|
||||
static: assert(not compiles(e))
|
||||
|
||||
reject take[string](i2)
|
||||
reject take[int1](i2)
|
||||
|
||||
# bug #6249
|
||||
type
|
||||
Obj2 = ref object
|
||||
PrintAble = concept x
|
||||
$x is string
|
||||
|
||||
proc `$`[T](nt: Obj1[T]): string =
|
||||
when T is PrintAble: result = "Printable"
|
||||
else: result = "Non Printable"
|
||||
|
||||
echo Obj2()
|
||||
|
||||
|
||||
|
||||
block t1128:
|
||||
type
|
||||
TFooContainer[T] = object
|
||||
|
||||
TContainer[T] = concept var c
|
||||
foo(c, T)
|
||||
|
||||
proc foo[T](c: var TFooContainer[T], val: T) =
|
||||
discard
|
||||
|
||||
proc bar(c: var TContainer) =
|
||||
discard
|
||||
|
||||
var fooContainer: TFooContainer[int]
|
||||
echo fooContainer is TFooContainer # true.
|
||||
echo fooContainer is TFooContainer[int] # true.
|
||||
fooContainer.bar()
|
||||
|
||||
|
||||
|
||||
block t5642:
|
||||
type DataTable = concept x
|
||||
x is object
|
||||
for f in fields(x):
|
||||
f is seq
|
||||
|
||||
type Students = object
|
||||
id : seq[int]
|
||||
name : seq[string]
|
||||
age: seq[int]
|
||||
|
||||
proc nrow(dt: DataTable) : Natural =
|
||||
var totalLen = 0
|
||||
for f in fields(dt):
|
||||
totalLen += f.len
|
||||
return totalLen
|
||||
|
||||
let
|
||||
stud = Students(id: @[1,2,3], name: @["Vas", "Pas", "NafNaf"], age: @[10,16,32])
|
||||
|
||||
doAssert nrow(stud) == 9
|
||||
|
||||
|
||||
|
||||
import t5888lib/ca, t5888lib/opt
|
||||
block t5888:
|
||||
type LocalCA = ca.CA
|
||||
|
||||
proc f(c: CA) =
|
||||
echo "f"
|
||||
echo c.x
|
||||
|
||||
var o = new(Opt)
|
||||
|
||||
echo o is CA
|
||||
echo o is LocalCA
|
||||
echo o is ca.CA
|
||||
|
||||
o.f()
|
||||
|
||||
|
||||
|
||||
import json
|
||||
block t5968:
|
||||
type
|
||||
Enumerable[T] = concept e
|
||||
for it in e:
|
||||
it is T
|
||||
|
||||
proc cmap[T, G](e: Enumerable[T], fn: proc(t: T): G): seq[G] =
|
||||
result = @[]
|
||||
for it in e: result.add(fn(it))
|
||||
|
||||
var x = %["hello", "world"]
|
||||
|
||||
var z = x.cmap(proc(it: JsonNode): string = it.getStr & "!")
|
||||
assert z == @["hello!", "world!"]
|
||||
|
||||
|
||||
|
||||
import sugar
|
||||
block t6462:
|
||||
type
|
||||
FilterMixin[T] = ref object
|
||||
test: (T) -> bool
|
||||
trans: (T) -> T
|
||||
|
||||
SeqGen[T] = ref object
|
||||
fil: FilterMixin[T]
|
||||
|
||||
WithFilter[T] = concept a
|
||||
a.fil is FilterMixin[T]
|
||||
|
||||
proc test[T](a: WithFilter[T]): (T) -> bool =
|
||||
a.fil.test
|
||||
|
||||
var s = SeqGen[int](fil: FilterMixin[int](test: nil, trans: nil))
|
||||
doAssert s.test() == nil
|
||||
|
||||
|
||||
|
||||
block t6770:
|
||||
type GA = concept c
|
||||
c.a is int
|
||||
|
||||
type A = object
|
||||
a: int
|
||||
|
||||
type AA = object
|
||||
case exists: bool
|
||||
of true:
|
||||
a: int
|
||||
else:
|
||||
discard
|
||||
|
||||
proc print(inp: GA) =
|
||||
echo inp.a
|
||||
|
||||
let failing = AA(exists: true, a: 10)
|
||||
let working = A(a:10)
|
||||
print(working)
|
||||
print(failing)
|
||||
|
||||
|
||||
|
||||
block t7952:
|
||||
type
|
||||
HasLen = concept iter
|
||||
len(iter) is int
|
||||
|
||||
proc echoLen(x: HasLen) =
|
||||
echo len(x)
|
||||
|
||||
echoLen([1, 2, 3, 4, 5])
|
||||
|
||||
|
||||
|
||||
block t8280:
|
||||
type
|
||||
Iterable[T] = concept x
|
||||
for elem in x:
|
||||
elem is T
|
||||
|
||||
proc max[A](iter: Iterable[A]): A =
|
||||
discard
|
||||
|
||||
type
|
||||
MyType = object
|
||||
|
||||
echo max(@[MyType()])
|
||||
|
||||
|
||||
|
||||
import math
|
||||
block t3452:
|
||||
type
|
||||
Node = concept n
|
||||
`==`(n, n) is bool
|
||||
Graph1 = concept g
|
||||
type N = Node
|
||||
distance(g, N, N) is float
|
||||
Graph2 = concept g
|
||||
distance(g, Node, Node) is float
|
||||
Graph3 = concept g
|
||||
var x: Node
|
||||
distance(g, x, x) is float
|
||||
XY = tuple[x, y: int]
|
||||
MyGraph = object
|
||||
points: seq[XY]
|
||||
|
||||
static:
|
||||
assert XY is Node
|
||||
|
||||
proc distance( g: MyGraph, a, b: XY): float =
|
||||
sqrt( pow(float(a.x - b.x), 2) + pow(float(a.y - b.y), 2) )
|
||||
|
||||
static:
|
||||
assert MyGraph is Graph1
|
||||
assert MyGraph is Graph2
|
||||
assert MyGraph is Graph3
|
||||
|
||||
|
||||
|
||||
block t6691:
|
||||
type
|
||||
ConceptA = concept c
|
||||
ConceptB = concept c
|
||||
c.myProc(ConceptA)
|
||||
Obj = object
|
||||
|
||||
proc myProc(obj: Obj, x: ConceptA) = discard
|
||||
|
||||
echo Obj is ConceptB
|
||||
|
||||
|
||||
|
||||
block t6782:
|
||||
type
|
||||
Reader = concept c
|
||||
c.read(openarray[byte], int, int) is int
|
||||
Rdr = concept c
|
||||
c.rd(openarray[byte], int, int) is int
|
||||
|
||||
type TestFile = object
|
||||
|
||||
proc read(r: TestFile, dest: openarray[byte], offset: int, limit: int): int =
|
||||
result = 0
|
||||
proc rd(r: TestFile, dest: openarray[byte], offset: int, limit: int): int =
|
||||
result = 0
|
||||
|
||||
doAssert TestFile is Reader
|
||||
doAssert TestFile is Rdr
|
||||
|
||||
|
||||
|
||||
block t7114:
|
||||
type
|
||||
MyConcept = concept x
|
||||
x.close() # error, doesn't work
|
||||
MyConceptImplementer = object
|
||||
|
||||
proc close(self: MyConceptImplementer) = discard
|
||||
proc takeConcept(window: MyConcept) =
|
||||
discard
|
||||
|
||||
takeConcept(MyConceptImplementer())
|
||||
|
||||
|
||||
|
||||
block t7510:
|
||||
type
|
||||
A[T] = concept a
|
||||
a.x is T
|
||||
B[T] = object
|
||||
x: T
|
||||
proc getx(v: A): v.T = v.x
|
||||
var v = B[int32](x: 10)
|
||||
echo v.getx
|
||||
|
||||
|
||||
|
||||
block misc_issues:
|
||||
# https://github.com/nim-lang/Nim/issues/1147
|
||||
type TTest = object
|
||||
vals: seq[int]
|
||||
|
||||
proc add(self: var TTest, val: int) =
|
||||
self.vals.add(val)
|
||||
|
||||
type CAddable = concept x
|
||||
x[].add(int)
|
||||
|
||||
echo((ref TTest) is CAddable) # true
|
||||
|
||||
# https://github.com/nim-lang/Nim/issues/1570
|
||||
type ConcretePointOfFloat = object
|
||||
x, y: float
|
||||
|
||||
type ConcretePoint[Value] = object
|
||||
x, y: Value
|
||||
|
||||
type AbstractPointOfFloat = concept p
|
||||
p.x is float and p.y is float
|
||||
|
||||
let p1 = ConcretePointOfFloat(x: 0, y: 0)
|
||||
let p2 = ConcretePoint[float](x: 0, y: 0)
|
||||
|
||||
echo p1 is AbstractPointOfFloat # true
|
||||
echo p2 is AbstractPointOfFloat # true
|
||||
echo p2.x is float and p2.y is float # true
|
||||
|
||||
# https://github.com/nim-lang/Nim/issues/2018
|
||||
type ProtocolFollower = concept
|
||||
true # not a particularly involved protocol
|
||||
|
||||
type ImplementorA = object
|
||||
type ImplementorB = object
|
||||
|
||||
proc p[A: ProtocolFollower, B: ProtocolFollower](a: A, b: B) =
|
||||
echo "p has been called."
|
||||
|
||||
p(ImplementorA(), ImplementorA())
|
||||
p(ImplementorA(), ImplementorB())
|
||||
|
||||
# https://github.com/nim-lang/Nim/issues/2423
|
||||
proc put[T](c: seq[T], x: T) = echo "generic"
|
||||
proc put(c: seq) = echo "implicit generic"
|
||||
|
||||
type
|
||||
Container[T] = concept c
|
||||
put(c)
|
||||
put(c, T)
|
||||
|
||||
proc c1(x: Container) = echo "implicit generic"
|
||||
c1(@[1])
|
||||
|
||||
proc c2[T](x: Container[T]) = echo "generic"
|
||||
c2(@[1])
|
||||
|
||||
# https://github.com/nim-lang/Nim/issues/2882
|
||||
type
|
||||
Paper = object
|
||||
name: string
|
||||
|
||||
Bendable = concept x
|
||||
bend(x is Bendable)
|
||||
|
||||
proc bend(p: Paper): Paper = Paper(name: "bent-" & p.name)
|
||||
|
||||
var paper = Paper(name: "red")
|
||||
echo paper is Bendable
|
||||
|
||||
type
|
||||
A = concept self
|
||||
size(self) is int
|
||||
|
||||
B = object
|
||||
|
||||
proc size(self: B): int =
|
||||
return -1
|
||||
|
||||
proc size(self: A): int =
|
||||
return 0
|
||||
|
||||
let b = B()
|
||||
echo b is A
|
||||
echo b.size()
|
||||
|
||||
# https://github.com/nim-lang/Nim/issues/7125
|
||||
type
|
||||
Thing = concept x
|
||||
x.hello is string
|
||||
Cat = object
|
||||
|
||||
proc hello(d: Cat): string = "Meow"
|
||||
|
||||
proc sayHello(c: Thing) = echo(c.hello)
|
||||
|
||||
var a: Thing = Cat()
|
||||
a.sayHello()
|
||||
Loading…
Add table
Add a link
Reference in a new issue