June 2018 Update
This commit is contained in:
parent
ba8067c3b7
commit
22f33d4004
5278 changed files with 84726 additions and 14379 deletions
|
|
@ -0,0 +1,56 @@
|
|||
iscontseq(n::Integer) = count_zeros(n) == leading_zeros(n) + trailing_zeros(n)
|
||||
iscontseq(n::BigInt) = !ismatch(r"0", rstrip(bin(n), '0'))
|
||||
|
||||
function makeint2seq(n::Integer)
|
||||
const idex = collect(1:n)
|
||||
function int2seq(m::Integer)
|
||||
d = digits(m, 2, n)
|
||||
idex[d .== 1]
|
||||
end
|
||||
return int2seq
|
||||
end
|
||||
|
||||
struct NCSubSeq{T<:Integer}
|
||||
n::T
|
||||
end
|
||||
|
||||
mutable struct NCSubState{T<:Integer}
|
||||
m::T
|
||||
m2s::Function
|
||||
end
|
||||
|
||||
Base.iteratorsize(::NCSubSeq) = Base.HasLength()
|
||||
Base.length(a::NCSubSeq) = 2 ^ a.n - a.n * (a.n + 1) ÷ 2 - 1
|
||||
|
||||
Base.start(a::NCSubSeq) = NCSubState(5, makeint2seq(a.n))
|
||||
Base.done(a::NCSubSeq, as::NCSubState) = 2 ^ a.n - 3 < as.m
|
||||
function Base.next(a::NCSubSeq, as::NCSubState)
|
||||
s = as.m2s(as.m)
|
||||
as.m += 1
|
||||
while iscontseq(as.m)
|
||||
as.m += 1
|
||||
end
|
||||
return (s, as)
|
||||
end
|
||||
|
||||
n = 4
|
||||
println("Testing NCSubSeq for ", n, " items:\n ", join(NCSubSeq(n), " "))
|
||||
|
||||
s = "Rosetta"
|
||||
cs = split(s, "")
|
||||
m = 10
|
||||
n = length(NCSubSeq(length(s))) - m
|
||||
println("\nThe first and last ", m, " NC sub-sequences of \"", s, "\":")
|
||||
for (i, a) in enumerate(NCSubSeq(length(cs)))
|
||||
i <= m || n < i || continue
|
||||
println(@sprintf "%6d %s" i join(cs[a], ""))
|
||||
i == m || continue
|
||||
println(" .. ......")
|
||||
end
|
||||
|
||||
using IterTools.chain
|
||||
|
||||
println("\nThe first and last ", m, " NC sub-sequences of \"", s, "\"")
|
||||
for x in IterTools.chain(1:10, 20:10:40, big.(50:50:200))
|
||||
@printf "%7d → %d\n" x length(NCSubSeq(x))
|
||||
end
|
||||
|
|
@ -0,0 +1,61 @@
|
|||
# Project : Non-continuous subsequences
|
||||
# Date : 2018/02/03
|
||||
# Author : Gal Zsolt [~ CalmoSoft ~]
|
||||
# Email : <calmosoft@gmail.com>
|
||||
|
||||
load "stdlib.ring"
|
||||
list = [1,2,3,4]
|
||||
items = newlist(pow(2,len(list))-1,len(list))
|
||||
see "For [1, 2, 3, 4] non-continuous subsequences are:" + nl
|
||||
powerset(list,4)
|
||||
showarray(items,4)
|
||||
see nl
|
||||
|
||||
list = [1,2,3,4,5]
|
||||
items = newlist(pow(2,len(list))-1,len(list))
|
||||
see "For [1, 2, 3, 4, 5] non-continuous subsequences are:" + nl
|
||||
powerset(list,5)
|
||||
showarray(items,5)
|
||||
|
||||
func showarray(items,ind)
|
||||
for n = 1 to len(items)
|
||||
flag = 0
|
||||
for m = 1 to ind - 1
|
||||
if items[n][m] = 0 or items[n][m+1] = 0
|
||||
exit
|
||||
ok
|
||||
if (items[n][m] + 1) != items[n][m+1]
|
||||
flag = 1
|
||||
exit
|
||||
ok
|
||||
next
|
||||
if flag = 1
|
||||
see "["
|
||||
str = ""
|
||||
for x = 1 to len(items[n])
|
||||
if items[n][x] != 0
|
||||
str = str + items[n][x] + " "
|
||||
ok
|
||||
next
|
||||
str = left(str, len(str) - 1)
|
||||
see str + "]" + nl
|
||||
ok
|
||||
next
|
||||
|
||||
func powerset(list,ind)
|
||||
num = 0
|
||||
num2 = 0
|
||||
items = newlist(pow(2,len(list))-1,ind)
|
||||
for i = 2 to (2 << len(list)) - 1 step 2
|
||||
num2 = 0
|
||||
num = num + 1
|
||||
for j = 1 to len(list)
|
||||
if i & (1 << j)
|
||||
num2 = num2 + 1
|
||||
if list[j] != 0
|
||||
items[num][num2] = list[j]
|
||||
ok
|
||||
ok
|
||||
next
|
||||
next
|
||||
return items
|
||||
Loading…
Add table
Add a link
Reference in a new issue