backup: mushclient

This commit is contained in:
2023-09-26 10:28:39 +03:00
parent 769043ff6c
commit 34a2832f04
493 changed files with 321664 additions and 1 deletions

View File

@@ -55,7 +55,7 @@ home() {
backup | b)
rsync -vtr "$HOME/Library/Application Support/CrossOver/Bottles/MushClient/drive_c/users/crossover/MUSHclient" "$DOTFILES/synced/"
echo_yellow "Copied Mushclient profile to synced folder."
git -C "$DOTFILES" add "$DOFTILES/synced/MUSHClient"
git -C "$DOTFILES" add "$DOTFILES/synced/MUSHclient"
git -C "$DOTFILES" commit -m "backup: mushclient"
git -C "$DOTFILES" push
echo_yellow "Backup complete."

View File

@@ -0,0 +1,11 @@
<html>
<head>
<meta http-equiv="Refresh" content="0; url=https://github.com/fiendish/aardwolfclientpackage/wiki" />
</head>
<body>
<h1>LOADING...</h1>
<a href="https://github.com/fiendish/aardwolfclientpackage/wiki">https://github.com/fiendish/aardwolfclientpackage/wiki</a>
<p>If you see this message for more than a few seconds, please click on the link above!</p>
</body>
</html>

Binary file not shown.

Binary file not shown.

Binary file not shown.

File diff suppressed because it is too large Load Diff

BIN
synced/MUSHclient/Dina.fon Normal file

Binary file not shown.

View File

@@ -0,0 +1,188 @@
-- ---------------------------------------------------------------
-- Example Trigger filters (paste into "filter by" script box
-- in the trigger list).
-- ---------------------------------------------------------------
function send_to_script (name, trigger)
return trigger.send_to == sendto.script and
trigger.enabled
end -- send_to_script
function enabled (name, trigger)
return trigger.enabled
end -- enabled
function disabled (name, trigger)
return not trigger.enabled
end -- disabled
function keep_evaluating (name, trigger)
return trigger.keep_evaluating
end -- keep_evaluating
function badscript (name, trigger)
return not trigger.script_valid and
trigger.script ~= ""
end -- badscript
function temporary (name, trigger)
return trigger.temporary
end -- temporary
function matched (name, trigger)
return trigger.times_matched > 0
end -- matched
function unmatched (name, trigger)
return trigger.times_matched == 0
end -- unmatched
-- if they cancel, show everything
function everything (name, trigger)
return true
end -- everything
-- choose which function to use
result = utils.listbox ("Choose type of filtering", "Triggers",
{
send_to_script = "Send to script and enabled",
enabled = "Enabled items",
disabled = "Disabled items",
badscript = "Script name not found",
keep_evaluating = "Keep evaluating",
temporary = "Temporary triggers",
matched = "Ones that matched something",
unmatched = "Ones that never matched",
},
"badscript") -- default
-- use that function
filter = _G [result] or everything
-- ---------------------------------------------------------------
-- Example Alias filters (paste into "filter by" script box
-- in the alias list).
-- ---------------------------------------------------------------
function send_to_script (name, alias)
return alias.send_to == sendto.script and
alias.enabled
end -- send_to_script
function enabled (name, alias)
return alias.enabled
end -- enabled
function disabled (name, alias)
return not alias.enabled
end -- disabled
function keep_evaluating (name, alias)
return alias.keep_evaluating
end -- keep_evaluating
function badscript (name, alias)
return not alias.script_valid and
alias.script ~= ""
end -- badscript
function temporary (name, alias)
return alias.temporary
end -- temporary
function matched (name, alias)
return alias.times_matched > 0
end -- matched
function unmatched (name, alias)
return alias.times_matched == 0
end -- unmatched
-- if they cancel, show everything
function everything (name, alias)
return true
end -- everything
-- choose which function to use
result = utils.listbox ("Choose type of filtering", "Aliases",
{
send_to_script = "Send to script and enabled",
enabled = "Enabled items",
disabled = "Disabled items",
badscript = "Script name not found",
keep_evaluating = "Keep evaluating",
temporary = "Temporary aliases",
matched = "Ones that matched something",
unmatched = "Ones that never matched",
},
"badscript") -- default
-- use that function
filter = _G [result] or everything
-- ---------------------------------------------------------------
-- Example Timer filters (paste into "filter by" script box
-- in the timer list).
-- ---------------------------------------------------------------
function send_to_script (name, timer)
return timer.send_to == sendto.script and
timer.enabled
end -- send_to_script
function enabled (name, timer)
return timer.enabled
end -- enabled
function disabled (name, timer)
return not timer.enabled
end -- disabled
function one_shot (name, timer)
return timer.one_shot
end -- one_shot
function badscript (name, timer)
return not timer.script_valid and
timer.script ~= ""
end -- badscript
function temporary (name, timer)
return timer.temporary
end -- temporary
function fired (name, timer)
return timer.times_fired > 0
end -- fired
function not_fired (name, timer)
return timer.times_fired == 0
end -- not_fired
-- if they cancel, show everything
function everything (name, timer)
return true
end -- everything
-- choose which function to use
result = utils.listbox ("Choose type of filtering", "Timers",
{
send_to_script = "Send to script and enabled",
enabled = "Enabled items",
disabled = "Disabled items",
badscript = "Script name not found",
one_shot = "One-shot timers",
temporary = "Temporary timers",
fired = "Ones that fired",
not_fired = "Ones that never fired",
},
"badscript") -- default
-- use that function
filter = _G [result] or everything

Binary file not shown.

BIN
synced/MUSHclient/MUSHclient.exe Executable file

Binary file not shown.

View File

@@ -0,0 +1,77 @@
[CtrlBars-Summary]
Bars=7
ScreenCX=5120
ScreenCY=1440
[CtrlBars-Bar0]
BarID=59392
XPos=-2
YPos=-2
Docking=1
MRUDockID=59419
MRUDockLeftPos=0
MRUDockTopPos=0
MRUDockRightPos=265
MRUDockBottomPos=26
MRUFloatStyle=8196
MRUFloatXPos=-15
MRUFloatYPos=0
[CtrlBars-Bar1]
BarID=59393
[CtrlBars-Bar2]
BarID=128
XPos=388
YPos=-2
MRUWidth=467
Docking=1
MRUDockID=59419
MRUDockLeftPos=388
MRUDockTopPos=0
MRUDockRightPos=866
MRUDockBottomPos=26
MRUFloatStyle=8196
MRUFloatXPos=-15
MRUFloatYPos=0
[CtrlBars-Bar3]
BarID=32944
XPos=1441
YPos=-2
Docking=1
MRUDockID=59419
MRUDockLeftPos=1441
MRUDockTopPos=0
MRUDockRightPos=1682
MRUDockBottomPos=26
MRUFloatStyle=8196
MRUFloatXPos=-15
MRUFloatYPos=0
[CtrlBars-Bar4]
BarID=32988
Visible=0
XPos=-2
YPos=-2
Docking=1
MRUDockID=0
MRUDockLeftPos=0
MRUDockTopPos=0
MRUDockRightPos=1007
MRUDockBottomPos=21
MRUFloatStyle=4
MRUFloatXPos=-15
MRUFloatYPos=0
[CtrlBars-Bar5]
BarID=59419
Bars=5
Bar#0=0
Bar#1=59392
Bar#2=128
Bar#3=32944
Bar#4=0
[CtrlBars-Bar6]
BarID=59422
Bars=3
Bar#0=0
Bar#1=32988
Bar#2=0
[Recent File List]
File1=C:\users\crossover\MUSHclient\worlds\Aardwolf.mcl
File2=.\worlds\Aardwolf.mcl

Binary file not shown.

Binary file not shown.

BIN
synced/MUSHclient/SnDdb.db Normal file

Binary file not shown.

