carriunix
/
bib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

initial state

This commit is contained in:
Marcus Carrião 2022-01-06 15:36:29 -03:00
commit 6cca7e891e
3 changed files with 3056 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2486
biblioteca.html Normal file
View File

File diff suppressed because it is too large Load Diff

79
cdd.html Executable file
View File

@ -0,0 +1,79 @@
<HTML>
<HEAD>
<TITLE>
biblioteca carriônica
</TITLE>
<LINK rel="shortcut icon" href="img/bibicon.png">
</HEAD>
<META http-equiv="Content-Type" content="text/html; charset=utf-8">
<STYLE>
/* Sortable tables*/
table.sortable thead {background-color:#000000; color:#ffffff; font-weight: bold; cursor: default;}
.hidden{display:none;}
div.titlebar {border:0px; background: white; z-index:100; width:100%;}
div.titlebar a, div.titlebar h3 {display:inline; margin:0 0.1em;text-decoration: none; color:white;}
</STYLE>
<SCRIPT src="sorttable.js"></SCRIPT>
<BODY BGCOLOR=#FFFFFF TEXT=#000000 LINK=#000000 VLINK=#000000 STYLE="width:70%; text-align:justify; margin-left:14%; margin-top: 5%; margin-bottom: 1%; font-family: times; font-size: 16px;">
<DIV STYLE="width:100%; height:230px;"><IMG SRC="img/biblogo.png" STYLE="HEIGHT:230px; FLOAT:RIGHT;"></DIV>
<H1><A HREF="biblioteca.html" STYLE="text-decoration:none">biblioteca carriônica</A></H1>
<BR>
<BR>
<BR>
<center>
<HR WIDTH="95%" SIZE="20" COLOR="#000000">
<BR>
<BR>
<table WIDTH="90%">
<tr><td colspan=3><H4> Código de chamada ou ID: </H4></td></tr>
<tr><td colspan=3><center><img src="img/id.png" height="100px"></center></td></tr>
<tr><td colspan=3> </tr><td>
<tr><td colspan=3><H4> Classificação Decimal Dewey (CDD) Adaptada: </H4></tr><td>
<tr><td> 00 Ciência da computação, conhecimento e sistemas </td><td> 34 Direito </td><td> 67 Indústria </td></tr>
<tr><td> 01 Bibliografia </td><td> 35 Administração pública e ciência militar </td><td> 68 Indústria para usos específicos </td></tr>
<tr><td> 02 Ciência da informação e bibliotecas e Biblioteconomia </td><td> 36 Problemas sociais e serviço sociais </td><td> 69 Construção </td></tr>
<tr><td> 03 Enciclopédia e anuário </td><td> 37 Educação </td><td> 70 Artes </td></tr>
<tr><td> 04 Coleções gerais de Ensaios </td><td> 38 Comércio, comunicação e transportes </td><td> 71 Jardinagem e paisagismo </td></tr>
<tr><td> 05 Revistas, jornais e séries </td><td> 39 Costumes, etiqueta e folclore </td><td> 72 Arquitetura </td></tr>
<tr><td> 06 Associações, organizações e museus </td><td> 40 Línguas </td><td> 73 Escultura, cerâmica e metalurgia </td></tr>
<tr><td> 07 Mídia informativa, jornalismo e publicações </td><td> 41 Linguística </td><td> 74 Desenho e artes decorativas </td></tr>
<tr><td> 08 Citações </td><td> 42 Língua inglesa e inglês antigo </td><td> 75 Pintura </td></tr>
<tr><td> 09 Manuscritos e livros raros </td><td> 43 Língua alemã e afins </td><td> 76 Artes gráficas </td></tr>
<tr><td> 10 Filosofia </td><td> 44 Língua francesa e afins </td><td> 77 Fotografia e arte de computador </td></tr>
<tr><td> 11 Metafísica </td><td> 45 Italiano, romeno e línguas afins </td><td> 78 Música </td></tr>
<tr><td> 12 Epistemologia </td><td> 46 Português e espanhol </td><td> 79 Esportes, jogos e diversão </td></tr>
<tr><td> 13 Parapsicologia e ocultismo </td><td> 47 Latim </td><td> 80 Literatura, retórica e crítica </td></tr>
<tr><td> 14 Escolas filosóficas de pensamento </td><td> 48 Grego clássico e moderno </td><td> 81 Literatura estadunidense </td></tr>
<tr><td> 15 Psicologia </td><td> 49 Outras línguas </td><td> 82 Literatura inglesa </td></tr>
<tr><td> 16 Lógica </td><td> 50 Ciências: história, filosofia e sociedade </td><td> 83 Literatura
alemã, russa, tcheca e afins </td></tr>
<tr><td> 17 Ética </td><td> 51 Matemática </td><td> 84 Literatura francesa e afins </td></tr>
<tr><td> 18 Filosofia antiga, medieval e oriental </td><td> 52 Astronomia </td><td> 85 Literatura italiana, romena e afins </td></tr>
<tr><td> 19 Filosofia ocidental moderna </td><td> 53 Física </td><td> 86 Literatura portuguesa, brasileira e espanhola </td></tr>
<tr><td> 21 Filosofia e teoria da religião </td><td> 54 Química </td><td> 87 Literatura latina </td></tr>
<tr><td> 22 Bíblia </td><td> 55 Ciências da terra e geologia </td><td> 88 Literatura grega clássica e moderna </td></tr>
<tr><td> 23 Cristandade e teologia cristã </td><td> 56 Fósseis e vida pré-histórica </td><td> 89 Outras literaturas </td></tr>
<tr><td> 24 Práticas e hábitos cristãos </td><td> 57 Ciências da vida, biologia </td><td> 90 História </td></tr>
<tr><td> 25 Prática pastoral cristã e ordens religiosas </td><td> 58 Plantas (botânica) </td><td> 91 Geografia e viagem </td></tr>
<tr><td> 26 Organização cristã, trabalho social </td><td> 59 Animais (zoologia) </td><td> 92 Biografia e genealogia </td></tr>
<tr><td> 27 História do cristianismo </td><td> 60 Tecnologia </td><td> 93 História do mundo antigo </td></tr>
<tr><td> 28 Denominações cristãs </td><td> 61 Medicina e saúde </td><td> 94 História da Europa </td></tr>
<tr><td> 29 Outras religiões </td><td> 62 Engenharia </td><td> 95 História da Ásia </td></tr>
<tr><td> 30 Ciências sociais, sociologia e antropologia </td><td> 63 Agricultura </td><td> 96 História da África </td></tr>
<tr><td> 31 Estatística </td><td> 64 Administração do lar e familiar </td><td> 97 História da América do Norte </td></tr>
<tr><td> 32 Ciência política </td><td> 65 Administração e relações públicas </td><td> 98 História da América do Sul </td></tr>
<tr><td> 33 Economia </td><td> 66 Engenharia química </td><td> 99 História de outras áreas </td></tr>
</table>
<br>
<br>
<i>"Si hortum in bibliotheca habes, nihil deerit"</i><br>
<b>--Marcus Tullius Cicero</b>
<BR>
<BR>
<FONT FACE="monospace" SIZE="1">
developed by <A HREF="https://carriunix.tildeteam.org" STYLE="text-decoration:none;"><B>carriunix</B></A>
<BR>
</FONT>
</center>
</body>
</html>

491
sorttable.js Executable file
View File

@ -0,0 +1,491 @@
/*
SortTable
version 2
7th April 2007
Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
Instructions:
Download this file
Add <script src="sorttable.js"></script> to your HTML
Add class="sortable" to any table you'd like to make sortable
Click on the headers to sort
Thanks to many, many people for contributions and suggestions.
Licenced as X11: http://www.kryogenix.org/code/browser/licence.html
This basically means: do what you want with it.
*/
var stIsIE = /*@cc_on!@*/false;
sorttable = {
init: function() {
// quit if this function has already been called
if (arguments.callee.done) return;
// flag this function so we don't do the same thing twice
arguments.callee.done = true;
// kill the timer
if (_timer) clearInterval(_timer);
if (!document.createElement || !document.getElementsByTagName) return;
sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
forEach(document.getElementsByTagName('table'), function(table) {
if (table.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortable(table);
}
});
},
makeSortable: function(table) {
if (table.getElementsByTagName('thead').length == 0) {
// table doesn't have a tHead. Since it should have, create one and
// put the first table row in it.
the = document.createElement('thead');
the.appendChild(table.rows[0]);
table.insertBefore(the,table.firstChild);
}
// Safari doesn't support table.tHead, sigh
if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];
if (table.tHead.rows.length != 1) return; // can't cope with two header rows
// Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
// "total" rows, for example). This is B&R, since what you're supposed
// to do is put them in a tfoot. So, if there are sortbottom rows,
// for backwards compatibility, move them to tfoot (creating it if needed).
sortbottomrows = [];
for (var i=0; i<table.rows.length; i++) {
if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
sortbottomrows[sortbottomrows.length] = table.rows[i];
}
}
if (sortbottomrows) {
if (table.tFoot == null) {
// table doesn't have a tfoot. Create one.
tfo = document.createElement('tfoot');
table.appendChild(tfo);
}
for (var i=0; i<sortbottomrows.length; i++) {
tfo.appendChild(sortbottomrows[i]);
}
delete sortbottomrows;
}
// work through each column and calculate its type
headrow = table.tHead.rows[0].cells;
for (var i=0; i<headrow.length; i++) {
// manually override the type with a sorttable_type attribute
if (!headrow[i].className.match(/\bsorttable_nosort\b/)) { // skip this col
mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/);
if (mtch) { override = mtch[1]; }
if (mtch && typeof sorttable["sort_"+override] == 'function') {
headrow[i].sorttable_sortfunction = sorttable["sort_"+override];
} else {
headrow[i].sorttable_sortfunction = sorttable.guessType(table,i);
}
// make it clickable to sort
headrow[i].sorttable_columnindex = i;
headrow[i].sorttable_tbody = table.tBodies[0];
dean_addEvent(headrow[i],"click", function(e) {
if (this.className.search(/\bsorttable_sorted\b/) != -1) {
// if we're already sorted by this column, just
// reverse the table, which is quicker
sorttable.reverse(this.sorttable_tbody);
this.className = this.className.replace('sorttable_sorted',
'sorttable_sorted_reverse');
this.removeChild(document.getElementById('sorttable_sortfwdind'));
sortrevind = document.createElement('span');
sortrevind.id = "sorttable_sortrevind";
sortrevind.innerHTML = stIsIE ? '&nbsp<font face="webdings">5</font>' : '&nbsp;&#x25B4;';
this.appendChild(sortrevind);
return;
}
if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) {
// if we're already sorted by this column in reverse, just
// re-reverse the table, which is quicker
sorttable.reverse(this.sorttable_tbody);
this.className = this.className.replace('sorttable_sorted_reverse',
'sorttable_sorted');
this.removeChild(document.getElementById('sorttable_sortrevind'));
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
this.appendChild(sortfwdind);
return;
}
// remove sorttable_sorted classes
theadrow = this.parentNode;
forEach(theadrow.childNodes, function(cell) {
if (cell.nodeType == 1) { // an element
cell.className = cell.className.replace('sorttable_sorted_reverse','');
cell.className = cell.className.replace('sorttable_sorted','');
}
});
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
this.className += ' sorttable_sorted';
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
this.appendChild(sortfwdind);
// build an array to sort. This is a Schwartzian transform thing,
// i.e., we "decorate" each row with the actual sort key,
// sort based on the sort keys, and then put the rows back in order
// which is a lot faster because you only do getInnerText once per row
row_array = [];
col = this.sorttable_columnindex;
rows = this.sorttable_tbody.rows;
for (var j=0; j<rows.length; j++) {
row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
}
/* If you want a stable sort, uncomment the following line */
//sorttable.shaker_sort(row_array, this.sorttable_sortfunction);
/* and comment out this one */
row_array.sort(this.sorttable_sortfunction);
tb = this.sorttable_tbody;
for (var j=0; j<row_array.length; j++) {
tb.appendChild(row_array[j][1]);
}
delete row_array;
});
}
}
},
guessType: function(table, column) {
// guess the type of a column based on its first non-blank row
sortfn = sorttable.sort_alpha;
for (var i=0; i<table.tBodies[0].rows.length; i++) {
text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
if (text != '') {
if (text.match(/^-?[<5B>$<24>]?[\d,.]+%?$/)) {
return sorttable.sort_numeric;
}
// check for a date: dd/mm/yyyy or dd/mm/yy
// can have / or . or - as separator
// can be mm/dd as well
possdate = text.match(sorttable.DATE_RE)
if (possdate) {
// looks like a date
first = parseInt(possdate[1]);
second = parseInt(possdate[2]);
if (first > 12) {
// definitely dd/mm
return sorttable.sort_ddmm;
} else if (second > 12) {
return sorttable.sort_mmdd;
} else {
// looks like a date, but we can't tell which, so assume
// that it's dd/mm (English imperialism!) and keep looking
sortfn = sorttable.sort_ddmm;
}
}
}
}
return sortfn;
},
getInnerText: function(node) {
// gets the text we want to use for sorting for a cell.
// strips leading and trailing whitespace.
// this is *not* a generic getInnerText function; it's special to sorttable.
// for example, you can override the cell text with a customkey attribute.
// it also gets .value for <input> fields.
hasInputs = (typeof node.getElementsByTagName == 'function') &&
node.getElementsByTagName('input').length;
if (node.getAttribute("sorttable_customkey") != null) {
return node.getAttribute("sorttable_customkey");
}
else if (typeof node.textContent != 'undefined' && !hasInputs) {
return node.textContent.replace(/^\s+|\s+$/g, '');
}
else if (typeof node.innerText != 'undefined' && !hasInputs) {
return node.innerText.replace(/^\s+|\s+$/g, '');
}
else if (typeof node.text != 'undefined' && !hasInputs) {
return node.text.replace(/^\s+|\s+$/g, '');
}
else {
switch (node.nodeType) {
case 3:
if (node.nodeName.toLowerCase() == 'input') {
return node.value.replace(/^\s+|\s+$/g, '');
}
case 4:
return node.nodeValue.replace(/^\s+|\s+$/g, '');
break;
case 1:
case 11:
var innerText = '';
for (var i = 0; i < node.childNodes.length; i++) {
innerText += sorttable.getInnerText(node.childNodes[i]);
}
return innerText.replace(/^\s+|\s+$/g, '');
break;
default:
return '';
}
}
},
reverse: function(tbody) {
// reverse the rows in a tbody
newrows = [];
for (var i=0; i<tbody.rows.length; i++) {
newrows[newrows.length] = tbody.rows[i];
}
for (var i=newrows.length-1; i>=0; i--) {
tbody.appendChild(newrows[i]);
}
delete newrows;
},
/* sort functions
each sort function takes two parameters, a and b
you are comparing a[0] and b[0] */
sort_numeric: function(a,b) {
aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));
if (isNaN(aa)) aa = 0;
bb = parseFloat(b[0].replace(/[^0-9.-]/g,''));
if (isNaN(bb)) bb = 0;
return aa-bb;
},
sort_alpha: function(a,b) {
if (a[0]==b[0]) return 0;
if (a[0]<b[0]) return -1;
return 1;
},
sort_ddmm: function(a,b) {
mtch = a[0].match(sorttable.DATE_RE);
y = mtch[3]; m = mtch[2]; d = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt1 = y+m+d;
mtch = b[0].match(sorttable.DATE_RE);
y = mtch[3]; m = mtch[2]; d = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt2 = y+m+d;
if (dt1==dt2) return 0;
if (dt1<dt2) return -1;
return 1;
},
sort_mmdd: function(a,b) {
mtch = a[0].match(sorttable.DATE_RE);
y = mtch[3]; d = mtch[2]; m = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt1 = y+m+d;
mtch = b[0].match(sorttable.DATE_RE);
y = mtch[3]; d = mtch[2]; m = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt2 = y+m+d;
if (dt1==dt2) return 0;
if (dt1<dt2) return -1;
return 1;
},
shaker_sort: function(list, comp_func) {
// A stable sort function to allow multi-level sorting of data
// see: http://en.wikipedia.org/wiki/Cocktail_sort
// thanks to Joseph Nahmias
var b = 0;
var t = list.length - 1;
var swap = true;
while(swap) {
swap = false;
for(var i = b; i < t; ++i) {
if ( comp_func(list[i], list[i+1]) > 0 ) {
var q = list[i]; list[i] = list[i+1]; list[i+1] = q;
swap = true;
}
} // for
t--;
if (!swap) break;
for(var i = t; i > b; --i) {
if ( comp_func(list[i], list[i-1]) < 0 ) {
var q = list[i]; list[i] = list[i-1]; list[i-1] = q;
swap = true;
}
} // for
b++;
} // while(swap)
}
}
/* ******************************************************************
Supporting functions: bundled here to avoid depending on a library
****************************************************************** */
// Dean Edwards/Matthias Miller/John Resig
/* for Mozilla/Opera9 */
if (document.addEventListener) {
document.addEventListener("DOMContentLoaded", sorttable.init, false);
}
/* for Internet Explorer */
/*@cc_on @*/
/*@if (@_win32)
document.write("<script id=__ie_onload defer src=javascript:void(0)><\/script>");
var script = document.getElementById("__ie_onload");
script.onreadystatechange = function() {
if (this.readyState == "complete") {
sorttable.init(); // call the onload handler
}
};
/*@end @*/
/* for Safari */
if (/WebKit/i.test(navigator.userAgent)) { // sniff
var _timer = setInterval(function() {
if (/loaded|complete/.test(document.readyState)) {
sorttable.init(); // call the onload handler
}
}, 10);
}
/* for other browsers */
window.onload = sorttable.init;
// written by Dean Edwards, 2005
// with input from Tino Zijdel, Matthias Miller, Diego Perini
// http://dean.edwards.name/weblog/2005/10/add-event/
function dean_addEvent(element, type, handler) {
if (element.addEventListener) {
element.addEventListener(type, handler, false);
} else {
// assign each event handler a unique ID
if (!handler.$$guid) handler.$$guid = dean_addEvent.guid++;
// create a hash table of event types for the element
if (!element.events) element.events = {};
// create a hash table of event handlers for each element/event pair
var handlers = element.events[type];
if (!handlers) {
handlers = element.events[type] = {};
// store the existing event handler (if there is one)
if (element["on" + type]) {
handlers[0] = element["on" + type];
}
}
// store the event handler in the hash table
handlers[handler.$$guid] = handler;
// assign a global event handler to do all the work
element["on" + type] = handleEvent;
}
};
// a counter used to create unique IDs
dean_addEvent.guid = 1;
function removeEvent(element, type, handler) {
if (element.removeEventListener) {
element.removeEventListener(type, handler, false);
} else {
// delete the event handler from the hash table
if (element.events && element.events[type]) {
delete element.events[type][handler.$$guid];
}
}
};
function handleEvent(event) {
var returnValue = true;
// grab the event object (IE uses a global event object)
event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);
// get a reference to the hash table of event handlers
var handlers = this.events[event.type];
// execute each event handler
for (var i in handlers) {
this.$$handleEvent = handlers[i];
if (this.$$handleEvent(event) === false) {
returnValue = false;
}
}
return returnValue;
};
function fixEvent(event) {
// add W3C standard event methods
event.preventDefault = fixEvent.preventDefault;
event.stopPropagation = fixEvent.stopPropagation;
return event;
};
fixEvent.preventDefault = function() {
this.returnValue = false;
};
fixEvent.stopPropagation = function() {
this.cancelBubble = true;
}
// Dean's forEach: http://dean.edwards.name/base/forEach.js
/*
forEach, version 1.0
Copyright 2006, Dean Edwards
License: http://www.opensource.org/licenses/mit-license.php
*/
// array-like enumeration
if (!Array.forEach) { // mozilla already supports this
Array.forEach = function(array, block, context) {
for (var i = 0; i < array.length; i++) {
block.call(context, array[i], i, array);
}
};
}
// generic enumeration
Function.prototype.forEach = function(object, block, context) {
for (var key in object) {
if (typeof this.prototype[key] == "undefined") {
block.call(context, object[key], key, object);
}
}
};
// character enumeration
String.forEach = function(string, block, context) {
Array.forEach(string.split(""), function(chr, index) {
block.call(context, chr, index, string);
});
};
// globally resolve forEach enumeration
var forEach = function(object, block, context) {
if (object) {
var resolve = Object; // default
if (object instanceof Function) {
// functions have a "length" property
resolve = Function;
} else if (object.forEach instanceof Function) {
// the object implements a custom forEach method so use that
object.forEach(block, context);
return;
} else if (typeof object == "string") {
// the object is a string
resolve = String;
} else if (typeof object.length == "number") {
// the object is array-like
resolve = Array;
}
resolve.forEach(object, block, context);
}
};