Commit afc9c045 authored by Stephan Euler's avatar Stephan Euler

mit php etc.

parent fe8e8cba
var alles = new Array();
var colored = new Array();
var lastMax = 7;
var minSchlaege = 1;
function summe2( el, bahn ) {
var schlaege = el.value;
alles[bahn] = parseInt( schlaege );
updateSum();
}
function summe( el, bahn, schlaege ) {
var par = el.parentElement;
if( colored[bahn] ) {
colored[bahn].classList.remove("success");
colored[bahn].firstChild.classList.remove("hidden");
}
par.classList.add("success");
colored[bahn] = par;
alles[bahn] = schlaege;
updateSum();
}
function updateSum() {
var total = 0;
alles.map(function(item){
total += item;
});
var count = 0;
alles.map(function(item){
count += item? 1 : 0;;
});
var el = document.getElementById("sum");
el.innerHTML = '<strong>' + total + '</strong>';
if( count > 0 ) {
var av = total / count;
el.innerHTML += ' &Oslash; ' + av.toPrecision(2);
}
}
function checkRoundInput( rform ) {
test = true;
feedback = "";
/*if( rform.userId.value == -1 ) {
test = false;
feedback += "bitte Spieler ausw&auml;hlen \n";
}
if( rform.courseId.value == -1 ) {
test = false;
feedback += "bitte Anlage ausw&auml;hlen \n";
} */
if( Object.keys(alles).length != 18 ) {
test = false;
feedback += "nicht nur " + Object.keys(alles).length + " Bahnen eingeben \n";
}
if( ! test ) {
//alert( HtmlDecode( feedback ) );
$("#eingabeFehler").removeClass("hide");
$("#eingabeFehler").children("span").text( feedback) ;
}
return test;
}
function checkRoundInputGast( rform ) {
console.log("checkRoundInputGast()");
var feedback = "Als Gast kann man das Ergebnis nicht speichern"
$("#eingabeFehler").removeClass("hide");
$("#eingabeFehler").children("span").text( feedback) ;
return false;
}
function download(text, name, type) {
var a = document.createElement("a");
var file = new Blob([text], {type: type});
a.href = URL.createObjectURL(file);
a.download = name;
a.click();
}
function saveToLocalFile() {
var result = {
courseName : $("#courseInput option:selected" ).text(),
courseId : $("#courseInput").val(),
date : $("#datumInput").val(),
holes : alles,
}
download( JSON.stringify( result, null, '\t' ), 'minigolf.txt', 'text/plain');
}
function selectAll( el, col, val ) {
//alert( col + " " + val);
for( i=1; i<=9; i++ ) {
e = document.getElementById( 'bahn' + (i + col * 9) +'_' + val );
e.click();
}
}
function HtmlDecode(html) {
var div = document.createElement("div");
div.innerHTML = html;
return div.childNodes[0].nodeValue;
}
function generateForm( maxSchlaege, anzahlBahnen ) {
if( screen.width <= 640 ) {
return generateFormSmall( maxSchlaege, anzahlBahnen );;
} else {
return generateFormLarge( maxSchlaege, anzahlBahnen );
}
}
function generateFormSmall( maxSchlaege, anzahlBahnen ) {
res = "";
res += '<table class="rec" border="2">';
for( bi=1; bi<=anzahlBahnen; ++bi ) {
for( var bi2=bi; bi2<=bi+anzahlBahnen; bi2+=anzahlBahnen ) {
res += '<td>' + bi2 + '</td>'
res += '<td><input type="number" class="form-control" min="0" max="' + maxSchlaege + '" name="bahn'+bi2+'" id="bahn' +bi2 + '" onchange="summe2(this,'+bi2+')"></td>'
res += '</td>';
}
res += '</tr>'
}
res += '<tr> <td colspan="2">Summe </td> <td id="sum" colspan="2"></td></tr>';
res += "</table>";
return res;
}
function generateFormLarge( maxSchlaege, anzahlBahnen ) {
res = "";
res += '<table class="rec" border="2">';
res += ' <table class="table table-striped table-hover table-responsive"><thead><tr>';
for( col=0; col<2; col++ ) {
res += ( '<th style="text-align:center">Bahn</th>' );
for( i=minSchlaege; i<=maxSchlaege; i++ ) {
res += ( '<th style="text-align:center">'+i+'</th>');
}
}
res += ( '</tr></thead>' );
res += ( '<tbody><tr>' );
for( bi=0; bi<2; bi++ ) {
res += ( '<td style="text-align:center">alle</td>' );
for( i=minSchlaege; i<=maxSchlaege; i++ ) {
res += ( '<td style="text-align:center"><input type="radio" name="all" value="' + i
+ '" onchange="selectAll(this, '+bi+','+i+')"></td>');
}
}
res += ( '</tr>' );
for( b=1; b<= 9; b++ ) {
res += ( '<tr>' );
for( bi=b; bi<b+10; bi+= 9 ) {
res += ( '<td style="text-align:center">' + bi + '</td>' );
for( i=minSchlaege; i<=maxSchlaege; i++ ) {
res += ( '<td style="text-align:center"><input type="radio" name="bahn'+bi+'" id="bahn' +bi +'_' + i +'" value="' + i
+ '" onchange="summe(this, '+bi+','+i+')"></td>');
}
}
res += ( '</tr>' );
}
res += '<tr> <td>Summe </td> <td id="sum" colspan="'+ (2*maxSchlaege+3)+ '"></td></tr>';
res += ' </table>';
return res;
}
function changeForm() {
var el = document.getElementById("inputTable");
if( lastMax == 7 ) {
lastMax = 10;
minSchlaege = 0;
} else {
lastMax = 7;
minSchlaege = 1;
}
el.innerHTML = generateForm( lastMax, 18);
}
const BLACK = '#000000'
const NAVY = '#000080'
const DARKBLUE = '#00008B'
const MEDIUMBLUE = '#0000CD'
const BLUE = '#0000FF'
const DARKGREEN = '#006400 '
const GREEN = '#008000'
const TEAL = '#008080'
const DARKCYAN = '#008B8B'
const DEEPSKYBLUE = '#00BFFF'
const DARKTURQUOISE = '#00CED1'
const MEDIUMSPRINGGREEN = '#00FA9A'
const LIME = '#00FF00'
const SPRINGGREEN = '# 00FF7F'
const AQUA = '#00FFFF'
const CYAN = '#00FFFF'
const MIDNIGHTBLUE = '#191970'
const DODGERBLUE = '#1E90FF'
const LIGHTSEAGREEN = '#20B2AA'
const FORESTGREEN = '#228B22'
const SEAGREEN = '#2E8B57'
const DARKSLATEGRAY = '#2F4F4F'
const LIMEGREEN = '#32CD32'
const MEDIUMSEAGREEN = '#3CB371'
const TURQUOISE = '#40E0D0'
const ROYALBLUE = '#4169E1'
const STEELBLUE = '#4682B4'
const DARKSLATEBLUE = '#483D8B'
const MEDIUMTURQUOISE = '#48D1CC'
const INDIGO = '#4B0082'
const DARKOLIVEGREEN = '#556B2F'
const CADETBLUE = '#5F9EA0'
const CORNFLOWERBLUE = '#6495ED'
const REBECCAPURPLE = '#663399'
const MEDIUMAQUAMARINE = '#66CDAA'
const DIMGRAY = '#696969'
const SLATEBLUE = '#6A5ACD'
const OLIVEDRAB = '#6B8E23'
const SLATEGRAY = '#708090'
const LIGHTSLATEGRAY = '#778899'
const MEDIUMSLATEBLUE = '#7B68EE'
const LAWNGREEN = '#7CFC00'
const CHARTREUSE = '#7FFF00'
const AQUAMARINE = '#7FFFD4'
const MAROON = '#800000'
const PURPLE = '#800080'
const OLIVE = '#808000'
const GRAY = '#808080'
const SKYBLUE = '#87CEEB'
const LIGHTSKYBLUE = '#87CEFA'
const BLUEVIOLET = '#8A2BE2'
const DARKRED = '#8B0000'
const DARKMAGENTA = '#8B008B'
const SADDLEBROWN = '#8B4513'
const DARKSEAGREEN = '#8FBC8F'
const LIGHTGREEN = '#90EE90'
const MEDIUMPURPLE = '#9370DB'
const DARKVIOLET = '#9400D3'
const PALEGREEN = '#98FB98'
const DARKORCHID = '#9932CC'
const YELLOWGREEN = '#9ACD32'
const SIENNA = '#A0522D'
const BROWN = '#A52A2A'
const DARKGRAY = '#A9A9A9'
const LIGHTBLUE = '#ADD8E6'
const GREENYELLOW = '#ADFF2F'
const PALETURQUOISE = '#AFEEEE'
const LIGHTSTEELBLUE = '#B0C4DE'
const POWDERBLUE = '#B0E0E6'
const FIREBRICK = '#B22222'
const DARKGOLDENROD = '#B8860B'
const MEDIUMORCHID = '#BA55D3'
const ROSYBROWN = '#BC8F8F'
const DARKKHAKI = '#BDB76B'
const SILVER = '#C0C0C0'
const MEDIUMVIOLETRED = '#C71585'
const INDIANRED = '#CD5C5C'
const PERU = '#CD853F'
const CHOCOLATE = '#D2691E'
const TAN = '#D2B48C'
const LIGHTGRAY = '#D3D3D3'
const THISTLE = '#D8BFD8'
const ORCHID = '#DA70D6'
const GOLDENROD = '#DAA520'
const PALEVIOLETRED = '#DB7093'
const CRIMSON = '#DC143C'
const GAINSBORO = '#DCDCDC'
const PLUM = '#DDA0DD'
const BURLYWOOD = '#DEB887'
const LIGHTCYAN = '#E0FFFF'
const LAVENDER = '#E6E6FA'
const DARKSALMON = '#E9967A'
const VIOLET = '#EE82EE'
const PALEGOLDENROD = '#EEE8AA'
const LIGHTCORAL = '#F08080'
const KHAKI = '#F0E68C'
const ALICEBLUE = '#F0F8FF'
const HONEYDEW = '#F0FFF0'
const AZURE = '#F0FFFF'
const SANDYBROWN = '#F4A460'
const WHEAT = '#F5DEB3'
const BEIGE = '#F5F5DC'
const WHITESMOKE = '#F5F5F5'
const MINTCREAM = '#F5FFFA'
const GHOSTWHITE = '#F8F8FF'
const SALMON = '#FA8072'
const ANTIQUEWHITE = '#FAEBD7'
const LINEN = '#FAF0E6'
const LIGHTGOLDENRODYELLOW = '#FAFAD2'
const OLDLACE = '#FDF5E6'
const RED = '#FF0000'
const FUCHSIA = '#FF00FF'
const MAGENTA = '#FF00FF'
const DEEPPINK = '#FF1493'
const ORANGERED = '#FF4500'
const TOMATO = '#FF6347'
const HOTPINK = '#FF69B4'
const CORAL = '#FF7F50'
const DARKORANGE = '#FF8C00'
const LIGHTSALMON = '#FFA07A'
const ORANGE = '#FFA500'
const LIGHTPINK = '#FFB6C1'
const PINK = '#FFC0CB'
const GOLD = '#FFD700'
const PEACHPUFF = '#FFDAB9'
const NAVAJOWHITE = '#FFDEAD'
const MOCCASIN = '#FFE4B5'
const BISQUE = '#FFE4C4'
const MISTYROSE = '#FFE4E1'
const BLANCHEDALMOND = '#FFEBCD'
const PAPAYAWHIP = '#FFEFD5'
const LAVENDERBLUSH = '#FFF0F5'
const SEASHELL = '#FFF5EE'
const CORNSILK = '#FFF8DC'
const LEMONCHIFFON = '#FFFACD'
const FLORALWHITE = '#FFFAF0'
const SNOW = '#FFFAFA'
const YELLOW = '#FFFF00'
const LIGHTYELLOW = '#FFFFE0'
const IVORY = '#FFFFF0'
const WHITE = '#FFFFFF'
/*
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
* Digest Algorithm, as defined in RFC 1321.
* Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* Distributed under the BSD License
* See http://pajhome.org.uk/crypt/md5 for more info.
*/
/*
* Configurable variables. You may need to tweak these to be compatible with
* the server-side, but the defaults work in most cases.
*/
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
/*
* These are the functions you'll usually want to call
* They take string arguments and return either hex or base-64 encoded strings
*/
function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
/*
* Perform a simple self-test to see if the VM is working
*/
function md5_vm_test()
{
return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
}
/*
* Calculate the MD5 of an array of little-endian words, and a bit length
*/
function core_md5(x, len)
{
/* append padding */
x[len >> 5] |= 0x80 << ((len) % 32);
x[(((len + 64) >>> 9) << 4) + 14] = len;
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
for(var i = 0; i < x.length; i += 16)
{
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
}
return Array(a, b, c, d);
}
/*
* These functions implement the four basic operations the algorithm uses.
*/
function md5_cmn(q, a, b, x, s, t)
{
return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
}
function md5_ff(a, b, c, d, x, s, t)
{
return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
}
function md5_gg(a, b, c, d, x, s, t)
{
return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
}
function md5_hh(a, b, c, d, x, s, t)
{
return md5_cmn(b ^ c ^ d, a, b, x, s, t);
}
function md5_ii(a, b, c, d, x, s, t)
{
return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
}
/*
* Calculate the HMAC-MD5, of a key and some data
*/
function core_hmac_md5(key, data)
{
var bkey = str2binl(key);
if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
var ipad = Array(16), opad = Array(16);
for(var i = 0; i < 16; i++)
{
ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;
}
var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
return core_md5(opad.concat(hash), 512 + 128);
}
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
*/
function safe_add(x, y)
{
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
/*
* Bitwise rotate a 32-bit number to the left.
*/
function bit_rol(num, cnt)
{
return (num << cnt) | (num >>> (32 - cnt));
}
/*
* Convert a string to an array of little-endian words
* If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
*/
function str2binl(str)
{
var bin = Array();
var mask = (1 << chrsz) - 1;
for(var i = 0; i < str.length * chrsz; i += chrsz)
bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
return bin;
}
/*
* Convert an array of little-endian words to a string
*/
function binl2str(bin)
{
var str = "";
var mask = (1 << chrsz) - 1;
for(var i = 0; i < bin.length * 32; i += chrsz)
str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
return str;
}
/*
* Convert an array of little-endian words to a hex string.
*/
function binl2hex(binarray)
{
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
for(var i = 0; i < binarray.length * 4; i++)
{
str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
}
return str;
}
/*
* Convert an array of little-endian words to a base-64 string
*/
function binl2b64(binarray)
{
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var str = "";
for(var i = 0; i < binarray.length * 4; i += 3)
{
var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
| (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
| ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
for(var j = 0; j < 4; j++)
{
if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
}
}
return str;
}
Copyright (c) 2012, Greg Fleming (greg.fleming@openmailbox.org),
with Reserved Font Name Railway.
This Font Software is licensed under the SIL Open Font License, Version 1.1.
This license is copied below, and is also available with a FAQ at:
http://scripts.sil.org/OFL
-----------------------------------------------------------
SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
-----------------------------------------------------------
PREAMBLE
The goals of the Open Font License (OFL) are to stimulate worldwide
development of collaborative font projects, to support the font creation
efforts of academic and linguistic communities, and to provide a free and
open framework in which fonts may be shared and improved in partnership
with others.
The OFL allows the licensed fonts to be used, studied, modified and
redistributed freely as long as they are not sold by themselves. The
fonts, including any derivative works, can be bundled, embedded,
redistributed and/or sold with any software provided that any reserved
names are not used by derivative works. The fonts and derivatives,
however, cannot be released under any other type of license. The
requirement for fonts to remain under this license does not apply
to any document created using the fonts or their derivatives.
DEFINITIONS
"Font Software" refers to the set of files released by the Copyright
Holder(s) under this license and clearly marked as such. This may
include source files, build scripts and documentation.
"Reserved Font Name" refers to any names specified as such after the
copyright statement(s).
"Original Version" refers to the collection of Font Software components as
distributed by the Copyright Holder(s).
"Modified Version" refers to any derivative made by adding to, deleting,
or substituting -- in part or in whole -- any of the components of the
Original Version, by changing formats or by porting the Font Software to a
new environment.
"Author" refers to any designer, engineer, programmer, technical
writer or other person who contributed to the Font Software.
PERMISSION & CONDITIONS
Permission is hereby granted, free of charge, to any person obtaining
a copy of the Font Software, to use, study, copy, merge, embed, modify,
redistribute, and sell modified and unmodified copies of the Font
Software, subject to the following conditions:
1) Neither the Font Software nor any of its individual components,
in Original or Modified Versions, may be sold by itself.
2) Original or Modified Versions of the Font Software may be bundled,
redistributed and/or sold with any software, provided that each copy
contains the above copyright notice and this license. These can be
included either as stand-alone text files, human-readable headers or
in the appropriate machine-readable metadata fields within text or
binary files as long as those fields can be easily viewed by the user.
3) No Modified Version of the Font Software may use the Reserved Font
Name(s) unless explicit written permission is granted by the corresponding
Copyright Holder. This restriction only applies to the primary font name as
presented to the users.
4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
Software shall not be used to promote, endorse or advertise any
Modified Version, except to acknowledge the contribution(s) of the
Copyright Holder(s) and the Author(s) or with their explicit written
permission.
5) The Font Software, modified or unmodified, in part or in whole,
must be distributed entirely under this license, and must not be
distributed under any other license. The requirement for fonts to
remain under this license does not apply to any document created
using the Font Software.
TERMINATION
This license becomes null and void if any of the above conditions are
not met.
DISCLAIMER
THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,