lilypond and some other things!!

lua2SC/lua/ide/ide_lane.lua

@@ -52,7 +52,11 @@ function ide_main()
 end
 function ide_lane()
 	local function MidiOpen(opt) return mainlinda:send("MidiOpen",opt) end
-	local function MidiClose() return mainlinda:send("MidiClose",1) end
+	local function MidiClose() 
+		local tmplinda = lanes.linda()
+		mainlinda:send("MidiClose",tmplinda)
+		tmplinda:receive("MidiClose_done")
+	end
 	local process_gen=lanes.gen("*",--"base,math,os,package,string,table",
 		{
 		cancelstep=10000,

lua2SC/lua/ide/ide_server.lua

@@ -1,6 +1,7 @@
 --to comunicate via linda with server
 local M = {}
-
+M.linda = {} --for using without init
+function M.linda:send() end
 function M:new(o)
 	o = o or {}
 	setmetatable(o, self)

lua2SC/lua/ide/scriptgui.lua

@@ -448,10 +448,14 @@ function wxFuncGraph3(parent,name,label,id,co)
 			local str=string.format("%.2f",lab)
 			dc:DrawText(str,0,y1)
 		end
-		dc:SetPen(wx.wxGREEN_PEN)
-		dc:SetBrush(wx.wxGREEN_BRUSH)
+		local pens = {wx.wxCYAN_PEN,wx.wxGREEN_PEN,wx.wxYELLOW_PEN,wx.wxRED_PEN} --wx.wxBLUE_PEN
+		local brushes = {wx.wxCYAN_BRUSH,wx.wxGREEN_BRUSH,wx.wxYELLOW_BRUSH,wx.wxRED_BRUSH} --wx.wxBLUE_BRUSH,
 		local maxbin=#GraphClass.values[1]
-		for _,vals in ipairs(GraphClass.values) do
+		for npen,vals in ipairs(GraphClass.values) do
+		npen = npen%#pens
+		npen = npen==0 and #pens or npen
+		dc:SetPen(pens[npen])
+		dc:SetBrush(brushes[npen])
 		if maxbin > 1 then
 			--local vals = GraphClass.value
 			local x
@@ -467,9 +471,10 @@ function wxFuncGraph3(parent,name,label,id,co)
 			--prtable("points",points)
 			dc:DrawLines(points,0,height)
 		end
-		end
 		dc:SetPen(wx.wxNullPen)
 		dc:SetBrush(wx.wxNullBrush)
+		end
+
 
 	end
 

lua2SC/lua/num/filter_design.lua

@@ -1,5 +1,6 @@
 --inherits from polynomial.lua for filter design transfer functions
 --by Victor Bombi
+require"sc.utils"
 require"num.polynomial"
 filterpoly_mt = deepcopy(RationalPoly_mt)
 --setmetatable(filterpoly_mt,filterpoly_mt)
@@ -70,6 +71,7 @@ function filterpoly_mt.GroupDelay(H,om)
 	return H.grupdelf(om)
 end
 function FilterPoly(B,A)
+	if B.isRatPoly and A==nil then return setmetatable(B,filterpoly_mt) end
 	local res = ZRatPoly(B,A)
 	return setmetatable(res, filterpoly_mt)
 end
@@ -371,7 +373,7 @@ function Durbin_recursion(Hz,fix)
 		--assert(math.abs(Kaes[i]) < 1,"inestable filter coeffs in Durbin K:"..i..tostring(Kaes[i]))
 		if math.abs(Kaes[i]) >=1 then
 			prtable(Kaes)
-			error()
+			print"error coef"
 		end
 		HzN = (HzN - Kaes[i]*Flip(HzN))/(1 - Kaes[i]*Kaes[i])
 		HzN = HzN:Simplify():Normalize()

lua2SC/lua/num/matrix.lua

@@ -0,0 +1,118 @@
+local matrix_mt = {}
+matrix_mt.__index = matrix_mt
+function matrix(t)
+	return setmetatable(t,matrix_mt)
+end
+local function is_matrix(a)
+	return getmetatable(a)==matrix_mt
+end
+function matrix_mt:size()
+	return #self,#self[1]
+end
+function matrix_mt:new(m,n) -- Define new Matrix
+	local mt = {} -- Make new array for Matrix
+	for i=1,m do mt[i] = {} end -- Null matrix elements
+	return matrix(mt) -- Set Matrix metatable
+end
+function matrix_mt.__mul(a,b)
+	if not is_matrix(a) then a,b = b,a end
+	local m,n = a:size()
+	local res = a:new(m,n)
+	if not is_matrix(b) then
+		for i=1,m do for j=1,n do res[i][j] = b*a[i][j] end end
+	else
+		local mb,nb = b:size()
+		assert(n==mb)
+		for i=1,m do
+			for j=1,nb do
+				local sum = 0
+				for k=1,n do sum = sum + a[i][k]*b[k][j] end
+				res[i][j] = sum
+			end
+		end
+	end
+	return res
+end
+function matrix_mt.__tostring(mx) -- Convert to string for printing
+	local m,n = mx:size()
+	local s = '{{'
+	for i=1,m do
+		for j=1,n-1 do 
+		s = s..(tostring(mx[i][j]) or '..')..', ' end
+		s = s..(tostring(mx[i][n]) or '..')..'}'
+		if i==m then s = s..'}' else s = s..',\n{' end
+	end
+	return s -- Printable string
+end
+--[[
+require"num.complex"
+require"num.filter_design"
+
+function MM(k)
+	return matrix{{Zpow(1),k*Zpow(-1)},{k*Zpow(1),Zpow(-1)}}*(1/(k+1))
+end
+
+function KLJunctionGain(kaes,rG,rL)
+	kaes = TA(kaes):reverse()
+	local res = matrix{{1},{rL}}
+	for i,k in ipairs(kaes) do
+		res = MM(k)*res
+	end
+	res = matrix{{Zpow(1),-rG*Zpow(-1)}}*res
+	return 1/res[1][1]
+end
+function KLJunctionGain2(kaes,rG,rL)
+
+	local res = matrix{{Zpow(1),-rG*Zpow(-1)}}--matrix{{1},{rL}}
+	for i,k in ipairs(kaes) do
+		res = res*MM(k)
+	end
+	res = res*matrix{{1},{rL}}
+	return 1/res[1][1]
+end
+
+require"sc.utils"
+require"sc.utilsstream"
+Tract = require"num.Tract"(18,nil,nil,false)
+
+
+function Areas2KK(AA)
+	local Kaes = {}
+
+	for i=2,#AA  do
+		local num = (AA[i-1]-AA[i])
+		local den = (AA[i]+AA[i-1])
+		if AA[i]==math.huge then 
+			Kaes[i-1] = 1
+		else
+			if num == 0 or den == 0 then
+				Kaes[i-1] = 0
+			else
+				Kaes[i-1] = num/den
+			end
+		end
+	end
+	return Kaes
+end
+
+areas = Tract.areas.E
+kaes = Areas2KK(areas)
+
+print(KLJunctionGain({1,2,3},0.95,0.97))
+print(KLJunctionGain2({1,2,3},0.95,0.97))
+
+fil = KLJunctionGain(kaes,0.95,0.97)
+
+print(MM(3))
+pp = FilterPoly({1,1},{1})--*Zpow(-1)
+print(pp)
+pp2 = RatPoly({1,1},{1})--*Zpow(-1)
+print(pp2)
+aa = matrix{{1,1},{0,1}}
+vec = matrix{{2,3}}
+vec2 = matrix{{2},{3}}
+print(aa:size())
+
+print(aa*vec2)
+--]]
+

lua2SC/lua/num/torational.lua

@@ -0,0 +1,78 @@
+--[[/*
+** find rational approximation to given real number
+** David Eppstein / UC Irvine / 8 Aug 1993
+**
+** With corrections from Arno Formella, May 2008
+**
+** usage: a.out r d
+**   r is real number to approx
+**   d is the maximum denominator allowed
+**
+** based on the theory of continued fractions
+** if x = a1 + 1/(a2 + 1/(a3 + 1/(a4 + ...)))
+** then best approximation is found by truncating this series
+** (with some adjustments in the last term).
+**
+** Note the fraction can be recovered as the first column of the matrix
+**  ( a1 1 ) ( a2 1 ) ( a3 1 ) ...
+**  ( 1  0 ) ( 1  0 ) ( 1  0 )
+** Instead of keeping the sequence of continued fraction terms,
+** we just keep the last partial product of these matrices.
+*/
+--]]
+function GCD(a,b)
+	local r
+	if a < b then b,a = a,b end
+	while true do
+		r = a%b
+		if r == 0 then return b end
+		--print(a,b,r)
+		a,b = b,r
+	end
+end
+--always gives reduced fractions, dont need GCD
+function torational(x,maxden)
+    local startx = x 
+    -- initialize matrix */
+    local m00, m11 = 1,1;
+    local m01, m10 = 0,0;
+
+    -- loop finding terms until denom gets too big */
+	local t
+	local ai = math.floor(x)
+    while (m10 *  ai + m11 <= maxden) do
+		print(ai)
+		t = m00 * ai + m01;
+		m01 = m00;
+		m00 = t;
+		t = m10 * ai + m11;
+		m11 = m10;
+		m10 = t;
+		if(x == ai) then break end    -- AF: division by zero 
+		x = 1/(x - ai);
+		if(x >0x7FFFFFFF) then break end  -- AF: representation failure
+		ai = math.floor(x)
+    end 
+
+    -- now remaining x is between 0 and 1/ai */
+    -- approx as either 0 or 1/m where m is max that will fit in maxden */
+    -- first try zero */
+  -- print( string.format("%d/%d, error = %e\n", m[0][0], m[1][0],startx - ( m[0][0] /  m[1][0])));
+	return m00,m10,startx - ( m00 /  m10)
+
+    -- now try other possibility */
+    --ai = (maxden - m[1][1]) / m[1][0];
+    --m[0][0] = m[0][0] * ai + m[0][1];
+    --m[1][0] = m[1][0] * ai + m[1][1];
+    --print(string.format("%d/%d, error = %e\n", m[0][0], m[1][0], startx - ( m[0][0] / m[1][0])));
+end
+
+--print(torational(2*5*7/(11*3*13),10000))
+--print(torational((3/2)^12,1e3))
+--print(GCD(1e17*13,1e17*11))
+--[[
+local N,M = torational(math.pi,1000)
+local gcd = MCD(N,M)
+print(N,M)
+print(N/gcd,M/gcd)
+--]]