Binary file not shown.

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,899 @@
flf2a$ 4 3 10 0 10 0 1920 96
Mini by Glenn Chappell 4/93
Includes ISO Latin-1
figlet release 2.1 -- 12 Aug 1994
Permission is hereby given to modify this font, as long as the
modifier's name is placed on a comment line.
Modified by Paul Burton <solution@earthlink.net> 12/96 to include new parameter
supported by FIGlet and FIGWin. May also be slightly modified for better use
of new full-width/kern/smush alternatives, but default output is NOT changed.
$$@
$$@
$$@
$$@@
@
|$@
o$@
@@
@
||$@
@
@@
@
-|-|-$@
-|-|-$@
@@
_$@
(|$ @
_|)$@
@@
@
O/$@
/O$@
@@
@
()$ @
(_X$@
@@
@
/$@
@
@@
@
/$@
|$ @
\$@@
@
\$ @
|$@
/$ @@
@
\|/$@
/|\$@
@@
@
_|_$@
|$ @
@@
@
@
o$@
/$@@
@
__$@
@
@@
@
@
o$@
@@
@
/$@
/$ @
@@
_$ @
/ \$@
\_/$@
@@
@
/|$@
|$@
@@
_$ @
)$@
/_$@
@@
_$ @
_)$@
_)$@
@@
@
|_|_$@
|$ @
@@
_$ @
|_$ @
_)$@
@@
_$ @
|_$ @
|_)$@
@@
__$@
/$@
/$ @
@@
_$ @
(_)$@
(_)$@
@@
_$ @
(_|$@
|$@
@@
@
o$@
o$@
@@
@
o$@
o$@
/$@@
@
/$@
\$@
@@
@
--$@
--$@
@@
@
\$@
/$@
@@
_$ @
)$@
o$ @
@@
__$ @
/ \$@
| (|/$@
\__$ @@
@
/\$ @
/--\$@
@@
_$ @
|_)$@
|_)$@
@@
_$@
/$ @
\_$@
@@
_$ @
| \$@
|_/$@
@@
_$@
|_$@
|_$@
@@
_$@
|_$@
|$ @
@@
__$@
/__$@
\_|$@
@@
@
|_|$@
| |$@
@@
___$@
|$ @
_|_$@
@@
@
|$@
\_|$@
@@
@
|/$@
|\$@
@@
@
|$ @
|_$@
@@
@
|\/|$@
| |$@
@@
@
|\ |$@
| \|$@
@@
_$ @
/ \$@
\_/$@
@@
_$ @
|_)$@
|$ @
@@
_$ @
/ \$@
\_X$@
@@
_$ @
|_)$@
| \$@
@@
__$@
(_$ @
__)$@
@@
___$@
|$ @
|$ @
@@
@
| |$@
|_|$@
@@
@
\ /$@
\/$ @
@@
@
\ /$@
\/\/$ @
@@
@
\/$@
/\$@
@@
@
\_/$@
|$ @
@@
__$@
/$@
/_$@
@@
_$@
|$ @
|_$@
@@
@
\$ @
\$@
@@
_$ @
|$@
_|$@
@@
/\$@
@
@
@@
@
@
@
__$@@
@
\$@
@
@@
@
_.$@
(_|$@
@@
@
|_$ @
|_)$@
@@
@
_$@
(_$@
@@
@
_|$@
(_|$@
@@
@
_$ @
(/_$@
@@
_$@
_|_$@
|$ @
@@
@
_$ @
(_|$@
_|$@@
@
|_$ @
| |$@
@@
@
o$@
|$@
@@
@
o$@
|$@
_|$@@
@
|$ @
|<$@
@@
@
|$@
|$@
@@
@
._ _$ @
| | |$@
@@
@
._$ @
| |$@
@@
@
_$ @
(_)$@
@@
@
._$ @
|_)$@
|$ @@
@
_.$@
(_|$@
|$@@
@
._$@
|$ @
@@
@
_$@
_>$@
@@
@
_|_$@
|_$@
@@
@
@
|_|$@
@@
@
@
\/$@
@@
@
@
\/\/$@
@@
@
@
><$@
@@
@
@
\/$@
/$ @@
@
_$ @
/_$@
@@
,-$@
_|$ @
|$ @
`-$@@
|$@
|$@
|$@
|$@@
-.$ @
|_$@
|$ @
-'$ @@
/\/$@
@
@
@@
o o$@
/\$ @
/--\$@
@@
o_o$@
/ \$@
\_/$@
@@
o o$@
| |$@
|_|$@
@@
o o$@
_.$@
(_|$@
@@
o o$@
_$ @
(_)$@
@@
o o$@
@
|_|$@
@@
_$ @
| )$@
| )$@
|$ @@
160 NO-BREAK SPACE
$$@
$$@
$$@
$$@@
161 INVERTED EXCLAMATION MARK
@
o$@
|$@
@@
162 CENT SIGN
@
|_$@
(__$@
|$ @@
163 POUND SIGN
_$ @
_/_`$ @
|___$@
@@
164 CURRENCY SIGN
@
`o'$@
' `$@
@@
165 YEN SIGN
@
_\_/_$@
--|--$@
@@
166 BROKEN BAR
|$@
|$@
|$@
|$@@
167 SECTION SIGN
_$@
($ @
()$@
_)$@@
168 DIAERESIS
o o$@
@
@
@@
169 COPYRIGHT SIGN
_$ @
|C|$@
`-'$@
@@
170 FEMININE ORDINAL INDICATOR
_.$@
(_|$@
---$@
@@
171 LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
@
//$@
\\$@
@@
172 NOT SIGN
@
__$ @
|$@
@@
173 SOFT HYPHEN
@
_$@
@
@@
174 REGISTERED SIGN
_$ @
|R|$@
`-'$@
@@
175 MACRON
__$@
@
@
@@
176 DEGREE SIGN
O$@
@
@
@@
177 PLUS-MINUS SIGN
@
_|_$@
_|_$@
@@
178 SUPERSCRIPT TWO
2$@
@
@
@@
179 SUPERSCRIPT THREE
3$@
@
@
@@
180 ACUTE ACCENT
/$@
@
@
@@
181 MICRO SIGN
@
@
|_|$@
|$ @@
182 PILCROW SIGN
__$ @
(| |$@
| |$@
@@
183 MIDDLE DOT
@
o$@
@
@@
184 CEDILLA
@
@
@
S$@@
185 SUPERSCRIPT ONE
1$@
@
@
@@
186 MASCULINE ORDINAL INDICATOR
_$ @
(_)$@
---$@
@@
187 RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK
@
\\$@
//$@
@@
188 VULGAR FRACTION ONE QUARTER
@
1/$@
/4$@
@@
189 VULGAR FRACTION ONE HALF
@
1/$@
/2$@
@@
190 VULGAR FRACTION THREE QUARTERS
@
3/$@
/4$@
@@
191 INVERTED QUESTION MARK
@
o$@
(_$@
@@
192 LATIN CAPITAL LETTER A WITH GRAVE
\$ @
/\$ @
/--\$@
@@
193 LATIN CAPITAL LETTER A WITH ACUTE
/$ @
/\$ @
/--\$@
@@
194 LATIN CAPITAL LETTER A WITH CIRCUMFLEX
/\$ @
/\$ @
/--\$@
@@
195 LATIN CAPITAL LETTER A WITH TILDE
/\/$@
/\$ @
/--\$@
@@
196 LATIN CAPITAL LETTER A WITH DIAERESIS
o o$@
/\$ @
/--\$@
@@
197 LATIN CAPITAL LETTER A WITH RING ABOVE
O$ @
/ \$ @
/---\$@
@@
198 LATIN CAPITAL LETTER AE
_$@
/|_$@
/-|_$@
@@
199 LATIN CAPITAL LETTER C WITH CEDILLA
_$@
/$ @
\_$@
S$@@
200 LATIN CAPITAL LETTER E WITH GRAVE
\_$@
|_$@
|_$@
@@
201 LATIN CAPITAL LETTER E WITH ACUTE
_/$@
|_$ @
|_$ @
@@
202 LATIN CAPITAL LETTER E WITH CIRCUMFLEX
/\$@
|_$ @
|_$ @
@@
203 LATIN CAPITAL LETTER E WITH DIAERESIS
o_o$@
|_$ @
|_$ @
@@
204 LATIN CAPITAL LETTER I WITH GRAVE
\__$@
|$ @
_|_$@
@@
205 LATIN CAPITAL LETTER I WITH ACUTE
__/$@
|$ @
_|_$@
@@
206 LATIN CAPITAL LETTER I WITH CIRCUMFLEX
/\$@
___$@
_|_$@
@@
207 LATIN CAPITAL LETTER I WITH DIAERESIS
o_o$@
|$ @
_|_$@
@@
208 LATIN CAPITAL LETTER ETH
_$ @
_|_\$@
|_/$@
@@
209 LATIN CAPITAL LETTER N WITH TILDE
/\/$@
|\ |$@
| \|$@
@@
210 LATIN CAPITAL LETTER O WITH GRAVE
\$ @
/ \$@
\_/$@
@@
211 LATIN CAPITAL LETTER O WITH ACUTE
/$ @
/ \$@
\_/$@
@@
212 LATIN CAPITAL LETTER O WITH CIRCUMFLEX
/\$@
/ \$@
\_/$@
@@
213 LATIN CAPITAL LETTER O WITH TILDE
/\/$@
/ \$@
\_/$@
@@
214 LATIN CAPITAL LETTER O WITH DIAERESIS
o_o$@
/ \$@
\_/$@
@@
215 MULTIPLICATION SIGN
@
@
X$@
@@
216 LATIN CAPITAL LETTER O WITH STROKE
__$ @
/ /\$@
\/_/$@
@@
217 LATIN CAPITAL LETTER U WITH GRAVE
\$ @
| |$@
|_|$@
@@
218 LATIN CAPITAL LETTER U WITH ACUTE
/$ @
| |$@
|_|$@
@@
219 LATIN CAPITAL LETTER U WITH CIRCUMFLEX
/\$@
| |$@
|_|$@
@@
220 LATIN CAPITAL LETTER U WITH DIAERESIS
o o$@
| |$@
|_|$@
@@
221 LATIN CAPITAL LETTER Y WITH ACUTE
/$ @
\_/$@
|$ @
@@
222 LATIN CAPITAL LETTER THORN
|_$ @
|_)$@
|$ @
@@
223 LATIN SMALL LETTER SHARP S
_$ @
| )$@
| )$@
|$ @@
224 LATIN SMALL LETTER A WITH GRAVE
\$ @
_.$@
(_|$@
@@
225 LATIN SMALL LETTER A WITH ACUTE
/$ @
_.$@
(_|$@
@@
226 LATIN SMALL LETTER A WITH CIRCUMFLEX
/\$@
_.$@
(_|$@
@@
227 LATIN SMALL LETTER A WITH TILDE
/\/$@
_.$@
(_|$@
@@
228 LATIN SMALL LETTER A WITH DIAERESIS
o o$@
_.$@
(_|$@
@@
229 LATIN SMALL LETTER A WITH RING ABOVE
O$ @
_.$@
(_|$@
@@
230 LATIN SMALL LETTER AE
@
___$ @
(_|/_$@
@@
231 LATIN SMALL LETTER C WITH CEDILLA
@
_$@
(_$@
S$@@
232 LATIN SMALL LETTER E WITH GRAVE
\$ @
_$ @
(/_$@
@@
233 LATIN SMALL LETTER E WITH ACUTE
/$ @
_$ @
(/_$@
@@
234 LATIN SMALL LETTER E WITH CIRCUMFLEX
/\$@
_$ @
(/_$@
@@
235 LATIN SMALL LETTER E WITH DIAERESIS
o o$@
_$ @
(/_$@
@@
236 LATIN SMALL LETTER I WITH GRAVE
\$@
@
|$@
@@
237 LATIN SMALL LETTER I WITH ACUTE
/$@
@
|$@
@@
238 LATIN SMALL LETTER I WITH CIRCUMFLEX
/\$@
@
|$ @
@@
239 LATIN SMALL LETTER I WITH DIAERESIS
o o$@
@
|$ @
@@
240 LATIN SMALL LETTER ETH
X$ @
\$ @
(_|$@
@@
241 LATIN SMALL LETTER N WITH TILDE
/\/$@
._$ @
| |$@
@@
242 LATIN SMALL LETTER O WITH GRAVE
\$ @
_$ @
(_)$@
@@
243 LATIN SMALL LETTER O WITH ACUTE
/$ @
_$ @
(_)$@
@@
244 LATIN SMALL LETTER O WITH CIRCUMFLEX
/\$@
_$ @
(_)$@
@@
245 LATIN SMALL LETTER O WITH TILDE
/\/$@
_$ @
(_)$@
@@
246 LATIN SMALL LETTER O WITH DIAERESIS
o o$@
_$ @
(_)$@
@@
247 DIVISION SIGN
o$ @
---$@
o$ @
@@
248 LATIN SMALL LETTER O WITH STROKE
@
_$ @
(/)$@
@@
249 LATIN SMALL LETTER U WITH GRAVE
\$ @
@
|_|$@
@@
250 LATIN SMALL LETTER U WITH ACUTE
/$ @
@
|_|$@
@@
251 LATIN SMALL LETTER U WITH CIRCUMFLEX
/\$@
@
|_|$@
@@
252 LATIN SMALL LETTER U WITH DIAERESIS
o o$@
@
|_|$@
@@
253 LATIN SMALL LETTER Y WITH ACUTE
/$@
@
\/$@
/$ @@
254 LATIN SMALL LETTER THORN
@
|_$ @
|_)$@
|$ @@
255 LATIN SMALL LETTER Y WITH DIAERESIS
oo$@
@
\/$@
/$ @@

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,899 @@
flf2a$ 4 3 14 0 10 0 1920 96
SmShadow by Glenn Chappell 4/93 -- based on Small
Includes ISO Latin-1
figlet release 2.1 -- 12 Aug 1994
Permission is hereby given to modify this font, as long as the
modifier's name is placed on a comment line.
Modified by Paul Burton <solution@earthlink.net> 12/96 to include new parameter
supported by FIGlet and FIGWin. May also be slightly modified for better use
of new full-width/kern/smush alternatives, but default output is NOT changed.
$$@
$$@
$$@
$$@@
|$@
_|$@
_)$@
@@
| )$@
V V$ @
@
@@
| |$ @
_ |_ |_|$@
_ |_ |_|$@
_| _|$ @@
|$ @
(_-<$@
_ _/$@
_|$ @@
_) /$ @
/$ @
_/ _)$@
@@
_|$ @
_| _|$@
\____|$ @
@@
)$@
/$ @
@
@@
/$@
|$ @
|$ @
\_\$@@
\ \$ @
|$@
|$@
_/$ @@
\ \ /$ @
_ _|$@
_/ _\$ @
@@
|$ @
__ __|$@
_|$ @
@@
@
@
)$@
/$ @@
@
____|$@
@
@@
@
@
_)$@
@@
/$@
/$ @
_/$ @
@@
\$ @
( |$@
\__/$ @
@@
_ |$@
|$@
_|$@
@@
_ )$@
/$ @
___|$@
@@
__ /$@
_ \$@
___/$@
@@
| |$ @
__ _|$@
_|$ @
@@
__|$@
__ \$@
___/$@
@@
/$ @
_ \$@
\___/$@
@@
__ /$@
/$ @
_/$ @
@@
_ )$@
_ \$@
\___/$@
@@
_ \$@
\_ /$@
_/$ @
@@
_)$@
@
_)$@
@@
_)$@
@
)$@
/$ @@
/$@
< <$ @
\_\$@
@@
@
____|$@
____|$@
@@
\ \$ @
> >$@
_/$ @
@@
__ \$@
_/$@
_)$ @
@@
__ \$ @
/ _` |$@
\__,_|$@
\____/$ @@
\$ @
_ \$ @
_/ _\$@
@@
_ )$@
_ \$@
___/$@
@@
__|$@
($ @
\___|$@
@@
_ \$ @
| |$@
___/$ @
@@
__|$@
_|$ @
___|$@
@@
__|$@
_|$ @
_|$ @
@@
__|$@
(_ |$@
\___|$@
@@
| |$@
__ |$@
_| _|$@
@@
_ _|$@
|$ @
___|$@
@@
|$@
\ |$@
\__/$ @
@@
| /$@
. <$ @
_|\_\$@
@@
|$ @
|$ @
____|$@
@@
\ |$@
|\/ |$@
_| _|$@
@@
\ |$@
. |$@
_|\_|$@
@@
_ \$ @
( |$@
\___/$ @
@@
_ \$@
__/$@
_|$ @
@@
_ \$ @
( |$@
\__\_\$@
@@
_ \$@
/$@
_|_\$@
@@
__|$@
\__ \$@
____/$@
@@
__ __|$@
|$ @
_|$ @
@@
| |$@
| |$@
\__/$ @
@@
\ \ /$@
\ \ /$ @
\_/$ @
@@
\ \ /$@
\ \ \ /$ @
\_/\_/$ @
@@
\ \ /$@
> <$ @
_/\_\$@
@@
\ \ /$@
\ /$ @
_|$ @
@@
__ /$@
/$ @
____|$@
@@
_|$@
|$ @
|$ @
__|$@@
\ \$ @
\ \$ @
\_\$@
@@
_ |$@
|$@
|$@
__|$@@
\$ @
/\|$@
@
@@
@
@
@
____|$@@
)$@
\|$@
@
@@
@
_` |$@
\__,_|$@
@@
|$ @
_ \$@
_.__/$@
@@
@
_|$@
\__|$@
@@
|$@
_` |$@
\__,_|$@
@@
@
-_)$@
\___|$@
@@
_|$@
_|$@
_|$ @
@@
@
_` |$@
\__, |$@
____/$ @@
|$ @
\$ @
_| _|$@
@@
_)$@
|$@
_|$@
@@
_)$@
|$@
|$@
__/$ @@
|$ @
| /$@
_\_\$@
@@
|$@
|$@
_|$@
@@
@
` \$ @
_|_|_|$@
@@
@
\$ @
_| _|$@
@@
@
_ \$@
\___/$@
@@
@
_ \$@
.__/$@
_|$ @@
@
_` |$@
\__, |$@
_|$@@
@
_|$@
_|$ @
@@
@
(_-<$@
___/$@
@@
|$ @
_|$@
\__|$@
@@
@
| |$@
\_,_|$@
@@
@
\ \ /$@
\_/$ @
@@
@
\ \ \ /$@
\_/\_/$ @
@@
@
\ \ /$@
_\_\$@
@@
@
| |$@
\_, |$@
___/$ @@
@
_ /$@
___|$@
@@
/$@
_ |$ @
|$ @
\_\$@@
|$@
|$@
|$@
_|$@@
\ \$ @
|_$@
|$ @
_/$ @@
\ |$@
/\/$ @
@
@@
_) \_)$@
_ \$ @
/ _\$@
@@
_) _)$@
__ \$@
\____/$@
@@
_) _)$@
| |$@
\__/$ @
@@
_) _)$@
_` |$@
\__,_|$@
@@
_) _)$@
_ \$@
\___/$@
@@
_) _)$@
| |$@
\_,_|$@
@@
_ \$@
|< <$@
|__/$@
_|$ @@
160 NO-BREAK SPACE
$$@
$$@
$$@
$$@@
161 INVERTED EXCLAMATION MARK
_)$@
|$@
_|$@
@@
162 CENT SIGN
|$ @
_)$@
\ _)$@
|$ @@
163 POUND SIGN
_\$ @
_ _|$ @
_,___|$@
@@
164 CURRENCY SIGN
\ . /$@
_ \$@
\/ /$@
@@
165 YEN SIGN
\ \ /$ @
__ __|$@
__ __|$@
_|$ @@
166 BROKEN BAR
|$@
_|$@
|$@
_|$@@
167 SECTION SIGN
_)$@
\ \$ @
\ \/$ @
__/$ @@
168 DIAERESIS
_) _)$@
@
@
@@
169 COPYRIGHT SIGN
\$ @
_| \$@
\ \__| /$@
\____/$ @@
170 FEMININE ORDINAL INDICATOR
_` |$@
\__,_|$@
_____|$@
@@
171 LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
/ /$@
< < <$ @
\_\_\$@
@@
172 NOT SIGN
____ |$@
_|$@
@
@@
173 SOFT HYPHEN
@
___|$@
@
@@
174 REGISTERED SIGN
\$ @
-) \$@
\ |\\ /$@
\____/$ @@
175 MACRON
___|$@
@
@
@@
176 DEGREE SIGN
.\$@
\_/$@
@
@@
177 PLUS-MINUS SIGN
|$ @
_ _|$@
_|$ @
_____|$@@
178 SUPERSCRIPT TWO
_ )$@
__|$@
@
@@
179 SUPERSCRIPT THREE
_ /$@
__)$@
@
@@
180 ACUTE ACCENT
_/$@
@
@
@@
181 MICRO SIGN
@
| |$@
.,_|$@
_|$ @@
182 PILCROW SIGN
|$@
\_ | |$@
_|_|$@
@@
183 MIDDLE DOT
@
_)$@
@
@@
184 CEDILLA
@
@
@
_)$@@
185 SUPERSCRIPT ONE
_ |$@
_|$@
@
@@
186 MASCULINE ORDINAL INDICATOR
_ \$@
\___/$@
____|$@
@@
187 RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK
\ \ \$ @
> > >$@
_/_/$ @
@@
188 VULGAR FRACTION ONE QUARTER
_ | /$ @
_| /_' |$@
_/ _|$@
@@
189 VULGAR FRACTION ONE HALF
_ | /$ @
_| /_ )$@
_/ __|$@
@@
190 VULGAR FRACTION THREE QUARTERS
_ / /$ @
__) /_' |$@
_/ _|$@
@@
191 INVERTED QUESTION MARK
_)$ @
/$ @
\___|$@
@@
192 LATIN CAPITAL LETTER A WITH GRAVE
\_\$ @
--\$ @
_/\_\$@
@@
193 LATIN CAPITAL LETTER A WITH ACUTE
_/$ @
--\$ @
_/\_\$@
@@
194 LATIN CAPITAL LETTER A WITH CIRCUMFLEX
/\\$ @
--\$ @
_/\_\$@
@@
195 LATIN CAPITAL LETTER A WITH TILDE
/ _/$ @
--\$ @
_/\_\$@
@@
196 LATIN CAPITAL LETTER A WITH DIAERESIS
_) \_)$@
_ \$ @
/ _\$@
@@
197 LATIN CAPITAL LETTER A WITH RING ABOVE
( )$ @
_ \$ @
_/ _\$@
@@
198 LATIN CAPITAL LETTER AE
, __|$@
_ _|$ @
_/ ___|$@
@@
199 LATIN CAPITAL LETTER C WITH CEDILLA
|$@
($ @
\___|$@
_)$ @@
200 LATIN CAPITAL LETTER E WITH GRAVE
\_\$@
-<$@
__<$@
@@
201 LATIN CAPITAL LETTER E WITH ACUTE
_/$@
-<$@
__<$@
@@
202 LATIN CAPITAL LETTER E WITH CIRCUMFLEX
/\\$@
-<$@
__<$@
@@
203 LATIN CAPITAL LETTER E WITH DIAERESIS
_) _)$@
-<$ @
__<$ @
@@
204 LATIN CAPITAL LETTER I WITH GRAVE
\_\$ @
_ _|$@
___|$@
@@
205 LATIN CAPITAL LETTER I WITH ACUTE
_/$ @
_ _|$@
___|$@
@@
206 LATIN CAPITAL LETTER I WITH CIRCUMFLEX
/\\$ @
_ _|$@
___|$@
@@
207 LATIN CAPITAL LETTER I WITH DIAERESIS
_) _)$@
_ _|$ @
___|$ @
@@
208 LATIN CAPITAL LETTER ETH
_ \$ @
_ _| |$@
___/$ @
@@
209 LATIN CAPITAL LETTER N WITH TILDE
/ _/$@
\ |$@
_|\_|$@
@@
210 LATIN CAPITAL LETTER O WITH GRAVE
\_\$ @
__ \$@
\____/$@
@@
211 LATIN CAPITAL LETTER O WITH ACUTE
_/$ @
__ \$@
\____/$@
@@
212 LATIN CAPITAL LETTER O WITH CIRCUMFLEX
/\\$ @
__ \$@
\____/$@
@@
213 LATIN CAPITAL LETTER O WITH TILDE
/ _/$ @
__ \$@
\____/$@
@@
214 LATIN CAPITAL LETTER O WITH DIAERESIS
_) _)$@
__ \$@
\____/$@
@@
215 MULTIPLICATION SIGN
\ \$@
, '$@
\/\/$@
@@
216 LATIN CAPITAL LETTER O WITH STROKE
_ /\$ @
( / |$@
\_/__/$ @
@@
217 LATIN CAPITAL LETTER U WITH GRAVE
\_\$ @
| |$@
\__/$ @
@@
218 LATIN CAPITAL LETTER U WITH ACUTE
_/$ @
| |$@
\__/$ @
@@
219 LATIN CAPITAL LETTER U WITH CIRCUMFLEX
/\\$ @
| |$@
\__/$ @
@@
220 LATIN CAPITAL LETTER U WITH DIAERESIS
_) _)$@
| |$@
\__/$ @
@@
221 LATIN CAPITAL LETTER Y WITH ACUTE
_/$ @
\ \ /$@
_|$ @
@@
222 LATIN CAPITAL LETTER THORN
|$ @
-_)$@
_|$ @
@@
223 LATIN SMALL LETTER SHARP S
_ \$@
|< <$@
|__/$@
_|$ @@
224 LATIN SMALL LETTER A WITH GRAVE
\_\$ @
_` |$@
\__,_|$@
@@
225 LATIN SMALL LETTER A WITH ACUTE
_/$ @
_` |$@
\__,_|$@
@@
226 LATIN SMALL LETTER A WITH CIRCUMFLEX
/\\$ @
_` |$@
\__,_|$@
@@
227 LATIN SMALL LETTER A WITH TILDE
/ _/$ @
_` |$@
\__,_|$@
@@
228 LATIN SMALL LETTER A WITH DIAERESIS
_) _)$@
_` |$@
\__,_|$@
@@
229 LATIN SMALL LETTER A WITH RING ABOVE
( )$ @
_` |$@
\__,_|$@
@@
230 LATIN SMALL LETTER AE
@
_` -_)$@
\__,___|$@
@@
231 LATIN SMALL LETTER C WITH CEDILLA
@
_|$@
\__|$@
_)$@@
232 LATIN SMALL LETTER E WITH GRAVE
\_\$ @
-_)$@
\___|$@
@@
233 LATIN SMALL LETTER E WITH ACUTE
_/$ @
-_)$@
\___|$@
@@
234 LATIN SMALL LETTER E WITH CIRCUMFLEX
/\\$ @
-_)$@
\___|$@
@@
235 LATIN SMALL LETTER E WITH DIAERESIS
_) _)$@
-_)$ @
\___|$ @
@@
236 LATIN SMALL LETTER I WITH GRAVE
\_\$@
|$@
_|$@
@@
237 LATIN SMALL LETTER I WITH ACUTE
_/$@
|$@
_|$@
@@
238 LATIN SMALL LETTER I WITH CIRCUMFLEX
/\\$@
|$ @
_|$ @
@@
239 LATIN SMALL LETTER I WITH DIAERESIS
_) _)$@
|$ @
_|$ @
@@
240 LATIN SMALL LETTER ETH
, \'$@
_` |$@
\___/$ @
@@
241 LATIN SMALL LETTER N WITH TILDE
/ _/$ @
' \$ @
_| _|$@
@@
242 LATIN SMALL LETTER O WITH GRAVE
\_\$ @
_ \$@
\___/$@
@@
243 LATIN SMALL LETTER O WITH ACUTE
_/$ @
_ \$@
\___/$@
@@
244 LATIN SMALL LETTER O WITH CIRCUMFLEX
/\\$ @
_ \$@
\___/$@
@@
245 LATIN SMALL LETTER O WITH TILDE
/ _/$@
_ \$@
\___/$@
@@
246 LATIN SMALL LETTER O WITH DIAERESIS
_) _)$@
_ \$@
\___/$@
@@
247 DIVISION SIGN
_)$ @
___|$@
_)$ @
@@
248 LATIN SMALL LETTER O WITH STROKE
@
/\$@
\_/_/$@
@@
249 LATIN SMALL LETTER U WITH GRAVE
\_\$ @
| |$@
\_,_|$@
@@
250 LATIN SMALL LETTER U WITH ACUTE
_/$ @
| |$@
\_,_|$@
@@
251 LATIN SMALL LETTER U WITH CIRCUMFLEX
/\\$ @
| |$@
\_,_|$@
@@
252 LATIN SMALL LETTER U WITH DIAERESIS
_) _)$@
| |$@
\_,_|$@
@@
253 LATIN SMALL LETTER Y WITH ACUTE
_/$ @
| |$@
\_, |$@
___/$ @@
254 LATIN SMALL LETTER THORN
|$ @
'_ \$@
.__/$@
_|$ @@
255 LATIN SMALL LETTER Y WITH DIAERESIS
_) _)$@
| |$@
\_, |$@
___/$ @@

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,600 @@
flf2a 1 1 2 -1 13 0 0 242
Terminal by Glenn Chappell 4/93
Includes characters 128-255
Enhanced for Latin-2,3,4 by John Cowan <cowan@ccil.org>
Latin character sets supported only if your screen font does
figlet release 2.2 -- November 1996
Permission is hereby given to modify this font, as long as the
modifier's name is placed on a comment line.
Double-checked by Paul Burton <solution@earthlink.net> 12/96. Added the new
parameter supported by FIGlet and FIGWin. Unlike all other FIGfonts, this one
is intended to produce output exactly the same as the input unless a control
file is used. Therefore it produces the SAME output for smush, kern or fit.
@
!@
"@
#@
$@
%@
&@
'@
(@
)@
*@
+@
,@
-@
.@
/@
0@
1@
2@
3@
4@
5@
6@
7@
8@
9@
:@
;@
<@
=@
>@
?@
@#
A@
B@
C@
D@
E@
F@
G@
H@
I@
J@
K@
L@
M@
N@
O@
P@
Q@
R@
S@
T@
U@
V@
W@
X@
Y@
Z@
[@
\@
]@
^@
_@
`@
a@
b@
c@
d@
e@
f@
g@
h@
i@
j@
k@
l@
m@
n@
o@
p@
q@
r@
s@
t@
u@
v@
w@
x@
y@
z@
{@
|@
}@
~@
<EFBFBD>@
<EFBFBD>@
<EFBFBD>@
<EFBFBD>@
<EFBFBD>@
<EFBFBD>@
<EFBFBD>@
128
<EFBFBD>@
129
<EFBFBD>@
130
<EFBFBD>@
131
<EFBFBD>@
132
<EFBFBD>@
133
<EFBFBD>@
134
<EFBFBD>@
135
<EFBFBD>@
136
<EFBFBD>@
137
<EFBFBD>@
138
<EFBFBD>@
139
<EFBFBD>@
140
<EFBFBD>@
141
<EFBFBD>@
142
<EFBFBD>@
143
<EFBFBD>@
144
<EFBFBD>@
145
<EFBFBD>@
146
<EFBFBD>@
147
<EFBFBD>@
148
<EFBFBD>@
149
<EFBFBD>@
150
<EFBFBD>@
151
<EFBFBD>@
152
<EFBFBD>@
153
<EFBFBD>@
154
<EFBFBD>@
155
<EFBFBD>@
156
<EFBFBD>@
157
<EFBFBD>@
158
<EFBFBD>@
159
<EFBFBD>@
160 NO-BREAK SPACE
<EFBFBD>@
161 INVERTED EXCLAMATION MARK
<EFBFBD>@
162 CENT SIGN
<EFBFBD>@
163 POUND SIGN
<EFBFBD>@
164 CURRENCY SIGN
<EFBFBD>@
165 YEN SIGN
<EFBFBD>@
166 BROKEN BAR
<EFBFBD>@
167 SECTION SIGN
<EFBFBD>@
168 DIAERESIS
<EFBFBD>@
169 COPYRIGHT SIGN
<EFBFBD>@
170 FEMININE ORDINAL INDICATOR
<EFBFBD>@
171 LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
<EFBFBD>@
172 NOT SIGN
<EFBFBD>@
173 SOFT HYPHEN
<EFBFBD>@
174 REGISTERED SIGN
<EFBFBD>@
175 MACRON
<EFBFBD>@
176 DEGREE SIGN
<EFBFBD>@
177 PLUS-MINUS SIGN
<EFBFBD>@
178 SUPERSCRIPT TWO
<EFBFBD>@
179 SUPERSCRIPT THREE
<EFBFBD>@
180 ACUTE ACCENT
<EFBFBD>@
181 MICRO SIGN
<EFBFBD>@
182 PILCROW SIGN
<EFBFBD>@
183 MIDDLE DOT
<EFBFBD>@
184 CEDILLA
<EFBFBD>@
185 SUPERSCRIPT ONE
<EFBFBD>@
186 MASCULINE ORDINAL INDICATOR
<EFBFBD>@
187 RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK
<EFBFBD>@
188 VULGAR FRACTION ONE QUARTER
<EFBFBD>@
189 VULGAR FRACTION ONE HALF
<EFBFBD>@
190 VULGAR FRACTION THREE QUARTERS
<EFBFBD>@
191 INVERTED QUESTION MARK
<EFBFBD>@
192 LATIN CAPITAL LETTER A WITH GRAVE
<EFBFBD>@
193 LATIN CAPITAL LETTER A WITH ACUTE
<EFBFBD>@
194 LATIN CAPITAL LETTER A WITH CIRCUMFLEX
<EFBFBD>@
195 LATIN CAPITAL LETTER A WITH TILDE
<EFBFBD>@
196 LATIN CAPITAL LETTER A WITH DIAERESIS
<EFBFBD>@
197 LATIN CAPITAL LETTER A WITH RING ABOVE
<EFBFBD>@
198 LATIN CAPITAL LETTER AE
<EFBFBD>@
199 LATIN CAPITAL LETTER C WITH CEDILLA
<EFBFBD>@
200 LATIN CAPITAL LETTER E WITH GRAVE
<EFBFBD>@
201 LATIN CAPITAL LETTER E WITH ACUTE
<EFBFBD>@
202 LATIN CAPITAL LETTER E WITH CIRCUMFLEX
<EFBFBD>@
203 LATIN CAPITAL LETTER E WITH DIAERESIS
<EFBFBD>@
204 LATIN CAPITAL LETTER I WITH GRAVE
<EFBFBD>@
205 LATIN CAPITAL LETTER I WITH ACUTE
<EFBFBD>@
206 LATIN CAPITAL LETTER I WITH CIRCUMFLEX
<EFBFBD>@
207 LATIN CAPITAL LETTER I WITH DIAERESIS
<EFBFBD>@
208 LATIN CAPITAL LETTER ETH
<EFBFBD>@
209 LATIN CAPITAL LETTER N WITH TILDE
<EFBFBD>@
210 LATIN CAPITAL LETTER O WITH GRAVE
<EFBFBD>@
211 LATIN CAPITAL LETTER O WITH ACUTE
<EFBFBD>@
212 LATIN CAPITAL LETTER O WITH CIRCUMFLEX
<EFBFBD>@
213 LATIN CAPITAL LETTER O WITH TILDE
<EFBFBD>@
214 LATIN CAPITAL LETTER O WITH DIAERESIS
<EFBFBD>@
215 MULTIPLICATION SIGN
<EFBFBD>@
216 LATIN CAPITAL LETTER O WITH STROKE
<EFBFBD>@
217 LATIN CAPITAL LETTER U WITH GRAVE
<EFBFBD>@
218 LATIN CAPITAL LETTER U WITH ACUTE
<EFBFBD>@
219 LATIN CAPITAL LETTER U WITH CIRCUMFLEX
<EFBFBD>@
220 LATIN CAPITAL LETTER U WITH DIAERESIS
<EFBFBD>@
221 LATIN CAPITAL LETTER Y WITH ACUTE
<EFBFBD>@
222 LATIN CAPITAL LETTER THORN
<EFBFBD>@
223 LATIN SMALL LETTER SHARP S
<EFBFBD>@
224 LATIN SMALL LETTER A WITH GRAVE
<EFBFBD>@
225 LATIN SMALL LETTER A WITH ACUTE
<EFBFBD>@
226 LATIN SMALL LETTER A WITH CIRCUMFLEX
<EFBFBD>@
227 LATIN SMALL LETTER A WITH TILDE
<EFBFBD>@
228 LATIN SMALL LETTER A WITH DIAERESIS
<EFBFBD>@
229 LATIN SMALL LETTER A WITH RING ABOVE
<EFBFBD>@
230 LATIN SMALL LETTER AE
<EFBFBD>@
231 LATIN SMALL LETTER C WITH CEDILLA
<EFBFBD>@
232 LATIN SMALL LETTER E WITH GRAVE
<EFBFBD>@
233 LATIN SMALL LETTER E WITH ACUTE
<EFBFBD>@
234 LATIN SMALL LETTER E WITH CIRCUMFLEX
<EFBFBD>@
235 LATIN SMALL LETTER E WITH DIAERESIS
<EFBFBD>@
236 LATIN SMALL LETTER I WITH GRAVE
<EFBFBD>@
237 LATIN SMALL LETTER I WITH ACUTE
<EFBFBD>@
238 LATIN SMALL LETTER I WITH CIRCUMFLEX
<EFBFBD>@
239 LATIN SMALL LETTER I WITH DIAERESIS
<EFBFBD>@
240 LATIN SMALL LETTER ETH
<EFBFBD>@
241 LATIN SMALL LETTER N WITH TILDE
<EFBFBD>@
242 LATIN SMALL LETTER O WITH GRAVE
<EFBFBD>@
243 LATIN SMALL LETTER O WITH ACUTE
<EFBFBD>@
244 LATIN SMALL LETTER O WITH CIRCUMFLEX
<EFBFBD>@
245 LATIN SMALL LETTER O WITH TILDE
<EFBFBD>@
246 LATIN SMALL LETTER O WITH DIAERESIS
<EFBFBD>@
247 DIVISION SIGN
<EFBFBD>@
248 LATIN SMALL LETTER O WITH STROKE
<EFBFBD>@
249 LATIN SMALL LETTER U WITH GRAVE
<EFBFBD>@
250 LATIN SMALL LETTER U WITH ACUTE
<EFBFBD>@
251 LATIN SMALL LETTER U WITH CIRCUMFLEX
<EFBFBD>@
252 LATIN SMALL LETTER U WITH DIAERESIS
<EFBFBD>@
253 LATIN SMALL LETTER Y WITH ACUTE
<EFBFBD>@
254 LATIN SMALL LETTER THORN
<EFBFBD>@
255 LATIN SMALL LETTER Y WITH DIAERESIS
<EFBFBD>@
0x0100 LATIN CAPITAL LETTER A WITH MACRON
<EFBFBD>@
0x0101 LATIN SMALL LETTER A WITH MACRON
<EFBFBD>@
0x0102 LATIN CAPITAL LETTER A WITH BREVE
<EFBFBD>@
0x0103 LATIN SMALL LETTER A WITH BREVE
<EFBFBD>@
0x0104 LATIN CAPITAL LETTER A WITH OGONEK
<EFBFBD>@
0x0105 LATIN SMALL LETTER A WITH OGONEK
<EFBFBD>@
0x0106 LATIN CAPITAL LETTER C WITH ACUTE
<EFBFBD>@
0x0107 LATIN SMALL LETTER C WITH ACUTE
<EFBFBD>@
0x0108 LATIN CAPITAL LETTER C WITH CIRCUMFLEX
<EFBFBD>@
0x0109 LATIN SMALL LETTER C WITH CIRCUMFLEX
<EFBFBD>@
0x010A LATIN CAPITAL LETTER C WITH DOT ABOVE
<EFBFBD>@
0x010B LATIN SMALL LETTER C WITH DOT ABOVE
<EFBFBD>@
0x010C LATIN CAPITAL LETTER C WITH CARON
<EFBFBD>@
0x010D LATIN SMALL LETTER C WITH CARON
<EFBFBD>@
0x010E LATIN CAPITAL LETTER D WITH CARON
<EFBFBD>@
0x010F LATIN SMALL LETTER D WITH CARON
<EFBFBD>@
0x0110 LATIN CAPITAL LETTER D WITH STROKE
<EFBFBD>@
0x0111 LATIN SMALL LETTER D WITH STROKE
<EFBFBD>@
0x0112 LATIN CAPITAL LETTER E WITH MACRON
<EFBFBD>@
0x0113 LATIN SMALL LETTER E WITH MACRON
<EFBFBD>@
0x0116 LATIN CAPITAL LETTER E WITH DOT ABOVE
<EFBFBD>@
0x0117 LATIN SMALL LETTER E WITH DOT ABOVE
<EFBFBD>@
0x0118 LATIN CAPITAL LETTER E WITH OGONEK
<EFBFBD>@
0x0119 LATIN SMALL LETTER E WITH OGONEK
<EFBFBD>@
0x011A LATIN CAPITAL LETTER E WITH CARON
<EFBFBD>@
0x011B LATIN SMALL LETTER E WITH CARON
<EFBFBD>@
0x011C LATIN CAPITAL LETTER G WITH CIRCUMFLEX
<EFBFBD>@
0x011D LATIN SMALL LETTER G WITH CIRCUMFLEX
<EFBFBD>@
0x011E LATIN CAPITAL LETTER G WITH BREVE
<EFBFBD>@
0x011F LATIN SMALL LETTER G WITH BREVE
<EFBFBD>@
0x0120 LATIN CAPITAL LETTER G WITH DOT ABOVE
<EFBFBD>@
0x0121 LATIN SMALL LETTER G WITH DOT ABOVE
<EFBFBD>@
0x0122 LATIN CAPITAL LETTER G WITH CEDILLA
<EFBFBD>@
0x0123 LATIN SMALL LETTER G WITH CEDILLA
<EFBFBD>@
0x0124 LATIN CAPITAL LETTER H WITH CIRCUMFLEX
<EFBFBD>@
0x0125 LATIN SMALL LETTER H WITH CIRCUMFLEX
<EFBFBD>@
0x0126 LATIN CAPITAL LETTER H WITH STROKE
<EFBFBD>@
0x0127 LATIN SMALL LETTER H WITH STROKE
<EFBFBD>@
0x0128 LATIN CAPITAL LETTER I WITH TILDE
<EFBFBD>@
0x0129 LATIN SMALL LETTER I WITH TILDE
<EFBFBD>@
0x012A LATIN CAPITAL LETTER I WITH MACRON
<EFBFBD>@
0x012B LATIN SMALL LETTER I WITH MACRON
<EFBFBD>@
0x012E LATIN CAPITAL LETTER I WITH OGONEK
<EFBFBD>@
0x012F LATIN SMALL LETTER I WITH OGONEK
<EFBFBD>@
0x0130 LATIN CAPITAL LETTER I WITH DOT ABOVE
<EFBFBD>@
0x0131 LATIN SMALL LETTER DOTLESS I
<EFBFBD>@
0x0134 LATIN CAPITAL LETTER J WITH CIRCUMFLEX
<EFBFBD>@
0x0135 LATIN SMALL LETTER J WITH CIRCUMFLEX
<EFBFBD>@
0x0136 LATIN CAPITAL LETTER K WITH CEDILLA
<EFBFBD>@
0x0137 LATIN SMALL LETTER K WITH CEDILLA
<EFBFBD>@
0x0138 LATIN SMALL LETTER KRA
<EFBFBD>@
0x0139 LATIN CAPITAL LETTER L WITH ACUTE
<EFBFBD>@
0x013A LATIN SMALL LETTER L WITH ACUTE
<EFBFBD>@
0x013B LATIN CAPITAL LETTER L WITH CEDILLA
<EFBFBD>@
0x013C LATIN SMALL LETTER L WITH CEDILLA
<EFBFBD>@
0x013D LATIN CAPITAL LETTER L WITH CARON
<EFBFBD>@
0x013E LATIN SMALL LETTER L WITH CARON
<EFBFBD>@
0x0141 LATIN CAPITAL LETTER L WITH STROKE
<EFBFBD>@
0x0142 LATIN SMALL LETTER L WITH STROKE
<EFBFBD>@
0x0143 LATIN CAPITAL LETTER N WITH ACUTE
<EFBFBD>@
0x0144 LATIN SMALL LETTER N WITH ACUTE
<EFBFBD>@
0x0145 LATIN CAPITAL LETTER N WITH CEDILLA
<EFBFBD>@
0x0146 LATIN SMALL LETTER N WITH CEDILLA
<EFBFBD>@
0x0147 LATIN CAPITAL LETTER N WITH CARON
<EFBFBD>@
0x0148 LATIN SMALL LETTER N WITH CARON
<EFBFBD>@
0x014A LATIN CAPITAL LETTER ENG
<EFBFBD>@
0x014B LATIN SMALL LETTER ENG
<EFBFBD>@
0x014C LATIN CAPITAL LETTER O WITH MACRON
<EFBFBD>@
0x014D LATIN SMALL LETTER O WITH MACRON
<EFBFBD>@
0x0150 LATIN CAPITAL LETTER O WITH DOUBLE ACUTE
<EFBFBD>@
0x0151 LATIN SMALL LETTER O WITH DOUBLE ACUTE
<EFBFBD>@
0x0154 LATIN CAPITAL LETTER R WITH ACUTE
<EFBFBD>@
0x0155 LATIN SMALL LETTER R WITH ACUTE
<EFBFBD>@
0x0156 LATIN CAPITAL LETTER R WITH CEDILLA
<EFBFBD>@
0x0157 LATIN SMALL LETTER R WITH CEDILLA
<EFBFBD>@
0x0158 LATIN CAPITAL LETTER R WITH CARON
<EFBFBD>@
0x0159 LATIN SMALL LETTER R WITH CARON
<EFBFBD>@
0x015A LATIN CAPITAL LETTER S WITH ACUTE
<EFBFBD>@
0x015B LATIN SMALL LETTER S WITH ACUTE
<EFBFBD>@
0x015C LATIN CAPITAL LETTER S WITH CIRCUMFLEX
<EFBFBD>@
0x015D LATIN SMALL LETTER S WITH CIRCUMFLEX
<EFBFBD>@
0x015E LATIN CAPITAL LETTER S WITH CEDILLA
<EFBFBD>@
0x015F LATIN SMALL LETTER S WITH CEDILLA
<EFBFBD>@
0x0160 LATIN CAPITAL LETTER S WITH CARON
<EFBFBD>@
0x0161 LATIN SMALL LETTER S WITH CARON
<EFBFBD>@
0x0162 LATIN CAPITAL LETTER T WITH CEDILLA
<EFBFBD>@
0x0163 LATIN SMALL LETTER T WITH CEDILLA
<EFBFBD>@
0x0164 LATIN CAPITAL LETTER T WITH CARON
<EFBFBD>@
0x0165 LATIN SMALL LETTER T WITH CARON
<EFBFBD>@
0x0166 LATIN CAPITAL LETTER T WITH STROKE
<EFBFBD>@
0x0167 LATIN SMALL LETTER T WITH STROKE
<EFBFBD>@
0x0168 LATIN CAPITAL LETTER U WITH TILDE
<EFBFBD>@
0x0169 LATIN SMALL LETTER U WITH TILDE
<EFBFBD>@
0x016A LATIN CAPITAL LETTER U WITH MACRON
<EFBFBD>@
0x016B LATIN SMALL LETTER U WITH MACRON
<EFBFBD>@
0x016C LATIN CAPITAL LETTER U WITH BREVE
<EFBFBD>@
0x016D LATIN SMALL LETTER U WITH BREVE
<EFBFBD>@
0x016E LATIN CAPITAL LETTER U WITH RING ABOVE
<EFBFBD>@
0x016F LATIN SMALL LETTER U WITH RING ABOVE
<EFBFBD>@
0x0170 LATIN CAPITAL LETTER U WITH DOUBLE ACUTE
<EFBFBD>@
0x0171 LATIN SMALL LETTER U WITH DOUBLE ACUTE
<EFBFBD>@
0x0172 LATIN CAPITAL LETTER U WITH OGONEK
<EFBFBD>@
0x0173 LATIN SMALL LETTER U WITH OGONEK
<EFBFBD>@
0x0179 LATIN CAPITAL LETTER Z WITH ACUTE
<EFBFBD>@
0x017A LATIN SMALL LETTER Z WITH ACUTE
<EFBFBD>@
0x017B LATIN CAPITAL LETTER Z WITH DOT ABOVE
<EFBFBD>@
0x017C LATIN SMALL LETTER Z WITH DOT ABOVE
<EFBFBD>@
0x017D LATIN CAPITAL LETTER Z WITH CARON
<EFBFBD>@
0x017E LATIN SMALL LETTER Z WITH CARON
<EFBFBD>@
0x02C7 CARON
<EFBFBD>@
0x02D8 BREVE
<EFBFBD>@
0x02D9 DOT ABOVE
<EFBFBD>@
0x02DB OGONEK
<EFBFBD>@
0x02DD DOUBLE ACUTE ACCENT
<EFBFBD>@

BIN
synced/MUSHclient/help.db Normal file

Binary file not shown.

View File

@@ -0,0 +1,30 @@
Copyright (C) 1991, 1993, 1994 Glenn Chappell and Ian Chai
Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001 John Cowan
Copyright (C) 2002 Christiaan Keet
Copyright (C) 2011 Claudio Matsuoka
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holders nor the names of their
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

View File

@@ -0,0 +1,28 @@
The following license is applied to all documents in this project with the
exception of the 'tests' directory at the root.
The 'tests' directory is dual-licenses Public Domain / MIT, whichever is
least restrictive in your legal jurisdiction.
The MIT License
Copyright (c) 2008 Thomas Harning Jr. <harningt@gmail.com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
--

View File

@@ -0,0 +1,7 @@
Copyright © 2008 Lua.org, PUC-Rio.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

View File

@@ -0,0 +1,24 @@
Copyright (c) 2007, 2008 Yuri Takhteyev
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
--

View File

@@ -0,0 +1,24 @@
===============================================================================
LuaCOM is available under the same terms and conditions as the Lua language.
Copyright (C) 1998-2005 Tecgraf, PUC-Rio
Authors: V. Almendra, R. Cerqueira, F. Mascarenhas, and others.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
===============================================================================

View File

@@ -0,0 +1,56 @@
===============================================================================
LuaJIT -- a Just-In-Time Compiler for Lua. https://luajit.org/
Copyright (C) 2005-2020 Mike Pall. All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
[ MIT license: https://www.opensource.org/licenses/mit-license.php ]
===============================================================================
[ LuaJIT includes code from Lua 5.1/5.2, which has this license statement: ]
Copyright (C) 1994-2012 Lua.org, PUC-Rio.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
===============================================================================
[ LuaJIT includes code from dlmalloc, which has this license statement: ]
This is a version (aka dlmalloc) of malloc/free/realloc written by
Doug Lea and released to the public domain, as explained at
https://creativecommons.org/licenses/publicdomain
===============================================================================

View File

@@ -0,0 +1,206 @@
LuaJSON(3)
==========
:Author: Thomas Harning
:Email: harningt@gmail.com
:Date: 2009/04/29
NAME
----
luajson - JSON encoder/decoder for Lua
SYNOPSIS
--------
require("json")
json.decode("json-string" [, parameters])
json.decode.getDecoder(parameters)
json.encode(lua_value [, parameters])
json.encode.getEncoder(parameters)
DESCRIPTION
-----------
json.decode("json-string" [, parameters])::
Obtains a JSON decoder using `getDecoder` with the parameters specified,
then performs the decoding operation.
json.encode(lua_value [, parameters])::
Obtains a JSON encoder using `getEncoder` with the parameters specified,
then performs the encoding operation.
json.decode.getDecoder(parameters)::
Obtains a JSON decoder configured with the given parameters or defaults.
json.encode.getEncoder(parameters)::
Obtains a JSON encoder configured with the given parameters or defaults.
json.encode.strict::
A default parameter specification containing 'strict' rules for encoding
json.decode.strict::
A default parameter specification containing 'strict' rules for decoding
=== COMMON PARAMETERS
initialObject : boolean::
Specifies if the outermost element be an array or object
allowUndefined : boolean::
Specifies if 'undefined' is an allowed value
null : any::
Placeholder object for null values
undefined : any::
Placeholder for undefined values
number.nan : boolean::
Specifies if NaN is an allowed value
number.inf : boolean::
Specifies if +/-Infinity is an allowed value
=== ENCODER-SPECIFIC PARAMETERS
preProcess : `function(object)`::
Called for every value to be encoded, optionally altering.
If returns `nil` then no value change occurs.
output : function::
Function that returns an encoder specification (TBD), if null
default used that returns a string.
array.isArray : `function(object)`::
If `true`/`false` returned, then the value is authoritatively
an array or not
strings.xEncode : boolean::
Specifies if binary values are to be encoded with \xNN rather than \uNNNN
strings.encodeSet : string::
http://www.lua.org/manual/5.1/manual.html#5.4.1[gmatch-style] set of
characters that need to be escaped (to be contained in `[]`)
strings.encodeSetAppend : string::
Set of characters that need to be escaped (to be contained in `[]`).
Appended to the current encodeSet.
==== Default Configuration
[source,lua]
----
array.isArray == json-util's isArray implementation
allowUndefined = true
number.nan = true
number.inf = true
strings.xEncode = false
strings.encodeSet = '\\"/%z\1-\031'
----
==== Strict Configuration
[source,lua]
----
initialObject = true
allowUndefined = false
number.nan = false
number.inf = false
----
=== DECODER-SPECIFIC PARAMETERS
unicodeWhitespace : boolean::
Specifies if unicode whitespace characters are counted
array.trailingComma / object.trailingComma : boolean::
Specifies if extraneous trailing commas are ignored in declaration
calls.defs : map<string | LPEG, function | boolean>::
Defines set of specifically permitted function definitions.
If boolean value, determines if allowed or not, decoded as a call object.
Function return-value is the decoded result.
Function definition: `function(name, [arguments])` : output-value
calls.allowUndefined : boolean::
Specifies if undefined call definitions are decoded as call objects.
number.frac : boolean::
Specifies if numbers can have a decimal component (ex: `.01`)
number.exp : boolean::
Specifies if exponents are allowed (ex: `1e2`)
number.hex : boolean::
Specifies if hexadecimal numbers are allowed (ex: `0xDEADBEEF`)
object.number : boolean::
Specifies if numbers can be object keys
object.identifier : boolean::
Specifies if unquoted 'identifiers' can be object keys (matching `[A-Za-z_][A-Za-z0-9_]*`)
strings.badChars : string::
Set of characters that should not be present in a string
strings.additionalEscapes : LPeg expression::
LPeg expression to handle output (ex: `lpeg.C(1)` would take `\k` and spit out `k`)
strings.escapeCheck : non-consuming LPeg expression::
LPeg expression to check if a given character is allowed to be an escape value
strings.decodeUnicode::
`function (XX, YY)` handling \uXXYY situation to output decoded unicode sequence
strings.strict_quotes : boolean::
Specifies if the `'` character is considered a quoting specifier
==== Default configuration
[source,lua]
----
unicodeWhitespace = true
initialObject = false
allowUndefined = true
array.trailingComma = true
number.frac = true
number.exp = true
number.hex = false
object.number = true
object.identifier = true
object.trailingComma = true
strings.badChars = '' -- No characters considered bad in a string
strings.additionalEscapes = false, -- disallow untranslated escapes
strings.escapeCheck = #lpeg.S('bfnrtv/\\"xu\'z'),
strings.decodeUnicode = utf8DecodeUnicode,
strings.strict_quotes = false
----
==== Strict configuration
[source,lua]
----
initialObject = true
allowUndefined = false
array.trailingComma = false
object.identifier = false
object.trailingComma = false
strings.badChars = '\b\f\n\r\t\v'
strings.additionalEscapes = false -- no additional escapes
strings.escapeCheck = #lpeg.S('bfnrtv/\\"u') --only these are allowed to be escaped
strings.strict_quotes = true
----
AUTHOR
------
Written by Thomas Harning Jr., <harningt@gmail.com>
REFERENCES
----------
http://www.inf.puc-rio.br/~roberto/lpeg[LPeg]
http://json.org[JSON]
COPYING
-------
Copyright (C) 2008-2009 Thomas Harning Jr. Free use of this software is granted
under the terms of the MIT license.

