xingluo/CCTweaked-Demo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: xingluo:f09c7d77a8337ed03502b53049735795ed14d8ca
Branches Tags
xingluo:main
..
compare: xingluo:main
Branches Tags
xingluo:main

8 Commits
f09c7d77a8 ... main

Author SHA1 Message Date
xingluo
a635d9a9bc 上传文件至 / 2025-12-05 02:22:26 +08:00
xingluo
270c5d84c0 上传文件至 / 2025-12-05 02:03:14 +08:00
xingluo
ee5ff39fbe 上传文件至 Demo/SanjuuniApi-Demo 2025-05-04 23:02:44 +08:00
HKXluo
57f34e87d4 Merge branch 'main' of https://git.liulikeji.cn/xingluo/CCTweaked-Demo 2025-05-04 22:36:10 +08:00
HKXluo
c43c51b779 修改demo2 2025-05-04 22:35:52 +08:00
xingluo
18d83df0ca 上传文件至 Demo/SanjuuniApi-Demo 2025-05-04 21:53:16 +08:00
HKXluo
d6ac4f00e7 2025-05-04 21:24:11 +08:00
HKXluo
2dbd84e514 lib 2025-05-04 21:22:18 +08:00
7 changed files with 276 additions and 1116 deletions
Expand all files Collapse all files

BIN
Demo/SanjuuniApi-Demo/demo.mp4 Normal file
View File

Binary file not shown.

198
Demo/SanjuuniApi-Demo/demo2.lua
View File

@@ -1,67 +1,187 @@
-- API 地址 / API Endpoint -- sanjuuni_converter.lua
-- 使用Sanjuuni API的图像转换工具
-- Usage: sanjuuni_converter --url <input_url> --format <output_format> --out <output_file> [options]
local API_URL = "http://newgmapi.liulikeji.cn/api/sanjuuni" local API_URL = "http://newgmapi.liulikeji.cn/api/sanjuuni"
-- 输入图片URL / Input image URL -- 显示帮助信息
local INPUT_URL = "https://git.liulikeji.cn/xingluo/CCTweaked-Demo/raw/branch/main/Demo/SanjuuniApi-Demo/demo.gif" local function showHelp()
print("Sanjuuni Image Converter - Usage:")
print("sanjuuni_converter --url <input_url> --format <output_format> --out <output_file> [options]")
print()
print("Required arguments:")
print(" --url <url> Input image URL")
print(" --format <fmt> Output format (bimg, gif, etc.)")
print(" --out <file> Output file path")
print()
print("Options:")
print(" --args <params> Conversion parameters (default: \"-8\")")
print(" --monitor <side> Use specified monitor for size reference")
print(" --scale <num> Set display scale before getting monitor size")
print(" --help Show this help message")
print()
print("Example:")
print("sanjuuni_converter --url https://example.com/image.jpg --format bimg --out output.bimg")
print("sanjuuni_converter --url https://example.com/image.jpg --format gif --out anim.gif --monitor top --scale 0.5")
end
-- 获取图像下载URL
local function Get_image_url(INPUT_URL,API_URL,args,output_format) local function getImageUrl(inputUrl, args, outputFormat)
-- ===== 1. 发送HTTP请求 / Send HTTP request ===== -- 准备请求数据
local requestData = { local requestData = {
input_url = INPUT_URL, input_url = inputUrl,
args = args, args = args,
output_format = output_format output_format = outputFormat
} }
print("Sending request to Sanjuuni API...")
local response, err = http.post( local response, err = http.post(
API_URL, API_URL,
textutils.serializeJSON(requestData), textutils.serializeJSON(requestData),
{ ["Content-Type"] = "application/json" } { ["Content-Type"] = "application/json" }
) )
-- ===== 2. 读取数据 / Send HTTP request ===== if not response then
if not response then error("HTTP Request Failure: "..(err or "Unknown error")) error("HTTP request failed: "..(err or "unknown error"))
else end
-- 读取响应 / Read response
local responseData = textutils.unserializeJSON(response.readAll())
response.close()
--返回下载链接 / Return download URL -- 解析响应数据
if responseData.status ~= "success" then error("Conversion failed:"..(responseData.error or "Unknown error")) local responseData = textutils.unserializeJSON(response.readAll())
response.close()
if responseData.status ~= "success" then
error("Conversion failed: "..(responseData.error or "unknown error"))
end
print("Conversion successful!")
return responseData.download_url
end
-- 下载文件到本地
local function downloadFile(url, outputPath)
print("Downloading converted file...")
local response = http.get(url)
if not response then
error("Failed to download file from: "..url)
end
local file = fs.open(outputPath, "wb")
if not file then
error("Cannot open output file: "..outputPath)
end
file.write(response.readAll())
file.close()
response.close()
print("File saved to: "..outputPath)
end
-- 解析命令行参数
local function parseArguments(args)
local options = {
args = {} -- 默认参数
}
local required = {"url", "format", "out"}
local seen = {}
local i = 1
while i <= #args do
local arg = args[i]
if arg == "--url" then
i = i + 1
options.url = args[i]
seen.url = true
elseif arg == "--format" then
i = i + 1
options.format = args[i]
seen.format = true
elseif arg == "--out" then
i = i + 1
options.out = args[i]
seen.out = true
elseif arg == "--args" then
i = i + 1
options.args = {args[i]} -- 简单参数处理
elseif arg == "--monitor" then
i = i + 1
options.monitor = args[i]
elseif arg == "--scale" then
i = i + 1
options.scale = tonumber(args[i])
elseif arg == "--help" then
showHelp()
return nil
else else
return responseData.download_url error("Unknown option: "..arg)
end
i = i + 1
end
-- 检查必需参数
for _, req in ipairs(required) do
if not seen[req] then
error("Missing required argument: --"..req)
end end
end end
return options
end end
-- 主函数
local function main(...)
local args = {...}
-- 图片宽度 / Image width if #args == 0 then
local width, height = term.getSize() -- 获取终端尺寸（width=宽度，height=高度） showHelp()
local width = width * 2 -- 宽度×2 return
local height = height * 3 -- 高度×3 end
-- 转换参数 / Conversion parameters -- 解析参数
args = { "-8","--width="..width,"--height="..height } local ok, options = pcall(parseArguments, args)
output_format = "bimg" if not ok then
printError(options) -- options contains error message
showHelp()
return
end
-- 调用API / Call API if not options then return end -- 用户请求帮助
local download_url = Get_image_url(INPUT_URL,API_URL,args,output_format)
-- 获取终端/显示器尺寸
local width, height
if options.monitor then
local monitor = peripheral.wrap(options.monitor)
if not monitor then
error("Invalid monitor: "..options.monitor)
end
-- 下载图像文件 / Download image file if options.scale then
print("\nConversion successful! Download URL:") monitor.setTextScale(options.scale)
print(download_url) end
luafile = http.get(download_url) width, height = monitor.getSize()
if luafile then else
print("\nLua file downloaded successfully.") width, height = term.getSize()
end
-- 保存Lua文件 / Save Lua file -- 计算最终尺寸
f = fs.open("demo.bimg", "w") width = width * 2
f.write(luafile.readAll()) height = height * 3
f.close()
print("\nLua file saved as demo.bimg.")
else -- 准备转换参数
print("\nFailed to download Lua file.") local conversionArgs = options.args
table.insert(conversionArgs, "--width="..width)
table.insert(conversionArgs, "--height="..height)
-- 调用API转换图像
local downloadUrl = getImageUrl(options.url, conversionArgs, options.format)
-- 下载转换后的文件
downloadFile(downloadUrl, options.out)
print("Image conversion completed successfully!")
end end
-- 运行程序
main(...)