View File

@@ -0,0 +1,21 @@
LuaSec 0.5 license
Copyright (C) 2006-2013 Bruno Silvestre, UFG
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

View File

@@ -0,0 +1,21 @@
LuaSocket 2.0.2 license
Copyright <20> 2004-2007 Diego Nehab
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.

View File

@@ -0,0 +1,178 @@
https://github.com/zhaozg/lua-openssl
lua-openssl is an open source software based on Lua and Openssl, and
also borrows some ideas and code from PHP.
The lua-openssl license and the relevant third-party licenses are
included below.
lua-openssl LICENSE
===================
--------------------------------------------------------------------
Copyright (c) 2011 - 2012 zhaozg, zhaozg(at)gmail.com
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to
deal in the Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
--------------------------------------------------------------------
Lua LICENSE
===========
--------------------------------------------------------------------
Copyright (c) 1994-2011 Lua.org, PUC-Rio.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to
deal in the Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
IN THE SOFTWARE.
--------------------------------------------------------------------
OpenSSL License
===============
/* ====================================================================
* Copyright (c) 1998-2011 The OpenSSL Project. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. All advertising materials mentioning features or use of this
* software must display the following acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
*
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please contact
* openssl-core@openssl.org.
*
* 5. Products derived from this software may not be called "OpenSSL"
* nor may "OpenSSL" appear in their names without prior written
* permission of the OpenSSL Project.
*
* 6. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit (http://www.openssl.org/)"
*
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
* ====================================================================
*
* This product includes cryptographic software written by Eric Young
* (eay@cryptsoft.com). This product includes software written by Tim
* Hudson (tjh@cryptsoft.com).
*
*/
PHP License
===========
--------------------------------------------------------------------
The PHP License, version 3.01
Copyright (c) 1999 - 2010 The PHP Group. All rights reserved.
--------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, is permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
3. The name "PHP" must not be used to endorse or promote products
derived from this software without prior written permission. For
written permission, please contact group@php.net.
4. Products derived from this software may not be called "PHP", nor
may "PHP" appear in their name, without prior written permission
from group@php.net. You may indicate that your software works in
conjunction with PHP by saying "Foo for PHP" instead of calling
it "PHP Foo" or "phpfoo"
5. The PHP Group may publish revised and/or new versions of the
license from time to time. Each version will be given a
distinguishing version number.
Once covered code has been published under a particular version
of the license, you may always continue to use it under the terms
of that version. You may also choose to use such covered code
under the terms of any subsequent version of the license
published by the PHP Group. No one other than the PHP Group has
the right to modify the terms applicable to covered code created
under this License.
6. Redistributions of any form whatsoever must retain the following
acknowledgment:
"This product includes PHP software, freely available from
<http://www.php.net/software/>".
THIS SOFTWARE IS PROVIDED BY THE PHP DEVELOPMENT TEAM ``AS IS'' AND
ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PHP
DEVELOPMENT TEAM OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
--------------------------------------------------------------------

View File

@@ -0,0 +1,17 @@
RFC 1321 compliant MD5 implementation
Copyright (C) 2001-2003 Christophe Devine
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

View File

@@ -0,0 +1,38 @@
LICENSE AGREEMENT
By installing and/or using MUSHclient you agree to the following conditions of use. If you do not agree to them please do not proceed with the installation.
This agreement is between you, "the User", and the program's author (Nick Gammon), "the Author".
AUTHOR
MUSHclient has been written by Nick Gammon of Gammon Software Solutions.
Web page: http://www.gammon.com.au/
Contact/support: http://www.gammon.com.au/forum/
COPYRIGHT
MUSHclient is copyright 1995 - 2007 by Nick Gammon. All rights reserved worldwide.
MUSHclient is not in the public domain and Nick Gammon keeps its copyright.
PERMISSION TO DISTRIBUTE
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
LIMITATION OF LIABILITY
The software is provided "as is", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the software.
This document was written on 2nd April 2007.
(End of agreement)

View File