261
Demo/SanjuuniApi-Demo/lib/32vid-player-mini.lua
View File

@@ -1,261 +0,0 @@
-- 32vid-player-mini from sanjuuni
-- Licensed under the MIT license
local bit32_band, bit32_lshift, bit32_rshift, math_frexp = bit32.band, bit32.lshift, bit32.rshift, math.frexp
local function log2(n) local _, r = math_frexp(n) return r-1 end
local dfpwm = require "cc.audio.dfpwm"
local speaker = peripheral.find "speaker"
local file
local path = ...
if path:match "^https?://" then
file = assert(http.get(path, nil, true))
else
file = assert(fs.open(shell.resolve(path), "rb"))
end
if file.read(4) ~= "32VD" then file.close() error("Not a 32Vid file") end
local width, height, fps, nstreams, flags = ("<HHBBH"):unpack(file.read(8))
--print(width, height, fps, nstreams, flags)
if nstreams ~= 1 then file.close() error("Separate stream files not supported by this tool") end
if bit32_band(flags, 1) == 0 then file.close() error("DEFLATE or no compression not supported by this tool") end
local _, nframes, ctype = ("<IIB"):unpack(file.read(9))
if ctype ~= 0x0C then file.close() error("Stream type not supported by this tool") end
local monitors, mawidth, maheight
if bit32.btest(flags, 0x20) then
mawidth, maheight = bit32_band(bit32_rshift(flags, 6), 7) + 1, bit32_band(bit32_rshift(flags, 9), 7) + 1
monitors = settings.get('sanjuuni.multimonitor')
if not monitors or #monitors < maheight or #monitors[1] < mawidth then
term.clear()
term.setCursorPos(1, 1)
print('This video needs monitors to be calibrated before being displayed. Please right-click each monitor in order, from the top left corner to the bottom right corner, going right first, then down.\n')
monitors = {}
local a = {}
for b = 1, maheight do
monitors[b] = {}
for c = 1, mawidth do
local d, e = term.getCursorPos()
for f = 1, maheight do
term.setCursorPos(3, e + f - 1)
term.clearLine()
for g = 1, mawidth do term.blit('\x8F ', g == c and f == b and '00' or '77', 'ff') end
end
term.setCursorPos(3, e + maheight)
term.write('(' .. c .. ', ' .. b .. ')')
term.setCursorPos(1, e)
repeat
local d, h = os.pullEvent('monitor_touch')
monitors[b][c] = h
until not a[h]
a[monitors[b][c]] = true
sleep(0.25)
end
end
settings.set('sanjuuni.multimonitor', monitors)
settings.save()
print('Calibration complete. Settings have been saved for future use.')
end
for _, r in ipairs(monitors) do for i, m in ipairs(r) do r[i] = peripheral.wrap(m) peripheral.call(m, "setTextScale", 0.5) peripheral.call(m, "clear") end end
end
local function readDict(size)
local retval = {}
for i = 0, size - 1, 2 do
local b = file.read()
retval[i] = bit32.rshift(b, 4)
retval[i+1] = bit32.band(b, 15)
end
return retval
end
local init, read
if bit32_band(flags, 3) == 1 then
local decodingTable, X, readbits, isColor
function init(c)
isColor = c
local R = file.read()
local L = 2^R
local Ls = readDict(c and 24 or 32)
if R == 0 then
decodingTable = file.read()
X = nil
return
end
local a = 0
for i = 0, #Ls do Ls[i] = Ls[i] == 0 and 0 or 2^(Ls[i]-1) a = a + Ls[i] end
assert(a == L, a)
decodingTable = {R = R}
local x, step, next, symbol = 0, 0.625 * L + 3, {}, {}
for i = 0, #Ls do
next[i] = Ls[i]
for _ = 1, Ls[i] do
while symbol[x] do x = (x + 1) % L end
x, symbol[x] = (x + step) % L, i
end
end
for x = 0, L - 1 do
local s = symbol[x]
local t = {s = s, n = R - log2(next[s])}
t.X, decodingTable[x], next[s] = bit32_lshift(next[s], t.n) - L, t, 1 + next[s]
end
local partial, bits, pos = 0, 0, 1
function readbits(n)
if not n then n = bits % 8 end
if n == 0 then return 0 end
while bits < n do pos, bits, partial = pos + 1, bits + 8, bit32_lshift(partial, 8) + file.read() end
local retval = bit32_band(bit32_rshift(partial, bits-n), 2^n-1)
bits = bits - n
return retval
end
X = readbits(R)
end
function read(nsym)
local retval = {}
if X == nil then
for i = 1, nsym do retval[i] = decodingTable end
return retval
end
local i = 1
local last = 0
while i <= nsym do
local t = decodingTable[X]
if isColor and t.s >= 16 then
local l = 2^(t.s - 15)
for n = 0, l-1 do retval[i+n] = last end
i = i + l
else retval[i], last, i = t.s, t.s, i + 1 end
X = t.X + readbits(t.n)
end
--print(X)
return retval
end
else
error("Unimplemented!")
end
local blitColors = {[0] = "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"}
local start = os.epoch "utc"
local lastyield = start
local vframe = 0
local subs = {}
term.clear()
for _ = 1, nframes do
local size, ftype = ("<IB"):unpack(file.read(5))
--print(size, ftype, file.seek())
if ftype == 0 then
if os.epoch "utc" - lastyield > 3000 then sleep(0) lastyield = os.epoch "utc" end
local dcstart = os.epoch "utc"
--print("init screen", vframe, file.seek())
init(false)
--print("read screen", vframe, file.seek())
local screen = read(width * height)
--print("init colors", vframe, file.seek())
init(true)
--print("read bg colors", vframe)
local bg = read(width * height)
--print("read fg colors", vframe)
local fg = read(width * height)
local dctime = os.epoch "utc" - dcstart
while os.epoch "utc" < start + vframe * 1000 / fps do end
local texta, fga, bga = {}, {}, {}
for y = 0, height - 1 do
local text, fgs, bgs = "", "", ""
for x = 1, width do
text = text .. string.char(128 + screen[y*width+x])
fgs = fgs .. blitColors[fg[y*width+x]]
bgs = bgs .. blitColors[bg[y*width+x]]
end
texta[y+1], fga[y+1], bga[y+1] = text, fgs, bgs
end
for i = 0, 15 do term.setPaletteColor(2^i, file.read() / 255, file.read() / 255, file.read() / 255) end
for y = 1, height do
term.setCursorPos(1, y)
term.blit(texta[y], fga[y], bga[y])
end
local delete = {}
for i, v in ipairs(subs) do
if vframe <= v.frame + v.length then
term.setCursorPos(v.x, v.y)
term.setBackgroundColor(v.bgColor)
term.setTextColor(v.fgColor)
term.write(v.text)
else delete[#delete+1] = i end
end
for i, v in ipairs(delete) do table.remove(subs, v - i + 1) end
--term.setCursorPos(1, height + 1)
--term.clearLine()
--print("Frame decode time:", dctime, "ms")
vframe = vframe + 1
elseif ftype == 1 then
local audio = file.read(size)
if speaker then
if bit32_band(flags, 12) == 0 then
local chunk = {audio:byte(1, -1)}
for i = 1, #chunk do chunk[i] = chunk[i] - 128 end
speaker.playAudio(chunk)
else
speaker.playAudio(dfpwm.decode(audio))
end
end
elseif ftype == 8 then
local data = file.read(size)
local sub = {}
sub.frame, sub.length, sub.x, sub.y, sub.color, sub.flags, sub.text = ("<IIHHBBs2"):unpack(data)
sub.bgColor, sub.fgColor = 2^bit32_rshift(sub.color, 4), 2^bit32_band(sub.color, 15)
subs[#subs+1] = sub
elseif ftype >= 0x40 and ftype < 0x80 then
if ftype == 64 then vframe = vframe + 1 end
local mx, my = bit32_band(bit32_rshift(ftype, 3), 7) + 1, bit32_band(ftype, 7) + 1
--print("(" .. mx .. ", " .. my .. ")")
local term = monitors[my][mx]
if os.epoch "utc" - lastyield > 3000 then sleep(0) lastyield = os.epoch "utc" end
local width, height = ("<HH"):unpack(file.read(4))
local dcstart = os.epoch "utc"
--print("init screen", vframe, file.seek())
init(false)
--print("read screen", vframe, file.seek())
local screen = read(width * height)
--print("init colors", vframe, file.seek())
init(true)
--print("read bg colors", vframe)
local bg = read(width * height)
--print("read fg colors", vframe)
local fg = read(width * height)
local dctime = os.epoch "utc" - dcstart
while os.epoch "utc" < start + vframe * 1000 / fps do end
local texta, fga, bga = {}, {}, {}
for y = 0, height - 1 do
local text, fgs, bgs = "", "", ""
for x = 1, width do
text = text .. string.char(128 + screen[y*width+x])
fgs = fgs .. blitColors[fg[y*width+x]]
bgs = bgs .. blitColors[bg[y*width+x]]
end
texta[y+1], fga[y+1], bga[y+1] = text, fgs, bgs
end
for i = 0, 15 do term.setPaletteColor(2^i, file.read() / 255, file.read() / 255, file.read() / 255) end
for y = 1, height do
term.setCursorPos(1, y)
term.blit(texta[y], fga[y], bga[y])
end
--[[local delete = {}
for i, v in ipairs(subs) do
if vframe <= v.frame + v.length then
term.setCursorPos(v.x, v.y)
term.setBackgroundColor(v.bgColor)
term.setTextColor(v.fgColor)
term.write(v.text)
else delete[#delete+1] = i end
end
for i, v in ipairs(delete) do table.remove(subs, v - i + 1) end]]
--term.setCursorPos(1, height + 1)
--term.clearLine()
--print("Frame decode time:", dctime, "ms")
else file.close() error("Unknown frame type " .. ftype) end
end
for i = 0, 15 do term.setPaletteColor(2^i, term.nativePaletteColor(2^i)) end
term.setBackgroundColor(colors.black)
term.setTextColor(colors.white)
term.setCursorPos(1, 1)
term.clear()

657
Demo/SanjuuniApi-Demo/lib/32vid-player.lua
View File

@@ -1,657 +0,0 @@
-- 32vid-player from sanjuuni
-- Licensed under the MIT license
local inflate do
local floor = math.floor
local ceil = math.ceil
local min = math.min
local max = math.max
-- utility functions
local function memoize(f)
local cache = {}
return function(...)
local key = table.concat({...}, "-")
if not cache[key] then
cache[key] = f(...)
end
return cache[key]
end
end
local function int(bytes)
local n = 0
for i = 1, #bytes do
n = 256*n + bytes:sub(i, i):byte()
end
return n
end
int = memoize(int)
local function bint(bits)
return tonumber(bits, 2) or 0
end
bint = memoize(bint)
local function bits(b, width)
local s = ""
if type(b) == "number" then
for i = 1, width do
s = b%2 .. s
b = floor(b/2)
end
else
for i = 1, #b do
s = s .. bits(b:byte(i), 8):reverse()
assert(#s == i * 8, s)
end
end
return s
end
bits = memoize(bits)
local function fill(bytes, len)
return bytes:rep(floor(len / #bytes)) .. bytes:sub(1, len % #bytes)
end
local function zip(t1, t2)
local zipped = {}
for i = 1, max(#t1, #t2) do
zipped[#zipped + 1] = {t1[i], t2[i]}
end
return zipped
end
local function unzip(zipped)
local t1, t2 = {}, {}
for i = 1, #zipped do
t1[#t1 + 1] = zipped[i][1]
t2[#t2 + 1] = zipped[i][2]
end
return t1, t2
end
local function map(f, t)
local mapped = {}
for i = 1, #t do
mapped[#mapped + 1] = f(t[i], i)
end
return mapped
end
local function filter(pred, t)
local filtered = {}
for i = 1, #t do
if pred(t[i], i) then
filtered[#filtered + 1] = t[i]
end
end
return filtered
end
local function find(key, t)
if type(key) == "function" then
for i = 1, #t do
if key(t[i]) then
return i
end
end
return nil
else
return find(function(x) return x == key end, t)
end
end
local function slice(t, i, j, step)
local sliced = {}
for k = i < 1 and 1 or i, i < 1 and #t + i or j or #t, step or 1 do
sliced[#sliced + 1] = t[k]
end
return sliced
end
local function range(i, j)
local r = {}
for k = j and i or 0, j or i - 1 do
r[#r + 1] = k
end
return r
end
-- streams
local function output_stream()
local stream, buffer = {}, {}
local curr = 0
function stream:write(bytes)
for i = 1, #bytes do
buffer[#buffer + 1] = bytes:sub(i, i)
end
curr = curr + #bytes
end
function stream:back_read(offset, n)
local read = {}
for i = curr - offset + 1, curr - offset + n do
read[#read + 1] = buffer[i]
end
return table.concat(read)
end
function stream:back_copy(dist, len)
local start, copied = curr - dist + 1, {}
for i = start, min(start + len, curr) do
copied[#copied + 1] = buffer[i]
end
self:write(fill(table.concat(copied), len))
end
function stream:pos()
return curr
end
function stream:raw()
return table.concat(buffer)
end
return stream
end
local function bit_stream(raw, offset)
local stream = {}
local curr = 0
offset = offset or 0
function stream:read(n, reverse)
local start = floor(curr/8) + offset + 1
local bb = ""
for i = start, start + ceil(n/8) do
local b = raw:byte(i)
for j = 0, 7 do bb = bb .. bit32.extract(b, j, 1) end
end
local b = bb:sub(curr%8 + 1, curr%8 + n)
curr = curr + n
return reverse and b or b:reverse()
end
function stream:seek(n)
if n == "beg" then
curr = 0
elseif n == "end" then
curr = #raw
else
curr = curr + n
end
return self
end
function stream:is_empty()
return curr >= 8*#raw
end
function stream:pos()
return curr
end
return stream
end
-- inflate
local CL_LENS_ORDER = {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}
local MAX_BITS = 15
local PT_WIDTH = 8
local function cl_code_lens(stream, hclen)
local code_lens = {}
for i = 1, hclen do
code_lens[#code_lens + 1] = bint(stream:read(3))
end
return code_lens
end
local function code_tree(lens, alphabet)
alphabet = alphabet or range(#lens)
local using = filter(function(x, i) return lens[i] and lens[i] > 0 end, alphabet)
lens = filter(function(x) return x > 0 end, lens)
local tree = zip(lens, using)
table.sort(tree, function(a, b)
if a[1] == b[1] then
return a[2] < b[2]
else
return a[1] < b[1]
end
end)
return unzip(tree)
end
local function codes(lens)
local codes = {}
local code = 0
for i = 1, #lens do
codes[#codes + 1] = bits(code, lens[i])
if i < #lens then
code = (code + 1)*2^(lens[i + 1] - lens[i])
end
end
return codes
end
local prefix_table
local function handle_long_codes(codes, alphabet, pt)
local i = find(function(x) return #x > PT_WIDTH end, codes)
local long = slice(zip(codes, alphabet), i)
i = 0
repeat
local prefix = long[i + 1][1]:sub(1, PT_WIDTH)
local same = filter(function(x) return x[1]:sub(1, PT_WIDTH) == prefix end, long)
same = map(function(x) return {x[1]:sub(PT_WIDTH + 1), x[2]} end, same)
pt[prefix] = {rest = prefix_table(unzip(same)), unused = 0}
i = i + #same
until i == #long
end
function prefix_table(codes, alphabet)
local pt = {}
if #codes[#codes] > PT_WIDTH then
handle_long_codes(codes, alphabet, pt)
end
for i = 1, #codes do
local code = codes[i]
if #code > PT_WIDTH then
break
end
local entry = {value = alphabet[i], unused = PT_WIDTH - #code}
if entry.unused == 0 then
pt[code] = entry
else
for i = 0, 2^entry.unused - 1 do
pt[code .. bits(i, entry.unused)] = entry
end
end
end
return pt
end
local function huffman_decoder(lens, alphabet)
local base_codes = prefix_table(codes(lens), alphabet)
return function(stream)
local codes = base_codes
local entry
repeat
entry = codes[stream:read(PT_WIDTH, true)]
stream:seek(-entry.unused)
codes = entry.rest
until not codes
return entry.value
end
end
local function code_lens(stream, decode, n)
local lens = {}
repeat
local value = decode(stream)
if value < 16 then
lens[#lens + 1] = value
elseif value == 16 then
for i = 1, bint(stream:read(2)) + 3 do
lens[#lens + 1] = lens[#lens]
end
elseif value == 17 then
for i = 1, bint(stream:read(3)) + 3 do
lens[#lens + 1] = 0
end
elseif value == 18 then
for i = 1, bint(stream:read(7)) + 11 do
lens[#lens + 1] = 0
end
end
until #lens == n
return lens
end
local function code_trees(stream)
local hlit = bint(stream:read(5)) + 257
local hdist = bint(stream:read(5)) + 1
local hclen = bint(stream:read(4)) + 4
local cl_decode = huffman_decoder(code_tree(cl_code_lens(stream, hclen), CL_LENS_ORDER))
local ll_decode = huffman_decoder(code_tree(code_lens(stream, cl_decode, hlit)))
local d_decode = huffman_decoder(code_tree(code_lens(stream, cl_decode, hdist)))
return ll_decode, d_decode
end
local function extra_bits(value)
if value >= 4 and value <= 29 then
return floor(value/2) - 1
elseif value >= 265 and value <= 284 then
return ceil(value/4) - 66
else
return 0
end
end
extra_bits = memoize(extra_bits)
local function decode_len(value, bits)
assert(value >= 257 and value <= 285, "value out of range")
assert(#bits == extra_bits(value), "wrong number of extra bits")
if value <= 264 then
return value - 254
elseif value == 285 then
return 258
end
local len = 11
for i = 1, #bits - 1 do
len = len + 2^(i+2)
end
return floor(bint(bits) + len + ((value - 1) % 4)*2^#bits)
end
decode_len = memoize(decode_len)
local function a(n)
if n <= 3 then
return n + 2
else
return a(n-1) + 2*a(n-2) - 2*a(n-3)
end
end
a = memoize(a)
local function decode_dist(value, bits)
assert(value >= 0 and value <= 29, "value out of range")
assert(#bits == extra_bits(value), "wrong number of extra bits)")
return bint(bits) + a(value - 1)
end
decode_dist = memoize(decode_dist)
function inflate(data)
local stream = bit_stream(data)
local ostream = output_stream()
repeat
local bfinal, btype = bint(stream:read(1)), bint(stream:read(2))
assert(btype == 2, "compression method not supported")
local ll_decode, d_decode = code_trees(stream)
while true do
local value = ll_decode(stream)
if value < 256 then
ostream:write(string.char(value))
elseif value == 256 then
break
else
local len = decode_len(value, stream:read(extra_bits(value)))
value = d_decode(stream)
local dist = decode_dist(value, stream:read(extra_bits(value)))
ostream:back_copy(dist, len)
end
end
until bfinal == 1
return ostream:raw()
end
end
local dfpwm = require "cc.audio.dfpwm"
local hexstr = "0123456789abcdef"
local file, err = fs.open(shell.resolve(...), "rb")
if not file then error(err) end
if file.read(4) ~= "32VD" then file.close() error("Not a 32vid file") end
local width, height, fps, nStreams, flags = ("<HHBBH"):unpack(file.read(8))
local video, audio, subtitles
for _ = 1, nStreams do
local size, nFrames, frameType = ("<IIB"):unpack(file.read(9))
print(("%X"):format(file.seek()), size, nFrames, frameType)
if frameType == 0 and not video then
local data = file.read(size)
if bit32.band(flags, 3) == 2 then data = inflate(data) end
video = {}
local pos = 1
local start = os.epoch "utc"
for i = 1, nFrames do
if i % 100 == 0 or i >= nFrames - 10 then print(i, os.epoch "utc" - start) start = os.epoch "utc" sleep(0) end
local frame = {palette = {}}
local tmp, tmppos = 0, 0
local use5bit, customcompress = bit32.btest(flags, 16), bit32.band(flags, 3) == 3
local codetree = {}
local solidchar, runlen
local function readField(isColor)
if customcompress then
if runlen then
local c = solidchar
runlen = runlen - 1
if runlen == 0 then runlen = nil end
return c
end
if not isColor and solidchar then return solidchar end
-- MARK: Huffman decoding
local node = codetree
while true do
local n = bit32.extract(tmp, tmppos, 1)
tmppos = tmppos - 1
if tmppos < 0 then tmp, pos, tmppos = data:byte(pos), pos + 1, 7 end
if type(node) ~= "table" then error(("Invalid tree state: position %X, frame %d"):format(pos+file.seek()-size-1, i)) end
if type(node[n]) == "number" then
local c = node[n]
if isColor then
if c > 15 then runlen = 2^(c-15)-1 return assert(solidchar)
else solidchar = c end
end
return c
else node = node[n] end
end
else
local n
if tmppos * 5 + 5 > 32 then n = bit32.extract(math.floor(tmp / 0x1000000), tmppos * 5 - 24, 5)
else n = bit32.extract(tmp, tmppos * 5, 5) end
tmppos = tmppos - 1
if tmppos < 0 then tmp, pos = (">I5"):unpack(data, pos) tmppos = 7 end
return n
end
end
if customcompress then
-- MARK: Huffman tree reconstruction
-- read bit lengths
local bitlen = {}
if use5bit then
for j = 0, 15 do
bitlen[j*2+1], bitlen[j*2+2] = {s = j*2, l = bit32.rshift(data:byte(pos+j), 4)}, {s = j*2+1, l = bit32.band(data:byte(pos+j), 0x0F)}
end
pos = pos + 16
else
for j = 0, 7 do
tmp, pos = (">I5"):unpack(data, pos)
bitlen[j*8+1] = {s = j*8+1, l = math.floor(tmp / 0x800000000)}
bitlen[j*8+2] = {s = j*8+2, l = math.floor(tmp / 0x40000000) % 32}
for k = 3, 8 do bitlen[j*8+k] = {s = j*8+k, l = bit32.extract(tmp, (8-k)*5, 5)} end
end
end
do
local j = 1
while j <= #bitlen do
if bitlen[j].l == 0 then table.remove(bitlen, j)
else j = j + 1 end
end
end
if #bitlen == 0 then
-- screen is solid character
solidchar = data:byte(pos)
pos = pos + 1
else
-- reconstruct codes from bit lengths
table.sort(bitlen, function(a, b) if a.l == b.l then return a.s < b.s else return a.l < b.l end end)
bitlen[1].c = 0
for j = 2, #bitlen do bitlen[j].c = bit32.lshift(bitlen[j-1].c + 1, bitlen[j].l - bitlen[j-1].l) end
-- create tree from codes
for j = 1, #bitlen do
local c = bitlen[j].c
local node = codetree
for k = bitlen[j].l - 1, 1, -1 do
local n = bit32.extract(c, k, 1)
if not node[n] then node[n] = {} end
node = node[n]
if type(node) == "number" then error(("Invalid tree state: position %X, frame %d, #bitlen = %d, current entry = %d"):format(pos, i, #bitlen, j)) end
end
local n = bit32.extract(c, 0, 1)
node[n] = bitlen[j].s
end
-- read first byte
tmp, tmppos, pos = data:byte(pos), 7, pos + 1
end
else readField() end
for y = 1, height do
local line = {"", "", "", {}}
for x = 1, width do
if pos + 5 + 1 >= #data then print(i, pos, x, y) error() end
local n = readField()
line[1] = line[1] .. string.char(128 + (n % 0x20))
line[4][x] = bit32.btest(n, 0x20)
end
frame[y] = line
end
if customcompress then
if tmppos == 7 then pos = pos - 1 end
codetree = {}
-- MARK: Huffman tree reconstruction
-- read bit lengths
local bitlen = {}
for j = 0, 11 do
bitlen[j*2+1], bitlen[j*2+2] = {s = j*2, l = bit32.rshift(data:byte(pos+j), 4)}, {s = j*2+1, l = bit32.band(data:byte(pos+j), 0x0F)}
end
pos = pos + 12
do
local j = 1
while j <= #bitlen do
if bitlen[j].l == 0 then table.remove(bitlen, j)
else j = j + 1 end
end
end
if #bitlen == 0 then
-- screen is solid color
solidchar = data:byte(pos)
pos = pos + 1
runlen = math.huge
else
-- reconstruct codes from bit lengths
table.sort(bitlen, function(a, b) if a.l == b.l then return a.s < b.s else return a.l < b.l end end)
bitlen[1].c = 0
for j = 2, #bitlen do bitlen[j].c = bit32.lshift(bitlen[j-1].c + 1, bitlen[j].l - bitlen[j-1].l) end
-- create tree from codes
for j = 1, #bitlen do
local c = bitlen[j].c
local node = codetree
for k = bitlen[j].l - 1, 1, -1 do
local n = bit32.extract(c, k, 1)
if not node[n] then node[n] = {} end
node = node[n]
if type(node) == "number" then error(("Invalid tree state: position %X, frame %d, #bitlen = %d, current entry = %d"):format(pos, i, #bitlen, j)) end
end
local n = bit32.extract(c, 0, 1)
node[n] = bitlen[j].s
end
-- read first byte
tmp, tmppos, pos = data:byte(pos), 7, pos + 1
end
for y = 1, height do
local line = frame[y]
for x = 1, width do
local c = readField(true)
line[2] = line[2] .. hexstr:sub(c+1, c+1)
end
end
runlen = nil
for y = 1, height do
local line = frame[y]
for x = 1, width do
local c = readField(true)
line[3] = line[3] .. hexstr:sub(c+1, c+1)
end
end
if tmppos == 7 then pos = pos - 1 end
else
for y = 1, height do
local line = frame[y]
for x = 1, width do
local c = data:byte(pos)
pos = pos + 1
if line[4][x] then c = bit32.bor(bit32.band(bit32.lshift(c, 4), 0xF0), bit32.rshift(c, 4)) end
line[2] = line[2] .. hexstr:sub(bit32.band(c, 15)+1, bit32.band(c, 15)+1)
line[3] = line[3] .. hexstr:sub(bit32.rshift(c, 4)+1, bit32.rshift(c, 4)+1)
end
line[4] = nil
end
end
for n = 1, 16 do frame.palette[n], pos = {data:byte(pos) / 255, data:byte(pos+1) / 255, data:byte(pos+2) / 255}, pos + 3 end
video[i] = frame
end
elseif frameType == 1 and not audio then
audio = {}
if bit32.band(flags, 12) == 0 then
for i = 1, math.ceil(size / 48000) do
local data
if jit then
data = {}
for j = 0, 5 do
local t = {file.read(math.min(size - (i-1) * 48000 - j * 8000, 8000)):byte(1, -1)}
if #t > 0 then for k = 1, #t do data[j*8000+k] = t[k] end end
end
else data = {file.read(math.min(size - (i-1) * 48000, 48000)):byte(1, -1)} end
for j = 1, #data do data[j] = data[j] - 128 end
audio[i] = data
end
elseif bit32.band(flags, 12) == 4 then
local decode = dfpwm.make_decoder()
for i = 1, math.ceil(size / 6000) do
local data = file.read(math.min(size - (i-1)*6000, 6000))
if not data then break end
audio[i] = decode(data)
end
end
elseif frameType == 8 and not subtitles then
subtitles = {}
for _ = 1, nFrames do
local start, length, x, y, color, sz = ("<IIHHBxH"):unpack(file.read(16))
local text = file.read(sz)
local sub = {text, hexstr:sub(bit32.band(color, 15)+1, bit32.band(color, 15)+1):rep(#text),
hexstr:sub(bit32.rshift(color, 4)+1, bit32.rshift(color, 4)+1):rep(#text), x = x, y = y}
for n = start, start + length - 1 do
subtitles[n] = subtitles[n] or {}
subtitles[n][#subtitles[n]+1] = sub
end
end
end
end
file.close()
if not video then error("No video stream found") end
sleep(0)
local speaker = peripheral.find "speaker"
term.clear()
local ok, err = pcall(parallel.waitForAll, function()
local start = os.epoch "utc"
for f, image in ipairs(video) do
for i, v in ipairs(image.palette) do term.setPaletteColor(2^(i-1), table.unpack(v)) end
for y, r in ipairs(image) do
term.setCursorPos(1, y)
term.blit(table.unpack(r))
end
if subtitles and subtitles[f-1] then
for _, v in ipairs(subtitles[f-1]) do
term.setCursorPos(v.x, v.y)
term.blit(table.unpack(v))
end
end
while os.epoch "utc" < start + (f + 1) / fps * 1000 do sleep(1 / fps) end
end
end, function()
if not speaker or not speaker.playAudio or not audio then return end
for _, chunk in ipairs(audio) do
while not speaker.playAudio(chunk) do repeat local ev, sp = os.pullEvent("speaker_audio_empty") until sp == peripheral.getName(speaker) end
end
end)
for i = 0, 15 do term.setPaletteColor(2^i, term.nativePaletteColor(2^i)) end
term.setBackgroundColor(colors.black)
term.setTextColor(colors.white)
term.setCursorPos(1, 1)
term.clear()
if not ok then printError(err) end

76
Demo/SanjuuniApi-Demo/lib/bimg-player.lua
View File

@@ -1,76 +0,0 @@
-- bimg-player from sanjuuni
-- Licensed in the public domain/CC0
local path = ...
if not path then error("Usage: bimg-player <file.bimg>") end
local file, err = fs.open(shell.resolve(path), "rb")
if not file then error("Could not open file: " .. err) end
local img = textutils.unserialize(file.readAll())
file.close()
local function drawFrame(frame, term)
for y, row in ipairs(frame) do
term.setCursorPos(1, y)
term.blit(table.unpack(row))
end
if frame.palette then for i = 0, #frame.palette do
local c = frame.palette[i]
if type(c) == "table" then term.setPaletteColor(2^i, table.unpack(c))
else term.setPaletteColor(2^i, c) end
end end
if img.multiMonitor then term.setTextScale(img.multiMonitor.scale or 0.5) end
end
if img.multiMonitor then
local width, height = img.multiMonitor.width, img.multiMonitor.height
local monitors = settings.get('sanjuuni.multimonitor')
if not monitors or #monitors < height or #monitors[1] < width then
term.clear()
term.setCursorPos(1, 1)
print('This image needs monitors to be calibrated before being displayed. Please right-click each monitor in order, from the top left corner to the bottom right corner, going right first, then down.')
monitors = {}
local names = {}
for y = 1, height do
monitors[y] = {}
for x = 1, width do
local _, oy = term.getCursorPos()
for ly = 1, height do
term.setCursorPos(3, oy + ly - 1)
term.clearLine()
for lx = 1, width do term.blit('\x8F ', (lx == x and ly == y) and '00' or '77', 'ff') end
end
term.setCursorPos(3, oy + height)
term.write('(' .. x .. ', ' .. y .. ')')
term.setCursorPos(1, oy)
repeat
local _, name = os.pullEvent('monitor_touch')
monitors[y][x] = name
until not names[name]
names[monitors[y][x]] = true
sleep(0.25)
end
end
settings.set('sanjuuni.multimonitor', monitors)
settings.save()
print('Calibration complete. Settings have been saved for future use.')
end
for i = 1, #img, width * height do
for y = 1, height do
for x = 1, width do
drawFrame(img[i + (y-1) * width + x-1], peripheral.wrap(monitors[y][x]))
end
end
if img.animation then sleep(img[i].duration or img.secondsPerFrame or 0.05)
else read() break end
end
else
term.clear()
for _, frame in ipairs(img) do
drawFrame(frame, term)
if img.animation then sleep(frame.duration or img.secondsPerFrame or 0.05)
else read() break end
end
term.setBackgroundColor(colors.black)
term.setTextColor(colors.white)
term.clear()
term.setCursorPos(1, 1)
for i = 0, 15 do term.setPaletteColor(2^i, term.nativePaletteColor(2^i)) end
end

83
Demo/SanjuuniApi-Demo/lib/raw-player.lua
View File

@@ -1,83 +0,0 @@
-- raw-player from sanjuuni
-- Licensed under the MIT license
local b64str = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
local function base64decode(str)
local retval = ""
for s in str:gmatch "...." do
if s:sub(3, 4) == '==' then
retval = retval .. string.char(bit32.bor(bit32.lshift(b64str:find(s:sub(1, 1)) - 1, 2), bit32.rshift(b64str:find(s:sub(2, 2)) - 1, 4)))
elseif s:sub(4, 4) == '=' then
local n = (b64str:find(s:sub(1, 1))-1) * 4096 + (b64str:find(s:sub(2, 2))-1) * 64 + (b64str:find(s:sub(3, 3))-1)
retval = retval .. string.char(bit32.extract(n, 10, 8)) .. string.char(bit32.extract(n, 2, 8))
else
local n = (b64str:find(s:sub(1, 1))-1) * 262144 + (b64str:find(s:sub(2, 2))-1) * 4096 + (b64str:find(s:sub(3, 3))-1) * 64 + (b64str:find(s:sub(4, 4))-1)
retval = retval .. string.char(bit32.extract(n, 16, 8)) .. string.char(bit32.extract(n, 8, 8)) .. string.char(bit32.extract(n, 0, 8))
end
end
return retval
end
local file, err = fs.open(shell.resolve(...), "r")
if not file then error(err) end
if file.readLine() ~= "32Vid 1.1" then error("Unsupported file") end
local fps = tonumber(file.readLine())
local first, second = file.readLine(), file.readLine()
if second == "" or second == nil then fps = 0 end
term.clear()
while true do
local frame
if first then frame, first = first, nil
elseif second then frame, second = second, nil
else frame = file.readLine() end
if frame == "" or frame == nil then break end
local mode = frame:match("^!CP([CD])")
if not mode then error("Invalid file") end
local b64data
if mode == "C" then
local len = tonumber(frame:sub(5, 8), 16)
b64data = frame:sub(9, len + 8)
else
local len = tonumber(frame:sub(5, 16), 16)
b64data = frame:sub(17, len + 16)
end
local data = base64decode(b64data)
-- TODO: maybe verify checksums?
assert(data:sub(1, 4) == "\0\0\0\0" and data:sub(9, 16) == "\0\0\0\0\0\0\0\0", "Invalid file")
local width, height = ("HH"):unpack(data, 5)
local c, n, pos = string.unpack("c1B", data, 17)
local text = {}
for y = 1, height do
text[y] = ""
for x = 1, width do
text[y] = text[y] .. c
n = n - 1
if n == 0 then c, n, pos = string.unpack("c1B", data, pos) end
end
end
c = c:byte()
for y = 1, height do
local fg, bg = "", ""
for x = 1, width do
fg, bg = fg .. ("%x"):format(bit32.band(c, 0x0F)), bg .. ("%x"):format(bit32.rshift(c, 4))
n = n - 1
if n == 0 then c, n, pos = string.unpack("BB", data, pos) end
end
term.setCursorPos(1, y)
term.blit(text[y], fg, bg)
end
pos = pos - 2
local r, g, b
for i = 0, 15 do
r, g, b, pos = string.unpack("BBB", data, pos)
term.setPaletteColor(2^i, r / 255, g / 255, b / 255)
end
if fps == 0 then read() break
else sleep(1 / fps) end
end
file.close()
for i = 0, 15 do term.setPaletteColor(2^i, term.nativePaletteColor(2^i)) end
term.setBackgroundColor(colors.black)
term.setTextColor(colors.white)
term.clear()
term.setCursorPos(1, 1)

117
LICENSE Normal file
View File

@@ -0,0 +1,117 @@
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too.
When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.
We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations.
Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and modification follow.
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program.
You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License.
c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program.
In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License.
3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable.
If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License.
7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice.
This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation.
10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found.
one line to give the program's name and an idea of what it does. Copyright (C) yyyy name of author
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker.
signature of Ty Coon, 1 April 1989 Ty Coon, President of Vice