@@ -0,0 +1,506 @@
https://github.com/nvaccess/nvda/tree/master/extras/controllerClient
The NVDA Controller Client API is licensed under the GNU Lesser General Public License (LGPL), version 2.1. In simple terms, this means you can use this library in any application, but if you modify the library in any way, you must contribute the changes back to the community under the same license.
GNU LESSER GENERAL PUBLIC LICENSE
Version 2.1, February 1999
Copyright (C) 1991, 1999 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.
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
Licenses are intended to guarantee your freedom to share and change
free software--to make sure the software is free for all its users.
This license, the Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it. You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.
When we speak of free software, we are referring to freedom of use,
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 and use pieces of
it in new free programs; and that you are informed that you can do
these things.
To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
rights. These restrictions translate to certain responsibilities for
you if you distribute copies of the library or if you modify it.
For example, if you distribute copies of the library, whether gratis
or for a fee, you must give the recipients all the rights that we gave
you. You must make sure that they, too, receive or can get the source
code. If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them
with the library after making changes to the library and recompiling
it. And you must show them these terms so they know their rights.
We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.
To protect each distributor, we want to make it very clear that
there is no warranty for the free library. Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder. Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.
Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License. This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License. We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.
When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library. The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General
Public License permits more lax criteria for linking other code with
the library.
We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License. It also provides other free software developers Less
of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many
libraries. However, the Lesser license provides advantages in certain
special circumstances.
For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard. To achieve this, non-free programs must be
allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software. For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.
Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.
The precise terms and conditions for copying, distribution and
modification follow. Pay close attention to the difference between a
"work based on the library" and a "work that uses the library". The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.
GNU LESSER GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser General Public License (also called "this License").
Each licensee is addressed as "you".
A "library" means a collection of software functions and/or data
prepared so as to be conveniently linked with application programs
(which use some of those functions and data) to form executables.
The "Library", below, refers to any such software library or work
which has been distributed under these terms. A "work based on the
Library" means either the Library or any derivative work under
copyright law: that is to say, a work containing the Library or a
portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language. (Hereinafter, translation is
included without limitation in the term "modification".)
"Source code" for a work means the preferred form of the work for
making modifications to it. For a library, 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 library.
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running a program using the Library is not restricted, and output from
such a program is covered only if its contents constitute a work based
on the Library (independent of the use of the Library in a tool for
writing it). Whether that is true depends on what the Library does
and what the program that uses the Library does.
1. You may copy and distribute verbatim copies of the Library's
complete 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 distribute a copy of this License along with the
Library.
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 Library or any portion
of it, thus forming a work based on the Library, 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) The modified work must itself be a software library.
b) You must cause the files modified to carry prominent notices
stating that you changed the files and the date of any change.
c) You must cause the whole of the work to be licensed at no
charge to all third parties under the terms of this License.
d) If a facility in the modified Library refers to a function or a
table of data to be supplied by an application program that uses
the facility, other than as an argument passed when the facility
is invoked, then you must make a good faith effort to ensure that,
in the event an application does not supply such function or
table, the facility still operates, and performs whatever part of
its purpose remains meaningful.
(For example, a function in a library to compute square roots has
a purpose that is entirely well-defined independent of the
application. Therefore, Subsection 2d requires that any
application-supplied function or table used by this function must
be optional: if the application does not supply it, the square
root function must still compute square roots.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Library,
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 Library, 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 Library.
In addition, mere aggregation of another work not based on the Library
with the Library (or with a work based on the Library) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may opt to apply the terms of the ordinary GNU General Public
License instead of this License to a given copy of the Library. To do
this, you must alter all the notices that refer to this License, so
that they refer to the ordinary GNU General Public License, version 2,
instead of to this License. (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
This option is useful when you wish to copy part of the code of
the Library into a program that is not a library.
4. You may copy and distribute the Library (or a portion or
derivative of it, under Section 2) in object code or executable form
under the terms of Sections 1 and 2 above provided that you 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.
If distribution of 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 satisfies the requirement to
distribute the source code, even though third parties are not
compelled to copy the source along with the object code.
5. A program that contains no derivative of any portion of the
Library, but is designed to work with the Library by being compiled or
linked with it, is called a "work that uses the Library". Such a
work, in isolation, is not a derivative work of the Library, and
therefore falls outside the scope of this License.
However, linking a "work that uses the Library" with the Library
creates an executable that is a derivative of the Library (because it
contains portions of the Library), rather than a "work that uses the
library". The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.
When a "work that uses the Library" uses material from a header file
that is part of the Library, the object code for the work may be a
derivative work of the Library even though the source code is not.
Whether this is true is especially significant if the work can be
linked without the Library, or if the work is itself a library. The
threshold for this to be true is not precisely defined by law.
If such an object file uses only numerical parameters, data
structure layouts and accessors, and small macros and small inline
functions (ten lines or less in length), then the use of the object
file is unrestricted, regardless of whether it is legally a derivative
work. (Executables containing this object code plus portions of the
Library will still fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
6. As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
under terms of your choice, provided that the terms permit
modification of the work for the customer's own use and reverse
engineering for debugging such modifications.
You must give prominent notice with each copy of the work that the
Library is used in it and that the Library and its use are covered by
this License. You must supply a copy of this License. If the work
during execution displays copyright notices, you must include the
copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License. Also, you must do one
of these things:
a) Accompany the work with the complete corresponding
machine-readable source code for the Library including whatever
changes were used in the work (which must be distributed under
Sections 1 and 2 above); and, if the work is an executable linked
with the Library, with the complete machine-readable "work that
uses the Library", as object code and/or source code, so that the
user can modify the Library and then relink to produce a modified
executable containing the modified Library. (It is understood
that the user who changes the contents of definitions files in the
Library will not necessarily be able to recompile the application
to use the modified definitions.)
b) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (1) uses at run time a
copy of the library already present on the user's computer system,
rather than copying library functions into the executable, and (2)
will operate properly with a modified version of the library, if
the user installs one, as long as the modified version is
interface-compatible with the version that the work was made with.
c) Accompany the work with a written offer, valid for at
least three years, to give the same user the materials
specified in Subsection 6a, above, for a charge no more
than the cost of performing this distribution.
d) If distribution of the work is made by offering access to copy
from a designated place, offer equivalent access to copy the above
specified materials from the same place.
e) Verify that the user has already received a copy of these
materials or that you have already sent this user a copy.
For an executable, the required form of the "work that uses the
Library" must include any data and utility programs needed for
reproducing the executable from it. However, as a special exception,
the materials to be 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.
It may happen that this requirement contradicts the license
restrictions of other proprietary libraries that do not normally
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
7. You may place library facilities that are a work based on the
Library side-by-side in a single library together with other library
facilities not covered by this License, and distribute such a combined
library, provided that the separate distribution of the work based on
the Library and of the other library facilities is otherwise
permitted, and provided that you do these two things:
a) Accompany the combined library with a copy of the same work
based on the Library, uncombined with any other library
facilities. This must be distributed under the terms of the
Sections above.
b) Give prominent notice with the combined library of the fact
that part of it is a work based on the Library, and explaining
where to find the accompanying uncombined form of the same work.
8. You may not copy, modify, sublicense, link with, or distribute
the Library except as expressly provided under this License. Any
attempt otherwise to copy, modify, sublicense, link with, or
distribute the Library 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.
9. 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 Library or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Library (or any work based on the
Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Library or works based on it.
10. Each time you redistribute the Library (or any work based on the
Library), the recipient automatically receives a license from the
original licensor to copy, distribute, link with or modify the Library
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 with
this License.
11. 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 Library at all. For example, if a patent
license would not permit royalty-free redistribution of the Library 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 Library.
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.
12. If the distribution and/or use of the Library is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Library 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.
13. The Free Software Foundation may publish revised and/or new
versions of the Lesser 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 Library
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 Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
14. If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
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
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
OTHER PARTIES PROVIDE THE LIBRARY "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
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. 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 LIBRARY 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
LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), 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 Libraries
If you develop a new library, and you want it to be of the greatest
possible use to the public, we recommend making it free software that
everyone can redistribute and change. You can do so by permitting
redistribution under these terms (or, alternatively, under the terms of the
ordinary General Public License).
To apply these terms, attach the following notices to the library. 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 library's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; 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.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the library, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
<signature of Ty Coon>, 1 April 1990
Ty Coon, President of Vice
That's all there is to it!

View File

@@ -0,0 +1,92 @@
PCRE LICENCE
------------
PCRE is a library of functions to support regular expressions whose syntax
and semantics are as close as possible to those of the Perl 5 language.
Release 8 of PCRE is distributed under the terms of the "BSD" licence, as
specified below. The documentation for PCRE, supplied in the "doc"
directory, is distributed under the same terms as the software itself.
The basic library functions are written in C and are freestanding. Also
included in the distribution is a set of C++ wrapper functions, and a
just-in-time compiler that can be used to optimize pattern matching. These
are both optional features that can be omitted when the library is built.
THE BASIC LIBRARY FUNCTIONS
---------------------------
Written by: Philip Hazel
Email local part: ph10
Email domain: cam.ac.uk
University of Cambridge Computing Service,
Cambridge, England.
Copyright (c) 1997-2013 University of Cambridge
All rights reserved.
PCRE JUST-IN-TIME COMPILATION SUPPORT
-------------------------------------
Written by: Zoltan Herczeg
Email local part: hzmester
Emain domain: freemail.hu
Copyright(c) 2010-2013 Zoltan Herczeg
All rights reserved.
STACK-LESS JUST-IN-TIME COMPILER
--------------------------------
Written by: Zoltan Herczeg
Email local part: hzmester
Emain domain: freemail.hu
Copyright(c) 2009-2013 Zoltan Herczeg
All rights reserved.
THE C++ WRAPPER FUNCTIONS
-------------------------
Contributed by: Google Inc.
Copyright (c) 2007-2012, Google Inc.
All rights reserved.
THE "BSD" LICENCE
-----------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the name of Google
Inc. nor the names of their contributors may be used to endorse or
promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
End

View File

@@ -0,0 +1,17 @@
FIPS-180-2 compliant SHA-256 implementation
Copyright (C) 2001-2003 Christophe Devine
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

View File

@@ -0,0 +1,168 @@
Tolk is distributed under the GNU Lesser General Public License version 3 (LGPLv3).
https://github.com/dkager/tolk © Davy Kager
GNU LESSER GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. [http://fsf.org/]
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
This version of the GNU Lesser General Public License incorporates
the terms and conditions of version 3 of the GNU General Public
License, supplemented by the additional permissions listed below.
0. Additional Definitions.
As used herein, "this License" refers to version 3 of the GNU Lesser
General Public License, and the "GNU GPL" refers to version 3 of the GNU
General Public License.
"The Library" refers to a covered work governed by this License,
other than an Application or a Combined Work as defined below.
An "Application" is any work that makes use of an interface provided
by the Library, but which is not otherwise based on the Library.
Defining a subclass of a class defined by the Library is deemed a mode
of using an interface provided by the Library.
A "Combined Work" is a work produced by combining or linking an
Application with the Library. The particular version of the Library
with which the Combined Work was made is also called the "Linked
Version".
The "Minimal Corresponding Source" for a Combined Work means the
Corresponding Source for the Combined Work, excluding any source code
for portions of the Combined Work that, considered in isolation, are
based on the Application, and not on the Linked Version.
The "Corresponding Application Code" for a Combined Work means the
object code and/or source code for the Application, including any data
and utility programs needed for reproducing the Combined Work from the
Application, but excluding the System Libraries of the Combined Work.
1. Exception to Section 3 of the GNU GPL.
You may convey a covered work under sections 3 and 4 of this License
without being bound by section 3 of the GNU GPL.
2. Conveying Modified Versions.
If you modify a copy of the Library, and, in your modifications, a
facility refers to a function or data to be supplied by an Application
that uses the facility (other than as an argument passed when the
facility is invoked), then you may convey a copy of the modified
version:
a) under this License, provided that you make a good faith effort to
ensure that, in the event an Application does not supply the
function or data, the facility still operates, and performs
whatever part of its purpose remains meaningful, or
b) under the GNU GPL, with none of the additional permissions of
this License applicable to that copy.
3. Object Code Incorporating Material from Library Header Files.
The object code form of an Application may incorporate material from
a header file that is part of the Library. You may convey such object
code under terms of your choice, provided that, if the incorporated
material is not limited to numerical parameters, data structure
layouts and accessors, or small macros, inline functions and templates
(ten or fewer lines in length), you do both of the following:
a) Give prominent notice with each copy of the object code that the
Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the object code with a copy of the GNU GPL and this license
document.
4. Combined Works.
You may convey a Combined Work under terms of your choice that,
taken together, effectively do not restrict modification of the
portions of the Library contained in the Combined Work and reverse
engineering for debugging such modifications, if you also do each of
the following:
a) Give prominent notice with each copy of the Combined Work that
the Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the Combined Work with a copy of the GNU GPL and this license
document.
c) For a Combined Work that displays copyright notices during
execution, include the copyright notice for the Library among
these notices, as well as a reference directing the user to the
copies of the GNU GPL and this license document.
d) Do one of the following:
0) Convey the Minimal Corresponding Source under the terms of this
License, and the Corresponding Application Code in a form
suitable for, and under terms that permit, the user to
recombine or relink the Application with a modified version of
the Linked Version to produce a modified Combined Work, in the
manner specified by section 6 of the GNU GPL for conveying
Corresponding Source.
1) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (a) uses at run time
a copy of the Library already present on the user's computer
system, and (b) will operate properly with a modified version
of the Library that is interface-compatible with the Linked
Version.
e) Provide Installation Information, but only if you would otherwise
be required to provide such information under section 6 of the
GNU GPL, and only to the extent that such information is
necessary to install and execute a modified version of the
Combined Work produced by recombining or relinking the
Application with a modified version of the Linked Version. (If
you use option 4d0, the Installation Information must accompany
the Minimal Corresponding Source and Corresponding Application
Code. If you use option 4d1, you must provide the Installation
Information in the manner specified by section 6 of the GNU GPL
for conveying Corresponding Source.)
5. Combined Libraries.
You may place library facilities that are a work based on the
Library side by side in a single library together with other library
facilities that are not Applications and are not covered by this
License, and convey such a combined library under terms of your
choice, if you do both of the following:
a) Accompany the combined library with a copy of the same work based
on the Library, uncombined with any other library facilities,
conveyed under the terms of this License.
b) Give prominent notice with the combined library that part of it
is a work based on the Library, and explaining where to find the
accompanying uncombined form of the same work.
6. Revised Versions of the GNU Lesser General Public License.
The Free Software Foundation may publish revised and/or new versions
of the GNU Lesser 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
Library as you received it specifies that a certain numbered version
of the GNU Lesser General Public License "or any later version"
applies to it, you have the option of following the terms and
conditions either of that published version or of any later version
published by the Free Software Foundation. If the Library as you
received it does not specify a version number of the GNU Lesser
General Public License, you may choose any version of the GNU Lesser
General Public License ever published by the Free Software Foundation.
If the Library as you received it specifies that a proxy can decide
whether future versions of the GNU Lesser General Public License shall
apply, that proxy's public statement of acceptance of any version is
permanent authorization for you to choose that version for the
Library.

View File

@@ -0,0 +1,26 @@
Copyright (C) 1991, 1992, 1993, 1994, 1997, 2000 Free Software Foundation, Inc.
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; see the file COPYING. If not, write to:
The Free Software Foundation, Inc.
59 Temple Place, Suite 330
Boston, MA 02111-1307 USA.
You may contact the author by:
e-mail: philnelson@acm.org
us-mail: Philip A. Nelson
Computer Science Department, 9062
Western Washington University
Bellingham, WA 98226-9062

View File

@@ -0,0 +1,339 @@
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.
GNU GENERAL PUBLIC LICENSE
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 a brief idea of what it does.>
Copyright (C) <year> <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
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License.

View File

@@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. 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
them 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 prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. 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.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey 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;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If 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 convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU 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 that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
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.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
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.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
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
state 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 a brief idea of what it does.>
Copyright (C) <year> <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 3 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, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program 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, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.

View File

@@ -0,0 +1,61 @@
This is version 2007-Mar-4 of the Info-ZIP license.
The definitive version of this document should be available at
ftp://ftp.info-zip.org/pub/infozip/license.html indefinitely and
a copy at http://www.info-zip.org/pub/infozip/license.html.
Copyright (c) 1990-2007 Info-ZIP. All rights reserved.
For the purposes of this copyright and license, "Info-ZIP" is defined as
the following set of individuals:
Mark Adler, John Bush, Karl Davis, Harald Denker, Jean-Michel Dubois,
Jean-loup Gailly, Hunter Goatley, Ed Gordon, Ian Gorman, Chris Herborth,
Dirk Haase, Greg Hartwig, Robert Heath, Jonathan Hudson, Paul Kienitz,
David Kirschbaum, Johnny Lee, Onno van der Linden, Igor Mandrichenko,
Steve P. Miller, Sergio Monesi, Keith Owens, George Petrov, Greg Roelofs,
Kai Uwe Rommel, Steve Salisbury, Dave Smith, Steven M. Schweda,
Christian Spieler, Cosmin Truta, Antoine Verheijen, Paul von Behren,
Rich Wales, Mike White.
This software is provided "as is," without warranty of any kind, express
or implied. In no event shall Info-ZIP or its contributors be held liable
for any direct, indirect, incidental, special or consequential damages
arising out of the use of or inability to use this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the above disclaimer and the following restrictions:
1. Redistributions of source code (in whole or in part) must retain
the above copyright notice, definition, disclaimer, and this list
of conditions.
2. Redistributions in binary form (compiled executables and libraries)
must reproduce the above copyright notice, definition, disclaimer,
and this list of conditions in documentation and/or other materials
provided with the distribution. The sole exception to this condition
is redistribution of a standard UnZipSFX binary (including SFXWiz) as
part of a self-extracting archive; that is permitted without inclusion
of this license, as long as the normal SFX banner has not been removed
from the binary or disabled.
3. Altered versions--including, but not limited to, ports to new operating
systems, existing ports with new graphical interfaces, versions with
modified or added functionality, and dynamic, shared, or static library
versions not from Info-ZIP--must be plainly marked as such and must not
be misrepresented as being the original source or, if binaries,
compiled from the original source. Such altered versions also must not
be misrepresented as being Info-ZIP releases--including, but not
limited to, labeling of the altered versions with the names "Info-ZIP"
(or any variation thereof, including, but not limited to, different
capitalizations), "Pocket UnZip," "WiZ" or "MacZip" without the
explicit permission of Info-ZIP. Such altered versions are further
prohibited from misrepresentative use of the Zip-Bugs or Info-ZIP
e-mail addresses or the Info-ZIP URL(s), such as to imply Info-ZIP
will provide support for the altered versions.
4. Info-ZIP retains the right to use the names "Info-ZIP," "Zip," "UnZip,"
"UnZipSFX," "WiZ," "Pocket UnZip," "Pocket Zip," and "MacZip" for its
own source and binary releases.

View File

@@ -0,0 +1,134 @@
COPYRIGHT NOTICE, DISCLAIMER, and LICENSE
=========================================
PNG Reference Library License version 2
---------------------------------------
* Copyright (c) 1995-2019 The PNG Reference Library Authors.
* Copyright (c) 2018-2019 Cosmin Truta.
* Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson.
* Copyright (c) 1996-1997 Andreas Dilger.
* Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
The software is supplied "as is", without warranty of any kind,
express or implied, including, without limitation, the warranties
of merchantability, fitness for a particular purpose, title, and
non-infringement. In no event shall the Copyright owners, or
anyone distributing the software, be liable for any damages or
other liability, whether in contract, tort or otherwise, arising
from, out of, or in connection with the software, or the use or
other dealings in the software, even if advised of the possibility
of such damage.
Permission is hereby granted to use, copy, modify, and distribute
this software, or portions hereof, for any purpose, without fee,
subject to the following restrictions:
1. The origin of this software must not be misrepresented; you
must not claim that you wrote the original software. If you
use this software in a product, an acknowledgment in the product
documentation would be appreciated, but is not required.
2. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
3. This Copyright notice may not be removed or altered from any
source or altered source distribution.
PNG Reference Library License version 1 (for libpng 0.5 through 1.6.35)
-----------------------------------------------------------------------
libpng versions 1.0.7, July 1, 2000, through 1.6.35, July 15, 2018 are
Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson, are
derived from libpng-1.0.6, and are distributed according to the same
disclaimer and license as libpng-1.0.6 with the following individuals
added to the list of Contributing Authors:
Simon-Pierre Cadieux
Eric S. Raymond
Mans Rullgard
Cosmin Truta
Gilles Vollant
James Yu
Mandar Sahastrabuddhe
Google Inc.
Vadim Barkov
and with the following additions to the disclaimer:
There is no warranty against interference with your enjoyment of
the library or against infringement. There is no warranty that our
efforts or the library will fulfill any of your particular purposes
or needs. This library is provided with all faults, and the entire
risk of satisfactory quality, performance, accuracy, and effort is
with the user.
Some files in the "contrib" directory and some configure-generated
files that are distributed with libpng have other copyright owners, and
are released under other open source licenses.
libpng versions 0.97, January 1998, through 1.0.6, March 20, 2000, are
Copyright (c) 1998-2000 Glenn Randers-Pehrson, are derived from
libpng-0.96, and are distributed according to the same disclaimer and
license as libpng-0.96, with the following individuals added to the
list of Contributing Authors:
Tom Lane
Glenn Randers-Pehrson
Willem van Schaik
libpng versions 0.89, June 1996, through 0.96, May 1997, are
Copyright (c) 1996-1997 Andreas Dilger, are derived from libpng-0.88,
and are distributed according to the same disclaimer and license as
libpng-0.88, with the following individuals added to the list of
Contributing Authors:
John Bowler
Kevin Bracey
Sam Bushell
Magnus Holmgren
Greg Roelofs
Tom Tanner
Some files in the "scripts" directory have other copyright owners,
but are released under this license.
libpng versions 0.5, May 1995, through 0.88, January 1996, are
Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
For the purposes of this copyright and license, "Contributing Authors"
is defined as the following set of individuals:
Andreas Dilger
Dave Martindale
Guy Eric Schalnat
Paul Schmidt
Tim Wegner
The PNG Reference Library is supplied "AS IS". The Contributing
Authors and Group 42, Inc. disclaim all warranties, expressed or
implied, including, without limitation, the warranties of
merchantability and of fitness for any purpose. The Contributing
Authors and Group 42, Inc. assume no liability for direct, indirect,
incidental, special, exemplary, or consequential damages, which may
result from the use of the PNG Reference Library, even if advised of
the possibility of such damage.
Permission is hereby granted to use, copy, modify, and distribute this
source code, or portions hereof, for any purpose, without fee, subject
to the following restrictions:
1. The origin of this source code must not be misrepresented.
2. Altered versions must be plainly marked as such and must not
be misrepresented as being the original source.
3. This Copyright notice may not be removed or altered from any
source or altered source distribution.
The Contributing Authors and Group 42, Inc. specifically permit,
without fee, and encourage the use of this source code as a component
to supporting the PNG file format in commercial products. If you use
this source code in a product, acknowledgment is not required but would
be appreciated.

View File

@@ -0,0 +1,27 @@
/************************************************************************
* lsqlite3 *
* Copyright (C) 2002-2007 Tiago Dionizio, Doug Currie *
* All rights reserved. *
* Author : Tiago Dionizio <tiago.dionizio@ist.utl.pt> *
* Author : Doug Currie <doug.currie@alum.mit.edu> *
* Library : lsqlite3 - a SQLite 3 database binding for Lua 5 *
* *
* Permission is hereby granted, free of charge, to any person obtaining *
* a copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, sublicense, and/or sell copies of the Software, and to *
* permit persons to whom the Software is furnished to do so, subject to *
* the following conditions: *
* *
* The above copyright notice and this permission notice shall be *
* included in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, *
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
************************************************************************/

View File

@@ -0,0 +1,19 @@
Copyright (c) 2011 by Robert G. Jakabosky <bobby@sharedrealm.com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.

View File

@@ -0,0 +1,22 @@
https://github.com/moteus/lua-llthreads2
The MIT License (MIT)
Copyright (c) 2013-2017 Alexey Melnichuk
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
the Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

View File

@@ -0,0 +1,156 @@
What is Mersenne Twister (MT)?
Mersenne Twister(MT) is a pseudorandom number generating algorithm developped by Makoto Matsumoto and Takuji Nishimura (alphabetical order) in 1996/1997. An improvement on initialization was given on 2002 Jan.
MT has the following merits:
* It is designed with consideration on the flaws of various existing generators.
* The algorithm is coded into a C-source downloadable below.
* Far longer period and far higher order of equidistribution than any other implemented generators. (It is proved that the period is 2^19937-1, and 623-dimensional equidistribution property is assured.)
* Fast generation. (Although it depends on the system, it is reported that MT is sometimes faster than the standard ANSI-C library in a system with pipeline and cache memory.) (Note added in 2004/3: on 1998, usually MT was much faster than rand(), but the algorithm for rand() has been substituted, and now there are no much difference in speed.)
* Efficient use of the memory. (The implemented C-code mt19937.c consumes only 624 words of working area.)
-------
Copyright notice from source code.
-------
A C-program for MT19937, with initialization improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
Before using, initialize the state by using init_genrand(seed)
or init_by_array(init_key, key_length).
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
-----------
Note re the period. Using the "bc" program under Linux, we can see that the MT algorithm repeats itself every
2^19937-1 =>
43154247973881626480552355163379198390539350432267115051652505414033\
30680137658091130451362931858466554526993825764883531790221733458441\
39095282691546091680190078753437413962968019201144864809026614143184\
43276980300066728104984095451588176077132969843762134621790396391341\
28520562761960051310664637664861599423667548653748024196435029593516\
86623639090479483476923139783013778207857124190544743328445291831729\
73242310888265081321626469451077707812282829444775022680488057820028\
76465939916476626520090056149580034405435369038986289406179287201112\
08336148084474829135473283672778795656483078469091169458662301697024\
01260240187028746650033445774570315431292996025187780790119375902863\
17108414964247337898626750330896137490576634090528957229001603800057\
16308751913739795550474681543332534749910462481325045163417965514705\
75481459200859472614836213875557116864445789750886277996487304308450\
48422342062926651855602433933919084436892101842484467704272766460185\
29149252772809226975384267702573339289544012054658956103476588553866\
33902546289962132643282425748035786233580608154696546932563833327670\
76989943977488852668727852745100296305914696387571542573553447597973\
44631006783673933274021499309687782967413915145996023742136298987206\
11431410402147238998090962818915890645693934483330994169632295877995\
84899336674701487176349480554999616305154122540346529700772114623135\
57040814930986630657336771911728539870957481678162560842128233801686\
25334586431254034670806135273543270714478876861861983320777280644806\
69112571319726258176315131359642954776357636783701934983517846214429\
49607571909180546251141436663841894338525764522893476524546315357404\
68786228945885654608562058042468987372436921445092315377698407168198\
37653823774861419620704154810637936512319281799900662176646716711347\
16327154817958770053826943934004030617004576911353491878748889234293\
49340145170571716181125795888889277495426977149914549623916394014822\
98502533165151143127880200905680845650681887726660983163688388490562\
18222629339865486456690806721917047404088913498356856624280632311985\
20436826329415290752972798343429446509992206368781367154091702655772\
72739132942427752934908260058588476652315095741707783191001616847568\
56586731928608820701797603072698499873548360423717346602576943472355\
06301744118874141292438958141549100609752216882230887611431996472330\
84238013711092744948355781503758684964458574991777286992674421836962\
11376751010832785437940817490940910430840967741447084363242794768920\
56200427227961638669149805489831121244676399931955371484012886360748\
70647956866904857478285521705474011394592962217750257556581106745220\
14489819919686359653615516812739827407601388996388203187763036687627\
30157584640042798880691862640268612686180883874939573818125022279689\
93026744625577395954246983163786300017127922715140603412990218157065\
96505326007758236773981821290873944498591827499990072235924233345678\
50671186568839186747704960016277540625331440619019129983789914712515\
36520033605799350860167880768756856237785709525554130490292719222018\
41725023571244499118702106426945650613849193734743245039662677990384\
02386781686809962015879090586549423504699190743519551043722544515740\
96782908433602593822578073088027385526155197204407562032678062444880\
34909982321612316877947156134057932495455095280525180101230872587789\
74115817048245588971438596754408081313438375502988726739523375296641\
61550140609160798322923982724061478325289247971651993698951918780868\
12211916417477109024806334910917048274412282811866324459071457871383\
51234842261380074621914004818152386666043133344875067903582838283562\
68808323657548206847963954638381953217452250268237244136327576587560\
91197836532983120667082171493167735643403792897243939867441398918554\
16612295739356668612658271234696438377122838998040199739078061443675\
41567107846340467370240377765347817336708484473470205686663615813800\
36922533822099094664695919301616260979205087421756703065051395428607\
50806159835357541032147095084278461056701367739794932024202998707731\
01769258204621070221251412042932253043178961626704777611512359793540\
41470848709854654265027720573009003338479053342506041195030300017040\
02887892941404603345869926367501355094942750552591581639980523190679\
61078499358089668329929768126244231400865703342186809455174050644882\
90392073167113076951318922965935090186230948105575195603052407871638\
09219164433754514863301000915916985856242176563624771328981678548246\
29737624953025136036341276836645617507703197745753491280643317653999\
59943433081184701471587128161493944212766142282629099500557469810532\
06610001560295784656616193252269412026831159508949671513845195883217\
14798274887926185141781997903441728559860772722086667768042609030875\
48238033454465663056192413083744527546681430154877108777280110860043\
25892262259413968285283497045571062757701421761565262725153407407625\
40514993198949445910641466053430537857670986252004986488096114486925\
86034737143636591940139627063668513892996928694918051725568185082988\
24954954815796063169517658741420159798754273428026723452481263569157\
30721315373978104162765371507859850415479728766312294671134815852941\
88164328250444666927811374744948983850643757875073764963451486253063\
83391555145690087891955315994462944493235248817599907119135755933382\
12170619147718505493663221115722292033114850248756330311801880568507\
35698415805181187107786539535712960143729408652704070219243831672903\
23231567912289419486240594039074452321678019381871219092155460768444\
57357855951361330424220615135645751393727093900970723782710124585383\
76783381610233975868548942306960915402499879074534613119239638529507\
54758058205625956600817743007191746812655955021747670922460866747744\
52087560785906233475062709832859348006778945616960249439281376349565\
75998474857735539909575573132008090408300364464922194099340969487305\
47494301216165686750735749555882340303989874672975455060957736921559\
19548081551403591570712993005702711728625284319741331230761788679750\
67842601954367603059903407084814646072789554954877421407535706212171\
98252192978869786916734625618430175454903864111585429504569920905636\
741539030968041471
bytes.

View File

@@ -0,0 +1,139 @@
Author: Nick Gammon
Web support: http://www.gammon.com.au/forum/
-----------------------------------------
If you are reading this file with NotePad,
enable "Word Wrap" under the Edit menu for
proper viewing of it.
-----------------------------------------
MUSHclient is produced by Gammon Software Solutions:
http://www.gammon.com.au/
MUSHclient home page:
http://www.gammon.com.au/mushclient/
A MUSHclient bug and suggestion list is at:
http://www.gammon.com.au/mushclient/buglist.htm
Forum for MUSHclient discussions, submitting bugs and suggestions:
http://www.gammon.com.au/forum/?bbsection_id=1
MUSHclient scripting functions (and a copy of the help file) are at:
http://www.gammon.com.au/scripts/doc.php
MUSHclient plugins are available at:
http://www.mushclient.com/plugins/
Changes in this version
-----------------------
Release notes for every version are kept here:
http://www.gammon.com.au/scripts/showrelnote.php
License
-------
Use of this program is subject to the License agreement. See Help menu -> About -> License.
In particular, the software is provided "as is", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement.
FreeWare
--------
MUSHclient is distributed as FreeWare. There is no fee for using it.
Source code
-----------
The source code for MUSHclient is available from:
http://github.com/nickgammon/mushclient/
Operating System
----------------
MUSHclient version 3.xx will run on:
Windows 95, Windows 98, Windows ME, Windows NT 4, Windows NT 2000, Windows XP, and Windows Vista.
It will not run on Windows 3.1 or Windows 3.11, sorry! This is because the enhancements in version 3.x use various 32-bit features of the more recent Windows operating systems. If you wish to continue using Windows 3.1, then MUSHclient 1.04 is still a very fast, reliable MUD client.
It should work on Linux running Wine. See: http://www.gammon.com.au/forum/?id=8380
Bug reports
-----------
Please submit bug reports or suggested enhancements to the MUSHclient forum:
http://www.gammon.com.au/forum/?bbsection_id=1
There is a "MUSHclient bug list" page on the Web, you may wish to check that page first to see if the bug you are reporting is already known. The bug list page is at:
http://www.mushclient.com/buglist.htm
FAQ
---
The MUSHclient FAQ (Frequently Asked Questions) page is at:
http://www.gammon.com.au/scripts/showfaq.php
Answers to common questions are also found at the MUSHclient forum:
http://www.gammon.com.au/forum/?bbsection_id=1
MUSHclient home page
--------------------
The MUSHclient home page on the Web is:
http://www.mushclient.com/
Compatibility with old world files
----------------------------------
MUSHclient version 4 will read world (and trigger, alias etc.) files produced by versions from 3.21 onwards.
You are advised to backup your world and other files, in case you wish to go back to an earlier version.
Credits
-------
Various aspects of MUSHclient have been written with the help of other people.
Please see Help -> About -> Credits for a list of those who have contributed.
Comments welcome
----------------
Please let me know if you have any problems. Check out the web pages mentioned above for details about later versions or known bugs.
Send support requests, bug reports, general queries or comments to the forum:
http://www.gammon.com.au/forum/?bbsection_id=1
Thanks!
-------
Thanks to everyone who has supported MUSHclient, either by registering earlier versions, or by sending in comments. Your support is appreciated.
Thanks again. I hope you enjoy using MUSHclient, as much as I have writing it.
- Nick Gammon

View File

@@ -0,0 +1,21 @@
Copyright (C) 1995-2017 Jean-loup Gailly and Mark Adler
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
Jean-loup Gailly Mark Adler
jloup@gzip.org madler@alumni.caltech.edu

Binary file not shown.

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,88 @@
-- make copy of original tables
orig_messages = messages
orig_formatted = formatted
orig_times = times
orig_headings = headings
-- empty them out so __index is triggered
-- save original tables so we can look them up eventually
messages = { _orig = orig_messages }
formatted = { _orig = orig_formatted }
times = { _orig = orig_times }
headings = { _orig = orig_headings }
counts = {} -- keep counts here
-- metatable for messages, titles, headings
mt_static = {
-- called to access an entry
__index=
function (t, name)
local s = rawget (t._orig, name)
if s == nil or #s == 0 then
counts [name] = (counts [name] or 0) + 1
end -- not translated yet
return s
end;
}
-- metatable for formatted messages
mt_formatted = {
-- called to access an entry
__index=
function (t, name)
local f = rawget (t._orig, name)
-- no function? not translated then
if f == nil then
counts [name] = (counts [name] or 0) + 1
return nil
end
assert (type (f) == "function")
-- return a function, that will count if the original function
-- returns an empty string
return function (...)
local s = f (...) -- call original function
if type (s) ~= "string" or #s == 0 then
counts [name] = (counts [name] or 0) + 1
end -- not translated
return s -- return translated value
end -- function
end;
}
-- apply the metatables
setmetatable (messages, mt_static)
setmetatable (times, mt_static)
setmetatable (headings, mt_static)
setmetatable (formatted, mt_formatted)
-- the user will call world.TranslateDebug to invoke this
function Debug ()
-- for sorting
local t = {}
-- build into table which can be sorted
for k, v in pairs (counts) do
table.insert (t, k)
end -- for
-- clear out notepad, make heading
utils.appendtonotepad ("translation", "Translation counts\n\n", true)
-- sort into descending order
table.sort (t, function (a, b)
return counts [a] > counts [b]
end)
-- display results
for k, v in ipairs (t) do
utils.appendtonotepad ("translation", string.format ("%4i: %q \n", counts [v], v))
end -- for
end -- Debug

View File

@@ -0,0 +1,67 @@
-- stuff already localized
locale = "en" -- change to suit you
dofile (locale .. ".lua")
-- make copy
original = {
messages = messages,
formatted = formatted,
times = times,
headings = headings
}
messages, formatted, times, headings = nil
-- from distribution
dofile ("Localize_template.lua")
-- make copy
distribution = {
messages = messages,
formatted = formatted,
times = times,
headings = headings
}
messages, formatted, times, headings = nil
function compare_table (name)
local count = 0
local old = original [name]
local new = distribution [name]
print ("Processing table", name)
print ""
-- new message is in distribution, but not in already localized file
for k, v in pairs (new) do
if not old [k] then
count = count + 1
print (string.format (" New message: %q", k))
end -- if not there
end -- for
print ("Found ", count, " new messages")
print ""
count = 0
-- old message is in already localized file, but not in distribution
for k, v in pairs (old) do
if not new [k] then
count = count + 1
print (string.format (" Deleted message: %q", k))
end -- if not there
end -- for
print ("Found ", count, " deleted messages")
print ""
end -- compare_table
compare_table ("messages")
compare_table ("formatted")
compare_table ("times")
compare_table ("headings")

Binary file not shown.

Binary file not shown.

View File

@@ -0,0 +1,84 @@
Localization notes
------------------
Author: Nick Gammon
Date: 18th June 2007
Amended: 27th May 2008 to mention large/small monitor handling
In the "locale" directory - which is a subdirectory under where the MUSHclient.exe program is stored, you should find the following files in the standard MUSHclient distribution:
* locale_notes.txt --> this file
* Localize_template.lua --> template for creating a new translation file
* en.dll --> resources for MUSHclient - in English (for screen resolution 1024 x 768 or larger)
* en_small.dll --> resources for MUSHclient - in English (for small screen resolutions)
* count_locale_usage.lua --> Lua script for counting which messages need translating the most
* detect_locale_changes.lua --> Lua script for detecting changes between one MUSHclient distribution and the next
See the following forum posting for detailed descriptions about localizing MUSHclient:
http://www.gammon.com.au/forum/?id=7953
To localize
-----------
If you are planning to localize to another language, you would take these steps. Let us take French as an example, which has a locale code of FR.
1. Copy en.dll as fr.dll (make a copy, rename the copy fr.dll)
NOTE: You now have two resource files (en.dll and en_small.dll). One is designed for small monitors and one for larger ones. Use the appropriate file depending on the size monitor you plan to use.
2. Copy Localize_template.lua as fr.lua (make a copy, rename the copy fr.lua)
3. Use a resource editor (search the Internet for an appropriate tool) and edit fr.dll, changing menus, dialogs, and string resources to have the appropriate translations.
An alternative is to download the Visual Studio project which built the resources file, change that with an appropriate tool (eg. Visual Studio) and recompile to build a new DLL from scratch.
4. Use a text editor (such as Crimson Editor) to edit the fr.lua file, translating the "empty" strings for each message, into French. Read the forum posting mentioned above for how to handle the "formatted" part.
You can get Crimson Editor from:
http://www.crimsoneditor.com/
Make sure you set the Document Encoding type to UTF-8 (w/o BOM).
----
To test, change the locale code in the MUSHclient Global Preferences -> General tab, to "FR".
Then close and re-open MUSHclient. It should now detect the new files and show the translated messages.
Counting translation usage
--------------------------
As there are around 750 messages to be translated in the Localize_template.lua file, you may prefer to concentrate on the ones that occur most frequently.
To find out what they are, edit your xx.lua file (eg. fr.lua) and add this line to the bottom:
dofile "locale/count_locale_usage.lua"
This adds the extra debugging code into your local file. Then, after you have been using MUSHclient for a while, you can enter the following script command:
/TranslateDebug ()
This will display which messages were called upon to be translated, sorted into most frequent first, to least frequent.
Checking if new messages appear
-------------------------------
With each new release of MUSHclient, you can check if new messages have been added to the file Localize_template.lua by running the Lua script detect_locale_changes.lua. This compares the messages in your locale file (eg. en.lua) to the new template file (ie. Localize_template.lua) and reports on any new ones.

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,75 @@
module (..., package.seeall)
require "string_split"
-- Returns an array of {start, end, text}
function findURLs(text)
local URLs = {}
local start, position = 0, 0
-- "rex" is a table supplied by MUSHclient for PCRE functionality.
local re = rex.new("(?:https?://|mailto:)\\S*[\\w/=@#\\-\\?]")
re:gmatch(text,
function (link, _)
start, position = string.find(text, link, position, true)
table.insert(URLs, {start=start, stop=position, text=link})
end
)
return URLs
end -- function findURL
version_file = "AardwolfPackageChanges.txt"
git_branch = "MUSHclient"
function PackageVersion()
local ver = nil
local file,err = io.open(version_file, "r")
if file then -- the file exists
--- read the snapshot revision from the third line
line = file:read("*l") -- read one line
line = file:read("*l") -- read one line
line = file:read("*l") -- read one line
file:close()
if line then -- if we got something
ver = tonumber(string.match(line, "r(%d+)"))
err = nil
end
end
return ver, err
end
function PackageVersionFull()
local ver, err = PackageVersion()
if ver then
ver = ver..(aard_req_novisuals_mode and "_VI" or "")
end
return ver or "ERROR"
end
function PackageVersionExtended()
local version, err = PackageVersion()
local msg = ""
local succ = false
if not version then -- the file is missing or unreadable
msg = "The file "..version_file.." appears to be missing or unreadable (this is bad), so the version check cannot proceed."
if err then
msg = msg.."\nThe system gave the error: "..err
end
else
succ = true
msg = "You are using Aardwolf MUSHclient Package version: r"..version..(aard_req_novisuals_mode and "\nIf someone asked you to report your version to them, consider also telling them that it's the no-visuals edition if you think that it might be useful information." or "")
end
return succ, version, msg
end
function osexecute(cmd)
local n = GetInfo(66).."aard_package_temp_file.txt" -- temp file for catching output
cmd = cmd .. " > \""..n.."\""
local err = os.execute(cmd)
local message_accumulator = {}
-- It's not so simple to catch errors from os.execute, so grab the system output from a catfile
for line in io.lines (n) do
table.insert(message_accumulator, line)
end
os.remove(n) -- remove temp file
return err, message_accumulator
end

View File

@@ -0,0 +1,316 @@
-- This module simplifies (and hopefully makes a bit safer) use of some Windows APIs
-- through the LuaJIT FFI library. See http://luajit.org/ext_ffi.html
-- Author: Avi Kelman (Fiendish)
--
-- Usage Notes:
--
-->>
-- After doing 'require "aard_lua_ffi"' from a script, you get access to the
-- aard_lua_ffi function namespace which includes a curated and safened set of
-- a few Windows API functions ( https://en.wikipedia.org/wiki/Windows_API ).
--<<
--
-->>
-- See the table at the very end for the list of exported functions
-- and their input arguments.
-- It looks something like:
--
-- --
-- -- export public functions
-- --
-- aard_lua_ffi = {
-- MoveFile = MoveFile, -- (source, destination, acceptable_errors)
-- CreateDirectory = CreateDirectory, -- (path_to_create, recursive, acceptable_errors)
-- DeleteFile = DeleteFile, -- (path_name, recursive, acceptable_errors)
-- ...
-- }
--<<
--
-->>
-- The acceptable_errors input argument on each of the functions is given
-- either nil or a list of Windows error codes that you want to be
-- ignored by the error checker. This will be function-specific, and
-- using it requires knowledge of what error codes might be thrown.
-- See the API call documentation linked in the function comments and also
-- the list of error codes at
-- https://msdn.microsoft.com/en-us/library/windows/desktop/ms681381.aspx
--
-- Some functions will have default reasonable acceptable_errors already set
-- if you pass in nil.
--
-- For instance: CreateDirectory has {183} assigned by default, which
-- ignores the error given if the directory already exists.
-- To re-enable this error you need to pass in either the empty
-- list {} or another list of other error codes, but reasonably
-- you probably don't care if a CreateDirectory attempt technically
-- fails because the directory already exists.
--<<
--
--Example Useage:
-->>
-- require "aard_lua_ffi"
--
-- print("A")
-- if not aard_lua_ffi.CreateDirectory(GetInfo(66).."test\\test", true) then
-- print("Failed A")
-- end
--
-- print("B")
-- if not aard_lua_ffi.CreateDirectory(GetInfo(66).."test\\test", true) then
-- print("Failed B")
-- end
--
-- print("C")
-- if not aard_lua_ffi.CreateDirectory(GetInfo(66).."test\\test", true, {}) then
-- print("Failed C")
-- end
--<<
--This will likely print: "A", "B", "C", an error report that the directory already exists, "Failed C"
--
--
--
-- declarations
--
local ffi_ok, ffi = pcall(require, "ffi")
if not ffi_ok then
utils.msgbox ( "Your MUSHclient package appears to be missing the LuaJIT FFI extensions.\r\nThis is bad.\r\nMostly this is bad, because one of your plugins wants to use LuaJIT FFI extension capability.\r\n\r\nHow did you get here?\r\n\r\n1) You thought it would be safe to replace your Lua DLLs? It's not.\r\n2) You downloaded an installer from mushclient.com or gammon.com.au and thought it would be safe to install that on top of the Aardwolf MUSHclient Package? It's not.\r\n3) You accidentally something something? Be more careful.\r\n4) File system corruption? Ruh-roh, Shaggy. Time to call tech support.", "Your MUSHclient Install is Broken", "ok", ".")
end
local ffi_charstr = ffi.typeof("char[?]")
ffi.cdef([[
typedef enum {
FO_MOVE = 0x0001,
FO_COPY = 0x0002,
FO_DELETE = 0x0003,
FO_RENAME = 0x0004,
___size = 0xFFFFFFFF
} FILEOP_FUNC;
typedef enum {
FOF_MULTIDESTFILES = 0x0001,
FOF_CONFIRMMOUSE = 0x0002,
FOF_SILENT = 0x0004,
FOF_RENAMEONCOLLISION = 0x0008,
FOF_NOCONFIRMATION = 0x0010,
FOF_WANTMAPPINGHANDLE = 0x0020,
FOF_ALLOWUNDO = 0x0040,
FOF_FILESONLY = 0x0080,
FOF_SIMPLEPROGRESS = 0x0100,
FOF_NOCONFIRMMKDIR = 0x0200,
FOF_NOERRORUI = 0x0400,
FOF_NOCOPYSECURITYATTRIBS = 0x0800,
FOF_NORECURSION = 0x1000
} FILEOP_FLAGS;
typedef bool BOOL;
typedef unsigned long DWORD, *PDWORD, *LPDWORD;
typedef void *PVOID, *LPVOID;
typedef const void *LPCVOID;
typedef PVOID HWND;
typedef char *LPTSTR;
typedef const char *LPCSTR, *LPCTSTR, *PCTSTR, *PCZZTSTR;
typedef struct {
HWND hwnd;
FILEOP_FUNC wFunc;
PCZZTSTR pFrom; // zero zero terminated
PCZZTSTR pTo; // zero zero terminated
FILEOP_FLAGS fFlags;
BOOL fAnyOperationsAborted;
LPVOID hNameMappings;
PCTSTR lpszProgressTitle; // only used if FOF_SIMPLEPROGRESS
} SHFILEOPSTRUCTA, *LPSHFILEOPSTRUCTA;
typedef struct _SECURITY_ATTRIBUTES {
DWORD nLength;
LPVOID lpSecurityDescriptor;
BOOL bInheritHandle;
} SECURITY_ATTRIBUTES, *PSECURITY_ATTRIBUTES, *LPSECURITY_ATTRIBUTES;
static const int FORMAT_MESSAGE_FROM_SYSTEM = 0x00001000;
static const int FORMAT_MESSAGE_IGNORE_INSERTS = 0x00000200;
int __stdcall SHFileOperationA(LPSHFILEOPSTRUCTA lpFileOp);
int __stdcall SHCreateDirectoryExA(HWND hwnd, LPCTSTR pszPath, const SECURITY_ATTRIBUTES* lpSecurityAttributes); // deprecated api?
BOOL __stdcall CreateDirectoryA(LPCTSTR lpPathName, LPSECURITY_ATTRIBUTES lpSecurityAttributes);
BOOL __stdcall MoveFileA(LPCTSTR lpExistingFileName, LPCTSTR lpNewFileName);
BOOL PathCanonicalizeA(LPTSTR lpszDst, LPCTSTR lpszSrc);
DWORD __stdcall GetLastError(void);
DWORD __stdcall FormatMessageA(DWORD dwFlags, LPCVOID lpSource, DWORD dwMessageId, DWORD dwLanguageId, LPTSTR lpBuffer, DWORD nSize, va_list *Arguments);
]])
--
-- connect non-automatic libraries
--
local SHFileOperationA = ffi.load("Shell32").SHFileOperationA
local SHCreateDirectoryExA = ffi.load("Shell32").SHCreateDirectoryExA -- deprecated api?
local PathCanonicalizeA = ffi.load("shlwapi.dll").PathCanonicalizeA
--------------------------
--------------------------
local function CheckForWinError(err, acceptable_errors)
acceptable_errors = acceptable_errors or {}
for i,v in ipairs(acceptable_errors) do
acceptable_errors[tostring(v)] = true
end
if err ~= 0 and not acceptable_errors[tostring(err)] then
print("")
local str = ffi_charstr(1024, 0)
local errlen = ffi.C.FormatMessageA(ffi.C.FORMAT_MESSAGE_FROM_SYSTEM + ffi.C.FORMAT_MESSAGE_IGNORE_INSERTS, nil, err, 0, str, 1023, nil)
if errlen == 0 then
ColourNote("yellow", "red", "Received Win32 error code: "..tostring(err).." but encountered another error calling FormatMessageA")
ColourNote("yellow", "red", "Try to see what this code means at:")
ColourNote("yellow", "red", " https://msdn.microsoft.com/en-us/library/windows/desktop/ms681381.aspx")
else
ColourNote("yellow", "red", "Received Win32 error code:", err, ffi.string(str, errlen))
end
local author = GetPluginInfo(GetPluginID(), 2) -- GetPluginInfo and GetPluginID are a MUSHclient API call
if author == nil or author == "" then
author = "Fiendish"
end
ColourNote("yellow", "red", "If you think this shouldn't be considered an error, please tell the script author (maybe "..author.."?).")
ColourNote("yellow", "red", debug.traceback())
print("")
return false
end
return true
end
local function RestrictPathScope(path)
local original_path = path
-- clean up path separators
path = path:gsub("/","\\")
repeat
path, num = path:gsub("\\\\", "\\")
until num == 0
local firstchar = string.sub(original_path,1,1)
if firstchar == "\\" or firstchar == "/" then
path = "\\"..path -- put UNC code back
end
local mushclient_canonical_path = ffi_charstr(1024, 0)
if not PathCanonicalizeA(mushclient_canonical_path, GetInfo(66)) then -- GetInfo is a MUSHclient API call
CheckForWinError(ffi.C.GetLastError())
return false
end
local canonical_path = ffi_charstr(1024, 0)
if not PathCanonicalizeA(canonical_path, path) then
CheckForWinError(ffi.C.GetLastError())
return false
end
canonical_path = ffi.string(canonical_path)
if canonical_path:find(ffi.string(mushclient_canonical_path), nil, true) ~= 1 then
ColourNote("yellow", "red", "ERROR: A script just tried to operate on a file outside of your MUSHclient directory.")
ColourNote("yellow", "red", "The action has been prevented.")
ColourNote("yellow", "red", "Details:")
ColourNote("yellow", "red", "-------------------------------------------------------")
ColourNote("yellow", "red", "Attempted File Path: "..original_path)
ColourNote("yellow", "red", "MUSHclient Directory: "..GetInfo(66)) -- GetInfo is a MUSHclient API call
plugin_id = GetPluginID() -- GetPluginID is a MUSHclient API call
if plugin_id ~= "" then
ColourNote("yellow", "red", "Plugin ID: "..plugin_id)
ColourNote("yellow", "red", "Plugin Name: "..GetPluginInfo(plugin_id, 1)) -- GetPluginInfo is a MUSHclient API call
ColourNote("yellow", "red", "Plugin File: "..GetPluginInfo(plugin_id, 6)) -- GetPluginInfo is a MUSHclient API call
end
ColourNote("yellow", "red", debug.traceback())
print("")
return false
end
return true, canonical_path
end
--
-- public interface functions:
--
-- wraps SHFileOperationA using SHFILEOPSTRUCTA.wFunc=FO_DELETE
-- https://msdn.microsoft.com/en-us/library/windows/desktop/bb762164.aspx
-- https://msdn.microsoft.com/en-us/library/windows/desktop/bb759795.aspx
local function DeleteFile(pathname, recursive, acceptable_errors)
succ, pathname = RestrictPathScope(pathname)
if not succ then
return false
end
acceptable_errors = acceptable_errors or {2, 1026} -- already gone
local SHDeleteFlags = ffi.C.FOF_NOCONFIRMATION + ffi.C.FOF_NOERRORUI + ffi.C.FOF_SILENT
if not recursive then
SHDeleteFlags = SHDeleteFlags + ffi.C.FOF_NORECURSION
end
local fos = ffi.new("SHFILEOPSTRUCTA")
fos.wFunc = "FO_DELETE"
fos.pFrom = pathname.."\000"
fos.fFlags = SHDeleteFlags
return CheckForWinError(SHFileOperationA(fos), acceptable_errors)
end
-- wraps SHCreateDirectoryExA if recursive
-- wraps CreateDirectoryA if not
-- https://msdn.microsoft.com/en-us/library/windows/desktop/bb762131.aspx
-- https://msdn.microsoft.com/en-us/library/windows/desktop/aa363855.aspx
local function CreateDirectory(path_to_create, recursive, acceptable_errors)
succ, path_to_create = RestrictPathScope(path_to_create)
if not succ then
return false
end
acceptable_errors = acceptable_errors or {183} -- already exists
if recursive then
return CheckForWinError(SHCreateDirectoryExA(nil, path_to_create, nil), acceptable_errors)
else
ffi.C.CreateDirectoryA(path_to_create, nil)
return CheckForWinError(ffi.C.GetLastError(), acceptable_errors)
end
end
-- wraps MoveFileA
-- https://msdn.microsoft.com/en-us/library/windows/desktop/aa365239.aspx
local function MoveFile(src, dest, acceptable_errors)
acceptable_errors = acceptable_errors or {}
succ, src = RestrictPathScope(src)
if not succ then
return false
end
succ, dest = RestrictPathScope(dest)
if not succ then
return false
end
if 0 == ffi.C.MoveFileA(src, dest) then
return CheckForWinError(ffi.C.GetLastError(), acceptable_errors)
end
end
--
-- export public functions
--
aard_lua_ffi = {
MoveFile = MoveFile, -- (source, destination, acceptable_errors)
CreateDirectory = CreateDirectory, -- (path_to_create, recursive, acceptable_errors)
DeleteFile = DeleteFile, -- (path_name, recursive, acceptable_errors)
RestrictPathScope = RestrictPathScope
}

View File

@@ -0,0 +1,5 @@
WindowCreate = function(w, ...)
ret = world.WindowCreate(w, ...)
CallPlugin("462b665ecb569efbf261422f", "registerMiniwindow", w)
return ret
end

View File

@@ -0,0 +1,2 @@
require "checkplugin"
do_plugin_check_now("50f4e1fc89999ce02a216a3c", "aard_requirements")

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1 @@
dofile(GetInfo(60).."aardwolf_colors.lua")

View File

@@ -0,0 +1,158 @@
-- addxml.lua
-- lets you add triggers, aliases, timers, macros using XML code
--
-- See: http://www.gammon.com.au/forum/?id=7123
--[[
This lets you add items by simply setting up a table of their attributes and then adding it.
Exposed functions are:
addxml.trigger -- add a trigger
addxml.alias -- add an alias
addxml.timer -- add a timer
addxml.macro -- add a macro
addxml.save -- convert one of the above back into a table
Example of adding a trigger:
require "addxml"
addxml.trigger { match = "swordfish",
regexp = true,
['repeat'] = true, -- repeat is lua keyword
send = "hi there",
sequence = 50,
enabled = true,
name = "boris",
}
Example of converting a trigger back into a table:
require "tprint"
require "addxml"
tprint (addxml.save ("trigger", "boris"))
--]]
module (..., package.seeall)
local html_replacements = {
["<"] = "&lt;",
[">"] = "&gt;",
["&"] = "&amp;",
['"'] = "&quot;",
}
-- fix text so that < > & and double-quote are escaped
local function fixhtml (s)
return (string.gsub (tostring (s), '[<>&"]',
function (str)
return html_replacements [str] or str
end ))
end -- fixhtml
local function GeneralAdd (t, which, plural)
assert (type (t) == "table", "Table must be supplied to add a " .. which)
local k, v
local xml = {}
local send = fixhtml (t.send or "") -- send is done differently
t.send = nil
-- turn into XML options
for k, v in pairs (t) do
-- fix true/false to y/n
if v == true then
v = "y"
elseif v == false then
v = "n"
end -- if true or false
table.insert (xml, k .. '="' .. fixhtml (v) .. '"')
end -- for loop
assert (ImportXML (string.format (
"<%s><%s %s ><send>%s</send></%s></%s>",
plural, -- eg. triggers
which, -- eg. trigger
table.concat (xml, "\n"), -- eg. match="nick"
send, -- eg. "go north"
which, -- eg. trigger
plural) -- eg. triggers
) == 1, "Import of " .. which .. " failed")
end -- GeneralAdd
function trigger (t)
GeneralAdd (t, "trigger", "triggers")
-- force script entry-point resolution
if t.name and t.script then
SetTriggerOption (t.name, "script", t.script)
end -- if trigger has a name, and a script name
end -- addxml.trigger
function alias (t)
GeneralAdd (t, "alias", "aliases")
-- force script entry-point resolution
if t.name and t.script then
SetAliasOption (t.name, "script", t.script)
end -- if alias has a name, and a script name
end -- addxml.alias
function timer (t)
GeneralAdd (t, "timer", "timers")
-- force script entry-point resolution
if t.name and t.script then
SetTimerOption (t.name, "script", t.script)
end -- if timer has a name, and a script name
end -- addxml.timer
function macro (t)
GeneralAdd (t, "macro", "macros")
end -- addxml.macro
function save (which, name)
local typeconversion =
{
trigger = 0,
alias = 1,
timer = 2,
macro = 3,
-- variable = 4,
-- keypad = 5
}
local itemtype = assert (typeconversion [which], "Unknown type: " .. which)
local xml = ExportXML (itemtype, name)
-- if not found returns empty string
assert (xml ~= "", "Can't find " .. which .. ": " .. name)
-- parse back into table entries
local xmlnodes = assert (utils.xmlread (xml), "Bad XML")
-- all attributes should be a couple of levels down
local result = xmlnodes.nodes [1].nodes [1].attributes
-- find "send" text
-- another level?
if xmlnodes.nodes [1].nodes [1].nodes then
if xmlnodes.nodes [1].nodes [1].nodes [1].name == "send" then
result.send = xmlnodes.nodes [1].nodes [1].nodes [1].content
end -- have a "send" field
end -- have a child node
return result
end -- addxml.save

View File

@@ -0,0 +1,80 @@
-- alphanum.lua
--
-- Adapted somewhat from: http://www.davekoelle.com/files/alphanum.lua
-- Also see: http://www.davekoelle.com/alphanum.html
--
-- Implements a sort function that does a more "human readable" sort order.
-- It breaks the sort strings into "chunks" and then compares each one naturally,
-- depending on whether it is a string or a number (eg. z9.doc compares less than z20.doc)
-- It also does a case-insensitive compare (so "nick" and "Nick" come out together).
-- See also: http://www.gammon.com.au/forum/?id=8698
--[[
Example:
require "alphanum"
t={
"z18.doc","z19.doc","z2.doc","z16.doc","z17.doc",
"z1.doc","z101.doc","z102.doc","z11.doc","z12.doc",
"z13.doc","z14.doc","z15.doc","z20.doc","z3.doc",
"z4.doc","z5.doc","z6.doc","z10.doc","z100.doc",
"z7.doc","z8.doc","z9.doc", "Z9A.doc",
}
table.sort(t, alphanum (t))
for i=1, #t do
print(t[i])
end
--]]
function alphanum (t)
assert (type (t) == "table", "Must pass table to be sorted to alphanum")
local function chunkString(str)
local c = {}
for a, b in tostring (str):gmatch("(%d*)(%D*)") do
if a ~= "" then c[#c+1] = tonumber(a) end
if b ~= "" then c[#c+1] = b end
end
return c
end
local chunks = {}
-- build temporary table of the keys
for i=1, #t do
chunks [t [i]] = chunkString (t [i])
end
return function (a, b) -- return our sort comparison function
-- lookup chunked information from previously-built table
local achunks = chunks [a]
local bchunks = chunks [b]
for i = 1, math.min (#achunks, #bchunks) do
local as, bs = achunks [i], bchunks [i]
-- if one is a string, make them both strings
if type (as) == "string" or type (bs) == "string" then
as = (tostring (as)):upper ()
bs = (tostring (bs)):upper ()
end -- at least one is a string
-- if they are equal, move onto the next chunk
if as ~= bs then
return as < bs
end -- if
end -- for each chunk
-- still equal? the one with fewer chunks compares less
return #achunks < #bchunks
end -- sort function
end -- alphanum
return alphanum

View File

@@ -0,0 +1,177 @@
module("async", package.seeall)
local _llthreads = require("llthreads2")
require "socket.http" -- just make sure that this can load so we don't get a surprise later
require "ssl.https" -- just make sure that this can load so we don't get a surprise later
local _ltn12 = require "ltn12"
local thread_pool = {}
local requests = {}
local request_times = {}
local result_callbacks = {}
local timeout_callbacks = {}
local timeouts = {}
-- Use doAsyncRemoteRequest to make generic asynchronous requests.
-- Use HEAD to retrieve just file header information.
-- result_callback_function gets arguments (retval, page, status, headers, full_status, requested_url, request_body)
-- You can set result_callback_function to nil (or the print function) if you just want to print everything that comes back to the screen.
-- callback_on_timeout function gets arguments (requested_url, timeout_after, request_body)
-- request_protocol is HTTP or HTTPS (if not provided, it will be inferred from the request_url)
-- timeout_after is in seconds
-- request_body is either nil, a string (which will switch the HTTP method to POST instead of the default GET), or a table of HTTP request parameters such as source/sink/method/headers. See http://w3.impa.br/~diego/software/luasocket/http.html for more details
function doAsyncRemoteRequest(request_url, result_callback_function, request_protocol, timeout_after, callback_on_timeout, request_body)
if request_protocol == nil then
if starts_with(request_url:lower(), "https:") then
request_protocol = "HTTPS"
elseif starts_with(request_url:lower(), "http:") then
request_protocol = "HTTP"
end
end
if timeout_after == nil then
timeout_after = 30
end
result_callback_function = result_callback_function or print
thread_id = tostring(GetUniqueNumber())
assert(type(request_url) == "string")
assert(request_protocol == "HTTP" or request_protocol == "HTTPS")
assert(type(timeout_after) == "number")
assert(type(result_callback_function) == "function" or type(result_callback_function) == "string")
assert(type(callback_on_timeout) == "function" or type(callback_on_timeout) == "string" or callback_on_timeout == nil)
requests[thread_id] = {['url']=request_url, ['body']=request_body}
timeouts[thread_id] = timeout_after
thread_pool[thread_id] = request(request_url, request_protocol, request_body)
request_times[thread_id] = os.time()
if type(result_callback_function) == "function" then
result_callbacks[thread_id] = result_callback_function
else
result_callbacks[thread_id] = loadstring(result_callback_function)
end
if type(callback_on_timeout) == "function" or callback_on_timeout == nil then
timeout_callbacks[thread_id] = callback_on_timeout
else
timeout_callbacks[thread_id] = loadstring(callback_on_timeout)
end
__checkCompletionFor(thread_id)
end
function HEAD(request_url, result_callback_function, request_protocol, timeout_after, callback_on_timeout)
local request_body = { method = "HEAD" }
doAsyncRemoteRequest(request_url, result_callback_function, request_protocol, timeout_after, callback_on_timeout, request_body)
end
function GETFILE(request_url, result_callback_function, request_protocol, file_name, timeout_after, callback_on_timeout)
local request_body = { sink = file_name }
doAsyncRemoteRequest(request_url, result_callback_function, request_protocol, timeout_after, callback_on_timeout, request_body)
end
function starts_with(str, start)
return str:sub(1, #start) == start
end
function default_timeout_callback(requested_url, timeout, request_body)
print("Request to ["..requested_url.."] timed out after "..tostring(timeout).." second"..(timeout ~= 1 and "s." or "."))
if request_body then
if type(request_body) == "table" then
require "tprint"
print("Message body was: {")
tprint(request_body, 3)
print("}")
else
print("Message Body Was:", request_body)
end
end
end
local network_thread_code = string.dump(function(arg)
local args = arg
local _socketeer = nil
if args.protocol == "HTTPS" then
_socketeer = require("ssl.https")
elseif args.protocol == "HTTP" then
_socketeer = require("socket.http")
else
return false
end
local body = args["body"]
local page, status, headers, full_status
if type(body) == "table" then
_ltn12 = require "ltn12"
body.url = args.url
if type(body.sink) == "string" then -- write to file
body.sink = _ltn12.sink.file(io.open(body.sink, "wb"))
end
if type(body.source) == "string" then
body.headers = body.headers or {}
body.headers["content-length"] = tostring(#body.source)
body.headers["content-type"] = body.headers["content-type"] or "application/x-www-form-urlencoded"
body.method = "POST"
body.source = _ltn12.source.string(body.source)
end
page, status, headers, full_status = _socketeer.request(body)
else
page, status, headers, full_status = _socketeer.request(args.url, body)
end
return page, status, headers, full_status
end)
-- makes an asynchronous HTTP or HTTPS request to a URL
function request(url, protocol, body)
local thread = _llthreads.new(network_thread_code, {url=url, protocol=protocol, body=body})
thread:start()
return thread
end
function __checkCompletionFor(thread_id)
if thread_pool[thread_id]:alive() then
if os.time() - request_times[thread_id] > timeouts[thread_id] then
-- stop trying after timeout_after seconds
local timeout_callback = timeout_callbacks[thread_id]
local request_data = requests[thread_id]
local timeout = timeouts[thread_id]
thread_pool[thread_id] = nil
request_times[thread_id] = nil
result_callbacks[thread_id] = nil
timeout_callbacks[thread_id] = nil
timeouts[thread_id] = nil
requests[thread_id] = nil
if timeout_callback ~= nil then
timeout_callback(request_data['url'], timeout, request_data['body'])
else
default_timeout_callback(request_data['url'], timeout, request_data['body'])
end
else
DoAfterSpecial(0.2, "async.__checkCompletionFor('"..thread_id.."')", sendto.script)
end
else
local retval, page, status, headers, full_status = thread_pool[thread_id]:join()
local request_data = requests[thread_id]
local callback_func = result_callbacks[thread_id]
result_callbacks[thread_id] = nil
timeout_callbacks[thread_id] = nil
thread_pool[thread_id] = nil
request_times[thread_id] = nil
timeouts[thread_id] = nil
requests[thread_id] = nil
callback_func(retval, page, status, headers, full_status, request_data['url'], request_data['body'])
end
end

View File

@@ -0,0 +1,29 @@
--
-- check.lua
--
-- ----------------------------------------------------------
-- return-code checker for MUSHclient functions that return error codes
-- ----------------------------------------------------------
--
--[[
Call for those MUSHclient functions that return a result code (like eOK).
Not all functions return such a code.
eg.
require "check
check (SetVariable ("abc", "def")) --> works ok
check (SetVariable ("abc-", "def")) --> The name of this object is invalid
--]]
function check (result)
if result ~= error_code.eOK then
error (error_desc [result] or
string.format ("Unknown error code: %i", result),
2) -- error level - whoever called this function
end -- if
end -- function check
return check

View File

@@ -0,0 +1,90 @@
-- checkplugin.lua
-- Checks the nominated plugin is installed
function do_plugin_check_now (id, name)
local me -- who am I? plugin or main world script?
local location -- location to attempt to load plugin from
-- allow for being called from main world script
if GetPluginID () == "" then
me = "world script"
location = GetInfo (60)
else
me = GetPluginName () .. " plugin"
location = GetPluginInfo(GetPluginID (), 20)
end -- if
-- first check if installed
if not IsPluginInstalled (id) then
ColourNote ("white", "green", "Plugin '" .. name .. "' not installed. Attempting to install it...")
LoadPlugin (location .. name .. ".xml")
if IsPluginInstalled (id) then
ColourNote ("white", "green", "Success!")
-- here if still not installed
else
ColourNote ("white", "red", string.rep ("-", 80))
ColourNote ("white", "red", "Plugin '" .. name .. "' not installed. Please download and install it.")
ColourNote ("white", "red", "It is required for the correct operation of the " .. me)
ColourNote ("white", "red", string.rep ("-", 80))
return -- skip enabled check
end -- if not installed
end -- plugin was not installed
-- now make sure enabled (suggested by Fiendish - version 4.74+ )
if not GetPluginInfo(id, 17) then
ColourNote ("white", "green", "Plugin '" .. name .. "' not enabled. Attempting to enable it...")
EnablePlugin(id, true)
if GetPluginInfo(id, 17) then
ColourNote ("white", "green", "Success!")
else
ColourNote ("white", "red", string.rep ("-", 80))
ColourNote ("white", "red", "Plugin '" .. name .. "' not enabled. Please make sure it can be enabled.")
ColourNote ("white", "red", "It is required for the correct operation of the " .. me)
ColourNote ("white", "red", string.rep ("-", 80))
end -- if
end -- if not enabled
end -- do_plugin_check_now
function checkplugin (id, name)
if GetOption ("enable_timers") ~= 1 then
ColourNote ("white", "red", "WARNING! Timers not enabled. Plugin dependency checks will not work properly.")
end -- if timers disabled
-- give them time to load
DoAfterSpecial (2,
"do_plugin_check_now ('" .. id .. "', '" .. name .. "')",
sendto.script)
end -- checkplugin
function load_ppi (id, name)
local PPI = require "ppi"
local ppi = PPI.Load(id)
if ppi then
return ppi
end
ColourNote ("white", "green", "Plugin '" .. name .. "' not installed. Attempting to install it...")
LoadPlugin (GetPluginInfo(GetPluginID (), 20) .. name .. ".xml")
ppi = PPI.Load(id) -- try again
if ppi then
ColourNote ("white", "green", "Success!")
return ppi
end
ColourNote ("white", "red", string.rep ("-", 80))
ColourNote ("white", "red", "Plugin '" .. name .. "' not installed. Please download and install it.")
ColourNote ("white", "red", string.rep ("-", 80))
return nil
end -- function load_ppi

View File

@@ -0,0 +1,44 @@
-- Amended slightly by Nick Gammon, from Worstje's version, on 17 Feb 2008
-- Thank you, Shaun Biggs, for taking your time to write the
-- (formerly Copy2) function below. It was slightly altered by me to suit
-- my usage (wordwrapped lines and no \r\n at start of selection). -- Nick Gammon
-- And then I ripped out its heart in a complete refactor. -- Fiendish
-- functions for handling Aardwolf color codes
dofile (GetInfo(60).."aardwolf_colors.lua")
function get_selection_with_color()
-- find selection in output window, if any
local first_line, last_line = GetSelectionStartLine(),
math.min (GetSelectionEndLine(), GetLinesInBufferCount())
local first_column, last_column = GetSelectionStartColumn(), GetSelectionEndColumn()
-- nothing selected, do normal copy
if first_line <= 0 then
return nil
end -- if nothing to copy from output window
local cpstr = ""
-- iterate to build up copy text
for line = first_line, last_line do
if line < last_line then
cpstr = cpstr..StylesToColours(TruncateStyles(GetStyleInfo(line), first_column, GetLineInfo(line).length))
first_column = 1
-- Is this a new line or merely the continuation of a paragraph?
if GetLineInfo(line, 3) then
cpstr = cpstr.."\r\n"
end -- new line
else
cpstr = cpstr..StylesToColours(TruncateStyles(GetStyleInfo(line), first_column, last_column-1))
end -- if
end -- for loop
-- Get rid of a spurious extra new line at the start.
if cpstr:sub(1, 2) == "\r\n" then
cpstr = cpstr:sub (3)
end
return cpstr
end

View File

@@ -0,0 +1,269 @@
-----------------------------------------------------------------------------
-- Provides support for color manipulation in HSL color space.
--
-- http://sputnik.freewisdom.org/lib/colors/
--
-- License: MIT/X
--
-- (c) 2008 Yuri Takhteyev (yuri@freewisdom.org) *
--
-- * rgb_to_hsl() implementation was contributed by Markus Fleck-Graffe.
-----------------------------------------------------------------------------
module(..., package.seeall)
local Color = {}
local Color_mt = {__metatable = {}, __index = Color}
-----------------------------------------------------------------------------
-- Instantiates a new "color".
--
-- @param H hue (0-360) _or_ an RGB string ("#930219")
-- @param S saturation (0.0-1.0)
-- @param L lightness (0.0-1.0)
-- @return an instance of Color
-----------------------------------------------------------------------------
function new(H, S, L)
if type(H) == "string" and H:sub(1,1)=="#" and H:len() == 7 then
H, S, L = rgb_string_to_hsl(H)
end
assert(Color_mt)
return setmetatable({H = H, S = S, L = L}, Color_mt)
end
-----------------------------------------------------------------------------
-- Converts an HSL triplet to RGB
-- (see http://homepages.cwi.nl/~steven/css/hsl.html).
--
-- @param h hue (0-360)
-- @param s saturation (0.0-1.0)
-- @param L lightness (0.0-1.0)
-- @return an R, G, and B component of RGB
-----------------------------------------------------------------------------
function hsl_to_rgb(h, s, L)
h = h/360
local m1, m2
if L<=0.5 then
m2 = L*(s+1)
else
m2 = L+s-L*s
end
m1 = L*2-m2
local function _h2rgb(m1, m2, h)
if h<0 then h = h+1 end
if h>1 then h = h-1 end
if h*6<1 then
return m1+(m2-m1)*h*6
elseif h*2<1 then
return m2
elseif h*3<2 then
return m1+(m2-m1)*(2/3-h)*6
else
return m1
end
end
return _h2rgb(m1, m2, h+1/3), _h2rgb(m1, m2, h), _h2rgb(m1, m2, h-1/3)
end
-----------------------------------------------------------------------------
-- Converts an RGB triplet to HSL.
-- (see http://easyrgb.com)
--
-- @param r red (0.0-1.0)
-- @param g green (0.0-1.0)
-- @param b blue (0.0-1.0)
-- @return corresponding H, S and L components
-----------------------------------------------------------------------------
function rgb_to_hsl(r, g, b)
--r, g, b = r/255, g/255, b/255
local min = math.min(r, g, b)
local max = math.max(r, g, b)
local delta = max - min
local h, s, l = 0, 0, ((min+max)/2)
if l > 0 and l < 0.5 then s = delta/(max+min) end
if l >= 0.5 and l < 1 then s = delta/(2-max-min) end
if delta > 0 then
if max == r and max ~= g then h = h + (g-b)/delta end
if max == g and max ~= b then h = h + 2 + (b-r)/delta end
if max == b and max ~= r then h = h + 4 + (r-g)/delta end
h = h / 6;
end
if h < 0 then h = h + 1 end
if h > 1 then h = h - 1 end
return h * 360, s, l
end
function rgb_string_to_hsl(rgb)
return rgb_to_hsl(tonumber(rgb:sub(2,3), 16)/255,
tonumber(rgb:sub(4,5), 16)/255,
tonumber(rgb:sub(6,7), 16)/255)
end
-----------------------------------------------------------------------------
-- Converts the color to an RGB string.
--
-- @return a 6-digit RGB representation of the color prefixed
-- with "#" (suitable for inclusion in HTML)
-----------------------------------------------------------------------------
function Color:to_rgb()
local rgb = {hsl_to_rgb(self.H, self.S, self.L)}
local buffer = "#"
for i,v in ipairs(rgb) do
buffer = buffer..string.format("%02x",math.floor(v*255+0.5))
end
return buffer
end
-----------------------------------------------------------------------------
-- Creates a new color with hue different by delta.
--
-- @param delta a delta for hue.
-- @return a new instance of Color.
-----------------------------------------------------------------------------
function Color:hue_offset(delta)
return new((self.H + delta) % 360, self.S, self.L)
end
-----------------------------------------------------------------------------
-- Creates a complementary color.
--
-- @return a new instance of Color
-----------------------------------------------------------------------------
function Color:complementary()
return self:hue_offset(180)
end
-----------------------------------------------------------------------------
-- Creates two neighboring colors (by hue), offset by "angle".
--
-- @param angle the difference in hue between this color and the
-- neighbors
-- @return two new instances of Color
-----------------------------------------------------------------------------
function Color:neighbors(angle)
local angle = angle or 30
return self:hue_offset(angle), self:hue_offset(360-angle)
end
-----------------------------------------------------------------------------
-- Creates two new colors to make a triadic color scheme.
--
-- @return two new instances of Color
-----------------------------------------------------------------------------
function Color:triadic()
return self:neighbors(120)
end
-----------------------------------------------------------------------------
-- Creates two new colors, offset by angle from this colors complementary.
--
-- @param angle the difference in hue between the complementary and
-- the returned colors
-- @return two new instances of Color
-----------------------------------------------------------------------------
function Color:split_complementary(angle)
return self:neighbors(180-(angle or 30))
end
-----------------------------------------------------------------------------
-- Creates a new color with saturation set to a new value.
--
-- @param saturation the new saturation value (0.0 - 1.0)
-- @return a new instance of Color
-----------------------------------------------------------------------------
function Color:desaturate_to(saturation)
return new(self.H, saturation, self.L)
end
-----------------------------------------------------------------------------
-- Creates a new color with saturation set to a old saturation times r.
--
-- @param r the multiplier for the new saturation
-- @return a new instance of Color
-----------------------------------------------------------------------------
function Color:desaturate_by(r)
return new(self.H, self.S*r, self.L)
end
-----------------------------------------------------------------------------
-- Creates a new color with lightness set to a new value.
--
-- @param lightness the new lightness value (0.0 - 1.0)
-- @return a new instance of Color
-----------------------------------------------------------------------------
function Color:lighten_to(lightness)
return new(self.H, self.S, lightness)
end
-----------------------------------------------------------------------------
-- Creates a new color with lightness set to a old lightness times r.
--
-- @param r the multiplier for the new lightness
-- @return a new instance of Color
-----------------------------------------------------------------------------
function Color:lighten_by(r)
return new(self.H, self.S, self.L*r)
end
-----------------------------------------------------------------------------
-- Creates n variations of this color using supplied function and returns
-- them as a table.
--
-- @param f the function to create variations
-- @param n the number of variations
-- @return a table with n values containing the new colors
-----------------------------------------------------------------------------
function Color:variations(f, n)
n = n or 5
local results = {}
for i=1,n do
table.insert(results, f(self, i, n))
end
return results
end
-----------------------------------------------------------------------------
-- Creates n tints of this color and returns them as a table
--
-- @param n the number of tints
-- @return a table with n values containing the new colors
-----------------------------------------------------------------------------
function Color:tints(n)
local f = function (color, i, n)
return color:lighten_to(color.L + (1-color.L)/n*i)
end
return self:variations(f, n)
end
-----------------------------------------------------------------------------
-- Creates n shades of this color and returns them as a table
--
-- @param n the number of shades
-- @return a table with n values containing the new colors
-----------------------------------------------------------------------------
function Color:shades(n)
local f = function (color, i, n)
return color:lighten_to(color.L - (color.L)/n*i)
end
return self:variations(f, n)
end
function Color:tint(r)
return self:lighten_to(self.L + (1-self.L)*r)
end
function Color:shade(r)
return self:lighten_to(self.L - self.L*r)
end
Color_mt.__tostring = Color.to_rgb

View File

@@ -0,0 +1,232 @@
-- commas.lua
-- ----------------------------------------------------------
-- Rounding, duration, comma functions
-- See forum thread:
-- http://www.gammon.com.au/forum/?id=7805
--[[
This function rounds any number to the closest integer.
The "tricky" case is exactly half-way.
That is, should 1.5 round to 1 or 2? How about -1.5?
This function rounds 1.5 "up" to 2, and -1.5 "down" to -2.
--]]
-- ----------------------------------------------------------
-- round normally, but when a number ends in exactly .5 round to the nearest even value.
function round_banker(x)
if x == 0 then return 0 end -- prevent returning -0
if (x + 0.5) % 2 == 0 then
return math.floor(x + 0.5)
else
return math.ceil(x - 0.5)
end
end
-- round "up" to absolute value, so we treat negative differently
-- that is, round (-1.5) will return -2
function round (x)
if x >= 0 then
return math.floor (x + 0.5)
end -- if positive
return math.ceil (x - 0.5)
end -- function round
--[[
Duration
This function is designed to display a time interval in "short form".
That is, rounded to the nearest major time interval. Some examples of intervals:
* 3.6 days - displays "4 d"
* 3.5 days - displays "4 d"
* 3.4 days - displays "3 d"
* 3.6 hours - displays "4 h"
* 3.5 hours - displays "4 h"
* 3.4 hours - displays "3 h"
* 3.6 minutes - displays "4 m"
* 3.5 minutes - displays "4 m"
* 3.4 minutes - displays "3 m"
* 59 seconds - displays "59 s"
* 58 seconds - displays "58 s"
* 57 seconds - displays "57 s" ... and so on to "0 s"
--]]
-- ----------------------------------------------------------
function convert_time (secs)
-- handle negative numbers
local sign = ""
if secs < 0 then
secs = math.abs (secs)
sign = "-"
end -- if negative seconds
-- weeks
if secs >= (60 * 60 * 24 * 6.5) then
return sign .. round (secs / (60 * 60 * 24 * 7)) .. " w"
end -- 6.5 or more days
-- days
if secs >= (60 * 60 * 23.5) then
return sign .. round (secs / (60 * 60 * 24)) .. " d"
end -- 23.5 or more hours
-- hours
if secs >= (60 * 59.5) then
return sign .. round (secs / (60 * 60)) .. " h"
end -- 59.5 or more minutes
-- minutes
if secs >= 59.5 then
return sign .. round (secs / 60) .. " m"
end -- 59.5 or more seconds
-- seconds
return sign .. round (secs) .. " s"
end -- function convert_time
--[[
Commas in numbers
This function adds commas to big numbers.
For example 123456 becomes "123,456".
--]]
-- ----------------------------------------------------------
function commas (num)
assert (type (num) == "number" or
type (num) == "string")
local result = ""
-- split number into 3 parts, eg. -1234.545e22
-- sign = + or -
-- before = 1234
-- after = .545e22
local sign, before, after =
string.match (tostring (num), "^([%+%-]?)(%d*)(%.?.*)$")
-- pull out batches of 3 digits from the end, put a comma before them
while string.len (before) > 3 do
result = "," .. string.sub (before, -3, -1) .. result
before = string.sub (before, 1, -4) -- remove last 3 digits
end -- while
-- we want the original sign, any left-over digits, the comma part,
-- and the stuff after the decimal point, if any
return sign .. before .. result .. after
end -- function commas
-- trim leading and trailing spaces from a string
function trim (s)
return (string.gsub (s, "^%s*(.-)%s*$", "%1"))
end -- trim
--[[
Shuffle a table
-- see: http://en.wikipedia.org/wiki/Fisher-Yates_shuffle
Example:
cards = { "Ace", "King", "Queen", "Jack", 10, 9, 8, 7, 6, 5, 4, 3, 2 }
shuffle (cards)
--]]
function shuffle(t)
local n = #t
while n >= 2 do
-- n is now the last pertinent index
local k = math.random(n) -- 1 <= k <= n
-- Quick swap
t[n], t[k] = t[k], t[n]
n = n - 1
end
return t
end
--[[
Directory scanner.
Calls function "f" for every file found in a path starting at "path".
Recurses to handle nested directories. Function "f" is called with two
arguments: (full) filename, statistics
See utils.readdir for the exact names of the entries supplied for each file.
See: http://www.gammon.com.au/forum/?id=9906
Example:
plugins = {}
-- this function is called for every found file
function load_file (name, stats)
if stats.size > 0 and
string.match (name:lower (), "%.xml$") and
not stats.hidden then
table.insert (plugins, name)
end -- if
end -- load_file
-- Scan plugins folder, passing each file found to "load_file" function.
scan_dir (GetInfo (60), load_file)
--]]
function scan_dir (path, f)
-- find all files in that directory
local t = assert (utils.readdir (path .. "\\*"))
for k, v in pairs (t) do
-- recurse to process subdirectory
if v.directory then
if k ~= "." and k ~= ".." then
scan_dir (path .. "\\" .. k, f)
end -- not current or owner directory
else -- call supplied function
f (path .. "\\" .. k, v)
end -- if
end -- for
end -- scan_dir

View File

@@ -0,0 +1,89 @@
-- copytable.lua
--[[
Table copying functions.
See: http://www.gammon.com.au/forum/?id=8042
Ideas by Shaun Biggs, David Haley, Nick Gammon
Date: 21st July 2007
This is intended to copy tables (make a real copy, rather than just the table
reference).
You can do a deep or shallow copy.
Shallow: Simply copies the keys and values.
If a value is a table, you will get the same table as in the original.
Deep: Copies keys and values recursively.
If a value is a table, makes a copy of that table, and so on.
Deep copy based on: http://lua-users.org/wiki/CopyTable
Restrictions: Items must be "safe" to copy (eg. not file IO userdata).
The deep copied tables share the same metatable as the original ones.
To change this, change the line:
return setmetatable(new_table, getmetatable(object))
to:
return setmetatable(new_table, _copy (getmetatable(object))
Example:
t1 = {
m = { a = 1, b = 2 },
n = { c = 3, d = 4 },
}
require "copytable" -- load this file
t2 = copytable.shallow (t1) -- shallow copy
t3 = copytable.deep (t1) -- copies sub tables as well
--]]
module (..., package.seeall)
function deep (object)
local lookup_table = {}
local function _copy (object)
if type (object) ~= "table" then
return object
elseif lookup_table [object] then
return lookup_table [object]
end -- if
local new_table = {}
lookup_table [object] = new_table
for index, value in pairs (object) do
new_table [_copy (index)] = _copy (value)
end -- for
return setmetatable (new_table, getmetatable (object))
end -- function _copy
return _copy (object)
end -- function deepcopy
function shallow (t)
assert (type (t) == "table", "You must specify a table to copy")
local result = {}
for k, v in pairs (t) do
result [k] = v
end -- for each table element
-- copy the metatable
return setmetatable (result, getmetatable (t))
end -- function shallow

View File

@@ -0,0 +1,47 @@
-- declare.lua
-- See: http://www.gammon.com.au/forum/?id=7327
--
-- If you use this inside a function you cannot access global variables that have
-- not already been declared, and must declare all local variables
function force_declarations ()
setfenv (2, setmetatable ({},
{
__index = function (t, n)
error("variable '"..n.."' is not declared", 2)
end,
__newindex = function (t, n, v)
error("assign to undeclared variable '"..n.."'", 2)
end })
)
end -- force_declarations
return force_declarations
--[[
Example of use:
require "declare"
function test (x)
-- capture any global variables we want
local print = print
-- after this we can't access global variables, and must declare local ones
force_declarations ()
-- must declare every variable now before we use it
local a, b, c
print (a)
a = 1
b = 2
c = x * 2
print (c)
end -- test
test (1)
--]]

View File

@@ -0,0 +1,37 @@
function GagBlankLine(index, sequence)
-- Gags the next line if it's blank. The index and sequence variables give extra control over operation but should
-- only be useful if running many of these simultaneously from the same plugin.
index = index or 1
sequence = sequence or 1
AddTriggerEx(
"blank_line_gag_trigger"..index,
"^$",
"DeleteTrigger('blank_line_gag_trigger_unset"..index.."');StopEvaluatingTriggers(true)",
trigger_flag.Enabled + trigger_flag.RegularExpression + trigger_flag.Temporary + trigger_flag.OneShot + trigger_flag.OmitFromLog + trigger_flag.OmitFromOutput,
custom_colour.NoChange,
0,
"",
"",
sendto.script,
sequence
)
AddTriggerEx(
"blank_line_gag_trigger_unset"..index,
".+",
"DeleteTrigger('blank_line_gag_trigger"..index.."')",
trigger_flag.Enabled + trigger_flag.RegularExpression + trigger_flag.Temporary + trigger_flag.OneShot + trigger_flag.KeepEvaluating,
custom_colour.NoChange,
0,
"",
"",
sendto.script,
0
)
end
function UngagBlankLine(index)
DeleteTrigger("blank_line_gag_trigger"..index)
DeleteTrigger("blank_line_gag_trigger_unset"..index)
end

View File

@@ -0,0 +1,224 @@
--[[
Function to draw a gauge (health bar).
You specify the starting point, width, and height.
Also the name to show for the mouse-over window (eg. "HP).
Author(s): Nick Gammon + Fiendish
Date: 14 February 2010
--]]
function gauge (win, -- miniwindow ID to draw in
name, -- string, eg: "HP"
current, max, -- current and max value (eg. 50, 100)
-- if max is nil, then current is a percentage
left, top, width, height, -- where to put it inside the window
fg_colour, bg_colour, -- colour for bar, colour for unfilled part
ticks, tick_colour, -- number of ticks to draw, and in what colour
frame_colour, -- colour for frame around bar
shadow_colour, -- colour for shadow, nil for no shadow
no_gradient, -- don't use the gradient fill effect
backing_hotspot) -- hotspot to use callbacks from
local Fraction
if not current then
return
end -- if
-- max == nil, means current is a percentage
if max then
if max <= 0 then
return
end -- no divide by zero
Fraction = current / max
else
Fraction = current / 100
end -- if
-- fraction in range 0 to 1
Fraction = math.min (math.max (Fraction, 0), 1)
-- set up some defaults
height = height or 15
fg_colour = fg_colour or ColourNameToRGB "mediumblue"
bg_colour = bg_colour or ColourNameToRGB "rosybrown"
ticks = ticks or 5
tick_colour = tick_colour or ColourNameToRGB "silver"
frame_colour = frame_colour or ColourNameToRGB "lightgrey"
-- shadow
if shadow_colour then
WindowRectOp (win, miniwin.rect_fill, left + 2, top + 2, left + width + 2, top + height + 2, shadow_colour)
end -- if
-- background colour - for un-filled part
WindowRectOp (win, miniwin.rect_fill, left, top, left + width, top + height, bg_colour) -- fill entire box
-- how big filled part is
local gauge_width = (width - 2) * Fraction
-- box size must be > 0 or WindowGradient fills the whole thing
if math.floor (gauge_width) > 0 then
if no_gradient then
WindowRectOp (win, miniwin.rect_fill, left+1, top, left+1+gauge_width, top+height, fg_colour)
else
-- top half
WindowGradient (win, left, top,
left + gauge_width, top + height / 2,
0x000000, -- black
fg_colour, 2) -- vertical top to bottom
-- bottom half
WindowGradient (win, left, top + height / 2,
left + gauge_width, top + height-1,
fg_colour,
0x000000, -- black
2) -- vertical top to bottom
end
end -- non-zero
-- draw tick marks if wanted
if ticks > 0 then
-- show ticks (if there are 5 ticks there are 6 gaps)
local ticks_at = width / (ticks + 1)
-- ticks
for i = 1, ticks do
WindowLine (win, left + (i * ticks_at), top,
left + (i * ticks_at), top + height,
tick_colour, 0, 1)
end -- for
end -- ticks wanted
-- draw a box around it (frame)
WindowRectOp (win, miniwin.rect_frame, left, top, left + width, top + height, frame_colour)
if name and #name > 0 then
-- mouse-over information: add hotspot
local mouseover, cancelmouseover, mousedown, cancelmousedown, mouseup, cursor, flags = "", "", "", "", "", 0, 0
local dragmove, dragrelease, dragflags = nil, nil, nil
local tooltip
if max then
tooltip = string.format("%s\t%i / %i (%i%%)", name, current, max, Fraction * 100)
else
tooltip = string.format("%s\t(%i%%)", name, Fraction * 100)
end -- if
if backing_hotspot == true then
local hotspots = WindowHotspotList(win)
if hotspots then
for _, hs in ipairs(hotspots) do
if (
(WindowHotspotInfo(win, hs, 1) <= left) and
(WindowHotspotInfo(win, hs, 3) >= left) and
(WindowHotspotInfo(win, hs, 2) <= top) and
(WindowHotspotInfo(win, hs, 4) >= top)
) then
backing_hotspot = hs
break
end
end
end -- if any
end
if type(backing_hotspot) == "string" then
mouseover = WindowHotspotInfo(win, backing_hotspot, 5) or mouseover
cancelmouseover = WindowHotspotInfo(win, backing_hotspot, 6) or cancelmouseover
mousedown = WindowHotspotInfo(win, backing_hotspot, 7) or mousedown
cancelmousedown = WindowHotspotInfo(win, backing_hotspot, 8) or cancelmousedown
mouseup = WindowHotspotInfo(win, backing_hotspot, 9) or mouseup
cursor = WindowHotspotInfo(win, backing_hotspot, 11) or cursor
flags = WindowHotspotInfo(win, backing_hotspot, 12) or flags
dragmove = WindowHotspotInfo(win, backing_hotspot, 13) or dragmove
dragrelease = WindowHotspotInfo(win, backing_hotspot, 14) or dragrelease
dragflags = WindowHotspotInfo(win, backing_hotspot, 15) or dragflags
end
WindowAddHotspot (
win, name, left, top, left + width, top + height,
mouseover, cancelmouseover, mousedown, cancelmousedown, mouseup,
tooltip, cursor, flags
)
if dragmove or dragrelease then
WindowDragHandler(win, name, dragmove, dragrelease, dragflags)
end
end -- hotspot wanted
end -- function gauge
-- find which element in an array has the largest text size
function max_text_width (win, font_id, t, utf8)
local max = 0
for _, s in ipairs (t) do
max = math.max (max, WindowTextWidth (win, font_id, s, utf8))
end -- for each item
return max
end -- max_text_width
-- get font from preferred font list
function get_preferred_font (t)
local fonts = utils.getfontfamilies ()
-- convert to upper-case
local f2 = {}
for k in pairs (fonts) do
f2 [k:upper ()] = true
end -- for
for _, s in ipairs (t) do
if f2 [s:upper ()] then
return s
end -- if
end -- for each item
return "Courier"
end -- get_preferred_font
function capitalize (x)
return string.upper (string.sub(x, 1, 1)) .. string.lower (string.sub(x, 2))
end -- capitalize
function draw_3d_box (win, left, top, width, height)
local right = left + width
local bottom = top + height
WindowCircleOp (win, miniwin.circle_round_rectangle, left, top, right, bottom, 0x505050, 0, 3, 0, 1) -- dark grey border (3 pixels)
WindowCircleOp (win, miniwin.circle_round_rectangle, left + 1, top + 1, right - 1, bottom - 1, 0x7C7C7C, 0, 1, 0, 1) -- lighter inner border
WindowCircleOp (win, miniwin.circle_round_rectangle, left + 2, top + 2, right - 2, bottom - 2, 0x000000, 0, 1, 0, 1) -- black inside that
WindowLine (win, left + 1, top + 1, right - 1, top + 1, 0xC2C2C2, 0, 1) -- light top edge
WindowLine (win, left + 1, top + 1, left + 1, bottom - 1, 0xC2C2C2, 0, 1) -- light left edge (for 3D look)
end -- draw_3d_box
function draw_text_box (win, font, left, top, text, utf8, text_colour, fill_colour, border_colour)
local width = WindowTextWidth (win, font, text, utf8)
local font_height = WindowFontInfo (win, font, 1)
WindowRectOp (win, miniwin.rect_fill, left - 3, top, left + width + 3, top + font_height, fill_colour) -- fill
WindowText (win, font, text, left, top, 0, 0, text_colour, utf8) -- draw text
WindowRectOp (win, miniwin.rect_frame, left - 3, top, left + width + 3, top + font_height, border_colour) -- border
return width
end -- draw_text_box
-- text with a black outline
function outlined_text(win, font, text, startx, starty, endx, endy, color, utf8)
WindowText(win, font, text, startx-1, starty-1, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx-1, starty, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx-1, starty+1, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx, starty-1, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx, starty+1, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx+1, starty-1, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx+1, starty, endx, endy, 0x000000, utf8)
WindowText(win, font, text, startx+1, starty+1, endx, endy, 0x000000, utf8)
return WindowText(win, font, text, startx, starty, endx, endy, color, utf8)
end

View File

@@ -0,0 +1,48 @@
-- getlines.lua
-- getlines iterator - iterates over a string and returns one item per line
function getlines (str)
local pos = 0
-- the for loop calls this for every iteration
-- returning nil terminates the loop
local function iterator (s)
if not pos then
return nil
end -- end of string, exit loop
local oldpos = pos + 1 -- step past previous newline
pos = string.find (s, "\n", oldpos) -- find next newline
if not pos then -- no more newlines, return rest of string
return string.sub (s, oldpos)
end -- no newline
return string.sub (s, oldpos, pos - 1)
end -- iterator
return iterator, str
end -- getlines
return getlines
--[=[
Example of use:
require "getlines"
test = [[
every good
boy
deserves
fruit]]
for l in getlines (test) do
print ('"' .. l .. '"')
end -- for
--]=]

View File

@@ -0,0 +1,49 @@
-- getstyle.lua
--
--[[
See forum thread: http://www.gammon.com.au/forum/?id=7818
GetStyle:
Finds a style run corresponding to a given column
Returns nil if style run not found (eg. column out of range)
If style run found returns:
* the style table (see below)
* the character at that column
* the style run number (eg. style 3)
The style table should contain the following:
t.text --> text of that (entire) style run
t.length --> length of the (entire) style run
t.textcolour --> text colour (RGB number)
t.backcolour --> background colour (RGB number)
t.style --> style bits (1=bold, 2=underline, 4=italic)
--]]
function GetStyle (styleRuns, wantedColumn)
local currentColumn = 1
-- check arguments
assert (type (styleRuns) == "table",
"First argument to GetStyle must be table of style runs")
assert (type (wantedColumn) == "number" and wantedColumn >= 1,
"Second argument to GetStyle must be column number to find")
-- go through each style
for item, style in ipairs (styleRuns) do
local position = wantedColumn - currentColumn + 1 -- where letter is in style
currentColumn = currentColumn + style.length -- next style starts here
if currentColumn > wantedColumn then -- if we are within this style
return style, string.sub (style.text, position, position), item -- done
end -- if found column
end -- for each style
-- if not found: result is nil
end -- function GetStyle

View File

@@ -0,0 +1,111 @@
-- table of worlds we couldn't open
cannot_open_world = cannot_open_world or {} -- set flag here if can't open world
-- getworld.lua
--
--[[
See forum thread: http://www.gammon.com.au/forum/?id=7991
This simplifies sending triggered lines to another, dummy, world.
get_a_world (name) - returns a world pointer to the named world, opening it if necessary
send_to_world (name, styles) - sends the style runs to the named world, calling get_a_world
to get it
--]]
-- make the named world, if necessary - adds "extra" lines to the world file (eg. plugins)
function make_world (name, extra, folder)
local filename = GetInfo (57)
if folder then
filename = filename .. folder .. "\\"
end -- if folder wanted
filename = filename .. name .. ".mcl"
local f = io.open (filename, "r")
if f then
f:close ()
return
end -- world file exists
f = io.output (filename) -- create world file
assert (f:write ([[
<?xml version="1.0" encoding="iso-8859-1"?>
<!DOCTYPE muclient>
<!-- MUSHclient world file -->
<!-- Written by Nick Gammon -->
<!-- Home Page: http://www.mushclient.com/ -->
<!-- Generated by getworld.lua plugin -->
<muclient>
<world defaults="y"
name="]] .. name .. [["
site="0.0.0.0"
port="4000"
/>
]] .. extra .. [[
</muclient>
]]))
f:close () -- close world file now
-- and open the file ;P
Open (filename)
end -- make_world
-- open a world by name, return world object or nil if cannot
function get_a_world (name, folder)
-- try to find world
local w = GetWorld (name) -- get world
-- if not found, try to open it in worlds directory
if not cannot_open_world [name] and not w then
local filename = GetInfo (57)
if folder then
filename = filename .. folder .. "\\"
end -- if folder wanted
filename = filename .. name .. ".mcl"
Open (filename) -- get MUSHclient to open it
Activate () -- make our original world active again
w = GetWorld (name) -- try again to get the world object
if w then
w:DeleteOutput () -- delete "welcome to MUSHclient" message
else
ColourNote ("white", "red", "Can't open world file: " .. filename)
cannot_open_world [name] = true -- don't repeatedly show failure message
end -- can't find world
end -- can't find world first time around
return w
end -- get_a_world
-- send the styles (eg. from a trigger) to the named world, opening it if necessary
function send_to_world (name, styles)
local w = get_a_world (name)
if w then -- if present
for _, v in ipairs (styles) do
w:ColourTell (RGBColourToName (v.textcolour),
RGBColourToName (v.backcolour),
v.text)
end -- for each style run
w:Note ("") -- wrap up line
end -- world found
return w -- so they can check if we succeeded
end -- send_to_world

View File

@@ -0,0 +1,15 @@
require "sha1"
function gitsha (filename)
function readAll(file)
local f = io.open(file, "rb")
if f == nil then
return ""
end
local content = f:read("*all")
f:close()
return content
end
local filed = readAll(filename)
return sha1.hash("blob "..#filed.."\0"..filed, true)
end

View File

@@ -0,0 +1,113 @@
require "serialize"
local IAC, SB, SE, DO = 0xFF, 0xFA, 0xF0, 0xFD
local GMCP = 201
-- Returns, in DWIM manner, the GMCP data from matching category.
-- Examples: gmcp("room"), gmcp("char.base.tier")
function gmcp(what)
local ret, datastring = CallPlugin("3e7dedbe37e44942dd46d264", "gmcpdata_as_string", what)
pcall(loadstring("data = "..datastring))
return data
end
-- Helper function to send GMCP data.
function Send_GMCP_Packet (what)
assert(what ~= nil, "Send_GMCP_Packet was asked to send a nil message.")
SendPkt (string.char (IAC, SB, GMCP) ..
(string.gsub (what, "\255", "\255\255")) .. -- IAC becomes IAC IAC
string.char (IAC, SE))
end
-- everything below this point is deprecated --
---------------------------------------------------------------------------------------------------
-- FUNCTION:: get_gmcp
-- Reverse of parse_gmcp - takes a value like "room.info.exits.n" and checks each level for
-- the next table and then for the actual value.
---------------------------------------------------------------------------------------------------
function get_gmcp(fieldname, parent)
assert (fieldname, "nil fieldname passed to get_gmcp")
assert (parent, "nil parent passed to get_gmcp")
assert (type (parent) == "table", "non-table parent value passed to get_gmcp")
local lastval = get_last_tag(fieldname)
for item in string.gmatch(fieldname,"%a+") do
if parent[item] ~= nil then
if item == lastval then return parent[item] end
if type(parent[item]) == "table" then
parent = parent[item]
else
return parent[item]
end
else
return "" -- if we asked for something valid, shouldn't get this.
end
end -- for item
return "" -- shouldn't reach here either if we asked for something valid.
end -- function get_gmcp
---------------------------------------------------------------------------------------------------
-- FUNCTION:: get_last_tag
-- Parses inbound string to pull the last of "char.vitals.str" or "room". First is "str",
-- second is just "room". Used to check if we're at the last level when accessing gmcpdata
-- by a keyword.
---------------------------------------------------------------------------------------------------
function get_last_tag(instr)
return string.match(instr,"^.*%.(%a+)$") or instr
end -- get_last_tag
---------------------------------------------------------------------------------------------------
-- FUNCTION:: gmcpval
-- Return an item from the table. Just a wrapper to serialize a table or return a uniqie
-- value that won't error if a value that doesn't exist is requested.
---------------------------------------------------------------------------------------------------
function gmcpval(fieldname)
return gmcpsection(fieldname,true)
end
---------------------------------------------------------------------------------------------------
-- FUNCTION:: gmcpitem
-- Version of gmcpval that should never return a table. Considered an error if it does.
---------------------------------------------------------------------------------------------------
function gmcpitem(fieldname)
return gmcpsection(fieldname,false)
end
---------------------------------------------------------------------------------------------------
-- FUNCTION:: gmcpsection
-- Return an item from the table, may be either a nested table serialized or a single
-- item - depends on the flag. Called by gmcpval (table ok) and gmcpitem (not ok).
---------------------------------------------------------------------------------------------------
function gmcpsection(fieldname,nesting)
assert (gmcpdata, "No gmcpdata variable set.")
local outval = get_gmcp(fieldname,gmcpdata)
if (type(outval) == "table") then
assert(nesting,"nested table value requested from GMCP. Should be single element.")
return serialize.save_simple(outval)
end
if outval == nil or type(outval) == "string" then
return outval
else
return tostring (outval)
end
end

View File

@@ -0,0 +1,24 @@
--[[
Licensed according to the included 'LICENSE' document
Author: Thomas Harning Jr <harningt@gmail.com>
]]
local decode = require("json.decode")
local encode = require("json.encode")
local util = require("json.util")
local _G = _G
local _ENV = nil
local json = {
_VERSION = "1.3.4",
_DESCRIPTION = "LuaJSON : customizable JSON decoder/encoder",
_COPYRIGHT = "Copyright (c) 2007-2014 Thomas Harning Jr. <harningt@gmail.com>",
decode = decode,
encode = encode,
util = util
}
_G.json = json
return json

View File

@@ -0,0 +1,171 @@
--[[
Licensed according to the included 'LICENSE' document
Author: Thomas Harning Jr <harningt@gmail.com>
]]
local lpeg = require("lpeg")
local error = error
local pcall = pcall
local jsonutil = require("json.util")
local merge = jsonutil.merge
local util = require("json.decode.util")
local decode_state = require("json.decode.state")
local setmetatable, getmetatable = setmetatable, getmetatable
local assert = assert
local ipairs, pairs = ipairs, pairs
local string_char = require("string").char
local type = type
local require = require
local _ENV = nil
local modulesToLoad = {
"composite",
"strings",
"number",
"others"
}
local loadedModules = {
}
local json_decode = {}
json_decode.default = {
unicodeWhitespace = true,
initialObject = false,
nothrow = false
}
local modes_defined = { "default", "strict", "simple" }
json_decode.simple = {}
json_decode.strict = {
unicodeWhitespace = true,
initialObject = true,
nothrow = false
}
for _,name in ipairs(modulesToLoad) do
local mod = require("json.decode." .. name)
if mod.mergeOptions then
for _, mode in pairs(modes_defined) do
mod.mergeOptions(json_decode[mode], mode)
end
end
loadedModules[#loadedModules + 1] = mod
end
-- Shift over default into defaultOptions to permit build optimization
local defaultOptions = json_decode.default
json_decode.default = nil
local function generateDecoder(lexer, options)
-- Marker to permit detection of final end
local marker = {}
local parser = lpeg.Ct((options.ignored * lexer)^0 * lpeg.Cc(marker)) * options.ignored * (lpeg.P(-1) + util.unexpected())
local decoder = function(data)
local state = decode_state.create(options)
local parsed = parser:match(data)
assert(parsed, "Invalid JSON data")
local i = 0
while true do
i = i + 1
local item = parsed[i]
if item == marker then break end
if type(item) == 'function' and item ~= jsonutil.undefined and item ~= jsonutil.null then
item(state)
else
state:set_value(item)
end
end
if options.initialObject then
assert(type(state.previous) == 'table', "Initial value not an object or array")
end
-- Make sure stack is empty
assert(state.i == 0, "Unclosed elements present")
return state.previous
end
if options.nothrow then
return function(data)
local status, rv = pcall(decoder, data)
if status then
return rv
else
return nil, rv
end
end
end
return decoder
end
local function buildDecoder(mode)
mode = mode and merge({}, defaultOptions, mode) or defaultOptions
for _, mod in ipairs(loadedModules) do
if mod.mergeOptions then
mod.mergeOptions(mode)
end
end
local ignored = mode.unicodeWhitespace and util.unicode_ignored or util.ascii_ignored
-- Store 'ignored' in the global options table
mode.ignored = ignored
--local grammar = {
-- [1] = mode.initialObject and (ignored * (object_type + array_type)) or value_type
--}
local lexer
for _, mod in ipairs(loadedModules) do
local new_lexer = mod.generateLexer(mode)
lexer = lexer and lexer + new_lexer or new_lexer
end
return generateDecoder(lexer, mode)
end
-- Since 'default' is nil, we cannot take map it
local defaultDecoder = buildDecoder(json_decode.default)
local prebuilt_decoders = {}
for _, mode in pairs(modes_defined) do
if json_decode[mode] ~= nil then
prebuilt_decoders[json_decode[mode]] = buildDecoder(json_decode[mode])
end
end
--[[
Options:
number => number decode options
string => string decode options
array => array decode options
object => object decode options
initialObject => whether or not to require the initial object to be a table/array
allowUndefined => whether or not to allow undefined values
]]
local function getDecoder(mode)
mode = mode == true and json_decode.strict or mode or json_decode.default
local decoder = mode == nil and defaultDecoder or prebuilt_decoders[mode]
if decoder then
return decoder
end
return buildDecoder(mode)
end
local function decode(data, mode)
local decoder = getDecoder(mode)
return decoder(data)
end
local mt = {}
mt.__call = function(self, ...)
return decode(...)
end
json_decode.getDecoder = getDecoder
json_decode.decode = decode
json_decode.util = util
setmetatable(json_decode, mt)
return json_decode

View File

@@ -0,0 +1,64 @@
--[[
Licensed according to the included 'LICENSE' document
Author: Thomas Harning Jr <harningt@gmail.com>
--]]
local lpeg = require("lpeg")
local util = require("json.decode.util")
local jsonutil = require("json.util")
local table_maxn = require("table").maxn
local unpack = unpack
module("json.decode.array")
-- Utility function to help manage slighly sparse arrays
local function processArray(array)
local max_n = table_maxn(array)
-- Only populate 'n' if it is necessary
if #array ~= max_n then
array.n = max_n
end
if jsonutil.InitArray then
array = jsonutil.InitArray(array) or array
end
return array
end
local defaultOptions = {
trailingComma = true
}
default = nil -- Let the buildCapture optimization take place
strict = {
trailingComma = false
}
local function buildCapture(options, global_options)
local ignored = global_options.ignored
-- arrayItem == element
local arrayItem = lpeg.V(util.types.VALUE)
local arrayElements = lpeg.Ct(arrayItem * (ignored * lpeg.P(',') * ignored * arrayItem)^0 + 0) / processArray
options = options and jsonutil.merge({}, defaultOptions, options) or defaultOptions
local capture = lpeg.P("[")
capture = capture * ignored
* arrayElements * ignored
if options.trailingComma then
capture = capture * (lpeg.P(",") + 0) * ignored
end
capture = capture * lpeg.P("]")
return capture
end
function register_types()
util.register_type("ARRAY")
end
function load_types(options, global_options, grammar)
local capture = buildCapture(options, global_options)
local array_id = util.types.ARRAY
grammar[array_id] = capture
util.append_grammar_item(grammar, "VALUE", lpeg.V(array_id))
end

View File

@@ -0,0 +1,116 @@
--[[
Licensed according to the included 'LICENSE' document
Author: Thomas Harning Jr <harningt@gmail.com>
--]]
local lpeg = require("lpeg")
local tostring = tostring
local pairs, ipairs = pairs, ipairs
local next, type = next, type
local error = error
local util = require("json.decode.util")
local buildCall = require("json.util").buildCall
local getmetatable = getmetatable
module("json.decode.calls")
local defaultOptions = {
defs = nil,
-- By default, do not allow undefined calls to be de-serialized as call objects
allowUndefined = false
}
-- No real default-option handling needed...
default = nil
strict = nil
local isPattern
if lpeg.type then
function isPattern(value)
return lpeg.type(value) == 'pattern'
end
else
local metaAdd = getmetatable(lpeg.P("")).__add
function isPattern(value)
return getmetatable(value).__add == metaAdd
end
end
local function buildDefinedCaptures(argumentCapture, defs)
local callCapture
if not defs then return end
for name, func in pairs(defs) do
if type(name) ~= 'string' and not isPattern(name) then
error("Invalid functionCalls name: " .. tostring(name) .. " not a string or LPEG pattern")
end
-- Allow boolean or function to match up w/ encoding permissions
if type(func) ~= 'boolean' and type(func) ~= 'function' then
error("Invalid functionCalls item: " .. name .. " not a function")
end
local nameCallCapture
if type(name) == 'string' then
nameCallCapture = lpeg.P(name .. "(") * lpeg.Cc(name)
else
-- Name matcher expected to produce a capture
nameCallCapture = name * "("
end
-- Call func over nameCallCapture and value to permit function receiving name
-- Process 'func' if it is not a function
if type(func) == 'boolean' then
local allowed = func
func = function(name, ...)
if not allowed then
error("Function call on '" .. name .. "' not permitted")
end
return buildCall(name, ...)
end
else
local inner_func = func
func = function(...)
return (inner_func(...))
end
end
local newCapture = (nameCallCapture * argumentCapture) / func * ")"
if not callCapture then
callCapture = newCapture
else
callCapture = callCapture + newCapture
end
end
return callCapture
end
local function buildCapture(options)
if not options -- No ops, don't bother to parse
or not (options.defs and (nil ~= next(options.defs)) or options.allowUndefined) then
return nil
end
-- Allow zero or more arguments separated by commas
local value = lpeg.V(util.types.VALUE)
local argumentCapture = (value * (lpeg.P(",") * value)^0) + 0
local callCapture = buildDefinedCaptures(argumentCapture, options.defs)
if options.allowUndefined then
local function func(name, ...)
return buildCall(name, ...)
end
-- Identifier-type-match
local nameCallCapture = lpeg.C(util.identifier) * "("
local newCapture = (nameCallCapture * argumentCapture) / func * ")"
if not callCapture then
callCapture = newCapture
else
callCapture = callCapture + newCapture
end
end
return callCapture
end
function load_types(options, global_options, grammar)
local capture = buildCapture(options, global_options)
if capture then
util.append_grammar_item(grammar, "VALUE", capture)
end
end

Some files were not shown because too many files have changed in this diff Show More