yetangitu/canvas-based-HTML5-Comic-Book-Reader
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Merge branch 'master' of https://github.com/balaclark/HTML5-Comic-Book-Reader

Browse source 
Conflicts:
	Makefile
	css/styles.css
	examples/basic.html
	img/iconic/sprite.png
	img/iconic/sprite.psd
	lib/ComicBook.js
	lib/ComicBook.min.js
	lib/pixastic
This commit is contained in:
Puzzlet Chung 2013-10-15 01:52:52 +09:00
commit bfb635adb1
76 changed files with 10283 additions and 1455 deletions
Download patch file Download diff file Expand all files Collapse all files

4
.gitignore vendored
View file

@ -3,3 +3,7 @@
.DS_Store
.project
.settings
lib/tests/pid.txt
comicbook
node_modules

6
.gitmodules vendored
View file

@ -1,6 +0,0 @@
[submodule "lib/pixastic"]
path = lib/pixastic
url = https://github.com/jseidelin/pixastic.git
[submodule "css/Aristo"]
path = css/Aristo
url = git://github.com/taitems/Aristo-jQuery-UI-Theme.git

3
.travis.yml Normal file
View file

@ -0,0 +1,3 @@
language: node_js
node_js:
- "0.10"

0
bin/closure-complier/COPYING → LICENSE
View file

55
Makefile Normal file → Executable file
View file

@ -1,20 +1,49 @@
SOURCES = lib/pixastic/pixastic.js \
lib/pixastic/pixastic.effects.js \
lib/pixastic/pixastic.worker.js \
lib/pixastic/pixastic.worker.control.js \
lib/ComicBook.js
#
# build package & update examples
#
all: reset lib/ComicBook.combined.js lib/ComicBook.min.js
build:
@echo "Running jshint..."
@./node_modules/.bin/jshint lib/ComicBook.js --config lib/.jshintrc
@echo "Compiling Handlebars templates..."
@./node_modules/.bin/handlebars templates/*.handlebars -f lib/templates.js
@echo "Compiling and minifying javascript..."
@mkdir -p comicbook/js/pixastic
@cat lib/vendor/pixastic/pixastic.js lib/vendor/pixastic/pixastic.effects.js lib/vendor/pixastic/pixastic.worker.js lib/vendor/handlebars.runtime-1.0.rc.1.min.js lib/templates.js lib/ComicBook.js > comicbook/js/comicbook.js
@cp lib/vendor/pixastic/pixastic.js comicbook/js/pixastic
@cp lib/vendor/pixastic/pixastic.effects.js comicbook/js/pixastic
@cp lib/vendor/pixastic/pixastic.worker.js comicbook/js/pixastic
@cp lib/vendor/pixastic/pixastic.worker.control.js comicbook/js/pixastic
@cp lib/vendor/pixastic/license-gpl-3.0.txt comicbook/js/pixastic
@cp lib/vendor/pixastic/license-mpl.txt comicbook/js/pixastic
@./node_modules/.bin/uglifyjs -nc comicbook/js/comicbook.js > comicbook/js/comicbook.min.js
@echo "Compiling CSS..."
@cat fonts/icomoon-toolbar/style.css css/reset.css css/styles.css css/toolbar.css > comicbook/comicbook.css
@echo "Copying assets..."
@cp -r css/img comicbook/img
@cp -r fonts/icomoon-toolbar/fonts comicbook
@cp -r fonts/icomoon-toolbar/license.txt comicbook/fonts
@echo "Updating examples"
@cp -r comicbook examples
@echo "Done"
lib/ComicBook.combined.js: ${SOURCES}
cat > $@ $^
#
# run jshint & quint tests
#
lib/ComicBook.min.js: lib/ComicBook.combined.js
java -jar bin/closure-complier/compiler.jar --compilation_level SIMPLE_OPTIMIZATIONS --js $< --js_output_file $@
test:
@./node_modules/.bin/jshint lib/ComicBook.js --config lib/.jshintrc
@./node_modules/.bin/jshint lib/tests/unit/*.js --config lib/.jshintrc
@node lib/tests/server.js &
@./node_modules/.bin/phantomjs lib/tests/phantom.js "http://localhost:3000/lib/tests"
@kill -9 `cat lib/tests/pid.txt`
@rm lib/tests/pid.txt
reset:
rm -f lib/ComicBook.min.js
#
# remove prior builds
#
clean:
rm lib/ComicBook.combined.js
@rm -r comicbook
@rm -r examples/comicbook

38
README.md Executable file
View file

@ -0,0 +1,38 @@
Comic Book Reader
=================
[![Build Status](https://api.travis-ci.org/balaclark/HTML5-Comic-Book-Reader.png)](https://travis-ci.org/balaclark/HTML5-Comic-Book-Reader)
A canvas based web application for reading comics. You can also see an implementation
of this as an offline Chrome packaged application CBZ / CBR comic book reader at:
https://github.com/balaclark/chrome-comic-reader.
Usage
-----
See included examples.
Development Install
-------------------
Builds require nodejs and npm. Installs have been tested with nodejs 0.10.0, older
versions may or may not work.
npm install
make
make test
Copyright and License
---------------------
Copyright 2010 Bala Clark
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
this work except in compliance with the License. You may obtain a copy of the
License in the LICENSE file, or at:
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed
under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
CONDITIONS OF ANY KIND, either express or implied. See the License for the
specific language governing permissions and limitations under the License.

292
bin/closure-complier/README
View file

@ -1,292 +0,0 @@
/*
* Copyright 2009 The Closure Compiler Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
//
// Contents
//
The Closure Compiler performs checking, instrumentation, and
optimizations on JavaScript code. The purpose of this README is to
explain how to build and run the Closure Compiler.
The Closure Compiler requires Java 6 or higher.
http://www.java.com/
//
// Building The Closure Compiler
//
There are three ways to get a Closure Compiler executable.
1) Use one we built for you.
Pre-built Closure binaries can be found at
http://code.google.com/p/closure-compiler/downloads/list
2) Check out the source and build it with Apache Ant.
First, check out the full source tree of the Closure Compiler. There
are instructions on how to do this at the project site.
http://code.google.com/p/closure-compiler/source/checkout
Apache Ant is a cross-platform build tool.
http://ant.apache.org/
At the root of the source tree, there is an Ant file named
build.xml. To use it, navigate to the same directory and type the
command
ant jar
This will produce a jar file called "build/compiler.jar".
3) Check out the source and build it with Eclipse.
Eclipse is a cross-platform IDE.
http://www.eclipse.org/
Under Eclipse's File menu, click "New > Project ..." and create a
"Java Project." You will see an options screen. Give the project a
name, select "Create project from existing source," and choose the
root of the checked-out source tree as the existing directory. Verify
that you are using JRE version 6 or higher.
Eclipse can use the build.xml file to discover rules. When you
navigate to the build.xml file, you will see all the build rules in
the "Outline" pane. Run the "jar" rule to build the compiler in
build/compiler.jar.
//
// Running The Closure Compiler
//
Once you have the jar binary, running the Closure Compiler is straightforward.
On the command line, type
java -jar compiler.jar
This starts the compiler in interactive mode. Type
var x = 17 + 25;
then hit "Enter", then hit "Ctrl-Z" (on Windows) or "Ctrl-D" (on Mac or Linux)
and "Enter" again. The Compiler will respond:
var x=42;
The Closure Compiler has many options for reading input from a file,
writing output to a file, checking your code, and running
optimizations. To learn more, type
java -jar compiler.jar --help
You can read more detailed documentation about the many flags at
http://code.google.com/closure/compiler/docs/gettingstarted_app.html
//
// Compiling Multiple Scripts
//
If you have multiple scripts, you should compile them all together with
one compile command.
java -jar compiler.jar --js=in1.js --js=in2.js ... --js_output_file=out.js
The Closure Compiler will concatenate the files in the order they're
passed at the command line.
If you need to compile many, many scripts together, you may start to
run into problems with managing dependencies between scripts. You
should check out the Closure Library. It contains functions for
enforcing dependencies between scripts, and a tool called calcdeps.py
that knows how to give scripts to the Closure Compiler in the right
order.
http://code.google.com/p/closure-library/
//
// Licensing
//
Unless otherwise stated, all source files are licensed under
the Apache License, Version 2.0.
-----
Code under:
src/com/google/javascript/rhino
test/com/google/javascript/rhino
URL: http://www.mozilla.org/rhino
Version: 1.5R3, with heavy modifications
License: Netscape Public License and MPL / GPL dual license
Description: A partial copy of Mozilla Rhino. Mozilla Rhino is an
implementation of JavaScript for the JVM. The JavaScript parser and
the parse tree data structures were extracted and modified
significantly for use by Google's JavaScript compiler.
Local Modifications: The packages have been renamespaced. All code not
relavant to parsing has been removed. A JSDoc parser and static typing
system have been added.
-----
Code in:
lib/rhino
Rhino
URL: http://www.mozilla.org/rhino
Version: Trunk
License: Netscape Public License and MPL / GPL dual license
Description: Mozilla Rhino is an implementation of JavaScript for the JVM.
Local Modifications: Minor changes to parsing JSDoc that usually get pushed
up-stream to Rhino trunk.
-----
Code in:
lib/args4j.jar
Args4j
URL: https://args4j.dev.java.net/
Version: 2.0.12
License: MIT
Description:
args4j is a small Java class library that makes it easy to parse command line
options/arguments in your CUI application.
Local Modifications: None.
-----
Code in:
lib/guava.jar
Guava Libraries
URL: http://code.google.com/p/guava-libraries/
Version: r08
License: Apache License 2.0
Description: Google's core Java libraries.
Local Modifications: None.
-----
Code in:
lib/jsr305.jar
Annotations for software defect detection
URL: http://code.google.com/p/jsr-305/
Version: svn revision 47
License: BSD License
Description: Annotations for software defect detection.
Local Modifications: None.
-----
Code in:
lib/jarjar.jar
Jar Jar Links
URL: http://jarjar.googlecode.com/
Version: 1.1
License: Apache License 2.0
Description:
A utility for repackaging Java libraries.
Local Modifications: None.
----
Code in:
lib/junit.jar
JUnit
URL: http://sourceforge.net/projects/junit/
Version: 4.8.2
License: Common Public License 1.0
Description: A framework for writing and running automated tests in Java.
Local Modifications: None.
---
Code in:
lib/protobuf-java.jar
Protocol Buffers
URL: http://code.google.com/p/protobuf/
Version: 2.3.0
License: New BSD License
Description: Supporting libraries for protocol buffers,
an encoding of structured data.
Local Modifications: None
---
Code in:
lib/ant.jar
lib/ant-launcher.jar
URL: http://ant.apache.org/bindownload.cgi
Version: 1.8.1
License: Apache License 2.0
Description:
Ant is a Java based build tool. In theory it is kind of like "make"
without make's wrinkles and with the full portability of pure java code.
Local Modifications: None
---
Code in:
lib/json.jar
URL: http://json.org/java/index.html
Version: JSON version 20090211
License: MIT license
Description:
JSON is a set of java files for use in transmitting data in JSON format.
Local Modifications: None
---
Code in:
tools/maven-ant-tasks-2.1.1.jar
URL: http://maven.apache.org
Version 2.1.1
License: Apache License 2.0
Description:
Maven Ant tasks are used to manage dependencies and to install/deploy to
maven repositories.
Local Modifications: None

BIN
bin/closure-complier/compiler.jar
View file

Binary file not shown.

1
css/Aristo

@ -1 +0,0 @@
Subproject commit 6f16099bc3a43689ecd86dc7d34fa01941fbb92a

0
img/loading.gif → css/img/loading.gif
View file

Side by side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.1 KiB

After

Width:  |  Height:  |  Size: 3.1 KiB

Before After
Before After

157
css/styles.css Normal file → Executable file
View file

@ -7,75 +7,47 @@
.cb-control {
color: #fff;
background-color: #111;
background-image: linear-gradient(bottom, rgb(17,17,17) 20%, rgb(41,41,41) 72%);
background-image: -o-linear-gradient(bottom, rgb(17,17,17) 20%, rgb(41,41,41) 72%);
background-image: -moz-linear-gradient(bottom, rgb(17,17,17) 20%, rgb(41,41,41) 72%);
background-image: -webkit-linear-gradient(bottom, rgb(17,17,17) 20%, rgb(41,41,41) 72%);
background-image: -ms-linear-gradient(bottom, rgb(17,17,17) 20%, rgb(41,41,41) 72%);
background-image: -webkit-gradient(
linear,
left bottom,
left top,
color-stop(0.2, rgb(17,17,17)),
color-stop(0.72, rgb(41,41,41))
);
padding: 10px;
position: fixed !important;
-webkit-box-shadow: 0 0 4px #000;
-moz-box-shadow: 0 0 4px #000;
box-shadow: 0 0 4px #000;
}
.cb-control label {
display: inline-block;
margin: 0 0 4px;
}
.cb-control.cb-navigate {
.navigate {
top: 0;
margin: 0;
cursor: pointer;
width: 128px;
opacity: 0;
background: center no-repeat;
-webkit-box-shadow: none;
-moz-box-shadow: none;
box-shadow: none;
padding: 0 3em;
}
.cb-control.cb-navigate:hover {
.navigate > span {
color: #000;
font-size: 10em;
background-color: rgba(255, 255, 255, 0.8);
border-radius: 1em;
top: 35%;
position: relative;
}
body:not(.mobile) .navigate:hover {
opacity: 1;
}
.cb-control.cb-navigate.left {
.navigate-left {
left: 0;
background-image: url(../img/left.png);
}
.cb-control.cb-navigate.right {
.navigate-right {
right: 0;
background-image: url(../img/right.png);
}
.cb-option {
margin-bottom: 16px;
}
.cb-option:last-child {
margin-bottom: 0;
}
.ui-draggable {
cursor: move;
}
#cb-loading-overlay {
z-index: 100;
opacity: 0.8;
background: #000 url("../img/loading.gif") no-repeat center;
-webkit-box-shadow: none;
-moz-box-shadow: none;
background: #000 url("img/loading.gif") no-repeat center;
box-shadow: none;
}
@ -85,105 +57,26 @@
right: 0;
bottom: 0;
margin: 8px;
-webkit-border-radius: 4px;
-moz-border-radius: 4px;
border-radius: 4px;
}
#cb-progress-bar {
width: 200px;
}
#cb-progress-bar,
#cb-progress-bar .progressbar-value {
height: 3px;
}
#cb-progress-bar .ui-widget-header {
#cb-progress-bar .progressbar-value {
width: 0;
background: #86C441;
border-color: #3E7600;
}
#cb-toolbar #cb-comic-info {
float: right;
line-height: 24px;
}
#cb-toolbar {
top: 0;
border-bottom: 1px solid #888;
}
#cb-toolbar button {
height: 24px;
width: 24px;
color: transparent;
border: none;
background-image: url("../img/iconic/sprite.png");
background-color: transparent;
background-repeat: no-repeat;
margin: 0 16px;
cursor: pointer;
}
#cb-toolbar button.cb-close { background-position: 0 -120px }
#cb-toolbar button.cb-close:hover { background-position: -24px -120px }
#cb-toolbar button.cb-color { background-position: 0 0 }
#cb-toolbar button.cb-color:hover,
#cb-toolbar button.cb-color.active { background-position: -24px 0 }
#cb-toolbar button.cb-layout { background-position: 0 -24px }
#cb-toolbar button.cb-layout:hover { background-position: -24px -24px }
#cb-toolbar button.cb-zoom-out { background-position: 0 -72px }
#cb-toolbar button.cb-zoom-out:hover { background-position: -24px -72px }
#cb-toolbar button.cb-zoom-in { background-position: 0 -96px }
#cb-toolbar button.cb-zoom-in:hover { background-position: -24px -96px }
#cb-toolbar button.cb-fit-width { background-position: 0 -48px }
#cb-toolbar button.cb-fit-width:hover { background-position: -24px -48px }
#cb-toolbar button.cb-fit-width[disabled=disabled] { background-position: -48px -48px }
#cb-toolbar button.cb-fit-best { background-position: 0 -192px }
#cb-toolbar button.cb-fit-best:hover { background-position: -24px -192px }
#cb-toolbar button.cb-fit-best[disabled=disabled] { background-position: -48px -192px }
#cb-toolbar button.cb-read-direction#toleft{ background-position: 0 -144px }
#cb-toolbar button.cb-read-direction:hover#toleft{ background-position: -24px -144px }
#cb-toolbar button.cb-read-direction#toright{ background-position: 0 -168px }
#cb-toolbar button.cb-read-direction:hover#toright { background-position: -24px -168px }
#cb-color {
width: 246px;
top: 44px;
left: 120px;
z-index: 1;
border: 2px solid #444;
border-top: none;
-moz-border-radius-bottomleft: 16px;
-moz-border-radius-bottomright: 16px;
-webkit-border-bottom-left-radius: 16px;
-webkit-border-bottom-right-radius: 16px;
border-bottom-left-radius: 16px;
border-bottom-right-radius: 16px;
}
label[for="cb-desaturate"] {
padding: 4px;
}
#cb-desaturate {
float: left;
}
#cb-reset {
float: right;
}
#cb-reset {
background: transparent url(../img/iconic/reload_12x14.png) no-repeat left center;
padding-left: 16px;
height: 14px;
border: none;
color: #fff;
cursor: pointer;
* {
-webkit-user-select: none;
-webkit-touch-callout: none;
-webkit-tap-highlight-color: rgba(0,0,0,0);
}

130
css/toolbar.css Normal file
View file

@ -0,0 +1,130 @@
body {
font-family: "Helvetica Neue", Helvetica, Arial, sans-serif;
font-size: 12px;
line-height: 20px;
color: #333;
}
button, input, label {
cursor: pointer;
}
.pull-left {
float: left;
}
.pull-right {
float: right;
}
.toolbar {
color: white;
background-color: black;
background-image: linear-gradient(to bottom, rgb(80, 80, 80), rgb(17, 17, 17));
overflow: visible;
padding: 0.75em;
position: fixed;
left: 0;
right: 0;
z-index: 99;
margin-bottom: 0;
box-shadow: 0 1px 10px rgba(0, 0, 0, 0.4);
opacity: 0;
transition: opacity 0.2s ease-in-out;
}
.mobile .toolbar {
opacity: 1;
}
.toolbar:hover {
opacity: 1;
}
.toolbar li {
display: inline-block;
position: relative;
}
.toolbar .separator {
border: solid 1px;
height: 1em;
}
.toolbar button {
color: white;
border: none;
background-color: transparent;
padding: 0;
}
.toolbar li > button {
font-size: 1.5em;
padding: 0 12px;
}
.mobile .toolbar li > button {
padding: 0 9px;
}
.toolbar li > button:hover {
color: #8CC746;
}
.toolbar button[data-action=close]:hover {
color: #FF6464;
}
.toolbar .dropdown {
font-size: 1em;
position: absolute;
width: 212px;
background-color: white;
color: #111;
border-radius: 4px;
box-shadow: 0 1px 10px rgba(0, 0, 0, 0.4);
top: 2em;
padding: 4px 0;
display: none;
}
body:not(.mobile) .toolbar li:hover > .dropdown {
display: block;
}
/* dropdown arrow code taken from Twitter Bootstrap 2.3.1 */
.toolbar .dropdown:after {
position: absolute;
top: -4px;
left: 15px;
display: inline-block;
border-right: 6px solid transparent;
border-bottom: 6px solid #ffffff;
border-left: 6px solid transparent;
content: '';
}
.toolbar .close {
display: none;
}
.dropdown .control-group {
padding: 8px;
}
.dropdown .sliders {
font-size: 1.5em;
}
.dropdown .control-group span {
float: left;
margin: 0 2px;
clear: both;
}
.dropdown .control-group input[type=range] {
width: 171px;
float: right;
margin: 0;
}

25
examples/basic.html
View file

@ -2,19 +2,15 @@
<html>
<head>
<meta charset="utf8">
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=0"/>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black">
<title>Basic</title>
<script src="https://ajax.googleapis.com/ajax/libs/jquery/1.6.2/jquery.min.js"></script>
<script src="https://ajax.googleapis.com/ajax/libs/jqueryui/1.8.16/jquery-ui.min.js"></script>
<script src="../lib/ComicBook.js"></script>
<script src="../lib/pixastic/pixastic.core.js"></script>
<script src="../lib/pixastic/actions/brightness.js"></script>
<script src="../lib/pixastic/actions/desaturate.js"></script>
<script src="../lib/pixastic/actions/brightness.js"></script>
<link rel="stylesheet" href="../css/reset.css">
<link rel="stylesheet" href="../css/Aristo/css/Aristo/Aristo.css">
<link rel="stylesheet" href="../css/styles.css">
<script src="//ajax.googleapis.com/ajax/libs/jquery/2.0.0/jquery.min.js"></script>
<script src="comicbook/js/comicbook.min.js"></script>
<link rel="stylesheet" href="comicbook/comicbook.css">
</head>
<body>
@ -48,10 +44,13 @@
'goldenboy/goldenboy_23.jpg',
'goldenboy/goldenboy_24.jpg',
'goldenboy/goldenboy_25.jpg'
]);
], {
libPath: "/reader/examples/comicbook/js/"
});
book.draw();
$(window).resize(function(event) {
$(window).on('resize', function(event) {
book.draw();
});
</script>

1
examples/bitjs/README.txt Executable file
View file

@ -0,0 +1 @@
bitjs: Binary Tools for JavaScript

340
examples/bitjs/archive.js Executable file
View file

@ -0,0 +1,340 @@
/**
* archive.js
*
* Provides base functionality for unarchiving.
*
* Licensed under the MIT License
*
* Copyright(c) 2011 Google Inc.
*/
var bitjs = bitjs || {};
bitjs.archive = bitjs.archive || {};
(function() {
// ===========================================================================
// Stolen from Closure because it's the best way to do Java-like inheritance.
bitjs.base = function(me, opt_methodName, var_args) {
var caller = arguments.callee.caller;
if (caller.superClass_) {
// This is a constructor. Call the superclass constructor.
return caller.superClass_.constructor.apply(
me, Array.prototype.slice.call(arguments, 1));
}
var args = Array.prototype.slice.call(arguments, 2);
var foundCaller = false;
for (var ctor = me.constructor;
ctor; ctor = ctor.superClass_ && ctor.superClass_.constructor) {
if (ctor.prototype[opt_methodName] === caller) {
foundCaller = true;
} else if (foundCaller) {
return ctor.prototype[opt_methodName].apply(me, args);
}
}
// If we did not find the caller in the prototype chain,
// then one of two things happened:
// 1) The caller is an instance method.
// 2) This method was not called by the right caller.
if (me[opt_methodName] === caller) {
return me.constructor.prototype[opt_methodName].apply(me, args);
} else {
throw Error(
'goog.base called from a method of one name ' +
'to a method of a different name');
}
};
bitjs.inherits = function(childCtor, parentCtor) {
/** @constructor */
function tempCtor() {};
tempCtor.prototype = parentCtor.prototype;
childCtor.superClass_ = parentCtor.prototype;
childCtor.prototype = new tempCtor();
childCtor.prototype.constructor = childCtor;
};
// ===========================================================================
/**
* An unarchive event.
*
* @param {string} type The event type.
* @constructor
*/
bitjs.archive.UnarchiveEvent = function(type) {
/**
* The event type.
*
* @type {string}
*/
this.type = type;
};
/**
* The UnarchiveEvent types.
*/
bitjs.archive.UnarchiveEvent.Type = {
START: 'start',
PROGRESS: 'progress',
EXTRACT: 'extract',
FINISH: 'finish',
INFO: 'info',
ERROR: 'error'
};
/**
* Useful for passing info up to the client (for debugging).
*
* @param {string} msg The info message.
*/
bitjs.archive.UnarchiveInfoEvent = function(msg) {
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.INFO);
/**
* The information message.
*
* @type {string}
*/
this.msg = msg;
};
bitjs.inherits(bitjs.archive.UnarchiveInfoEvent, bitjs.archive.UnarchiveEvent);
/**
* An unrecoverable error has occured.
*
* @param {string} msg The error message.
*/
bitjs.archive.UnarchiveErrorEvent = function(msg) {
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.ERROR);
/**
* The information message.
*
* @type {string}
*/
this.msg = msg;
};
bitjs.inherits(bitjs.archive.UnarchiveErrorEvent, bitjs.archive.UnarchiveEvent);
/**
* Start event.
*
* @param {string} msg The info message.
*/
bitjs.archive.UnarchiveStartEvent = function() {
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.START);
};
bitjs.inherits(bitjs.archive.UnarchiveStartEvent, bitjs.archive.UnarchiveEvent);
/**
* Finish event.
*
* @param {string} msg The info message.
*/
bitjs.archive.UnarchiveFinishEvent = function() {
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.FINISH);
};
bitjs.inherits(bitjs.archive.UnarchiveFinishEvent, bitjs.archive.UnarchiveEvent);
/**
* Progress event.
*/
bitjs.archive.UnarchiveProgressEvent = function(
currentFilename,
currentFileNumber,
currentBytesUnarchivedInFile,
currentBytesUnarchived,
totalUncompressedBytesInArchive,
totalFilesInArchive) {
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.PROGRESS);
this.currentFilename = currentFilename;
this.currentFileNumber = currentFileNumber;
this.currentBytesUnarchivedInFile = currentBytesUnarchivedInFile;
this.totalFilesInArchive = totalFilesInArchive;
this.currentBytesUnarchived = currentBytesUnarchived;
this.totalUncompressedBytesInArchive = totalUncompressedBytesInArchive;
};
bitjs.inherits(bitjs.archive.UnarchiveProgressEvent, bitjs.archive.UnarchiveEvent);
/**
* All extracted files returned by an Unarchiver will implement
* the following interface:
*
* interface UnarchivedFile {
* string filename
* TypedArray fileData
* }
*
*/
/**
* Extract event.
*/
bitjs.archive.UnarchiveExtractEvent = function(unarchivedFile) {
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.EXTRACT);
/**
* @type {UnarchivedFile}
*/
this.unarchivedFile = unarchivedFile;
};
bitjs.inherits(bitjs.archive.UnarchiveExtractEvent, bitjs.archive.UnarchiveEvent);
/**
* Base class for all Unarchivers.
*
* @param {ArrayBuffer} arrayBuffer The Array Buffer.
* @param {string} opt_pathToBitJS Optional string for where the BitJS files are located.
* @constructor
*/
bitjs.archive.Unarchiver = function(arrayBuffer, opt_pathToBitJS) {
/**
* The ArrayBuffer object.
* @type {ArrayBuffer}
* @protected
*/
this.ab = arrayBuffer;
/**
* The path to the BitJS files.
* @type {string}
* @private
*/
this.pathToBitJS_ = opt_pathToBitJS || '';
/**
* A map from event type to an array of listeners.
* @type {Map.<string, Array>}
*/
this.listeners_ = {};
for (var type in bitjs.archive.UnarchiveEvent.Type) {
this.listeners_[bitjs.archive.UnarchiveEvent.Type[type]] = [];
}
};
/**
* Private web worker initialized during start().
* @type {Worker}
* @private
*/
bitjs.archive.Unarchiver.prototype.worker_ = null;
/**
* This method must be overridden by the subclass to return the script filename.
* @return {string} The script filename.
* @protected.
*/
bitjs.archive.Unarchiver.prototype.getScriptFileName = function() {
throw 'Subclasses of AbstractUnarchiver must overload getScriptFileName()';
};
/**
* Adds an event listener for UnarchiveEvents.
*
* @param {string} Event type.
* @param {function} An event handler function.
*/
bitjs.archive.Unarchiver.prototype.addEventListener = function(type, listener) {
if (type in this.listeners_) {
if (this.listeners_[type].indexOf(listener) == -1) {
this.listeners_[type].push(listener);
}
}
};
/**
* Removes an event listener.
*
* @param {string} Event type.
* @param {EventListener|function} An event listener or handler function.
*/
bitjs.archive.Unarchiver.prototype.removeEventListener = function(type, listener) {
if (type in this.listeners_) {
var index = this.listeners_[type].indexOf(listener);
if (index != -1) {
this.listeners_[type].splice(index, 1);
}
}
};
/**
* Receive an event and pass it to the listener functions.
*
* @param {bitjs.archive.UnarchiveEvent} e
* @private
*/
bitjs.archive.Unarchiver.prototype.handleWorkerEvent_ = function(e) {
if ((e instanceof bitjs.archive.UnarchiveEvent || e.type) &&
this.listeners_[e.type] instanceof Array) {
this.listeners_[e.type].forEach(function (listener) { listener(e) });
} else {
console.log(e);
}
};
/**
* Starts the unarchive in a separate Web Worker thread and returns immediately.
*/
bitjs.archive.Unarchiver.prototype.start = function() {
var me = this;
var scriptFileName = this.pathToBitJS_ + this.getScriptFileName();
if (scriptFileName) {
this.worker_ = new Worker(scriptFileName);
this.worker_.onerror = function(e) {
console.log('Worker error: message = ' + e.message);
throw e;
};
this.worker_.onmessage = function(e) {
if (typeof e.data == 'string') {
// Just log any strings the workers pump our way.
console.log(e.data);
} else {
// Assume that it is an UnarchiveEvent. Some browsers preserve the 'type'
// so that instanceof UnarchiveEvent returns true, but others do not.
me.handleWorkerEvent_(e.data);
}
};
this.worker_.postMessage({file: this.ab});
}
}
/**
* Unzipper
* @extends {bitjs.archive.Unarchiver}
* @constructor
*/
bitjs.archive.Unzipper = function(arrayBuffer, opt_pathToBitJS) {
bitjs.base(this, arrayBuffer, opt_pathToBitJS);
};
bitjs.inherits(bitjs.archive.Unzipper, bitjs.archive.Unarchiver);
bitjs.archive.Unzipper.prototype.getScriptFileName = function() { return 'unzip.js' };
/**
* Unrarrer
* @extends {bitjs.archive.Unarchiver}
* @constructor
*/
bitjs.archive.Unrarrer = function(arrayBuffer, opt_pathToBitJS) {
bitjs.base(this, arrayBuffer, opt_pathToBitJS);
};
bitjs.inherits(bitjs.archive.Unrarrer, bitjs.archive.Unarchiver);
bitjs.archive.Unrarrer.prototype.getScriptFileName = function() { return 'unrar.js' };
/**
* Untarrer
* @extends {bitjs.archive.Unarchiver}
* @constructor
*/
bitjs.archive.Untarrer = function(arrayBuffer, opt_pathToBitJS) {
bitjs.base(this, arrayBuffer, opt_pathToBitJS);
};
bitjs.inherits(bitjs.archive.Untarrer, bitjs.archive.Unarchiver);
bitjs.archive.Untarrer.prototype.getScriptFileName = function() { return 'untar.js' };
})();

79
examples/bitjs/drive.html Executable file
View file

@ -0,0 +1,79 @@
<!DOCTYPE html>
<html><head>
<script src="io.js"></script>
<script src="archive.js"></script>
</head>
<body>
<input id='filechooser' type='file'></input>
</body>
<script>
function assertTrue(a) {
if (!a) {
alert("'" + a + "' not true");
}
}
function assertEquals(a,b) {
if (a != b) {
alert("'" + a + "' != '" + b + "'")
}
}
function testAddRemoveEventListeners() {
var progress = function(e) { alert('progress') };
var progress2 = function(e) { alert('progress2') };
var ua = new bitjs.archive.Unarchiver(null);
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress2);
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress2);
assertEquals(2, ua.listeners_[bitjs.archive.UnarchiveEvent.Type.PROGRESS].length);
ua.removeEventListener(bitjs.archive.UnarchiveEvent.Type.START, progress);
assertEquals(2, ua.listeners_[bitjs.archive.UnarchiveEvent.Type.PROGRESS].length);
ua.removeEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
assertEquals(1, ua.listeners_[bitjs.archive.UnarchiveEvent.Type.PROGRESS].length);
}
function testAbstractUnarchiveThrows() {
var ua = new bitjs.archive.Unarchiver(null);
try {
ua.start();
alert("unarchive() didn't throw");
} catch(e) {}
}
// unit tests
// testAddRemoveEventListeners();
// testAbstractUnarchiveThrows();
// var uz = new bitjs.archive.Unzipper(null);
document.body.querySelector("#filechooser").addEventListener("change",
function(evt) {
var inp = evt.target;
var filelist = inp.files;
if (filelist.length == 1) {
var blob = filelist[0];
var fr = new FileReader();
fr.onload = function() {
var ua = new bitjs.archive.Unzipper(fr.result);
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.INFO, function(e) {
console.log("info: " + e.msg);
})
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, function(e) {
console.log("progress: " + e.msg);
})
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.EXTRACT, function(e) {
console.log("extract: " + e.unarchiveFile.filename);
})
ua.start();
};
fr.readAsArrayBuffer(blob);
}
}, false);
</script>
</html>

310
examples/bitjs/io.js Executable file
View file

@ -0,0 +1,310 @@
/*
* io.js
*
* Provides readers for bit/byte streams (reading) and a byte buffer (writing).
*
* Licensed under the MIT License
*
* Copyright(c) 2011 Google Inc.
* Copyright(c) 2011 antimatter15
*/
var bitjs = bitjs || {};
bitjs.io = bitjs.io || {};
(function() {
// mask for getting the Nth bit (zero-based)
bitjs.BIT = [ 0x01, 0x02, 0x04, 0x08,
0x10, 0x20, 0x40, 0x80,
0x100, 0x200, 0x400, 0x800,
0x1000, 0x2000, 0x4000, 0x8000];
// mask for getting N number of bits (0-8)
var BITMASK = [0, 0x01, 0x03, 0x07, 0x0F, 0x1F, 0x3F, 0x7F, 0xFF ];
/**
* This bit stream peeks and consumes bits out of a binary stream.
*
* {ArrayBuffer} ab An ArrayBuffer object or a Uint8Array.
* {boolean} rtl Whether the stream reads bits from the byte starting
* from bit 7 to 0 (true) or bit 0 to 7 (false).
* {Number} opt_offset The offset into the ArrayBuffer
* {Number} opt_length The length of this BitStream
*/
bitjs.io.BitStream = function(ab, rtl, opt_offset, opt_length) {
if (!ab || !ab.toString || ab.toString() !== "[object ArrayBuffer]") {
throw "Error! BitArray constructed with an invalid ArrayBuffer object";
}
var offset = opt_offset || 0;
var length = opt_length || ab.byteLength;
this.bytes = new Uint8Array(ab, offset, length);
this.bytePtr = 0; // tracks which byte we are on
this.bitPtr = 0; // tracks which bit we are on (can have values 0 through 7)
this.peekBits = rtl ? this.peekBits_rtl : this.peekBits_ltr;
};
// byte0 byte1 byte2 byte3
// 7......0 | 7......0 | 7......0 | 7......0
//
// The bit pointer starts at bit0 of byte0 and moves left until it reaches
// bit7 of byte0, then jumps to bit0 of byte1, etc.
bitjs.io.BitStream.prototype.peekBits_ltr = function(n, movePointers) {
if (n <= 0 || typeof n != typeof 1) {
return 0;
}
var movePointers = movePointers || false,
bytePtr = this.bytePtr,
bitPtr = this.bitPtr,
result = 0,
bitsIn = 0,
bytes = this.bytes;
// keep going until we have no more bits left to peek at
// TODO: Consider putting all bits from bytes we will need into a variable and then
// shifting/masking it to just extract the bits we want.
// This could be considerably faster when reading more than 3 or 4 bits at a time.
while (n > 0) {
if (bytePtr >= bytes.length) {
throw "Error! Overflowed the bit stream! n=" + n + ", bytePtr=" + bytePtr + ", bytes.length=" +
bytes.length + ", bitPtr=" + bitPtr;
return -1;
}
var numBitsLeftInThisByte = (8 - bitPtr);
if (n >= numBitsLeftInThisByte) {
var mask = (BITMASK[numBitsLeftInThisByte] << bitPtr);
result |= (((bytes[bytePtr] & mask) >> bitPtr) << bitsIn);
bytePtr++;
bitPtr = 0;
bitsIn += numBitsLeftInThisByte;
n -= numBitsLeftInThisByte;
}
else {
var mask = (BITMASK[n] << bitPtr);
result |= (((bytes[bytePtr] & mask) >> bitPtr) << bitsIn);
bitPtr += n;
bitsIn += n;
n = 0;
}
}
if (movePointers) {
this.bitPtr = bitPtr;
this.bytePtr = bytePtr;
}
return result;
};
// byte0 byte1 byte2 byte3
// 7......0 | 7......0 | 7......0 | 7......0
//
// The bit pointer starts at bit7 of byte0 and moves right until it reaches
// bit0 of byte0, then goes to bit7 of byte1, etc.
bitjs.io.BitStream.prototype.peekBits_rtl = function(n, movePointers) {
if (n <= 0 || typeof n != typeof 1) {
return 0;
}
var movePointers = movePointers || false,
bytePtr = this.bytePtr,
bitPtr = this.bitPtr,
result = 0,
bytes = this.bytes;
// keep going until we have no more bits left to peek at
// TODO: Consider putting all bits from bytes we will need into a variable and then
// shifting/masking it to just extract the bits we want.
// This could be considerably faster when reading more than 3 or 4 bits at a time.
while (n > 0) {
if (bytePtr >= bytes.length) {
throw "Error! Overflowed the bit stream! n=" + n + ", bytePtr=" + bytePtr + ", bytes.length=" +
bytes.length + ", bitPtr=" + bitPtr;
return -1;
}
var numBitsLeftInThisByte = (8 - bitPtr);
if (n >= numBitsLeftInThisByte) {
result <<= numBitsLeftInThisByte;
result |= (BITMASK[numBitsLeftInThisByte] & bytes[bytePtr]);
bytePtr++;
bitPtr = 0;
n -= numBitsLeftInThisByte;
}
else {
result <<= n;
result |= ((bytes[bytePtr] & (BITMASK[n] << (8 - n - bitPtr))) >> (8 - n - bitPtr));
bitPtr += n;
n = 0;
}
}
if (movePointers) {
this.bitPtr = bitPtr;
this.bytePtr = bytePtr;
}
return result;
};
//some voodoo magic
bitjs.io.BitStream.prototype.getBits = function() {
return (((((this.bytes[this.bytePtr] & 0xff) << 16) +
((this.bytes[this.bytePtr+1] & 0xff) << 8) +
((this.bytes[this.bytePtr+2] & 0xff))) >>> (8-this.bitPtr)) & 0xffff);
};
bitjs.io.BitStream.prototype.readBits = function(n) {
return this.peekBits(n, true);
};
// This returns n bytes as a sub-array, advancing the pointer if movePointers
// is true.
// Only use this for uncompressed blocks as this throws away remaining bits in
// the current byte.
bitjs.io.BitStream.prototype.peekBytes = function(n, movePointers) {
if (n <= 0 || typeof n != typeof 1) {
return 0;
}
// from http://tools.ietf.org/html/rfc1951#page-11
// "Any bits of input up to the next byte boundary are ignored."
while (this.bitPtr != 0) {
this.readBits(1);
}
var movePointers = movePointers || false;
var bytePtr = this.bytePtr,
bitPtr = this.bitPtr;
var result = this.bytes.subarray(bytePtr, bytePtr + n);
if (movePointers) {
this.bytePtr += n;
}
return result;
};
bitjs.io.BitStream.prototype.readBytes = function( n ) {
return this.peekBytes(n, true);
};
/**
* This object allows you to peek and consume bytes as numbers and strings
* out of an ArrayBuffer.
*
* This object is much easier to write than the above BitStream since
* everything is byte-aligned.
*
* {ArrayBuffer} ab The ArrayBuffer object.
* {Number} opt_offset The offset into the ArrayBuffer
* {Number} opt_length The length of this BitStream
*/
bitjs.io.ByteStream = function(ab, opt_offset, opt_length) {
var offset = opt_offset || 0;
var length = opt_length || ab.byteLength;
this.bytes = new Uint8Array(ab, offset, length);
this.ptr = 0;
};
// peeks at the next n bytes as an unsigned number but does not advance the pointer
// TODO: This apparently cannot read more than 4 bytes as a number?
bitjs.io.ByteStream.prototype.peekNumber = function( n ) {
// TODO: return error if n would go past the end of the stream?
if (n <= 0 || typeof n != typeof 1)
return -1;
var result = 0;
// read from last byte to first byte and roll them in
var curByte = this.ptr + n - 1;
while (curByte >= this.ptr) {
result <<= 8;
result |= this.bytes[curByte];
--curByte;
}
return result;
};
// returns the next n bytes as an unsigned number (or -1 on error)
// and advances the stream pointer n bytes
bitjs.io.ByteStream.prototype.readNumber = function( n ) {
var num = this.peekNumber( n );
this.ptr += n;
return num;
};
// This returns n bytes as a sub-array, advancing the pointer if movePointers
// is true.
bitjs.io.ByteStream.prototype.peekBytes = function(n, movePointers) {
if (n <= 0 || typeof n != typeof 1) {
return 0;
}
var result = this.bytes.subarray(this.ptr, this.ptr + n);
if (movePointers) {
this.ptr += n;
}
return result;
};
bitjs.io.ByteStream.prototype.readBytes = function( n ) {
return this.peekBytes(n, true);
};
// peeks at the next n bytes as a string but does not advance the pointer
bitjs.io.ByteStream.prototype.peekString = function( n ) {
if (n <= 0 || typeof n != typeof 1) {
return 0;
}
var result = "";
for (var p = this.ptr, end = this.ptr + n; p < end; ++p) {
result += String.fromCharCode(this.bytes[p]);
}
return result;
};
// returns the next n bytes as a string
// and advances the stream pointer n bytes
bitjs.io.ByteStream.prototype.readString = function(n) {
var strToReturn = this.peekString(n);
this.ptr += n;
return strToReturn;
};
/**
* A write-only Byte buffer which uses a Uint8 Typed Array as a backing store.
*/
bitjs.io.ByteBuffer = function(numBytes) {
if (typeof numBytes != typeof 1 || numBytes <= 0) {
throw "Error! ByteBuffer initialized with '" + numBytes + "'";
}
this.data = new Uint8Array(numBytes);
this.ptr = 0;
};
bitjs.io.ByteBuffer.prototype.insertByte = function(b) {
// TODO: throw if byte is invalid?
this.data[this.ptr++] = b;
};
bitjs.io.ByteBuffer.prototype.insertBytes = function(bytes) {
// TODO: throw if bytes is invalid?
this.data.set(bytes, this.ptr);
this.ptr += bytes.length;
};
})();

906
examples/bitjs/unrar.js Executable file
View file

@ -0,0 +1,906 @@
/**
* unrar.js
*
* Copyright(c) 2011 Google Inc.
* Copyright(c) 2011 antimatter15
*
* Reference Documentation:
*
* http://kthoom.googlecode.com/hg/docs/unrar.html
*/
// This file expects to be invoked as a Worker (see onmessage below).
importScripts('io.js');
importScripts('archive.js');
// Progress variables.
var currentFilename = "";
var currentFileNumber = 0;
var currentBytesUnarchivedInFile = 0;
var currentBytesUnarchived = 0;
var totalUncompressedBytesInArchive = 0;
var totalFilesInArchive = 0;
// Helper functions.
var info = function(str) {
postMessage(new bitjs.archive.UnarchiveInfoEvent(str));
};
var err = function(str) {
postMessage(new bitjs.archive.UnarchiveErrorEvent(str));
};
var postProgress = function() {
postMessage(new bitjs.archive.UnarchiveProgressEvent(
currentFilename,
currentFileNumber,
currentBytesUnarchivedInFile,
currentBytesUnarchived,
totalUncompressedBytesInArchive,
totalFilesInArchive));
};
// shows a byte value as its hex representation
var nibble = "0123456789ABCDEF";
var byteValueToHexString = function(num) {
return nibble[num>>4] + nibble[num&0xF];
};
var twoByteValueToHexString = function(num) {
return nibble[(num>>12)&0xF] + nibble[(num>>8)&0xF] + nibble[(num>>4)&0xF] + nibble[num&0xF];
};
// Volume Types
var MARK_HEAD = 0x72,
MAIN_HEAD = 0x73,
FILE_HEAD = 0x74,
COMM_HEAD = 0x75,
AV_HEAD = 0x76,
SUB_HEAD = 0x77,
PROTECT_HEAD = 0x78,
SIGN_HEAD = 0x79,
NEWSUB_HEAD = 0x7a,
ENDARC_HEAD = 0x7b;
// bstream is a bit stream
var RarVolumeHeader = function(bstream) {
var headPos = bstream.bytePtr;
// byte 1,2
info("Rar Volume Header @"+bstream.bytePtr);
this.crc = bstream.readBits(16);
info(" crc=" + this.crc);
// byte 3
this.headType = bstream.readBits(8);
info(" headType=" + this.headType);
// Get flags
// bytes 4,5
this.flags = {};
this.flags.value = bstream.peekBits(16);
info(" flags=" + twoByteValueToHexString(this.flags.value));
switch (this.headType) {
case MAIN_HEAD:
this.flags.MHD_VOLUME = !!bstream.readBits(1);
this.flags.MHD_COMMENT = !!bstream.readBits(1);
this.flags.MHD_LOCK = !!bstream.readBits(1);
this.flags.MHD_SOLID = !!bstream.readBits(1);
this.flags.MHD_PACK_COMMENT = !!bstream.readBits(1);
this.flags.MHD_NEWNUMBERING = this.flags.MHD_PACK_COMMENT;
this.flags.MHD_AV = !!bstream.readBits(1);
this.flags.MHD_PROTECT = !!bstream.readBits(1);
this.flags.MHD_PASSWORD = !!bstream.readBits(1);
this.flags.MHD_FIRSTVOLUME = !!bstream.readBits(1);
this.flags.MHD_ENCRYPTVER = !!bstream.readBits(1);
bstream.readBits(6); // unused
break;
case FILE_HEAD:
this.flags.LHD_SPLIT_BEFORE = !!bstream.readBits(1); // 0x0001
this.flags.LHD_SPLIT_AFTER = !!bstream.readBits(1); // 0x0002
this.flags.LHD_PASSWORD = !!bstream.readBits(1); // 0x0004
this.flags.LHD_COMMENT = !!bstream.readBits(1); // 0x0008
this.flags.LHD_SOLID = !!bstream.readBits(1); // 0x0010
bstream.readBits(3); // unused
this.flags.LHD_LARGE = !!bstream.readBits(1); // 0x0100
this.flags.LHD_UNICODE = !!bstream.readBits(1); // 0x0200
this.flags.LHD_SALT = !!bstream.readBits(1); // 0x0400
this.flags.LHD_VERSION = !!bstream.readBits(1); // 0x0800
this.flags.LHD_EXTTIME = !!bstream.readBits(1); // 0x1000
this.flags.LHD_EXTFLAGS = !!bstream.readBits(1); // 0x2000
bstream.readBits(2); // unused
info(" LHD_SPLIT_BEFORE = " + this.flags.LHD_SPLIT_BEFORE);
break;
default:
bstream.readBits(16);
}
// byte 6,7
this.headSize = bstream.readBits(16);
info(" headSize=" + this.headSize);
switch (this.headType) {
case MAIN_HEAD:
this.highPosAv = bstream.readBits(16);
this.posAv = bstream.readBits(32);
if (this.flags.MHD_ENCRYPTVER) {
this.encryptVer = bstream.readBits(8);
}
info("Found MAIN_HEAD with highPosAv=" + this.highPosAv + ", posAv=" + this.posAv);
break;
case FILE_HEAD:
this.packSize = bstream.readBits(32);
this.unpackedSize = bstream.readBits(32);
this.hostOS = bstream.readBits(8);
this.fileCRC = bstream.readBits(32);
this.fileTime = bstream.readBits(32);
this.unpVer = bstream.readBits(8);
this.method = bstream.readBits(8);
this.nameSize = bstream.readBits(16);
this.fileAttr = bstream.readBits(32);
if (this.flags.LHD_LARGE) {
info("Warning: Reading in LHD_LARGE 64-bit size values");
this.HighPackSize = bstream.readBits(32);
this.HighUnpSize = bstream.readBits(32);
} else {
this.HighPackSize = 0;
this.HighUnpSize = 0;
if (this.unpackedSize == 0xffffffff) {
this.HighUnpSize = 0x7fffffff
this.unpackedSize = 0xffffffff;
}
}
this.fullPackSize = 0;
this.fullUnpackSize = 0;
this.fullPackSize |= this.HighPackSize;
this.fullPackSize <<= 32;
this.fullPackSize |= this.packSize;
// read in filename
this.filename = bstream.readBytes(this.nameSize);
for (var _i = 0, _s = ''; _i < this.filename.length; _i++) {
_s += String.fromCharCode(this.filename[_i]);
}
this.filename = _s;
if (this.flags.LHD_SALT) {
info("Warning: Reading in 64-bit salt value");
this.salt = bstream.readBits(64); // 8 bytes
}
if (this.flags.LHD_EXTTIME) {
// 16-bit flags
var extTimeFlags = bstream.readBits(16);
// this is adapted straight out of arcread.cpp, Archive::ReadHeader()
for (var I = 0; I < 4; ++I) {
var rmode = extTimeFlags >> ((3-I)*4);
if ((rmode & 8)==0)
continue;
if (I!=0)
bstream.readBits(16);
var count = (rmode&3);
for (var J = 0; J < count; ++J)
bstream.readBits(8);
}
}
if (this.flags.LHD_COMMENT) {
info("Found a LHD_COMMENT");
}
while(headPos + this.headSize > bstream.bytePtr) bstream.readBits(1);
info("Found FILE_HEAD with packSize=" + this.packSize + ", unpackedSize= " + this.unpackedSize + ", hostOS=" + this.hostOS + ", unpVer=" + this.unpVer + ", method=" + this.method + ", filename=" + this.filename);
break;
default:
info("Found a header of type 0x" + byteValueToHexString(this.headType));
// skip the rest of the header bytes (for now)
bstream.readBytes( this.headSize - 7 );
break;
}
};
var BLOCK_LZ = 0,
BLOCK_PPM = 1;
var rLDecode = [0,1,2,3,4,5,6,7,8,10,12,14,16,20,24,28,32,40,48,56,64,80,96,112,128,160,192,224],
rLBits = [0,0,0,0,0,0,0,0,1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5],
rDBitLengthCounts = [4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,14,0,12],
rSDDecode = [0,4,8,16,32,64,128,192],
rSDBits = [2,2,3, 4, 5, 6, 6, 6];
var rDDecode = [0, 1, 2, 3, 4, 6, 8, 12, 16, 24, 32,
48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072,
4096, 6144, 8192, 12288, 16384, 24576, 32768, 49152, 65536, 98304,
131072, 196608, 262144, 327680, 393216, 458752, 524288, 589824,
655360, 720896, 786432, 851968, 917504, 983040];
var rDBits = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5,
5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14,
15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16];
var rLOW_DIST_REP_COUNT = 16;
var rNC = 299,
rDC = 60,
rLDC = 17,
rRC = 28,
rBC = 20,
rHUFF_TABLE_SIZE = (rNC+rDC+rRC+rLDC);
var UnpBlockType = BLOCK_LZ;
var UnpOldTable = new Array(rHUFF_TABLE_SIZE);
var BD = { //bitdecode
DecodeLen: new Array(16),
DecodePos: new Array(16),
DecodeNum: new Array(rBC)
};
var LD = { //litdecode
DecodeLen: new Array(16),
DecodePos: new Array(16),
DecodeNum: new Array(rNC)
};
var DD = { //distdecode
DecodeLen: new Array(16),
DecodePos: new Array(16),
DecodeNum: new Array(rDC)
};
var LDD = { //low dist decode
DecodeLen: new Array(16),
DecodePos: new Array(16),
DecodeNum: new Array(rLDC)
};
var RD = { //rep decode
DecodeLen: new Array(16),
DecodePos: new Array(16),
DecodeNum: new Array(rRC)
};
var rBuffer;
// read in Huffman tables for RAR
function RarReadTables(bstream) {
var BitLength = new Array(rBC),
Table = new Array(rHUFF_TABLE_SIZE);
// before we start anything we need to get byte-aligned
bstream.readBits( (8 - bstream.bitPtr) & 0x7 );
if (bstream.readBits(1)) {
info("Error! PPM not implemented yet");
return;
}
if (!bstream.readBits(1)) { //discard old table
for (var i = UnpOldTable.length; i--;) UnpOldTable[i] = 0;
}
// read in bit lengths
for (var I = 0; I < rBC; ++I) {
var Length = bstream.readBits(4);
if (Length == 15) {
var ZeroCount = bstream.readBits(4);
if (ZeroCount == 0) {
BitLength[I] = 15;
}
else {
ZeroCount += 2;
while (ZeroCount-- > 0 && I < rBC)
BitLength[I++] = 0;
--I;
}
}
else {
BitLength[I] = Length;
}
}
// now all 20 bit lengths are obtained, we construct the Huffman Table:
RarMakeDecodeTables(BitLength, 0, BD, rBC);
var TableSize = rHUFF_TABLE_SIZE;
//console.log(DecodeLen, DecodePos, DecodeNum);
for (var i = 0; i < TableSize;) {
var num = RarDecodeNumber(bstream, BD);
if (num < 16) {
Table[i] = (num + UnpOldTable[i]) & 0xf;
i++;
} else if(num < 18) {
var N = (num == 16) ? (bstream.readBits(3) + 3) : (bstream.readBits(7) + 11);
while (N-- > 0 && i < TableSize) {
Table[i] = Table[i - 1];
i++;
}
} else {
var N = (num == 18) ? (bstream.readBits(3) + 3) : (bstream.readBits(7) + 11);
while (N-- > 0 && i < TableSize) {
Table[i++] = 0;
}
}
}
RarMakeDecodeTables(Table, 0, LD, rNC);
RarMakeDecodeTables(Table, rNC, DD, rDC);
RarMakeDecodeTables(Table, rNC + rDC, LDD, rLDC);
RarMakeDecodeTables(Table, rNC + rDC + rLDC, RD, rRC);
for (var i = UnpOldTable.length; i--;) {
UnpOldTable[i] = Table[i];
}
return true;
}
function RarDecodeNumber(bstream, dec) {
var DecodeLen = dec.DecodeLen, DecodePos = dec.DecodePos, DecodeNum = dec.DecodeNum;
var bitField = bstream.getBits() & 0xfffe;
//some sort of rolled out binary search
var bits = ((bitField < DecodeLen[8])?
((bitField < DecodeLen[4])?
((bitField < DecodeLen[2])?
((bitField < DecodeLen[1])?1:2)
:((bitField < DecodeLen[3])?3:4))
:(bitField < DecodeLen[6])?
((bitField < DecodeLen[5])?5:6)
:((bitField < DecodeLen[7])?7:8))
:((bitField < DecodeLen[12])?
((bitField < DecodeLen[10])?
((bitField < DecodeLen[9])?9:10)
:((bitField < DecodeLen[11])?11:12))
:(bitField < DecodeLen[14])?
((bitField < DecodeLen[13])?13:14)
:15));
bstream.readBits(bits);
var N = DecodePos[bits] + ((bitField - DecodeLen[bits -1]) >>> (16 - bits));
return DecodeNum[N];
}
function RarMakeDecodeTables(BitLength, offset, dec, size) {
var DecodeLen = dec.DecodeLen, DecodePos = dec.DecodePos, DecodeNum = dec.DecodeNum;
var LenCount = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
TmpPos = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
N = 0, M = 0;
for (var i = DecodeNum.length; i--;) DecodeNum[i] = 0;
for (var i = 0; i < size; i++) {
LenCount[BitLength[i + offset] & 0xF]++;
}
LenCount[0] = 0;
TmpPos[0] = 0;
DecodePos[0] = 0;
DecodeLen[0] = 0;
for (var I = 1; I < 16; ++I) {
N = 2 * (N+LenCount[I]);
M = (N << (15-I));
if (M > 0xFFFF)
M = 0xFFFF;
DecodeLen[I] = M;
DecodePos[I] = DecodePos[I-1] + LenCount[I-1];
TmpPos[I] = DecodePos[I];
}
for (I = 0; I < size; ++I)
if (BitLength[I + offset] != 0)
DecodeNum[ TmpPos[ BitLength[offset + I] & 0xF ]++] = I;
}
// TODO: implement
function Unpack15(bstream, Solid) {
info("ERROR! RAR 1.5 compression not supported");
}
function Unpack20(bstream, Solid) {
var destUnpSize = rBuffer.data.length;
var oldDistPtr = 0;
RarReadTables20(bstream);
while (destUnpSize > rBuffer.ptr) {
var num = RarDecodeNumber(bstream, LD);
if (num < 256) {
rBuffer.insertByte(num);
continue;
}
if (num > 269) {
var Length = rLDecode[num -= 270] + 3;
if ((Bits = rLBits[num]) > 0) {
Length += bstream.readBits(Bits);
}
var DistNumber = RarDecodeNumber(bstream, DD);
var Distance = rDDecode[DistNumber] + 1;
if ((Bits = rDBits[DistNumber]) > 0) {
Distance += bstream.readBits(Bits);
}
if (Distance >= 0x2000) {
Length++;
if(Distance >= 0x40000) Length++;
}
lastLength = Length;
lastDist = rOldDist[oldDistPtr++ & 3] = Distance;
RarCopyString(Length, Distance);
continue;
}
if (num == 269) {
RarReadTables20(bstream);
RarUpdateProgress()
continue;
}
if (num == 256) {
lastDist = rOldDist[oldDistPtr++ & 3] = lastDist;
RarCopyString(lastLength, lastDist);
continue;
}
if (num < 261) {
var Distance = rOldDist[(oldDistPtr - (num - 256)) & 3];
var LengthNumber = RarDecodeNumber(bstream, RD);
var Length = rLDecode[LengthNumber] +2;
if ((Bits = rLBits[LengthNumber]) > 0) {
Length += bstream.readBits(Bits);
}
if (Distance >= 0x101) {
Length++;
if (Distance >= 0x2000) {
Length++
if (Distance >= 0x40000) Length++;
}
}
lastLength = Length;
lastDist = rOldDist[oldDistPtr++ & 3] = Distance;
RarCopyString(Length, Distance);
continue;
}
if (num < 270) {
var Distance = rSDDecode[num -= 261] + 1;
if ((Bits = rSDBits[num]) > 0) {
Distance += bstream.readBits(Bits);
}
lastLength = 2;
lastDist = rOldDist[oldDistPtr++ & 3] = Distance;
RarCopyString(2, Distance);
continue;
}
}
RarUpdateProgress()
}
function RarUpdateProgress() {
var change = rBuffer.ptr - currentBytesUnarchivedInFile;
currentBytesUnarchivedInFile = rBuffer.ptr;
currentBytesUnarchived += change;
postProgress();
}
var rNC20 = 298,
rDC20 = 48,
rRC20 = 28,
rBC20 = 19,
rMC20 = 257;
var UnpOldTable20 = new Array(rMC20 * 4);
function RarReadTables20(bstream) {
var BitLength = new Array(rBC20);
var Table = new Array(rMC20 * 4);
var TableSize, N, I;
var AudioBlock = bstream.readBits(1);
if (!bstream.readBits(1))
for (var i = UnpOldTable20.length; i--;) UnpOldTable20[i] = 0;
TableSize = rNC20 + rDC20 + rRC20;
for (var I = 0; I < rBC20; I++)
BitLength[I] = bstream.readBits(4);
RarMakeDecodeTables(BitLength, 0, BD, rBC20);
I = 0;
while (I < TableSize) {
var num = RarDecodeNumber(bstream, BD);
if (num < 16) {
Table[I] = num + UnpOldTable20[I] & 0xf;
I++;
} else if(num == 16) {
N = bstream.readBits(2) + 3;
while (N-- > 0 && I < TableSize) {
Table[I] = Table[I - 1];
I++;
}
} else {
if (num == 17) {
N = bstream.readBits(3) + 3;
} else {
N = bstream.readBits(7) + 11;
}
while (N-- > 0 && I < TableSize) {
Table[I++] = 0;
}
}
}
RarMakeDecodeTables(Table, 0, LD, rNC20);
RarMakeDecodeTables(Table, rNC20, DD, rDC20);
RarMakeDecodeTables(Table, rNC20 + rDC20, RD, rRC20);
for (var i = UnpOldTable20.length; i--;) UnpOldTable20[i] = Table[i];
}
var lowDistRepCount = 0, prevLowDist = 0;
var rOldDist = [0,0,0,0];
var lastDist;
var lastLength;
function Unpack29(bstream, Solid) {
// lazy initialize rDDecode and rDBits
var DDecode = new Array(rDC);
var DBits = new Array(rDC);
var Dist=0,BitLength=0,Slot=0;
for (var I = 0; I < rDBitLengthCounts.length; I++,BitLength++) {
for (var J = 0; J < rDBitLengthCounts[I]; J++,Slot++,Dist+=(1<<BitLength)) {
DDecode[Slot]=Dist;
DBits[Slot]=BitLength;
}
}
var Bits;
//tablesRead = false;
rOldDist = [0,0,0,0]
lastDist = 0;
lastLength = 0;
for (var i = UnpOldTable.length; i--;) UnpOldTable[i] = 0;
// read in Huffman tables
RarReadTables(bstream);
while (true) {
var num = RarDecodeNumber(bstream, LD);
if (num < 256) {
rBuffer.insertByte(num);
continue;
}
if (num >= 271) {
var Length = rLDecode[num -= 271] + 3;
if ((Bits = rLBits[num]) > 0) {
Length += bstream.readBits(Bits);
}
var DistNumber = RarDecodeNumber(bstream, DD);
var Distance = DDecode[DistNumber]+1;
if ((Bits = DBits[DistNumber]) > 0) {
if (DistNumber > 9) {
if (Bits > 4) {
Distance += ((bstream.getBits() >>> (20 - Bits)) << 4);
bstream.readBits(Bits - 4);
//todo: check this
}
if (lowDistRepCount > 0) {
lowDistRepCount--;
Distance += prevLowDist;
} else {
var LowDist = RarDecodeNumber(bstream, LDD);
if (LowDist == 16) {
lowDistRepCount = rLOW_DIST_REP_COUNT - 1;
Distance += prevLowDist;
} else {
Distance += LowDist;
prevLowDist = LowDist;
}
}
} else {
Distance += bstream.readBits(Bits);
}
}
if (Distance >= 0x2000) {
Length++;
if (Distance >= 0x40000) {
Length++;
}
}
RarInsertOldDist(Distance);
RarInsertLastMatch(Length, Distance);
RarCopyString(Length, Distance);
continue;
}
if (num == 256) {
if (!RarReadEndOfBlock(bstream)) break;
continue;
}
if (num == 257) {
//console.log("READVMCODE");
if (!RarReadVMCode(bstream)) break;
continue;
}
if (num == 258) {
if (lastLength != 0) {
RarCopyString(lastLength, lastDist);
}
continue;
}
if (num < 263) {
var DistNum = num - 259;
var Distance = rOldDist[DistNum];
for (var I = DistNum; I > 0; I--) {
rOldDist[I] = rOldDist[I-1];
}
rOldDist[0] = Distance;
var LengthNumber = RarDecodeNumber(bstream, RD);
var Length = rLDecode[LengthNumber] + 2;
if ((Bits = rLBits[LengthNumber]) > 0) {
Length += bstream.readBits(Bits);
}
RarInsertLastMatch(Length, Distance);
RarCopyString(Length, Distance);
continue;
}
if (num < 272) {
var Distance = rSDDecode[num -= 263] + 1;
if ((Bits = rSDBits[num]) > 0) {
Distance += bstream.readBits(Bits);
}
RarInsertOldDist(Distance);
RarInsertLastMatch(2, Distance);
RarCopyString(2, Distance);
continue;
}
}
RarUpdateProgress()
}
function RarReadEndOfBlock(bstream) {
RarUpdateProgress()
var NewTable = false, NewFile = false;
if (bstream.readBits(1)) {
NewTable = true;
} else {
NewFile = true;
NewTable = !!bstream.readBits(1);
}
//tablesRead = !NewTable;
return !(NewFile || NewTable && !RarReadTables(bstream));
}
function RarReadVMCode(bstream) {
var FirstByte = bstream.readBits(8);
var Length = (FirstByte & 7) + 1;
if (Length == 7) {
Length = bstream.readBits(8) + 7;
} else if(Length == 8) {
Length = bstream.readBits(16);
}
var vmCode = [];
for(var I = 0; I < Length; I++) {
//do something here with cheking readbuf
vmCode.push(bstream.readBits(8));
}
return RarAddVMCode(FirstByte, vmCode, Length);
}
function RarAddVMCode(firstByte, vmCode, length) {
//console.log(vmCode);
if (vmCode.length > 0) {
info("Error! RarVM not supported yet!");
}
return true;
}
function RarInsertLastMatch(length, distance) {
lastDist = distance;
lastLength = length;
}
function RarInsertOldDist(distance) {
rOldDist.splice(3,1);
rOldDist.splice(0,0,distance);
}
//this is the real function, the other one is for debugging
function RarCopyString(length, distance) {
var destPtr = rBuffer.ptr - distance;
if(destPtr < 0){
var l = rOldBuffers.length;
while(destPtr < 0){
destPtr = rOldBuffers[--l].data.length + destPtr
}
//TODO: lets hope that it never needs to read beyond file boundaries
while(length--) rBuffer.insertByte(rOldBuffers[l].data[destPtr++]);
}
if (length > distance) {
while(length--) rBuffer.insertByte(rBuffer.data[destPtr++]);
} else {
rBuffer.insertBytes(rBuffer.data.subarray(destPtr, destPtr + length));
}
}
var rOldBuffers = []
// v must be a valid RarVolume
function unpack(v) {
// TODO: implement what happens when unpVer is < 15
var Ver = v.header.unpVer <= 15 ? 15 : v.header.unpVer,
Solid = v.header.LHD_SOLID,
bstream = new bitjs.io.BitStream(v.fileData.buffer, true /* rtl */, v.fileData.byteOffset, v.fileData.byteLength );
rBuffer = new bitjs.io.ByteBuffer(v.header.unpackedSize);
info("Unpacking "+v.filename+" RAR v"+Ver);
switch(Ver) {
case 15: // rar 1.5 compression
Unpack15(bstream, Solid);
break;
case 20: // rar 2.x compression
case 26: // files larger than 2GB
Unpack20(bstream, Solid);
break;
case 29: // rar 3.x compression
case 36: // alternative hash
Unpack29(bstream, Solid);
break;
} // switch(method)
rOldBuffers.push(rBuffer);
//TODO: clear these old buffers when there's over 4MB of history
return rBuffer.data;
}
// bstream is a bit stream
var RarLocalFile = function(bstream) {
this.header = new RarVolumeHeader(bstream);
this.filename = this.header.filename;
if (this.header.headType != FILE_HEAD && this.header.headType != ENDARC_HEAD) {
this.isValid = false;
info("Error! RAR Volume did not include a FILE_HEAD header ");
}
else {
// read in the compressed data
this.fileData = null;
if (this.header.packSize > 0) {
this.fileData = bstream.readBytes(this.header.packSize);
this.isValid = true;
}
}
};
RarLocalFile.prototype.unrar = function() {
if (!this.header.flags.LHD_SPLIT_BEFORE) {
// unstore file
if (this.header.method == 0x30) {
info("Unstore "+this.filename);
this.isValid = true;
currentBytesUnarchivedInFile += this.fileData.length;
currentBytesUnarchived += this.fileData.length;
} else {
this.isValid = true;
this.fileData = unpack(this);
}
}
}
var unrar = function(arrayBuffer) {
currentFilename = "";
currentFileNumber = 0;
currentBytesUnarchivedInFile = 0;
currentBytesUnarchived = 0;
totalUncompressedBytesInArchive = 0;
totalFilesInArchive = 0;
postMessage(new bitjs.archive.UnarchiveStartEvent());
var bstream = new bitjs.io.BitStream(arrayBuffer, false /* rtl */);
var header = new RarVolumeHeader(bstream);
if (header.crc == 0x6152 &&
header.headType == 0x72 &&
header.flags.value == 0x1A21 &&
header.headSize == 7) {
info("Found RAR signature");
var mhead = new RarVolumeHeader(bstream);
if (mhead.headType != MAIN_HEAD) {
info("Error! RAR did not include a MAIN_HEAD header");
}
else {
var localFiles = [],
localFile = null;
do {
try {
localFile = new RarLocalFile(bstream);
info("RAR localFile isValid=" + localFile.isValid + ", volume packSize=" + localFile.header.packSize);
if (localFile && localFile.isValid && localFile.header.packSize > 0) {
totalUncompressedBytesInArchive += localFile.header.unpackedSize;
localFiles.push(localFile);
} else if (localFile.header.packSize == 0 && localFile.header.unpackedSize == 0) {
localFile.isValid = true;
}
} catch(err) {
break;
}
//info("bstream" + bstream.bytePtr+"/"+bstream.bytes.length);
} while( localFile.isValid );
totalFilesInArchive = localFiles.length;
// now we have all information but things are unpacked
// TODO: unpack
localFiles = localFiles.sort(function(a,b) {
// extract the number at the end of both filenames
var aname = a.filename;
var bname = b.filename;
return aname > bname ? 1 : -1;
/*
var aindex = aname.length, bindex = bname.length;
// Find the last number character from the back of the filename.
while (aname[aindex-1] < '0' || aname[aindex-1] > '9') --aindex;
while (bname[bindex-1] < '0' || bname[bindex-1] > '9') --bindex;
// Find the first number character from the back of the filename
while (aname[aindex-1] >= '0' && aname[aindex-1] <= '9') --aindex;
while (bname[bindex-1] >= '0' && bname[bindex-1] <= '9') --bindex;
// parse them into numbers and return comparison
var anum = parseInt(aname.substr(aindex), 10),
bnum = parseInt(bname.substr(bindex), 10);
return bnum - anum;*/
});
info(localFiles.map(function(a){return a.filename}).join(', '));
for (var i = 0; i < localFiles.length; ++i) {
var localfile = localFiles[i];
// update progress
currentFilename = localfile.header.filename;
currentBytesUnarchivedInFile = 0;
// actually do the unzipping
localfile.unrar();
if (localfile.isValid) {
postMessage(new bitjs.archive.UnarchiveExtractEvent(localfile));
postProgress();
}
}
postProgress();
}
}
else {
err("Invalid RAR file");
}
postMessage(new bitjs.archive.UnarchiveFinishEvent());
};
// event.data.file has the ArrayBuffer.
onmessage = function(event) {
var ab = event.data.file;
unrar(ab, true);
};

182
examples/bitjs/untar.js Executable file
View file

@ -0,0 +1,182 @@
/**
* untar.js
*
* Copyright(c) 2011 Google Inc.
*
* Reference Documentation:
*
* TAR format: http://www.gnu.org/software/automake/manual/tar/Standard.html
*/
// This file expects to be invoked as a Worker (see onmessage below).
importScripts('io.js');
importScripts('archive.js');
// Progress variables.
var currentFilename = "";
var currentFileNumber = 0;
var currentBytesUnarchivedInFile = 0;
var currentBytesUnarchived = 0;
var totalUncompressedBytesInArchive = 0;
var totalFilesInArchive = 0;
// Helper functions.
var info = function(str) {
postMessage(new bitjs.archive.UnarchiveInfoEvent(str));
};
var err = function(str) {
postMessage(new bitjs.archive.UnarchiveErrorEvent(str));
};
var postProgress = function() {
postMessage(new bitjs.archive.UnarchiveProgressEvent(
currentFilename,
currentFileNumber,
currentBytesUnarchivedInFile,
currentBytesUnarchived,
totalUncompressedBytesInArchive,
totalFilesInArchive));
};
// Removes all characters from the first zero-byte in the string onwards.
var readCleanString = function(bstr, numBytes) {
var str = bstr.readString(numBytes);
var zIndex = str.indexOf(String.fromCharCode(0));
return zIndex != -1 ? str.substr(0, zIndex) : str;
};
// takes a ByteStream and parses out the local file information
var TarLocalFile = function(bstream) {
this.isValid = false;
// Read in the header block
this.name = readCleanString(bstream, 100);
this.mode = readCleanString(bstream, 8);
this.uid = readCleanString(bstream, 8);
this.gid = readCleanString(bstream, 8);
this.size = parseInt(readCleanString(bstream, 12), 8);
this.mtime = readCleanString(bstream, 12);
this.chksum = readCleanString(bstream, 8);
this.typeflag = readCleanString(bstream, 1);
this.linkname = readCleanString(bstream, 100);
this.maybeMagic = readCleanString(bstream, 6);
if (this.maybeMagic == "ustar") {
this.version = readCleanString(bstream, 2);
this.uname = readCleanString(bstream, 32);
this.gname = readCleanString(bstream, 32);
this.devmajor = readCleanString(bstream, 8);
this.devminor = readCleanString(bstream, 8);
this.prefix = readCleanString(bstream, 155);
if (this.prefix.length) {
this.name = this.prefix + this.name;
}
bstream.readBytes(12); // 512 - 500
} else {
bstream.readBytes(255); // 512 - 257
}
// Done header, now rest of blocks are the file contents.
this.filename = this.name;
this.fileData = null;
info("Untarring file '" + this.filename + "'");
info(" size = " + this.size);
info(" typeflag = " + this.typeflag);
// A regular file.
if (this.typeflag == 0) {
info(" This is a regular file.");
var sizeInBytes = parseInt(this.size);
this.fileData = new Uint8Array(bstream.bytes.buffer, bstream.ptr, this.size);
if (this.name.length > 0 && this.size > 0 && this.fileData && this.fileData.buffer) {
this.isValid = true;
}
bstream.readBytes(this.size);
// Round up to 512-byte blocks.
var remaining = 512 - this.size % 512;
if (remaining > 0 && remaining < 512) {
bstream.readBytes(remaining);
}
} else if (this.typeflag == 5) {
info(" This is a directory.")
}
};
// Takes an ArrayBuffer of a tar file in
// returns null on error
// returns an array of DecompressedFile objects on success
var untar = function(arrayBuffer) {
currentFilename = "";
currentFileNumber = 0;
currentBytesUnarchivedInFile = 0;
currentBytesUnarchived = 0;
totalUncompressedBytesInArchive = 0;
totalFilesInArchive = 0;
postMessage(new bitjs.archive.UnarchiveStartEvent());
var bstream = new bitjs.io.ByteStream(arrayBuffer);
var localFiles = [];
// While we don't encounter an empty block, keep making TarLocalFiles.
while (bstream.peekNumber(4) != 0) {
var oneLocalFile = new TarLocalFile(bstream);
if (oneLocalFile && oneLocalFile.isValid) {
localFiles.push(oneLocalFile);
totalUncompressedBytesInArchive += oneLocalFile.size;
}
}
totalFilesInArchive = localFiles.length;
// got all local files, now sort them
localFiles.sort(function(a,b) {
// extract the number at the end of both filenames
var aname = a.filename;
var bname = b.filename;
var aindex = aname.length, bindex = bname.length;
// Find the last number character from the back of the filename.
while (aname[aindex-1] < '0' || aname[aindex-1] > '9') --aindex;
while (bname[bindex-1] < '0' || bname[bindex-1] > '9') --bindex;
// Find the first number character from the back of the filename
while (aname[aindex-1] >= '0' && aname[aindex-1] <= '9') --aindex;
while (bname[bindex-1] >= '0' && bname[bindex-1] <= '9') --bindex;
// parse them into numbers and return comparison
var anum = parseInt(aname.substr(aindex), 10),
bnum = parseInt(bname.substr(bindex), 10);
return anum - bnum;
});
// report # files and total length
if (localFiles.length > 0) {
postProgress();
}
// now do the shipping of each file
for (var i = 0; i < localFiles.length; ++i) {
var localfile = localFiles[i];
info("Sending file '" + localfile.filename + "' up");
// update progress
currentFilename = localfile.filename;
currentFileNumber = i;
currentBytesUnarchivedInFile = localfile.size;
currentBytesUnarchived += localfile.size;
postMessage(new bitjs.archive.UnarchiveExtractEvent(localfile));
postProgress();
}
postProgress();
postMessage(new bitjs.archive.UnarchiveFinishEvent());
};
// event.data.file has the ArrayBuffer.
onmessage = function(event) {
var ab = event.data.file;
untar(ab);
};

631
examples/bitjs/unzip.js Executable file
View file

@ -0,0 +1,631 @@
/**
* unzip.js
*
* Copyright(c) 2011 Google Inc.
* Copyright(c) 2011 antimatter15
*
* Reference Documentation:
*
* ZIP format: http://www.pkware.com/documents/casestudies/APPNOTE.TXT
* DEFLATE format: http://tools.ietf.org/html/rfc1951
*/
// This file expects to be invoked as a Worker (see onmessage below).
importScripts('io.js');
importScripts('archive.js');
// Progress variables.
var currentFilename = "";
var currentFileNumber = 0;
var currentBytesUnarchivedInFile = 0;
var currentBytesUnarchived = 0;
var totalUncompressedBytesInArchive = 0;
var totalFilesInArchive = 0;
// Helper functions.
var info = function(str) {
postMessage(new bitjs.archive.UnarchiveInfoEvent(str));
};
var err = function(str) {
postMessage(new bitjs.archive.UnarchiveErrorEvent(str));
};
var postProgress = function() {
postMessage(new bitjs.archive.UnarchiveProgressEvent(
currentFilename,
currentFileNumber,
currentBytesUnarchivedInFile,
currentBytesUnarchived,
totalUncompressedBytesInArchive,
totalFilesInArchive));
};
var zLocalFileHeaderSignature = 0x04034b50;
var zArchiveExtraDataSignature = 0x08064b50;
var zCentralFileHeaderSignature = 0x02014b50;
var zDigitalSignatureSignature = 0x05054b50;
var zEndOfCentralDirSignature = 0x06064b50;
var zEndOfCentralDirLocatorSignature = 0x07064b50;
// takes a ByteStream and parses out the local file information
var ZipLocalFile = function(bstream) {
if (typeof bstream != typeof {} || !bstream.readNumber || typeof bstream.readNumber != typeof function(){}) {
return null;
}
bstream.readNumber(4); // swallow signature
this.version = bstream.readNumber(2);
this.generalPurpose = bstream.readNumber(2);
this.compressionMethod = bstream.readNumber(2);
this.lastModFileTime = bstream.readNumber(2);
this.lastModFileDate = bstream.readNumber(2);
this.crc32 = bstream.readNumber(4);
this.compressedSize = bstream.readNumber(4);
this.uncompressedSize = bstream.readNumber(4);
this.fileNameLength = bstream.readNumber(2);
this.extraFieldLength = bstream.readNumber(2);
this.filename = null;
if (this.fileNameLength > 0) {
this.filename = bstream.readString(this.fileNameLength);
}
info("Zip Local File Header:");
info(" version=" + this.version);
info(" general purpose=" + this.generalPurpose);
info(" compression method=" + this.compressionMethod);
info(" last mod file time=" + this.lastModFileTime);
info(" last mod file date=" + this.lastModFileDate);
info(" crc32=" + this.crc32);
info(" compressed size=" + this.compressedSize);
info(" uncompressed size=" + this.uncompressedSize);
info(" file name length=" + this.fileNameLength);
info(" extra field length=" + this.extraFieldLength);
info(" filename = '" + this.filename + "'");
this.extraField = null;
if (this.extraFieldLength > 0) {
this.extraField = bstream.readString(this.extraFieldLength);
info(" extra field=" + this.extraField);
}
// read in the compressed data
this.fileData = null;
if (this.compressedSize > 0) {
this.fileData = new Uint8Array(bstream.bytes.buffer, bstream.ptr, this.compressedSize);
bstream.ptr += this.compressedSize;
}
// TODO: deal with data descriptor if present (we currently assume no data descriptor!)
// "This descriptor exists only if bit 3 of the general purpose bit flag is set"
// But how do you figure out how big the file data is if you don't know the compressedSize
// from the header?!?
if ((this.generalPurpose & bitjs.BIT[3]) != 0) {
this.crc32 = bstream.readNumber(4);
this.compressedSize = bstream.readNumber(4);
this.uncompressedSize = bstream.readNumber(4);
}
};
// determine what kind of compressed data we have and decompress
ZipLocalFile.prototype.unzip = function() {
// Zip Version 1.0, no compression (store only)
if (this.compressionMethod == 0 ) {
info("ZIP v"+this.version+", store only: " + this.filename + " (" + this.compressedSize + " bytes)");
currentBytesUnarchivedInFile = this.compressedSize;
currentBytesUnarchived += this.compressedSize;
}
// version == 20, compression method == 8 (DEFLATE)
else if (this.compressionMethod == 8) {
info("ZIP v2.0, DEFLATE: " + this.filename + " (" + this.compressedSize + " bytes)");
this.fileData = inflate(this.fileData, this.uncompressedSize);
}
else {
err("UNSUPPORTED VERSION/FORMAT: ZIP v" + this.version + ", compression method=" + this.compressionMethod + ": " + this.filename + " (" + this.compressedSize + " bytes)");
this.fileData = null;
}
};
// Takes an ArrayBuffer of a zip file in
// returns null on error
// returns an array of DecompressedFile objects on success
var unzip = function(arrayBuffer) {
postMessage(new bitjs.archive.UnarchiveStartEvent());
currentFilename = "";
currentFileNumber = 0;
currentBytesUnarchivedInFile = 0;
currentBytesUnarchived = 0;
totalUncompressedBytesInArchive = 0;
totalFilesInArchive = 0;
currentBytesUnarchived = 0;
var bstream = new bitjs.io.ByteStream(arrayBuffer);
// detect local file header signature or return null
if (bstream.peekNumber(4) == zLocalFileHeaderSignature) {
var localFiles = [];
// loop until we don't see any more local files
while (bstream.peekNumber(4) == zLocalFileHeaderSignature) {
var oneLocalFile = new ZipLocalFile(bstream);
// this should strip out directories/folders
if (oneLocalFile && oneLocalFile.uncompressedSize > 0 && oneLocalFile.fileData) {
localFiles.push(oneLocalFile);
totalUncompressedBytesInArchive += oneLocalFile.uncompressedSize;
}
}
totalFilesInArchive = localFiles.length;
// got all local files, now sort them
localFiles.sort(function(a,b) {
// extract the number at the end of both filenames
var aname = a.filename;
var bname = b.filename;
var aindex = aname.length, bindex = bname.length;
// Find the last number character from the back of the filename.
while (aname[aindex-1] < '0' || aname[aindex-1] > '9') --aindex;
while (bname[bindex-1] < '0' || bname[bindex-1] > '9') --bindex;
// Find the first number character from the back of the filename
while (aname[aindex-1] >= '0' && aname[aindex-1] <= '9') --aindex;
while (bname[bindex-1] >= '0' && bname[bindex-1] <= '9') --bindex;
// parse them into numbers and return comparison
var anum = parseInt(aname.substr(aindex), 10),
bnum = parseInt(bname.substr(bindex), 10);
return anum - bnum;
});
// archive extra data record
if (bstream.peekNumber(4) == zArchiveExtraDataSignature) {
info(" Found an Archive Extra Data Signature");
// skipping this record for now
bstream.readNumber(4);
var archiveExtraFieldLength = bstream.readNumber(4);
bstream.readString(archiveExtraFieldLength);
}
// central directory structure
// TODO: handle the rest of the structures (Zip64 stuff)
if (bstream.peekNumber(4) == zCentralFileHeaderSignature) {
info(" Found a Central File Header");
// read all file headers
while (bstream.peekNumber(4) == zCentralFileHeaderSignature) {
bstream.readNumber(4); // signature
bstream.readNumber(2); // version made by
bstream.readNumber(2); // version needed to extract
bstream.readNumber(2); // general purpose bit flag
bstream.readNumber(2); // compression method
bstream.readNumber(2); // last mod file time
bstream.readNumber(2); // last mod file date
bstream.readNumber(4); // crc32
bstream.readNumber(4); // compressed size
bstream.readNumber(4); // uncompressed size
var fileNameLength = bstream.readNumber(2); // file name length
var extraFieldLength = bstream.readNumber(2); // extra field length
var fileCommentLength = bstream.readNumber(2); // file comment length
bstream.readNumber(2); // disk number start
bstream.readNumber(2); // internal file attributes
bstream.readNumber(4); // external file attributes
bstream.readNumber(4); // relative offset of local header
bstream.readString(fileNameLength); // file name
bstream.readString(extraFieldLength); // extra field
bstream.readString(fileCommentLength); // file comment
}
}
// digital signature
if (bstream.peekNumber(4) == zDigitalSignatureSignature) {
info(" Found a Digital Signature");
bstream.readNumber(4);
var sizeOfSignature = bstream.readNumber(2);
bstream.readString(sizeOfSignature); // digital signature data
}
// report # files and total length
if (localFiles.length > 0) {
postProgress();
}
// now do the unzipping of each file
for (var i = 0; i < localFiles.length; ++i) {
var localfile = localFiles[i];
// update progress
currentFilename = localfile.filename;
currentFileNumber = i;
currentBytesUnarchivedInFile = 0;
// actually do the unzipping
localfile.unzip();
if (localfile.fileData != null) {
postMessage(new bitjs.archive.UnarchiveExtractEvent(localfile));
postProgress();
}
}
postProgress();
postMessage(new bitjs.archive.UnarchiveFinishEvent());
}
}
// returns a table of Huffman codes
// each entry's index is its code and its value is a JavaScript object
// containing {length: 6, symbol: X}
function getHuffmanCodes(bitLengths) {
// ensure bitLengths is an array containing at least one element
if (typeof bitLengths != typeof [] || bitLengths.length < 1) {
err("Error! getHuffmanCodes() called with an invalid array");
return null;
}
// Reference: http://tools.ietf.org/html/rfc1951#page-8
var numLengths = bitLengths.length,
bl_count = [],
MAX_BITS = 1;
// Step 1: count up how many codes of each length we have
for (var i = 0; i < numLengths; ++i) {
var length = bitLengths[i];
// test to ensure each bit length is a positive, non-zero number
if (typeof length != typeof 1 || length < 0) {
err("bitLengths contained an invalid number in getHuffmanCodes(): " + length + " of type " + (typeof length));
return null;
}
// increment the appropriate bitlength count
if (bl_count[length] == undefined) bl_count[length] = 0;
// a length of zero means this symbol is not participating in the huffman coding
if (length > 0) bl_count[length]++;
if (length > MAX_BITS) MAX_BITS = length;
}
// Step 2: Find the numerical value of the smallest code for each code length
var next_code = [],
code = 0;
for (var bits = 1; bits <= MAX_BITS; ++bits) {
var length = bits-1;
// ensure undefined lengths are zero
if (bl_count[length] == undefined) bl_count[length] = 0;
code = (code + bl_count[bits-1]) << 1;
next_code[bits] = code;
}
// Step 3: Assign numerical values to all codes
var table = {}, tableLength = 0;
for (var n = 0; n < numLengths; ++n) {
var len = bitLengths[n];
if (len != 0) {
table[next_code[len]] = { length: len, symbol: n }; //, bitstring: binaryValueToString(next_code[len],len) };
tableLength++;
next_code[len]++;
}
}
table.maxLength = tableLength;
return table;
}
/*
The Huffman codes for the two alphabets are fixed, and are not
represented explicitly in the data. The Huffman code lengths
for the literal/length alphabet are:
Lit Value Bits Codes
--------- ---- -----
0 - 143 8 00110000 through
10111111
144 - 255 9 110010000 through
111111111
256 - 279 7 0000000 through
0010111
280 - 287 8 11000000 through
11000111
*/
// fixed Huffman codes go from 7-9 bits, so we need an array whose index can hold up to 9 bits
var fixedHCtoLiteral = null;
var fixedHCtoDistance = null;
function getFixedLiteralTable() {
// create once
if (!fixedHCtoLiteral) {
var bitlengths = new Array(288);
for (var i = 0; i <= 143; ++i) bitlengths[i] = 8;
for (i = 144; i <= 255; ++i) bitlengths[i] = 9;
for (i = 256; i <= 279; ++i) bitlengths[i] = 7;
for (i = 280; i <= 287; ++i) bitlengths[i] = 8;
// get huffman code table
fixedHCtoLiteral = getHuffmanCodes(bitlengths);
}
return fixedHCtoLiteral;
}
function getFixedDistanceTable() {
// create once
if (!fixedHCtoDistance) {
var bitlengths = new Array(32);
for (var i = 0; i < 32; ++i) { bitlengths[i] = 5; }
// get huffman code table
fixedHCtoDistance = getHuffmanCodes(bitlengths);
}
return fixedHCtoDistance;
}
// extract one bit at a time until we find a matching Huffman Code
// then return that symbol
function decodeSymbol(bstream, hcTable) {
var code = 0, len = 0;
var match = false;
// loop until we match
for (;;) {
// read in next bit
var bit = bstream.readBits(1);
code = (code<<1) | bit;
++len;
// check against Huffman Code table and break if found
if (hcTable.hasOwnProperty(code) && hcTable[code].length == len) {
break;
}
if (len > hcTable.maxLength) {
err("Bit stream out of sync, didn't find a Huffman Code, length was " + len +
" and table only max code length of " + hcTable.maxLength);
break;
}
}
return hcTable[code].symbol;
}
var CodeLengthCodeOrder = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
/*
Extra Extra Extra
Code Bits Length(s) Code Bits Lengths Code Bits Length(s)
---- ---- ------ ---- ---- ------- ---- ---- -------
257 0 3 267 1 15,16 277 4 67-82
258 0 4 268 1 17,18 278 4 83-98
259 0 5 269 2 19-22 279 4 99-114
260 0 6 270 2 23-26 280 4 115-130
261 0 7 271 2 27-30 281 5 131-162
262 0 8 272 2 31-34 282 5 163-194
263 0 9 273 3 35-42 283 5 195-226
264 0 10 274 3 43-50 284 5 227-257
265 1 11,12 275 3 51-58 285 0 258
266 1 13,14 276 3 59-66
*/
var LengthLookupTable = [
[0,3], [0,4], [0,5], [0,6],
[0,7], [0,8], [0,9], [0,10],
[1,11], [1,13], [1,15], [1,17],
[2,19], [2,23], [2,27], [2,31],
[3,35], [3,43], [3,51], [3,59],
[4,67], [4,83], [4,99], [4,115],
[5,131], [5,163], [5,195], [5,227],
[0,258]
];
/*
Extra Extra Extra
Code Bits Dist Code Bits Dist Code Bits Distance
---- ---- ---- ---- ---- ------ ---- ---- --------
0 0 1 10 4 33-48 20 9 1025-1536
1 0 2 11 4 49-64 21 9 1537-2048
2 0 3 12 5 65-96 22 10 2049-3072
3 0 4 13 5 97-128 23 10 3073-4096
4 1 5,6 14 6 129-192 24 11 4097-6144
5 1 7,8 15 6 193-256 25 11 6145-8192
6 2 9-12 16 7 257-384 26 12 8193-12288
7 2 13-16 17 7 385-512 27 12 12289-16384
8 3 17-24 18 8 513-768 28 13 16385-24576
9 3 25-32 19 8 769-1024 29 13 24577-32768
*/
var DistLookupTable = [
[0,1], [0,2], [0,3], [0,4],
[1,5], [1,7],
[2,9], [2,13],
[3,17], [3,25],
[4,33], [4,49],
[5,65], [5,97],
[6,129], [6,193],
[7,257], [7,385],
[8,513], [8,769],
[9,1025], [9,1537],
[10,2049], [10,3073],
[11,4097], [11,6145],
[12,8193], [12,12289],
[13,16385], [13,24577]
];
function inflateBlockData(bstream, hcLiteralTable, hcDistanceTable, buffer) {
/*
loop (until end of block code recognized)
decode literal/length value from input stream
if value < 256
copy value (literal byte) to output stream
otherwise
if value = end of block (256)
break from loop
otherwise (value = 257..285)
decode distance from input stream
move backwards distance bytes in the output
stream, and copy length bytes from this
position to the output stream.
*/
var numSymbols = 0, blockSize = 0;
for (;;) {
var symbol = decodeSymbol(bstream, hcLiteralTable);
++numSymbols;
if (symbol < 256) {
// copy literal byte to output
buffer.insertByte(symbol);
blockSize++;
}
else {
// end of block reached
if (symbol == 256) {
break;
}
else {
var lengthLookup = LengthLookupTable[symbol-257],
length = lengthLookup[1] + bstream.readBits(lengthLookup[0]),
distLookup = DistLookupTable[decodeSymbol(bstream, hcDistanceTable)],
distance = distLookup[1] + bstream.readBits(distLookup[0]);
// now apply length and distance appropriately and copy to output
// TODO: check that backward distance < data.length?
// http://tools.ietf.org/html/rfc1951#page-11
// "Note also that the referenced string may overlap the current
// position; for example, if the last 2 bytes decoded have values
// X and Y, a string reference with <length = 5, distance = 2>
// adds X,Y,X,Y,X to the output stream."
//
// loop for each character
var ch = buffer.ptr - distance;
blockSize += length;
if(length > distance) {
var data = buffer.data;
while (length--) {
buffer.insertByte(data[ch++]);
}
} else {
buffer.insertBytes(buffer.data.subarray(ch, ch + length))
}
} // length-distance pair
} // length-distance pair or end-of-block
} // loop until we reach end of block
return blockSize;
}
// {Uint8Array} compressedData A Uint8Array of the compressed file data.
// compression method 8
// deflate: http://tools.ietf.org/html/rfc1951
function inflate(compressedData, numDecompressedBytes) {
// Bit stream representing the compressed data.
var bstream = new bitjs.io.BitStream(compressedData.buffer,
false /* rtl */,
compressedData.byteOffset,
compressedData.byteLength);
var buffer = new bitjs.io.ByteBuffer(numDecompressedBytes);
var numBlocks = 0, blockSize = 0;
// block format: http://tools.ietf.org/html/rfc1951#page-9
do {
var bFinal = bstream.readBits(1),
bType = bstream.readBits(2);
blockSize = 0;
++numBlocks;
// no compression
if (bType == 0) {
// skip remaining bits in this byte
while (bstream.bitPtr != 0) bstream.readBits(1);
var len = bstream.readBits(16),
nlen = bstream.readBits(16);
// TODO: check if nlen is the ones-complement of len?
if(len > 0) buffer.insertBytes(bstream.readBytes(len));
blockSize = len;
}
// fixed Huffman codes
else if(bType == 1) {
blockSize = inflateBlockData(bstream, getFixedLiteralTable(), getFixedDistanceTable(), buffer);
}
// dynamic Huffman codes
else if(bType == 2) {
var numLiteralLengthCodes = bstream.readBits(5) + 257;
var numDistanceCodes = bstream.readBits(5) + 1,
numCodeLengthCodes = bstream.readBits(4) + 4;
// populate the array of code length codes (first de-compaction)
var codeLengthsCodeLengths = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];
for (var i = 0; i < numCodeLengthCodes; ++i) {
codeLengthsCodeLengths[ CodeLengthCodeOrder[i] ] = bstream.readBits(3);
}
// get the Huffman Codes for the code lengths
var codeLengthsCodes = getHuffmanCodes(codeLengthsCodeLengths);
// now follow this mapping
/*
0 - 15: Represent code lengths of 0 - 15
16: Copy the previous code length 3 - 6 times.
The next 2 bits indicate repeat length
(0 = 3, ... , 3 = 6)
Example: Codes 8, 16 (+2 bits 11),
16 (+2 bits 10) will expand to
12 code lengths of 8 (1 + 6 + 5)
17: Repeat a code length of 0 for 3 - 10 times.
(3 bits of length)
18: Repeat a code length of 0 for 11 - 138 times
(7 bits of length)
*/
// to generate the true code lengths of the Huffman Codes for the literal
// and distance tables together
var literalCodeLengths = [];
var prevCodeLength = 0;
while (literalCodeLengths.length < numLiteralLengthCodes + numDistanceCodes) {
var symbol = decodeSymbol(bstream, codeLengthsCodes);
if (symbol <= 15) {
literalCodeLengths.push(symbol);
prevCodeLength = symbol;
}
else if (symbol == 16) {
var repeat = bstream.readBits(2) + 3;
while (repeat--) {
literalCodeLengths.push(prevCodeLength);
}
}
else if (symbol == 17) {
var repeat = bstream.readBits(3) + 3;
while (repeat--) {
literalCodeLengths.push(0);
}
}
else if (symbol == 18) {
var repeat = bstream.readBits(7) + 11;
while (repeat--) {
literalCodeLengths.push(0);
}
}
}
// now split the distance code lengths out of the literal code array
var distanceCodeLengths = literalCodeLengths.splice(numLiteralLengthCodes, numDistanceCodes);
// now generate the true Huffman Code tables using these code lengths
var hcLiteralTable = getHuffmanCodes(literalCodeLengths),
hcDistanceTable = getHuffmanCodes(distanceCodeLengths);
blockSize = inflateBlockData(bstream, hcLiteralTable, hcDistanceTable, buffer);
}
// error
else {
err("Error! Encountered deflate block of type 3");
return null;
}
// update progress
currentBytesUnarchivedInFile += blockSize;
currentBytesUnarchived += blockSize;
postProgress();
} while (bFinal != 1);
// we are done reading blocks if the bFinal bit was set for this block
// return the buffer data bytes
return buffer.data;
}
// event.data.file has the ArrayBuffer.
onmessage = function(event) {
unzip(event.data.file, true);
};

67
examples/dev.html Executable file
View file

@ -0,0 +1,67 @@
<!DOCTYPE html>
<html>
<head>
<meta charset="utf8">
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=0"/>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black">
<title>Dev</title>
<script src="//ajax.googleapis.com/ajax/libs/jquery/2.0.0/jquery.min.js"></script>
<script src="../lib/vendor/pixastic/pixastic.js"></script>
<script src="../lib/vendor/pixastic/pixastic.effects.js"></script>
<script src="../lib/vendor/pixastic/pixastic.worker.js"></script>
<script src="../lib/vendor/handlebars.runtime-1.0.rc.1.min.js"></script>
<script src="../lib/templates.js"></script>
<script src="../lib/ComicBook.js"></script>
<link rel="stylesheet" href="../css/reset.css">
<link rel="stylesheet" href="../fonts/icomoon-toolbar/style.css">
<link rel="stylesheet" href="../css/styles.css">
<link rel="stylesheet" href="../css/toolbar.css">
</head>
<body>
<canvas id="comic"></canvas>
<script>
var book = new ComicBook('comic', [
'goldenboy/goldenboy_00.jpg',
'goldenboy/goldenboy_01.jpg',
'goldenboy/goldenboy_02.jpg',
'goldenboy/goldenboy_03.jpg',
'goldenboy/goldenboy_04.jpg',
'goldenboy/goldenboy_05.jpg',
'goldenboy/goldenboy_06.jpg',
'goldenboy/goldenboy_07.jpg',
'goldenboy/goldenboy_08.jpg',
'goldenboy/goldenboy_09.jpg',
'goldenboy/goldenboy_10.jpg',
'goldenboy/goldenboy_11.jpg',
'goldenboy/goldenboy_12.jpg',
'goldenboy/goldenboy_13.jpg',
'goldenboy/goldenboy_14.jpg',
'goldenboy/goldenboy_15.jpg',
'goldenboy/goldenboy_16.jpg',
'goldenboy/goldenboy_17.jpg',
'goldenboy/goldenboy_18.jpg',
'goldenboy/goldenboy_19.jpg',
'goldenboy/goldenboy_20.jpg',
'goldenboy/goldenboy_21.jpg',
'goldenboy/goldenboy_22.jpg',
'goldenboy/goldenboy_23.jpg',
'goldenboy/goldenboy_24.jpg',
'goldenboy/goldenboy_25.jpg'
], {
libPath: "/reader/examples/comicbook/js/"
});
book.draw();
$(window).on('resize', function () {
book.draw();
});
</script>
</body>
</html>

207
examples/file.html Normal file
View file

@ -0,0 +1,207 @@
<!--
TODO:
· Update ComicBook to allow pages to be added after the object is initialised.
This would allow us to start rendering the comic immediately instead of
having to wait for the complete archive to be extracted before rendering.
-->
<!DOCTYPE html>
<html>
<head>
<meta charset="utf8">
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=0"/>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black">
<title>App</title>
<script src="//ajax.googleapis.com/ajax/libs/jquery/2.0.0/jquery.min.js"></script>
<script src="bitjs/io.js"></script>
<script src="bitjs/archive.js"></script>
<script src="comicbook/js/comicbook.min.js"></script>
<link rel="stylesheet" href="comicbook/comicbook.css">
<style>
#filepicker {
margin: 10px;
}
.progress, .bar {
width: 200px;
height: 1em;
display: inline-block;
}
.progress {
border: solid 1px;
}
.bar {
width: 0;
background-color: gray;
}
#droptarget {
width: 100%;
height: 400px;
border: dashed 1px gray;
}
#droptarget.active {
border-style: solid;
}
</style>
</head>
<body>
<div id="filepicker">
<input type="file" id="open">
<div id="droptarget"></div>
<div id="progressbar" style="display:none">
opening <span id="filename"></span>...
<br>
<span class="progress"><span class="bar"></span></span>
</div>
</div>
<canvas id="comic" style="display:none"></canvas>
<script>
(function () {
'use strict';
var $droptarget = $('#droptarget');
var $progressbar = $('.bar');
if (!$.isFunction(window.FileReader)) {
$('#filepicker').html("Your browser doesn't support the HTML5 FileReader API. <a href='http://browsehappy.com'>http://browsehappy.com</a>.");
return false;
}
function extractImages(files, opts) {
var images = [];
var fr = new FileReader();
var file = files[0];
var re_file_ext = new RegExp(/\.([a-z]+)$/);
var archive_class = ({ cbz: 'Unzipper', cbr: 'Unrarrer' })[file.name.toLowerCase().match(re_file_ext)[1]];
var options = $.extend({
start: function () {},
extract: function (page_url) {},
progress: function (percent_complete) {},
finish: function (images) {},
}, opts);
if (!archive_class) {
alert('invalid file type, only cbz and cbr are supported.');
return false;
}
options.start(file);
fr.onload = function () {
var done = false;
var ua = new bitjs.archive[archive_class](this.result, '/cbr/lib/bitjs/');
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.EXTRACT, function (e) {
var mimetype, blob, url;
var file_extension = e.unarchivedFile.filename.toLowerCase().match(re_file_ext)[1];
switch (file_extension) {
case 'jpg':
case 'jpeg':
mimetype = 'image/jpeg';
break;
case 'png':
mimetype = 'image/png';
break;
case 'gif':
mimetype = 'image/gif';
break;
default:
return false;
}
blob = new Blob([e.unarchivedFile.fileData], { type: mimetype });
url = window.URL.createObjectURL(blob);
images.push(url);
options.extract(url, blob);
});
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, function (e) {
options.progress(Math.floor(e.currentBytesUnarchived / e.totalUncompressedBytesInArchive * 100));
});
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.FINISH, function (e) {
options.finish(images);
});
ua.start();
};
fr.readAsArrayBuffer(file);
}
function openComicArchive(e) {
var title;
var files = e.target.files || e.originalEvent.dataTransfer.files;
e.stopPropagation();
e.preventDefault();
extractImages(files, {
start: function (file) {
this.file = file;
$droptarget.hide();
$('#open').hide();
$('#filename').text(file.name);
$('#progressbar').show();
},
extract: function (url, blob) {
// $('body').append($('<img>').attr('src', url).css('width', '10px'));
// console.log(url, Math.floor(blob.size / 1024));
},
progress: function (percent_complete) {
$progressbar.css('width', percent_complete + '%');
},
finish: function (pages) {
var name = this.file.name.replace(/\.[a-z]+$/, '');
var id = encodeURIComponent(name.toLowerCase());
var book = new ComicBook('comic', pages, { libPath: '/reader/examples/comicbook/js/'});
document.title = name;
$('#filepicker').hide();
$('#comic').show();
book.draw();
$(window).on('resize', function () {
book.draw();
});
}
});
}
$droptarget.on('dragover', function (e) {
e.stopPropagation();
e.preventDefault();
$(this).addClass('active');
});
$droptarget.on('dragleave', function (e) {
e.stopPropagation();
e.preventDefault();
$(this).removeClass('active');
});
$droptarget.on('drop', openComicArchive);
$('#open').on('change', openComicArchive);
}());
</script>
</body>
</html>

BIN
examples/goldenboy.cbz Normal file
View file

Binary file not shown.

3
fonts/icomoon-toolbar/Read Me.txt Normal file
View file

@ -0,0 +1,3 @@
To modify your generated font, use the *dev.svg* file, located in the *fonts* folder in this package. You can import this dev.svg file to the IcoMoon app. All the tags (class names) and the Unicode points of your glyphs are saved in this file.
See the documentation for more info on how to use this package: http://icomoon.io/#docs/font-face

110
fonts/icomoon-toolbar/fonts/toolbar.dev.svg Normal file
View file

@ -0,0 +1,110 @@
<?xml version="1.0" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
<svg xmlns="http://www.w3.org/2000/svg">
<metadata>
This is a custom SVG font generated by IcoMoon.
<iconset grid="20"></iconset>
</metadata>
<defs>
<font id="toolbar" horiz-adv-x="640" >
<font-face units-per-em="640" ascent="608" descent="-32" />
<missing-glyph horiz-adv-x="640" />
<glyph class="hidden" unicode="&#xf000;" d="M0,608L 640 -32L0 -32 z" horiz-adv-x="0" />
<glyph unicode="&#xe000;" d="M 557.574,490.426l-75.146,75.148C 459.091,588.909, 413,608, 380,608L 100,608 C 67,608, 40,581, 40,548l0-520 c0-33, 27-60, 60-60l 440,0
c 33,0, 60,27, 60,60L 600,388 C 600,421, 580.909,467.091, 557.574,490.426z M 400,523.274c 1.373-0.503, 2.782-1.050, 4.224-1.647
c 11.287-4.676, 19.124-10.11, 21.635-12.621l 75.148-75.149c 2.511-2.511, 7.945-10.346, 12.621-21.634c 0.597-1.441, 1.145-2.851, 1.647-4.223
L 400,408 L 400,523.274 z M 520,48L 120,48 L 120,528 l 240,0 l0-160 l 160,0 L 520,48 z" data-tags="file, paper, page, new, empty, blank, document" />
<glyph unicode="&#xe001;" d="M 560,488 L 80,488 L 80,88 L 560,88 L 560,488 Z M 640,568 L 640,568 L 640,8 L 0,8 L 0,568 L 640,568 ZM 520,128 L 120,128 L 120,208 L 240,408 L 404.375,208 L 520,288 L 520,248 ZM 400,388A60,60 3060 1 1 520,388A60,60 3060 1 1 400,388z" data-tags="image, picture, photo, graphic" />
<glyph unicode="&#xe002;" d="M 620.164,63.378L 468.569,192.311c-15.671,14.104-32.431,20.579-45.97,19.954C 458.384,254.183, 480,308.564, 480,368
C 480,500.549, 372.549,608, 240,608C 107.453,608,0,500.549,0,368c0-132.549, 107.451-240, 240-240c 59.436,0, 113.817,21.616, 155.735,57.402
c-0.625-13.539, 5.85-30.299, 19.954-45.97l 128.934-151.595c 22.076-24.529, 58.139-26.596, 80.138-4.598S 644.692,41.301, 620.164,63.378
z M 240,208c-88.365,0-160,71.635-160,160S 151.635,528, 240,528s 160-71.635, 160-160S 328.366,208, 240,208zM 120,408L 360,408L 360,328L 120,328z" data-tags="zoom out, smaller, scale, reduce" />
<glyph unicode="&#xe003;" d="M 620.164,63.378L 468.569,192.311c-15.671,14.104-32.431,20.579-45.97,19.954C 458.384,254.183, 480,308.564, 480,368
C 480,500.549, 372.549,608, 240,608C 107.453,608,0,500.549,0,368c0-132.549, 107.451-240, 240-240c 59.436,0, 113.817,21.616, 155.735,57.402
c-0.625-13.539, 5.85-30.299, 19.954-45.97l 128.934-151.595c 22.076-24.529, 58.139-26.596, 80.138-4.598S 644.692,41.301, 620.164,63.378
z M 240,208c-88.365,0-160,71.635-160,160S 151.635,528, 240,528s 160-71.635, 160-160S 328.366,208, 240,208zM 280,488L 200,488L 200,408L 120,408L 120,328L 200,328L 200,248L 280,248L 280,328L 360,328L 360,408L 280,408 z" data-tags="zoom in, enlarge, scale" />
<glyph unicode="&#xe004;" d="M 640,608 L 640,348 L 540,448 L 420,328 L 360,388 L 480,508 L 380,608 ZM 280,188 L 160,68 L 260-32 L 0-32 L 0,228 L 100,128 L 220,248 Z" data-tags="expand, enlarge, maximize, fullscreen" />
<glyph unicode="&#xe005;" d="M 640,608 L 640,368 L 553.587,454.412 L 421.087,321.913 L 353.913,389.088 L 486.413,521.588 L 400,608 ZM 153.588,521.588 L 286.087,389.088 L 218.912,321.913 L 86.412,454.412 L 0,368 L 0,608 L 240,608 ZM 553.587,121.587 L 640,208 L 640-32 L 400-32 L 486.413,54.413 L 353.913,186.913 L 421.087,254.087 ZM 286.087,186.913 L 153.588,54.413 L 240-32 L 0-32 L 0,208 L 86.412,121.587 L 218.912,254.087 Z" data-tags="expand, enlarge, maximize, fullscreen" />
<glyph unicode="&#xe006;" d="M 520,8L 640,328L 120,328L0,8 zM 80,368 L 0,8 L 0,528 L 180,528 L 260,448 L 520,448 L 520,368 Z" data-tags="folder-open, directory, category, browse" />
<glyph unicode="&#xe007;" d="M 0,408 L 640,408 L 600,8 L 40,8 L 0,408 Z M 580,488 L 600,448 L 40,448 L 80,528 L 300,528 L 320,488 L 580,488 Z" data-tags="folder, directory, category, browse" />
<glyph unicode="&#xe008;" d="M 583.619,226.594c-33.579,58.159-13.385,132.69, 45.095,166.555l-62.891,108.933c-17.969-10.534-38.86-16.574-61.154-16.574
c-67.21,0-121.692,54.841-121.692,122.494L 257.19,608.001 c 0.166-20.881-5.046-42.051-16.224-61.407
c-33.578-58.16-108.222-77.939-166.789-44.224L 11.287,393.437c 18.106-10.295, 33.781-25.367, 44.929-44.674
c 33.524-58.068, 13.445-132.45-44.817-166.39l 62.891-108.933c 17.906,10.435, 38.697,16.409, 60.875,16.409
c 66.998,0, 121.34-54.495, 121.688-121.849l 125.784,0 c-0.054,20.671, 5.17,41.606, 16.229,60.761
c 33.523,58.066, 107.985,77.871, 166.509,44.383l 62.891,108.931C 610.277,192.368, 594.707,207.387, 583.619,226.594z M 320,158.418
c-71.567,0-129.585,58.015-129.585,129.584c0,71.567, 58.016,129.584, 129.585,129.584c 71.567,0, 129.582-58.016, 129.582-129.584
C 449.581,216.433, 391.567,158.418, 320,158.418z" data-tags="cog, preferences, settings, gear, generate, control, options" />
<glyph unicode="&#xe009;" d="M 40,488L 600,488L 600,368L 40,368zM 40,328L 600,328L 600,208L 40,208zM 40,168L 600,168L 600,48L 40,48z" data-tags="menu, list, items, lines, options" />
<glyph unicode="&#xe00a;" d="M 626.834,96.827l-287.845,246.725C 352.394,368.739, 360,397.479, 360,428C 360,527.411, 279.411,608, 180,608
c-18.184,0-35.733-2.708-52.279-7.721l 103.994-103.994c 15.556-15.556, 15.556-41.013,0-56.569l-63.431-63.431
c-15.556-15.556-41.013-15.556-56.569,0L 7.721,480.279C 2.708,463.732,0,446.184,0,428c0-99.411, 80.589-180, 180-180
c 30.521,0, 59.261,7.606, 84.448,21.012l 246.725-287.845c 14.318-16.703, 38.76-17.641, 54.315-2.086l 63.433,63.433
C 644.475,58.069, 643.536,82.51, 626.834,96.827z" data-tags="wrench, settings, control, tool, options, preferences, fix" />
<glyph unicode="&#xe00b;" d="M 280,528l0,10 c0,16.5-13.5,30-30,30l-100,0 c-16.5,0-30-13.5-30-30l0-10 L0,528 l0-80 l 120,0 l0-10 c0-16.5, 13.5-30, 30-30l 100,0 c 16.5,0, 30,13.5, 30,30l0,10
l 360,0 L 640,528 L 280,528 z M 160,448L 160,528 l 80,0 l0-80 L 160,448 zM 520,338c0,16.5-13.5,30-30,30l-100,0 c-16.5,0-30-13.5-30-30l0-10 L0,328 l0-80 l 360,0 l0-10 c0-16.5, 13.5-30, 30-30l 100,0 c 16.5,0, 30,13.5, 30,30l0,10
l 120,0 l0,80 l-120,0 L 520,338 z M 400,248l0,80 l 80,0 l0-80 L 400,248 zM 280,138c0,16.5-13.5,30-30,30l-100,0 c-16.5,0-30-13.5-30-30l0-10 L0,128 l0-80 l 120,0 l0-10 c0-16.5, 13.5-30, 30-30l 100,0 c 16.5,0, 30,13.5, 30,30l0,10
l 360,0 l0,80 L 280,128 L 280,138 z M 160,48l0,80 l 80,0 l0-80 L 160,48 z" data-tags="settings, preferences, options" />
<glyph unicode="&#xe00c;" d="M 546.264,514.263C 488.356,572.172, 408.366,608, 320,608C 182.82,608, 65.819,521.67, 20.314,400.382l 74.922-28.096
C 129.364,463.252, 217.115,528, 320,528c 66.275,0, 126.263-26.875, 169.691-70.309L 400,368l 240,0 L 640,608 L 546.264,514.263zM 320,48c-66.275,0-126.266,26.87-169.695,70.305L 240,208L0,208 l0-240 l 93.746,93.746C 151.65,3.832, 231.633-32, 320-32
c 137.181,0, 254.183,86.33, 299.688,207.618l-74.922,28.096C 510.637,112.748, 422.886,48, 320,48z" data-tags="loop, repeat, reload, refresh, update, upgrade, synchronize, media control, arrows" />
<glyph unicode="&#xe00d;" d="M 640,448c0,88.32-71.72,160-160,160c-59.68,0-111.24-33.16-138.76-81.72c0,0.040, 0.080,0.080, 0.080,0.12
c-7.34,0.7-14.46,2.22-21.96,2.22c-132.58,0-240-107.42-240-240c0-50.54, 15.78-97.34, 42.42-135.94L0-32l 185.78,121.24
c 38.2-25.62, 84.14-40.62, 133.6-40.62c 132.58,0, 240,107.42, 240,240c0,6.92-1.4,13.4-2.040,20.16C 606.4,336.12, 640,387.88, 640,448z
M 319.38,128.62c-88.28,0-160,71.72-160,160c0,88.24, 71.72,160, 160,160c 0.24,0, 0.46-0.080, 0.62-0.080c0,0.16, 0.080,0.28, 0.080,0.4
C 320.080,448.62, 320,448.32, 320,448c0-13.9, 2.34-27.1, 5.62-39.96l-63.44-63.48c-31.24-31.24-31.24-81.88,0-113.12s 81.88-31.24, 113.12,0
l 62.82,62.82c 13.2-3.6, 26.88-6.1, 41.18-6.18C 478.98,200.040, 407.42,128.62, 319.38,128.62z M 480,368c-44.060,0-80,35.9-80,80
s 35.94,80, 80,80s 80-35.9, 80-80S 524.060,368, 480,368z" data-tags="pin, location" />
<glyph unicode="&#xe00e;" d="M 239.52,288c0-8.256, 8.384-14.144, 8.384-14.144l 232.8-146.208C 497.952,116.352, 512,124.672, 512,146.048L 512,429.952
c0,21.408-14.048,29.728-31.296,18.432l-232.8-146.24C 247.904,302.112, 239.52,296.256, 239.52,288z M 128,436.576l0-297.152 c0-28.416, 19.584-37.12, 48-37.12
S 224,111.008, 224,139.392L 224,436.576 c0,28.448-19.584,37.152-48,37.152S 128,464.992, 128,436.576z" data-tags="first, start, media control" />
<glyph unicode="&#xe00f;" d="M 392.096,302.144l-232.8,146.24C 142.080,459.648, 128,451.36, 128,429.92l0-283.872 c0-21.44, 14.080-29.696, 31.296-18.432l 232.8,146.208
c0,0, 8.416,5.92, 8.416,14.144S 392.096,302.144, 392.096,302.144z M 464,473.728c-28.416,0-48-8.736-48-37.152l0-297.152
c0-28.448, 19.584-37.184, 48-37.184s 48,8.736, 48,37.184L 512,436.576 C 512,464.992, 492.416,473.728, 464,473.728z" data-tags="last, end, media control" />
<glyph unicode="&#xe011;" d="M 614.4,288c0,162.592-131.808,294.4-294.4,294.4S 25.6,450.592, 25.6,288c0-162.624, 131.808-294.432, 294.4-294.432S 614.4,125.408, 614.4,288z M 89.6,288
c0,127.232, 103.168,230.4, 230.4,230.4s 230.4-103.168, 230.4-230.4c0-127.264-103.168-230.432-230.4-230.432S 89.6,160.736, 89.6,288z M 443.2,230.4L 443.2,345.6 L 312.32,345.6 L 312.32,417.6
L 190.4,288l 121.92-129.6L 312.32,230.4 L 443.2,230.4 z" data-tags="arrow-left, left, previous" />
<glyph unicode="&#xe010;" d="M 25.6,288c0-162.592, 131.84-294.4, 294.4-294.4c 162.592,0, 294.4,131.808, 294.4,294.4C 614.4,450.592, 482.592,582.4, 320,582.4C 157.408,582.4, 25.6,450.592, 25.6,288z
M 550.4,288c0-127.232-103.168-230.4-230.4-230.4S 89.6,160.736, 89.6,288C 89.6,415.264, 192.736,518.4, 320,518.4S 550.4,415.264, 550.4,288z M 196.8,345.6l0-115.2 l 130.88,0 l0-72
L 449.6,288l-121.92,129.6L 327.68,345.6 L 196.8,345.6 z" data-tags="arrow-right, right, next" />
<glyph unicode="&#xe012;" d="M 447.968,435.2L 448,140.8L 192,288 z" data-tags="arrow-left, left, triangle, previous" />
<glyph unicode="&#xe013;" d="M 192.032,435.2L 192,140.8L 448,288 z" data-tags="arrow-right, triangle, right, next" />
<glyph unicode="&#xe014;" d="M 319.52,531.2L 319.52,408.704L 544.064,408.736L 544.064,167.072L 319.52,167.072L 319.52,44.8L 76.864,288 z" data-tags="arrow-left, left, previous" />
<glyph unicode="&#xe015;" d="M 320.48,531.2L 320.48,408.704L 95.936,408.736L 95.936,167.072L 320.48,167.072L 320.48,44.8L 563.136,288 z" data-tags="arrow-right, right, next" />
<glyph unicode="&#xe016;" d="M 44.768,288c0-8.928, 8.928-15.328, 8.928-15.328l 238.816-158.368c 18.304-12.256, 33.344-3.264, 33.344,19.968L 325.856,441.76
c0,23.232-15.040,32.192-33.344,20l-238.816-158.4C 53.728,303.328, 44.768,296.928, 44.768,288z M 335.2,288c0-8.928, 8.928-15.328, 8.928-15.328
l 230.496-158.368c 18.336-12.256, 33.344-3.264, 33.344,19.968L 607.968,441.76 c0,23.232-15.008,32.192-33.344,20l-230.496-158.4
C 344.128,303.328, 335.2,296.928, 335.2,288z" data-tags="previous, media control" />
<glyph unicode="&#xe017;" d="M 586.272,303.328l-238.784,158.4C 329.152,473.952, 314.112,464.96, 314.112,441.76l0-307.488 c0-23.232, 15.040-32.224, 33.376-19.968l 238.784,158.368
c0,0, 8.928,6.4, 8.928,15.328S 586.272,303.328, 586.272,303.328z M 295.872,303.328L 65.344,461.76C 47.040,473.952, 32.032,464.96, 32.032,441.76l0-307.488
c0-23.232, 15.008-32.224, 33.344-19.968l 230.528,158.368c0,0, 8.928,6.4, 8.928,15.328S 295.872,303.328, 295.872,303.328z" data-tags="next, media control" />
<glyph unicode="&#xe01a;" d="M 559.963,212.061c-0.007,0.441-0.019,0.876-0.026,1.316c-0.020,0.892-0.044,1.784-0.074,2.675C 553.594,413.332, 320,608, 320,608
S 86.404,413.332, 80.138,216.049c-0.027-0.894-0.055-1.782-0.075-2.676c-0.009-0.44-0.019-0.876-0.026-1.316
c-0.022-1.35-0.035-2.702-0.035-4.060c0-1.48, 0.018-2.951, 0.044-4.424c 0.003-0.122, 0.004-0.244, 0.009-0.366
C 82.602,72.874, 189.051-32, 320-32c 130.947,0, 237.395,104.874, 239.949,235.21c 0.003,0.122, 0.005,0.245, 0.006,0.366
c 0.026,1.472, 0.045,2.946, 0.045,4.424C 560,209.358, 559.985,210.71, 559.963,212.061z M 479.969,205.038l-0.005-0.254
c-0.824-42.054-17.832-81.459-47.891-110.968C 401.984,64.271, 362.179,48, 320,48c-7.789,0-15.496,0.559-23.078,1.649
c 86.91,51.779, 145.135,146.69, 145.135,255.201c0,12.16-0.737,24.146-2.157,35.925c 25.17-46.212, 38.79-89.25, 40.001-127.266
l 0.003-0.090c 0.020-0.593, 0.033-1.182, 0.049-1.777l 0.018-0.905C 479.988,209.826, 480,208.913, 480,208
C 480,207.010, 479.988,206.024, 479.969,205.038z" data-tags="droplet, colors, water" />
<glyph unicode="&#xf042;" d="M 274,562.286q 74.643,0 137.679-36.786t 99.821-99.821t 36.786-137.679t-36.786-137.679t-99.821-99.821t-137.679-36.786t-137.679,36.786t-99.821,99.821t-36.786,137.679t 36.786,137.679t 99.821,99.821t 137.679,36.786zM 91.143,288q0-37.143 14.464-70.893t 39.107-58.393t 58.393-39.107t 70.893-14.464l0,365.714 q-37.143,0 -70.893-14.464 t-58.393-39.107t-39.107-58.393t-14.464-70.893z" horiz-adv-x="548" data-tags="adjust, contrast" />
<glyph unicode="&#xe018;" d="M 608,313.6c-5.824,0-25.568,0-31.36,0c-17.664,0-32-11.456-32-25.6s 14.336-25.6, 32-25.6c 5.824,0, 25.568,0, 31.36,0c 17.696,0, 32,11.456, 32,25.6
S 625.696,313.6, 608,313.6z M 320,464C 222.4,464, 144,385.6, 144,288c0-97.632, 78.4-176, 176-176c 97.632,0, 176,78.368, 176,176
C 496,385.6, 417.632,464, 320,464z M 320,160c-70.72,0-128,57.28-128,128c0,70.688, 57.28,128, 128,128s 128-57.312, 128-128C 448,217.28, 390.72,160, 320,160z M 95.328,288
c0,14.144-13.664,25.6-31.328,25.6c-5.92,0-26.112,0-32,0c-17.664,0-32-11.456-32-25.6s 14.336-25.6, 32-25.6c 5.888,0, 26.080,0, 32,0
C 81.664,262.4, 95.328,273.856, 95.328,288z M 320,512c 14.112,0, 25.6,14.336, 25.6,32c0,5.856,0,26.144,0,32c0,17.664-11.456,32-25.6,32S 294.4,593.664, 294.4,576
c0-5.856,0-26.144,0-32C 294.4,526.336, 305.888,512, 320,512z M 320,64c-14.112,0-25.6-14.336-25.6-32c0-5.856,0-26.144,0-32c0-17.696, 11.456-32, 25.6-32
s 25.6,14.304, 25.6,32c0,5.856,0,26.144,0,32C 345.6,49.664, 334.112,64, 320,64z M 555.68,487.488c 12.512,12.512, 14.528,30.752, 4.544,40.736
s-28.224,7.968-40.704-4.544c-3.424-3.456-18.944-18.944-22.4-22.4c-12.512-12.512-14.528-30.72-4.544-40.704s 28.256-8, 40.736,4.512
C 536.736,468.544, 552.256,484.032, 555.68,487.488z M 106.688,110.912c-3.456-3.456-18.944-18.976-22.4-22.4c-12.48-12.512-14.496-30.72-4.512-40.704
c 9.984-9.984, 28.224-7.968, 40.704,4.512c 3.456,3.424, 18.976,18.944, 22.4,22.4c 12.512,12.512, 14.528,30.72, 4.512,40.704
S 119.168,123.36, 106.688,110.912z M 120.512,523.712C 108,536.192, 89.792,538.24, 79.776,528.224S 71.808,500, 84.288,487.488
c 3.456-3.456, 18.944-18.944, 22.4-22.4c 12.512-12.48, 30.72-14.528, 40.704-4.512s 8,28.224-4.512,40.704C 139.456,504.736, 123.968,520.256, 120.512,523.712z
M 497.088,74.688c 3.456-3.456, 18.976-18.976, 22.4-22.4c 12.512-12.48, 30.752-14.496, 40.736-4.512c 9.984,9.984, 7.936,28.224-4.544,40.704
c-3.456,3.424-18.976,18.944-22.4,22.4c-12.512,12.48-30.752,14.496-40.736,4.512S 484.64,87.2, 497.088,74.688z" data-tags="sun, brightness, lightness" />
<glyph unicode="&#xf057;" d="M 410.071,207.286q0,9.286 -6.786,16.071l-64.643,64.643l 64.643,64.643q 6.786,6.786 6.786,16.071q0,9.643 -6.786,16.429l-32.143,32.143q-6.786,6.786 -16.429,6.786q-9.286,0 -16.071-6.786l-64.643-64.643l-64.643,64.643q-6.786,6.786 -16.071,6.786q-9.643,0 -16.429-6.786l-32.143-32.143q-6.786-6.786 -6.786-16.429q0-9.286 6.786-16.071l 64.643-64.643l-64.643-64.643q-6.786-6.786 -6.786-16.071q0-9.643 6.786-16.429l 32.143-32.143q 6.786-6.786 16.429-6.786 q 9.286,0 16.071,6.786l 64.643,64.643l 64.643-64.643q 6.786-6.786 16.071-6.786q 9.643,0 16.429,6.786l 32.143,32.143q 6.786,6.786 6.786,16.429zM 548.285,288q0-74.643 -36.786-137.679t-99.821-99.821t-137.679-36.786t-137.679,36.786t-99.821,99.821t-36.786,137.679t 36.786,137.679t 99.821,99.821t 137.679,36.786t 137.679-36.786t 99.821-99.821t 36.786-137.679z" horiz-adv-x="548" data-tags="remove-sign, cancel, remove, delete, close, sign" />
<glyph unicode="&#xf00d;" d="M 463.142,135.857q0-14.286 -10-24.286l-48.571-48.571q-10-10 -24.286-10t-24.286,10l-105,105l-105-105q-10-10 -24.286-10t-24.286,10l-48.571,48.571q-10,10 -10,24.286t 10,24.286l 105,105l-105,105q-10,10 -10,24.286t 10,24.286l 48.571,48.571q 10,10 24.286,10t 24.286-10l 105-105l 105,105q 10,10 24.286,10t 24.286-10l 48.571-48.571q 10-10 10-24.286 t-10-24.286l-105-105l 105-105q 10-10 10-24.286z" horiz-adv-x="502" data-tags="remove, cancel, close, delete, mutiply" />
<glyph unicode="&#xe037;" d="M 520,448l-120,0 L 400,488 L 280,608L0,608 l0-480 l 240,0 l0-160 l 400,0 L 640,328 L 520,448z M 520,391.431L 583.431,328L 520,328 L 520,391.431 z M 280,551.431L 343.431,488L 280,488
L 280,551.431 z M 40,568l 200,0 l0-120 l 120,0 l0-280 L 40,168 L 40,568 z M 600,8L 280,8 l0,120 l 120,0 L 400,408 l 80,0 l0-120 l 120,0 L 600,8 z" data-tags="copy, duplicate, files, pages, papers, documents" />
<glyph unicode="&#x20;" horiz-adv-x="320" />
</font></defs></svg>
Side by side

After

Width:  |  Height:  |  Size: 16 KiB

BIN
fonts/icomoon-toolbar/fonts/toolbar.eot Normal file
View file

Binary file not shown.

110
fonts/icomoon-toolbar/fonts/toolbar.svg Normal file
View file

@ -0,0 +1,110 @@
<?xml version="1.0" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
<svg xmlns="http://www.w3.org/2000/svg">
<metadata>
This is a custom SVG font generated by IcoMoon.
<iconset grid="20"></iconset>
</metadata>
<defs>
<font id="toolbar" horiz-adv-x="640" >
<font-face units-per-em="640" ascent="608" descent="-32" />
<missing-glyph horiz-adv-x="640" />
<glyph class="hidden" unicode="&#xf000;" d="M0,608L 640 -32L0 -32 z" horiz-adv-x="0" />
<glyph unicode="&#xe000;" d="M 557.574,490.426l-75.146,75.148C 459.091,588.909, 413,608, 380,608L 100,608 C 67,608, 40,581, 40,548l0-520 c0-33, 27-60, 60-60l 440,0
c 33,0, 60,27, 60,60L 600,388 C 600,421, 580.909,467.091, 557.574,490.426z M 400,523.274c 1.373-0.503, 2.782-1.050, 4.224-1.647
c 11.287-4.676, 19.124-10.11, 21.635-12.621l 75.148-75.149c 2.511-2.511, 7.945-10.346, 12.621-21.634c 0.597-1.441, 1.145-2.851, 1.647-4.223
L 400,408 L 400,523.274 z M 520,48L 120,48 L 120,528 l 240,0 l0-160 l 160,0 L 520,48 z" />
<glyph unicode="&#xe001;" d="M 560,488 L 80,488 L 80,88 L 560,88 L 560,488 Z M 640,568 L 640,568 L 640,8 L 0,8 L 0,568 L 640,568 ZM 520,128 L 120,128 L 120,208 L 240,408 L 404.375,208 L 520,288 L 520,248 ZM 400,388A60,60 3060 1 1 520,388A60,60 3060 1 1 400,388z" />
<glyph unicode="&#xe002;" d="M 620.164,63.378L 468.569,192.311c-15.671,14.104-32.431,20.579-45.97,19.954C 458.384,254.183, 480,308.564, 480,368
C 480,500.549, 372.549,608, 240,608C 107.453,608,0,500.549,0,368c0-132.549, 107.451-240, 240-240c 59.436,0, 113.817,21.616, 155.735,57.402
c-0.625-13.539, 5.85-30.299, 19.954-45.97l 128.934-151.595c 22.076-24.529, 58.139-26.596, 80.138-4.598S 644.692,41.301, 620.164,63.378
z M 240,208c-88.365,0-160,71.635-160,160S 151.635,528, 240,528s 160-71.635, 160-160S 328.366,208, 240,208zM 120,408L 360,408L 360,328L 120,328z" />
<glyph unicode="&#xe003;" d="M 620.164,63.378L 468.569,192.311c-15.671,14.104-32.431,20.579-45.97,19.954C 458.384,254.183, 480,308.564, 480,368
C 480,500.549, 372.549,608, 240,608C 107.453,608,0,500.549,0,368c0-132.549, 107.451-240, 240-240c 59.436,0, 113.817,21.616, 155.735,57.402
c-0.625-13.539, 5.85-30.299, 19.954-45.97l 128.934-151.595c 22.076-24.529, 58.139-26.596, 80.138-4.598S 644.692,41.301, 620.164,63.378
z M 240,208c-88.365,0-160,71.635-160,160S 151.635,528, 240,528s 160-71.635, 160-160S 328.366,208, 240,208zM 280,488L 200,488L 200,408L 120,408L 120,328L 200,328L 200,248L 280,248L 280,328L 360,328L 360,408L 280,408 z" />
<glyph unicode="&#xe004;" d="M 640,608 L 640,348 L 540,448 L 420,328 L 360,388 L 480,508 L 380,608 ZM 280,188 L 160,68 L 260-32 L 0-32 L 0,228 L 100,128 L 220,248 Z" />
<glyph unicode="&#xe005;" d="M 640,608 L 640,368 L 553.587,454.412 L 421.087,321.913 L 353.913,389.088 L 486.413,521.588 L 400,608 ZM 153.588,521.588 L 286.087,389.088 L 218.912,321.913 L 86.412,454.412 L 0,368 L 0,608 L 240,608 ZM 553.587,121.587 L 640,208 L 640-32 L 400-32 L 486.413,54.413 L 353.913,186.913 L 421.087,254.087 ZM 286.087,186.913 L 153.588,54.413 L 240-32 L 0-32 L 0,208 L 86.412,121.587 L 218.912,254.087 Z" />
<glyph unicode="&#xe006;" d="M 520,8L 640,328L 120,328L0,8 zM 80,368 L 0,8 L 0,528 L 180,528 L 260,448 L 520,448 L 520,368 Z" />
<glyph unicode="&#xe007;" d="M 0,408 L 640,408 L 600,8 L 40,8 L 0,408 Z M 580,488 L 600,448 L 40,448 L 80,528 L 300,528 L 320,488 L 580,488 Z" />
<glyph unicode="&#xe008;" d="M 583.619,226.594c-33.579,58.159-13.385,132.69, 45.095,166.555l-62.891,108.933c-17.969-10.534-38.86-16.574-61.154-16.574
c-67.21,0-121.692,54.841-121.692,122.494L 257.19,608.001 c 0.166-20.881-5.046-42.051-16.224-61.407
c-33.578-58.16-108.222-77.939-166.789-44.224L 11.287,393.437c 18.106-10.295, 33.781-25.367, 44.929-44.674
c 33.524-58.068, 13.445-132.45-44.817-166.39l 62.891-108.933c 17.906,10.435, 38.697,16.409, 60.875,16.409
c 66.998,0, 121.34-54.495, 121.688-121.849l 125.784,0 c-0.054,20.671, 5.17,41.606, 16.229,60.761
c 33.523,58.066, 107.985,77.871, 166.509,44.383l 62.891,108.931C 610.277,192.368, 594.707,207.387, 583.619,226.594z M 320,158.418
c-71.567,0-129.585,58.015-129.585,129.584c0,71.567, 58.016,129.584, 129.585,129.584c 71.567,0, 129.582-58.016, 129.582-129.584
C 449.581,216.433, 391.567,158.418, 320,158.418z" />
<glyph unicode="&#xe009;" d="M 40,488L 600,488L 600,368L 40,368zM 40,328L 600,328L 600,208L 40,208zM 40,168L 600,168L 600,48L 40,48z" />
<glyph unicode="&#xe00a;" d="M 626.834,96.827l-287.845,246.725C 352.394,368.739, 360,397.479, 360,428C 360,527.411, 279.411,608, 180,608
c-18.184,0-35.733-2.708-52.279-7.721l 103.994-103.994c 15.556-15.556, 15.556-41.013,0-56.569l-63.431-63.431
c-15.556-15.556-41.013-15.556-56.569,0L 7.721,480.279C 2.708,463.732,0,446.184,0,428c0-99.411, 80.589-180, 180-180
c 30.521,0, 59.261,7.606, 84.448,21.012l 246.725-287.845c 14.318-16.703, 38.76-17.641, 54.315-2.086l 63.433,63.433
C 644.475,58.069, 643.536,82.51, 626.834,96.827z" />
<glyph unicode="&#xe00b;" d="M 280,528l0,10 c0,16.5-13.5,30-30,30l-100,0 c-16.5,0-30-13.5-30-30l0-10 L0,528 l0-80 l 120,0 l0-10 c0-16.5, 13.5-30, 30-30l 100,0 c 16.5,0, 30,13.5, 30,30l0,10
l 360,0 L 640,528 L 280,528 z M 160,448L 160,528 l 80,0 l0-80 L 160,448 zM 520,338c0,16.5-13.5,30-30,30l-100,0 c-16.5,0-30-13.5-30-30l0-10 L0,328 l0-80 l 360,0 l0-10 c0-16.5, 13.5-30, 30-30l 100,0 c 16.5,0, 30,13.5, 30,30l0,10
l 120,0 l0,80 l-120,0 L 520,338 z M 400,248l0,80 l 80,0 l0-80 L 400,248 zM 280,138c0,16.5-13.5,30-30,30l-100,0 c-16.5,0-30-13.5-30-30l0-10 L0,128 l0-80 l 120,0 l0-10 c0-16.5, 13.5-30, 30-30l 100,0 c 16.5,0, 30,13.5, 30,30l0,10
l 360,0 l0,80 L 280,128 L 280,138 z M 160,48l0,80 l 80,0 l0-80 L 160,48 z" />
<glyph unicode="&#xe00c;" d="M 546.264,514.263C 488.356,572.172, 408.366,608, 320,608C 182.82,608, 65.819,521.67, 20.314,400.382l 74.922-28.096
C 129.364,463.252, 217.115,528, 320,528c 66.275,0, 126.263-26.875, 169.691-70.309L 400,368l 240,0 L 640,608 L 546.264,514.263zM 320,48c-66.275,0-126.266,26.87-169.695,70.305L 240,208L0,208 l0-240 l 93.746,93.746C 151.65,3.832, 231.633-32, 320-32
c 137.181,0, 254.183,86.33, 299.688,207.618l-74.922,28.096C 510.637,112.748, 422.886,48, 320,48z" />
<glyph unicode="&#xe00d;" d="M 640,448c0,88.32-71.72,160-160,160c-59.68,0-111.24-33.16-138.76-81.72c0,0.040, 0.080,0.080, 0.080,0.12
c-7.34,0.7-14.46,2.22-21.96,2.22c-132.58,0-240-107.42-240-240c0-50.54, 15.78-97.34, 42.42-135.94L0-32l 185.78,121.24
c 38.2-25.62, 84.14-40.62, 133.6-40.62c 132.58,0, 240,107.42, 240,240c0,6.92-1.4,13.4-2.040,20.16C 606.4,336.12, 640,387.88, 640,448z
M 319.38,128.62c-88.28,0-160,71.72-160,160c0,88.24, 71.72,160, 160,160c 0.24,0, 0.46-0.080, 0.62-0.080c0,0.16, 0.080,0.28, 0.080,0.4
C 320.080,448.62, 320,448.32, 320,448c0-13.9, 2.34-27.1, 5.62-39.96l-63.44-63.48c-31.24-31.24-31.24-81.88,0-113.12s 81.88-31.24, 113.12,0
l 62.82,62.82c 13.2-3.6, 26.88-6.1, 41.18-6.18C 478.98,200.040, 407.42,128.62, 319.38,128.62z M 480,368c-44.060,0-80,35.9-80,80
s 35.94,80, 80,80s 80-35.9, 80-80S 524.060,368, 480,368z" />
<glyph unicode="&#xe00e;" d="M 239.52,288c0-8.256, 8.384-14.144, 8.384-14.144l 232.8-146.208C 497.952,116.352, 512,124.672, 512,146.048L 512,429.952
c0,21.408-14.048,29.728-31.296,18.432l-232.8-146.24C 247.904,302.112, 239.52,296.256, 239.52,288z M 128,436.576l0-297.152 c0-28.416, 19.584-37.12, 48-37.12
S 224,111.008, 224,139.392L 224,436.576 c0,28.448-19.584,37.152-48,37.152S 128,464.992, 128,436.576z" />
<glyph unicode="&#xe00f;" d="M 392.096,302.144l-232.8,146.24C 142.080,459.648, 128,451.36, 128,429.92l0-283.872 c0-21.44, 14.080-29.696, 31.296-18.432l 232.8,146.208
c0,0, 8.416,5.92, 8.416,14.144S 392.096,302.144, 392.096,302.144z M 464,473.728c-28.416,0-48-8.736-48-37.152l0-297.152
c0-28.448, 19.584-37.184, 48-37.184s 48,8.736, 48,37.184L 512,436.576 C 512,464.992, 492.416,473.728, 464,473.728z" />
<glyph unicode="&#xe011;" d="M 614.4,288c0,162.592-131.808,294.4-294.4,294.4S 25.6,450.592, 25.6,288c0-162.624, 131.808-294.432, 294.4-294.432S 614.4,125.408, 614.4,288z M 89.6,288
c0,127.232, 103.168,230.4, 230.4,230.4s 230.4-103.168, 230.4-230.4c0-127.264-103.168-230.432-230.4-230.432S 89.6,160.736, 89.6,288z M 443.2,230.4L 443.2,345.6 L 312.32,345.6 L 312.32,417.6
L 190.4,288l 121.92-129.6L 312.32,230.4 L 443.2,230.4 z" />
<glyph unicode="&#xe010;" d="M 25.6,288c0-162.592, 131.84-294.4, 294.4-294.4c 162.592,0, 294.4,131.808, 294.4,294.4C 614.4,450.592, 482.592,582.4, 320,582.4C 157.408,582.4, 25.6,450.592, 25.6,288z
M 550.4,288c0-127.232-103.168-230.4-230.4-230.4S 89.6,160.736, 89.6,288C 89.6,415.264, 192.736,518.4, 320,518.4S 550.4,415.264, 550.4,288z M 196.8,345.6l0-115.2 l 130.88,0 l0-72
L 449.6,288l-121.92,129.6L 327.68,345.6 L 196.8,345.6 z" />
<glyph unicode="&#xe012;" d="M 447.968,435.2L 448,140.8L 192,288 z" />
<glyph unicode="&#xe013;" d="M 192.032,435.2L 192,140.8L 448,288 z" />
<glyph unicode="&#xe014;" d="M 319.52,531.2L 319.52,408.704L 544.064,408.736L 544.064,167.072L 319.52,167.072L 319.52,44.8L 76.864,288 z" />
<glyph unicode="&#xe015;" d="M 320.48,531.2L 320.48,408.704L 95.936,408.736L 95.936,167.072L 320.48,167.072L 320.48,44.8L 563.136,288 z" />
<glyph unicode="&#xe016;" d="M 44.768,288c0-8.928, 8.928-15.328, 8.928-15.328l 238.816-158.368c 18.304-12.256, 33.344-3.264, 33.344,19.968L 325.856,441.76
c0,23.232-15.040,32.192-33.344,20l-238.816-158.4C 53.728,303.328, 44.768,296.928, 44.768,288z M 335.2,288c0-8.928, 8.928-15.328, 8.928-15.328
l 230.496-158.368c 18.336-12.256, 33.344-3.264, 33.344,19.968L 607.968,441.76 c0,23.232-15.008,32.192-33.344,20l-230.496-158.4
C 344.128,303.328, 335.2,296.928, 335.2,288z" />
<glyph unicode="&#xe017;" d="M 586.272,303.328l-238.784,158.4C 329.152,473.952, 314.112,464.96, 314.112,441.76l0-307.488 c0-23.232, 15.040-32.224, 33.376-19.968l 238.784,158.368
c0,0, 8.928,6.4, 8.928,15.328S 586.272,303.328, 586.272,303.328z M 295.872,303.328L 65.344,461.76C 47.040,473.952, 32.032,464.96, 32.032,441.76l0-307.488
c0-23.232, 15.008-32.224, 33.344-19.968l 230.528,158.368c0,0, 8.928,6.4, 8.928,15.328S 295.872,303.328, 295.872,303.328z" />
<glyph unicode="&#xe01a;" d="M 559.963,212.061c-0.007,0.441-0.019,0.876-0.026,1.316c-0.020,0.892-0.044,1.784-0.074,2.675C 553.594,413.332, 320,608, 320,608
S 86.404,413.332, 80.138,216.049c-0.027-0.894-0.055-1.782-0.075-2.676c-0.009-0.44-0.019-0.876-0.026-1.316
c-0.022-1.35-0.035-2.702-0.035-4.060c0-1.48, 0.018-2.951, 0.044-4.424c 0.003-0.122, 0.004-0.244, 0.009-0.366
C 82.602,72.874, 189.051-32, 320-32c 130.947,0, 237.395,104.874, 239.949,235.21c 0.003,0.122, 0.005,0.245, 0.006,0.366
c 0.026,1.472, 0.045,2.946, 0.045,4.424C 560,209.358, 559.985,210.71, 559.963,212.061z M 479.969,205.038l-0.005-0.254
c-0.824-42.054-17.832-81.459-47.891-110.968C 401.984,64.271, 362.179,48, 320,48c-7.789,0-15.496,0.559-23.078,1.649
c 86.91,51.779, 145.135,146.69, 145.135,255.201c0,12.16-0.737,24.146-2.157,35.925c 25.17-46.212, 38.79-89.25, 40.001-127.266
l 0.003-0.090c 0.020-0.593, 0.033-1.182, 0.049-1.777l 0.018-0.905C 479.988,209.826, 480,208.913, 480,208
C 480,207.010, 479.988,206.024, 479.969,205.038z" />
<glyph unicode="&#xf042;" d="M 274,562.286q 74.643,0 137.679-36.786t 99.821-99.821t 36.786-137.679t-36.786-137.679t-99.821-99.821t-137.679-36.786t-137.679,36.786t-99.821,99.821t-36.786,137.679t 36.786,137.679t 99.821,99.821t 137.679,36.786zM 91.143,288q0-37.143 14.464-70.893t 39.107-58.393t 58.393-39.107t 70.893-14.464l0,365.714 q-37.143,0 -70.893-14.464 t-58.393-39.107t-39.107-58.393t-14.464-70.893z" horiz-adv-x="548" />
<glyph unicode="&#xe018;" d="M 608,313.6c-5.824,0-25.568,0-31.36,0c-17.664,0-32-11.456-32-25.6s 14.336-25.6, 32-25.6c 5.824,0, 25.568,0, 31.36,0c 17.696,0, 32,11.456, 32,25.6
S 625.696,313.6, 608,313.6z M 320,464C 222.4,464, 144,385.6, 144,288c0-97.632, 78.4-176, 176-176c 97.632,0, 176,78.368, 176,176
C 496,385.6, 417.632,464, 320,464z M 320,160c-70.72,0-128,57.28-128,128c0,70.688, 57.28,128, 128,128s 128-57.312, 128-128C 448,217.28, 390.72,160, 320,160z M 95.328,288
c0,14.144-13.664,25.6-31.328,25.6c-5.92,0-26.112,0-32,0c-17.664,0-32-11.456-32-25.6s 14.336-25.6, 32-25.6c 5.888,0, 26.080,0, 32,0
C 81.664,262.4, 95.328,273.856, 95.328,288z M 320,512c 14.112,0, 25.6,14.336, 25.6,32c0,5.856,0,26.144,0,32c0,17.664-11.456,32-25.6,32S 294.4,593.664, 294.4,576
c0-5.856,0-26.144,0-32C 294.4,526.336, 305.888,512, 320,512z M 320,64c-14.112,0-25.6-14.336-25.6-32c0-5.856,0-26.144,0-32c0-17.696, 11.456-32, 25.6-32
s 25.6,14.304, 25.6,32c0,5.856,0,26.144,0,32C 345.6,49.664, 334.112,64, 320,64z M 555.68,487.488c 12.512,12.512, 14.528,30.752, 4.544,40.736
s-28.224,7.968-40.704-4.544c-3.424-3.456-18.944-18.944-22.4-22.4c-12.512-12.512-14.528-30.72-4.544-40.704s 28.256-8, 40.736,4.512
C 536.736,468.544, 552.256,484.032, 555.68,487.488z M 106.688,110.912c-3.456-3.456-18.944-18.976-22.4-22.4c-12.48-12.512-14.496-30.72-4.512-40.704
c 9.984-9.984, 28.224-7.968, 40.704,4.512c 3.456,3.424, 18.976,18.944, 22.4,22.4c 12.512,12.512, 14.528,30.72, 4.512,40.704
S 119.168,123.36, 106.688,110.912z M 120.512,523.712C 108,536.192, 89.792,538.24, 79.776,528.224S 71.808,500, 84.288,487.488
c 3.456-3.456, 18.944-18.944, 22.4-22.4c 12.512-12.48, 30.72-14.528, 40.704-4.512s 8,28.224-4.512,40.704C 139.456,504.736, 123.968,520.256, 120.512,523.712z
M 497.088,74.688c 3.456-3.456, 18.976-18.976, 22.4-22.4c 12.512-12.48, 30.752-14.496, 40.736-4.512c 9.984,9.984, 7.936,28.224-4.544,40.704
c-3.456,3.424-18.976,18.944-22.4,22.4c-12.512,12.48-30.752,14.496-40.736,4.512S 484.64,87.2, 497.088,74.688z" />
<glyph unicode="&#xf057;" d="M 410.071,207.286q0,9.286 -6.786,16.071l-64.643,64.643l 64.643,64.643q 6.786,6.786 6.786,16.071q0,9.643 -6.786,16.429l-32.143,32.143q-6.786,6.786 -16.429,6.786q-9.286,0 -16.071-6.786l-64.643-64.643l-64.643,64.643q-6.786,6.786 -16.071,6.786q-9.643,0 -16.429-6.786l-32.143-32.143q-6.786-6.786 -6.786-16.429q0-9.286 6.786-16.071l 64.643-64.643l-64.643-64.643q-6.786-6.786 -6.786-16.071q0-9.643 6.786-16.429l 32.143-32.143q 6.786-6.786 16.429-6.786 q 9.286,0 16.071,6.786l 64.643,64.643l 64.643-64.643q 6.786-6.786 16.071-6.786q 9.643,0 16.429,6.786l 32.143,32.143q 6.786,6.786 6.786,16.429zM 548.285,288q0-74.643 -36.786-137.679t-99.821-99.821t-137.679-36.786t-137.679,36.786t-99.821,99.821t-36.786,137.679t 36.786,137.679t 99.821,99.821t 137.679,36.786t 137.679-36.786t 99.821-99.821t 36.786-137.679z" horiz-adv-x="548" />
<glyph unicode="&#xf00d;" d="M 463.142,135.857q0-14.286 -10-24.286l-48.571-48.571q-10-10 -24.286-10t-24.286,10l-105,105l-105-105q-10-10 -24.286-10t-24.286,10l-48.571,48.571q-10,10 -10,24.286t 10,24.286l 105,105l-105,105q-10,10 -10,24.286t 10,24.286l 48.571,48.571q 10,10 24.286,10t 24.286-10l 105-105l 105,105q 10,10 24.286,10t 24.286-10l 48.571-48.571q 10-10 10-24.286 t-10-24.286l-105-105l 105-105q 10-10 10-24.286z" horiz-adv-x="502" />
<glyph unicode="&#xe037;" d="M 520,448l-120,0 L 400,488 L 280,608L0,608 l0-480 l 240,0 l0-160 l 400,0 L 640,328 L 520,448z M 520,391.431L 583.431,328L 520,328 L 520,391.431 z M 280,551.431L 343.431,488L 280,488
L 280,551.431 z M 40,568l 200,0 l0-120 l 120,0 l0-280 L 40,168 L 40,568 z M 600,8L 280,8 l0,120 l 120,0 L 400,408 l 80,0 l0-120 l 120,0 L 600,8 z" />
<glyph unicode="&#x20;" horiz-adv-x="320" />
</font></defs></svg>
Side by side

After

Width:  |  Height:  |  Size: 15 KiB

BIN
fonts/icomoon-toolbar/fonts/toolbar.ttf Normal file
View file

Binary file not shown.

BIN
fonts/icomoon-toolbar/fonts/toolbar.woff Normal file
View file

Binary file not shown.

351
fonts/icomoon-toolbar/index.html Normal file
View file

@ -0,0 +1,351 @@
<!doctype html>
<html>
<head>
<title>Your Font/Glyphs</title>
<link rel="stylesheet" href="style.css" />
<!--[if lte IE 7]><script src="lte-ie7.js"></script><![endif]-->
<style>
section, header, footer {display: block;}
body {
font-family: sans-serif;
color: #444;
line-height: 1.5;
font-size: 1em;
}
* {
-moz-box-sizing: border-box;
-webkit-box-sizing: border-box;
box-sizing: border-box;
margin: 0;
padding: 0;
}
.glyph {
font-size: 20px;
float: left;
text-align: center;
background: #eee;
padding: .75em;
margin: .75em 1.5em .75em 0;
width: 7.5em;
border-radius: .25em;
box-shadow: inset 0 0 0 1px #f8f8f8, 0 0 0 1px #CCC;
}
.glyph input {
font-family: consolas, monospace;
font-size: 13px;
width: 100%;
text-align: center;
border: 0;
box-shadow: 0 0 0 1px #ccc;
padding: .125em;
}
.w-main {
width: 80%;
}
.centered {
margin-left: auto;
margin-right: auto;
}
.fs1 {
font-size: 2em;
}
header {
margin: 2em 0;
padding-bottom: .5em;
color: #666;
box-shadow: 0 2px #eee;
}
header h1 {
font-size: 2em;
font-weight: normal;
}
.clearfix:before, .clearfix:after { content: ""; display: table; }
.clearfix:after, .clear { clear: both; }
footer {
margin-top: 2em;
padding: .5em 0;
box-shadow: 0 -2px #eee;
}
a, a:visited {
color: #B35047;
text-decoration: none;
}
a:hover, a:focus {color: #000;}
.box1 {
font-size: 20px;
display: inline-block;
width: 15em;
padding: .25em .5em;
background: #eee;
margin: .5em 1em .5em 0;
}
</style>
</head>
<body>
<div class="w-main centered">
<section class="mtm clearfix" id="glyphs">
<header>
<h1>Your font contains the following glyphs</h1>
<p>The generated SVG font can be imported back to <a href="http://icomoon.io/app">IcoMoon</a> for modification.</p>
</header>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe000;"></div>
<input type="text" readonly="readonly" value="&amp;#xe000;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe001;"></div>
<input type="text" readonly="readonly" value="&amp;#xe001;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe002;"></div>
<input type="text" readonly="readonly" value="&amp;#xe002;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe003;"></div>
<input type="text" readonly="readonly" value="&amp;#xe003;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe004;"></div>
<input type="text" readonly="readonly" value="&amp;#xe004;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe005;"></div>
<input type="text" readonly="readonly" value="&amp;#xe005;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe006;"></div>
<input type="text" readonly="readonly" value="&amp;#xe006;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe007;"></div>
<input type="text" readonly="readonly" value="&amp;#xe007;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe008;"></div>
<input type="text" readonly="readonly" value="&amp;#xe008;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe009;"></div>
<input type="text" readonly="readonly" value="&amp;#xe009;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe00a;"></div>
<input type="text" readonly="readonly" value="&amp;#xe00a;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe00b;"></div>
<input type="text" readonly="readonly" value="&amp;#xe00b;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe00c;"></div>
<input type="text" readonly="readonly" value="&amp;#xe00c;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe00d;"></div>
<input type="text" readonly="readonly" value="&amp;#xe00d;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe00e;"></div>
<input type="text" readonly="readonly" value="&amp;#xe00e;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe00f;"></div>
<input type="text" readonly="readonly" value="&amp;#xe00f;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe011;"></div>
<input type="text" readonly="readonly" value="&amp;#xe011;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe010;"></div>
<input type="text" readonly="readonly" value="&amp;#xe010;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe012;"></div>
<input type="text" readonly="readonly" value="&amp;#xe012;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe013;"></div>
<input type="text" readonly="readonly" value="&amp;#xe013;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe014;"></div>
<input type="text" readonly="readonly" value="&amp;#xe014;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe015;"></div>
<input type="text" readonly="readonly" value="&amp;#xe015;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe016;"></div>
<input type="text" readonly="readonly" value="&amp;#xe016;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe017;"></div>
<input type="text" readonly="readonly" value="&amp;#xe017;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe01a;"></div>
<input type="text" readonly="readonly" value="&amp;#xe01a;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xf042;"></div>
<input type="text" readonly="readonly" value="&amp;#xf042;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe018;"></div>
<input type="text" readonly="readonly" value="&amp;#xe018;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xf057;"></div>
<input type="text" readonly="readonly" value="&amp;#xf057;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xf00d;"></div>
<input type="text" readonly="readonly" value="&amp;#xf00d;" />
</div>
<div class="glyph">
<div class="fs1" aria-hidden="true" data-icon="&#xe037;"></div>
<input type="text" readonly="readonly" value="&amp;#xe037;" />
</div>
</section>
<div class="clear"></div>
<section class="mtm clearfix" id="glyphs">
<header>
<h1>Class Names</h1>
</header>
<span class="box1">
<span aria-hidden="true" class="icon-file"></span>
&nbsp;icon-file
</span>
<span class="box1">
<span aria-hidden="true" class="icon-image"></span>
&nbsp;icon-image
</span>
<span class="box1">
<span aria-hidden="true" class="icon-zoom-out"></span>
&nbsp;icon-zoom-out
</span>
<span class="box1">
<span aria-hidden="true" class="icon-zoom-in"></span>
&nbsp;icon-zoom-in
</span>
<span class="box1">
<span aria-hidden="true" class="icon-expand"></span>
&nbsp;icon-expand
</span>
<span class="box1">
<span aria-hidden="true" class="icon-expand-2"></span>
&nbsp;icon-expand-2
</span>
<span class="box1">
<span aria-hidden="true" class="icon-folder-open"></span>
&nbsp;icon-folder-open
</span>
<span class="box1">
<span aria-hidden="true" class="icon-folder"></span>
&nbsp;icon-folder
</span>
<span class="box1">
<span aria-hidden="true" class="icon-cog"></span>
&nbsp;icon-cog
</span>
<span class="box1">
<span aria-hidden="true" class="icon-menu"></span>
&nbsp;icon-menu
</span>
<span class="box1">
<span aria-hidden="true" class="icon-wrench"></span>
&nbsp;icon-wrench
</span>
<span class="box1">
<span aria-hidden="true" class="icon-settings"></span>
&nbsp;icon-settings
</span>
<span class="box1">
<span aria-hidden="true" class="icon-loop"></span>
&nbsp;icon-loop
</span>
<span class="box1">
<span aria-hidden="true" class="icon-pin"></span>
&nbsp;icon-pin
</span>
<span class="box1">
<span aria-hidden="true" class="icon-first"></span>
&nbsp;icon-first
</span>
<span class="box1">
<span aria-hidden="true" class="icon-last"></span>
&nbsp;icon-last
</span>
<span class="box1">
<span aria-hidden="true" class="icon-arrow-left"></span>
&nbsp;icon-arrow-left
</span>
<span class="box1">
<span aria-hidden="true" class="icon-arrow-right"></span>
&nbsp;icon-arrow-right
</span>
<span class="box1">
<span aria-hidden="true" class="icon-arrow-left-2"></span>
&nbsp;icon-arrow-left-2
</span>
<span class="box1">
<span aria-hidden="true" class="icon-arrow-right-2"></span>
&nbsp;icon-arrow-right-2
</span>
<span class="box1">
<span aria-hidden="true" class="icon-arrow-left-3"></span>
&nbsp;icon-arrow-left-3
</span>
<span class="box1">
<span aria-hidden="true" class="icon-arrow-right-3"></span>
&nbsp;icon-arrow-right-3
</span>
<span class="box1">
<span aria-hidden="true" class="icon-previous"></span>
&nbsp;icon-previous
</span>
<span class="box1">
<span aria-hidden="true" class="icon-next"></span>
&nbsp;icon-next
</span>
<span class="box1">
<span aria-hidden="true" class="icon-droplet"></span>
&nbsp;icon-droplet
</span>
<span class="box1">
<span aria-hidden="true" class="icon-adjust"></span>
&nbsp;icon-adjust
</span>
<span class="box1">
<span aria-hidden="true" class="icon-sun"></span>
&nbsp;icon-sun
</span>
<span class="box1">
<span aria-hidden="true" class="icon-remove-sign"></span>
&nbsp;icon-remove-sign
</span>
<span class="box1">
<span aria-hidden="true" class="icon-remove"></span>
&nbsp;icon-remove
</span>
<span class="box1">
<span aria-hidden="true" class="icon-copy"></span>
&nbsp;icon-copy
</span>
</section>
<footer>
<p>Generated by <a href="http://icomoon.io">IcoMoon.io</a></p>
</footer>
</div>
<script>
document.getElementById("glyphs").addEventListener("click", function(e) {
var target = e.target;
if (target.tagName === "INPUT") {
target.select();
}
});
</script>
</body>
</html>

11
fonts/icomoon-toolbar/license.txt Normal file
View file

@ -0,0 +1,11 @@
Icon Set: IcoMoon - Free -- http://keyamoon.com/icomoon/
License: CC BY 3.0 -- http://creativecommons.org/licenses/by/3.0/Set: Font Awesome -- http://fortawesome.github.com/Font-Awesome/
License: CC BY 3.0 -- http://creativecommons.org/licenses/by/3.0/
Icon Set: IcoMoon - Free -- http://keyamoon.com/icomoon/
License: CC BY 3.0 -- http://creativecommons.org/licenses/by/3.0/
Icon Set: Iconic -- http://somerandomdude.com/work/iconic/
License: CC BY-SA 3.0 -- http://creativecommons.org/licenses/by-sa/3.0/us/

57
fonts/icomoon-toolbar/lte-ie7.js Normal file
View file

@ -0,0 +1,57 @@
/* Load this script using conditional IE comments if you need to support IE 7 and IE 6. */
window.onload = function() {
function addIcon(el, entity) {
var html = el.innerHTML;
el.innerHTML = '<span style="font-family: \'toolbar\'">' + entity + '</span>' + html;
}
var icons = {
'icon-file' : '&#xe000;',
'icon-image' : '&#xe001;',
'icon-zoom-out' : '&#xe002;',
'icon-zoom-in' : '&#xe003;',
'icon-expand' : '&#xe004;',
'icon-expand-2' : '&#xe005;',
'icon-folder-open' : '&#xe006;',
'icon-folder' : '&#xe007;',
'icon-cog' : '&#xe008;',
'icon-menu' : '&#xe009;',
'icon-wrench' : '&#xe00a;',
'icon-settings' : '&#xe00b;',
'icon-loop' : '&#xe00c;',
'icon-pin' : '&#xe00d;',
'icon-first' : '&#xe00e;',
'icon-last' : '&#xe00f;',
'icon-arrow-left' : '&#xe011;',
'icon-arrow-right' : '&#xe010;',
'icon-arrow-left-2' : '&#xe012;',
'icon-arrow-right-2' : '&#xe013;',
'icon-arrow-left-3' : '&#xe014;',
'icon-arrow-right-3' : '&#xe015;',
'icon-previous' : '&#xe016;',
'icon-next' : '&#xe017;',
'icon-droplet' : '&#xe01a;',
'icon-adjust' : '&#xf042;',
'icon-sun' : '&#xe018;',
'icon-remove-sign' : '&#xf057;',
'icon-remove' : '&#xf00d;',
'icon-copy' : '&#xe037;'
},
els = document.getElementsByTagName('*'),
i, attr, html, c, el;
for (i = 0; ; i += 1) {
el = els[i];
if(!el) {
break;
}
attr = el.getAttribute('data-icon');
if (attr) {
addIcon(el, attr);
}
c = el.className;
c = c.match(/icon-[^\s'"]+/);
if (c && icons[c[0]]) {
addIcon(el, icons[c[0]]);
}
}
};

129
fonts/icomoon-toolbar/style.css Normal file
View file

@ -0,0 +1,129 @@
@font-face {
font-family: 'toolbar';
src:url('fonts/toolbar.eot');
src:url('fonts/toolbar.eot?#iefix') format('embedded-opentype'),
url('fonts/toolbar.woff') format('woff'),
url('fonts/toolbar.ttf') format('truetype'),
url('fonts/toolbar.svg#toolbar') format('svg');
font-weight: normal;
font-style: normal;
}
/* Use the following CSS code if you want to use data attributes for inserting your icons */
[data-icon]:before {
font-family: 'toolbar';
content: attr(data-icon);
speak: none;
font-weight: normal;
font-variant: normal;
text-transform: none;
line-height: 1;
-webkit-font-smoothing: antialiased;
}
/* Use the following CSS code if you want to have a class per icon */
/*
Instead of a list of all class selectors,
you can use the generic selector below, but it's slower:
[class*="icon-"] {
*/
.icon-file, .icon-image, .icon-zoom-out, .icon-zoom-in, .icon-expand, .icon-expand-2, .icon-folder-open, .icon-folder, .icon-cog, .icon-menu, .icon-wrench, .icon-settings, .icon-loop, .icon-pin, .icon-first, .icon-last, .icon-arrow-left, .icon-arrow-right, .icon-arrow-left-2, .icon-arrow-right-2, .icon-arrow-left-3, .icon-arrow-right-3, .icon-previous, .icon-next, .icon-droplet, .icon-adjust, .icon-sun, .icon-remove-sign, .icon-remove, .icon-copy {
font-family: 'toolbar';
speak: none;
font-style: normal;
font-weight: normal;
font-variant: normal;
text-transform: none;
line-height: 1;
-webkit-font-smoothing: antialiased;
}
.icon-file:before {
content: "\e000";
}
.icon-image:before {
content: "\e001";
}
.icon-zoom-out:before {
content: "\e002";
}
.icon-zoom-in:before {
content: "\e003";
}
.icon-expand:before {
content: "\e004";
}
.icon-expand-2:before {
content: "\e005";
}
.icon-folder-open:before {
content: "\e006";
}
.icon-folder:before {
content: "\e007";
}
.icon-cog:before {
content: "\e008";
}
.icon-menu:before {
content: "\e009";
}
.icon-wrench:before {
content: "\e00a";
}
.icon-settings:before {
content: "\e00b";
}
.icon-loop:before {
content: "\e00c";
}
.icon-pin:before {
content: "\e00d";
}
.icon-first:before {
content: "\e00e";
}
.icon-last:before {
content: "\e00f";
}
.icon-arrow-left:before {
content: "\e011";
}
.icon-arrow-right:before {
content: "\e010";
}
.icon-arrow-left-2:before {
content: "\e012";
}
.icon-arrow-right-2:before {
content: "\e013";
}
.icon-arrow-left-3:before {
content: "\e014";
}
.icon-arrow-right-3:before {
content: "\e015";
}
.icon-previous:before {
content: "\e016";
}
.icon-next:before {
content: "\e017";
}
.icon-droplet:before {
content: "\e01a";
}
.icon-adjust:before {
content: "\f042";
}
.icon-sun:before {
content: "\e018";
}
.icon-remove-sign:before {
content: "\f057";
}
.icon-remove:before {
content: "\f00d";
}
.icon-copy:before {
content: "\e037";
}

7
img/iconic/LICENSE
View file

@ -1,7 +0,0 @@
Iconic Icons by PJ Onori
@somerandomdude
http://somerandomdude.com/projects/iconic/
http://creativecommons.org/licenses/by-sa/3.0/us/
http://scripts.sil.org/cms/scripts/page.php?site_id=nrsi&id=OFL

BIN
img/iconic/reload_12x14.png
View file

Binary file not shown.
Side by side

Before

Width:  |  Height:  |  Size: 248 B

BIN
img/iconic/sprite.png
View file

Binary file not shown.
Side by side

Before

Width:  |  Height:  |  Size: 6.6 KiB

BIN
img/iconic/sprite.psd
View file

Binary file not shown.

BIN
img/left.png
View file

Binary file not shown.
Side by side

Before

Width:  |  Height:  |  Size: 3.2 KiB

BIN
img/right.png
View file

Binary file not shown.
Side by side

Before

Width:  |  Height:  |  Size: 3.2 KiB

21
lib/.jshintrc Normal file
View file

@ -0,0 +1,21 @@
{
"predef": [
"jQuery",
"Handlebars",
"Pixastic"
],
"forin": true,
"noarg": true,
"noempty": true,
"eqeqeq": true,
"bitwise": true,
"strict": true,
"undef": true,
"unused": true,
"curly": true,
"browser": true,
"maxerr": 50,
"quotmark": "single",
"trailing": false,
"indent": 2
}

1833
lib/ComicBook.js
View file

File diff suppressed because it is too large Load diff

23
lib/ComicBook.min.js vendored
View file

@ -1,23 +0,0 @@
function merge(j,d){var i;typeof d==="undefined"&&(d={});for(i in j)j.hasOwnProperty(i)&&!(i in d)&&(d[i]=j[i]);return d}var ComicBookException={INVALID_PAGE:"invalid page",INVALID_PAGE_TYPE:"invalid page type",UNDEFINED_CONTROL:"undefined control",INVALID_ZOOM_MODE:"invalid zoom mode",INVALID_NAVIGATION_EVENT:"invalid navigation event"};
function ComicBook(j,d,i){function m(){var a=window.innerHeight+1;p===!1&&(p=$(document.createElement("div")).attr("id","cb-width-shiv").css({width:"100%",position:"absolute",top:0,zIndex:"-1000"}),$("body").append(p));p.height(a);return p.innerWidth()}function x(){var a=t();a!==c&&l.indexOf(a)>-1&&(c=a,ComicBook.prototype.draw())}function t(){var a=parseInt(location.hash.substring(1),10)-1||0;if(a<0)a=location.hash=0;return a}function s(){f=document.getElementById(y);u=f.getContext("2d");v===!1&&
(ComicBook.prototype.renderControls(),v=!0);f.addEventListener("click",ComicBook.prototype.navigation,!1);window.addEventListener("keydown",ComicBook.prototype.navigation,!1);window.addEventListener("hashchange",x,!1)}var y=j;this.srcs=d;var b=merge({displayMode:"double",zoomMode:"fitWidth",manga:!1,enhance:{},keyboard:{next:78,previous:80,toolbar:84,toggleLayout:76}},i),w=d.length,q=[],f,u,l=[],n=1,r=!1,v=!1,o=!1,p=!1,j=t(),c=j<d.length?j:0;ComicBook.prototype.control={status:$(document.createElement("div")).attr("id",
"cb-status").addClass("cb-control cb-always-on").append($(document.createElement("div")).attr("id","cb-progress-bar").progressbar()),toolbar:$(document.createElement("div")).attr("id","cb-toolbar").addClass("cb-control").append($(document.createElement("button")).attr("title","close the toolbar").addClass("cb-close").click(function(){ComicBook.prototype.toggleToolbar()})).append($(document.createElement("button")).attr("title","switch between dual and single page modes").addClass("cb-layout "+b.displayMode).click(function(){ComicBook.prototype.toggleLayout()})).append($(document.createElement("button")).attr("title",
"tweak the page colors").addClass("cb-color cb-menu-button").click(function(){ComicBook.prototype.toggleControl("color")})).append($(document.createElement("button")).attr("title","zoom out").addClass("cb-zoom-out").click(function(){ComicBook.prototype.zoom(n-0.1)})).append($(document.createElement("button")).attr("title","zoom in").addClass("cb-zoom-in").click(function(){ComicBook.prototype.zoom(n+0.1)})).append($(document.createElement("button")).attr("title","fit to page width").addClass("cb-fit-width").click(function(){b.zoomMode=
"fitWidth";ComicBook.prototype.drawPage()})).append($(document.createElement("button")).attr("title",b.manga==!0?"change reading direction to 'left-to-right'":"change reading direction to 'right-to-left'").addClass("cb-read-direction").click(function(){b.manga=!b.manga;ComicBook.prototype.drawPage()}).attr("id",b.manga==!0?"toright":"toleft")).append($(document.createElement("p")).attr("id","cb-comic-info").append("<span id='cb-current-page'></span> / "+d.length)),color:$(document.createElement("div")).attr("id",
"cb-color").addClass("cb-control").append("<label for='cb-sharpen'>Brightness</label>").append($("<div id='cb-brightness' class='cb-option'></div>").slider({value:0,step:10,min:-1E3,max:1E3,change:function(a,b){ComicBook.prototype.enhance.brightness({brightness:b.value})}})).append("<label for='cb-sharpen'>Contrast</label>").append($("<div id='cb-contrast' class='cb-option'></div>").slider({value:0,step:0.001,min:0,max:1,change:function(a,b){ComicBook.prototype.enhance.brightness({contrast:b.value})}})).append("<label for='cb-sharpen'>Sharpen</label>").append($("<div id='cb-sharpen' class='cb-option'></div>").slider({value:0,
step:0.001,min:0,max:1,change:function(a,b){ComicBook.prototype.enhance.sharpen({amount:b.value})}})).append($(document.createElement("div")).addClass("cb-option").append("<input type='checkbox' id='cb-desaturate' /> <label for='cb-desaturate'>Desaturate</label>").append("<button id='cb-reset'>reset</button>")),navigation:{left:$(document.createElement("div")).addClass("cb-control cb-navigate cb-always-on left").click(function(){b.manga==!1?ComicBook.prototype.drawPrevPage():ComicBook.prototype.drawNextPage()}),
right:$(document.createElement("div")).addClass("cb-control cb-navigate cb-always-on right").click(function(){b.manga==!1?ComicBook.prototype.drawNextPage():ComicBook.prototype.drawPrevPage()})},loadingOverlay:$(document.createElement("div")).attr("id","cb-loading-overlay").addClass("cb-control")};ComicBook.prototype.renderControls=function(){$(f).before(this.getControl("loadingOverlay")).before(this.getControl("status")).after(this.getControl("toolbar").hide()).after(this.getControl("navigation").left).after(this.getControl("navigation").right).after(this.getControl("color").hide());
$(".cb-menu-button").click(function(){$(this).toggleClass("active")});$("#cb-desaturate").click(function(){$(this).is(":checked")?ComicBook.prototype.enhance.desaturate():ComicBook.prototype.enhance.resaturate()});$("#cb-reset").click(function(){$("#cb-brightness").slider("value",0);$("#cb-contrast").slider("value",0);$("#cb-saturation").slider("value",0);$("#cb-sharpen").slider("value",0);$("#cb-desaturate").attr("checked",!1);ComicBook.prototype.enhance.reset()})};ComicBook.prototype.getControl=
function(a){if(typeof this.control[a]==="undefined")throw ComicBookException.UNDEFINED_CONTROL+" "+a;return this.control[a]};ComicBook.prototype.showControl=function(a){this.getControl(a).show().addClass("open")};ComicBook.prototype.hideControl=function(a){this.getControl(a).removeClass("open").hide()};ComicBook.prototype.toggleControl=function(a){this.getControl(a).toggle().toggleClass("open")};ComicBook.prototype.toggleToolbar=function(){$("#cb-toolbar").is(":visible")?$(".cb-control").not(".cb-always-on").hide():
$("#cb-toolbar, .cb-control.open").show()};ComicBook.prototype.toggleLayout=function(){b.displayMode==="double"?($("#cb-toolbar .cb-layout").removeClass("double"),b.displayMode="single"):($("#cb-toolbar .cb-layout").removeClass("single"),b.displayMode="double");$("#cb-toolbar .cb-layout").addClass(b.displayMode);ComicBook.prototype.drawPage()};ComicBook.prototype.getPage=function(a){if(a<0||a>d.length-1)throw ComicBookException.INVALID_PAGE+" "+a;if(typeof q[a]==="object")return q[a];else o=a,this.showControl("loadingOverlay")};
ComicBook.prototype.draw=function(){s();$(".cb-control.cb-navigate").outerHeight(window.innerHeight);$("#cb-toolbar").outerWidth(m());$("#cb-loading-overlay").outerWidth(m()).height(window.innerHeight);q.length!==w?this.preload():this.drawPage()};ComicBook.prototype.zoom=function(a){b.zoomMode="manual";n=a;typeof this.getPage(c)==="object"&&this.drawPage()};ComicBook.prototype.preload=function(){function a(e){var g=new Image;g.src=d[e];g.onload=function(){q[e]=this;l.push(e);$("#cb-progress-bar").progressbar("value",
Math.floor(l.length/w*100));var g=b.displayMode==="double"&&c<d.length-1?1:0;if(h===!1&&$.inArray(c+g,l)!==-1||typeof o==="number"&&$.inArray(o,l)!==-1)typeof o==="number"&&(c=o-1,o=!1),ComicBook.prototype.drawPage(),ComicBook.prototype.hideControl("loadingOverlay"),h=!0;f.length?(a(f[0]),f.splice(0,1)):$("#cb-status").delay(500).fadeOut()}}var e=c,h=!1,f=[];this.showControl("loadingOverlay");(function(b,c){for(var e=1,d=b,h=b-1;d<=c;)e>3&&h>-1?(f.push(h),h--,e=0):(f.push(d),d++),e++;for(;h>-1;)f.push(h),
h--;a(f[0])})(e,d.length-1)};ComicBook.prototype.pageLoaded=function(a){return typeof l[a-1]!=="undefined"};ComicBook.prototype.drawPage=function(a){if(typeof a==="number"&&a<d.length&&a>0&&(c=a-1,!this.pageLoaded(a))){this.showControl("loadingOverlay");return}c<0&&(c=0);var e,h=0,j=0,k=ComicBook.prototype.getPage(c),a=!1;b.displayMode==="double"&&c<d.length-1&&(a=ComicBook.prototype.getPage(c+1));if(typeof k!=="object")throw ComicBookException.INVALID_PAGE_TYPE+" "+typeof k;var g=k.width;f.width=
0;f.height=0;if(r=typeof a==="object"&&(k.width>k.height||a.width>a.height)&&b.displayMode==="double")b.displayMode="single";b.displayMode==="double"&&(g+=typeof a==="object"?a.width:g);switch(b.zoomMode){case "manual":document.body.style.overflowX="auto";e=b.displayMode==="double"?n*2:n;break;case "fitWidth":document.body.style.overflowX="hidden";n=e=m()>g?(m()-g)/m()+1:m()/g;break;default:throw ComicBookException.INVALID_ZOOM_MODE+" "+b.zoomMode;}var g=k.width*e,i=k.height*e;e=b.zoomMode==="manual"?
k.width*n:g;var l=b.zoomMode==="manual"?k.height*n:i,i=l;f.width=g<m()?m():g;f.height=i<window.innerHeight?window.innerHeight:i;g<m()&&b.zoomMode==="manual"&&(h=(m()-e)/2,b.displayMode==="double"&&(h-=e/2));i<window.innerHeight&&b.zoomMode==="manual"&&(j=(window.innerHeight-l)/2);b.manga&&b.displayMode==="double"&&typeof a==="object"&&(g=k,k=a,a=g);u.drawImage(k,h,j,e,l);b.displayMode==="double"&&typeof a==="object"&&u.drawImage(a,e+h,j,e,l);$.each(b.enhance,function(a,b){ComicBook.prototype.enhance[a](b)});
h=b.displayMode==="double"&&c+2<=d.length?c+1+"-"+(c+2):c+1;$("#cb-current-page").text(h);if(r)b.displayMode="double";$("button.cb-fit-width").attr("disabled",b.zoomMode==="fitWidth");b.manga==!0?$("button.cb-read-direction").attr("id","toright"):$("button.cb-read-direction").attr("id","toleft");$(".cb-navigate").show();c===0&&b.manga==!1?($(".cb-navigate.left").hide(),$(".cb-navigate.right").show()):c===0&&b.manga==!0&&($(".cb-navigate.left").show(),$(".cb-navigate.right").hide());if((c===d.length-
1||typeof a==="object"&&c===d.length-2)&&b.manga==!1)$(".cb-navigate.left").show(),$(".cb-navigate.right").hide();else if((c===d.length-1||typeof a==="object"&&c===d.length-2)&&b.manga==!0)$(".cb-navigate.left").hide(),$(".cb-navigate.right").show();typeof b.afterDrawPage==="function"&&b.afterDrawPage(c+1);if(t()!==c)location.hash=c+1;window.scroll(0,0)};ComicBook.prototype.drawNextPage=function(){var a;try{a=this.getPage(c+1)}catch(e){}if(!a)return!1;if(c+1<q.length){c+=b.displayMode==="single"||
r?1:2;try{this.drawPage()}catch(d){}}};ComicBook.prototype.drawPrevPage=function(){var a;try{a=this.getPage(c-1)}catch(e){}if(!a)return!1;r=a.width>a.height;c>0&&(c-=b.displayMode==="single"||r?1:2,this.drawPage())};ComicBook.prototype.enhance={reset:function(a){a?delete b.enhance[a]:b.enhance={};ComicBook.prototype.drawPage()},brightness:function(a,c){c!==!1&&this.reset("brightness");var d=merge({brightness:0,contrast:0},a);b.enhance.brightness=d;Pixastic.process(f,"brightness",{brightness:d.brightness,
contrast:d.contrast,legacy:!0});s()},desaturate:function(){b.enhance.desaturate={};Pixastic.process(f,"desaturate",{average:!1});s()},resaturate:function(){delete b.enhance.desaturate;ComicBook.prototype.drawPage()},sharpen:function(a){this.desharpen();a=merge({amount:0},a);b.enhance.sharpen=a;Pixastic.process(f,"sharpen",{amount:a.amount});s()},desharpen:function(){delete b.enhance.sharpen;ComicBook.prototype.drawPage()}};ComicBook.prototype.navigation=function(a){if($("#cb-loading-overlay").is(":visible"))return!1;
var c=!1;switch(a.type){case "click":ComicBook.prototype.toggleToolbar();break;case "keydown":a.keyCode===b.keyboard.previous&&(c="left");a.keyCode===b.keyboard.next&&(c="right");a.keyCode===b.keyboard.toolbar&&ComicBook.prototype.toggleToolbar();a.keyCode===b.keyboard.toggleLayout&&ComicBook.prototype.toggleLayout();break;default:throw ComicBookException.INVALID_NAVIGATION_EVENT+" "+a.type;}if(c)return a.stopPropagation(),b.manga?(c==="left"&&ComicBook.prototype.drawNextPage(),c==="right"&&ComicBook.prototype.drawPrevPage()):
(c==="left"&&ComicBook.prototype.drawPrevPage(),c==="right"&&ComicBook.prototype.drawNextPage()),!1}};

1
lib/pixastic

@ -1 +0,0 @@
Subproject commit 5de84389685e3124137f6b45daa64811cc6a8220

43
lib/templates.js Normal file
View file

@ -0,0 +1,43 @@
(function() {
var template = Handlebars.template, templates = Handlebars.templates = Handlebars.templates || {};
templates['loadingOverlay'] = template(function (Handlebars,depth0,helpers,partials,data) {
this.compilerInfo = [2,'>= 1.0.0-rc.3'];
helpers = helpers || Handlebars.helpers; data = data || {};
return "\n<div id=\"cb-loading-overlay\" class=\"cb-control\"></div>\n";
});
templates['navigateLeft'] = template(function (Handlebars,depth0,helpers,partials,data) {
this.compilerInfo = [2,'>= 1.0.0-rc.3'];
helpers = helpers || Handlebars.helpers; data = data || {};
return "\n<div data-trigger=\"click\" data-action=\"navigation\" data-navigate-side=\"left\" class=\"cb-control navigate navigate-left \">\n <span class=\"icon-arrow-left\"></span>\n</div>\n";
});
templates['navigateRight'] = template(function (Handlebars,depth0,helpers,partials,data) {
this.compilerInfo = [2,'>= 1.0.0-rc.3'];
helpers = helpers || Handlebars.helpers; data = data || {};
return "\n<div data-trigger=\"click\" data-action=\"navigation\" data-navigate-side=\"right\" class=\"cb-control navigate navigate-right\">\n <span class=\"icon-arrow-right\"></span>\n</div>\n";
});
templates['progressbar'] = template(function (Handlebars,depth0,helpers,partials,data) {
this.compilerInfo = [2,'>= 1.0.0-rc.3'];
helpers = helpers || Handlebars.helpers; data = data || {};
return "<div id=\"cb-status\" class=\"cb-control\">\n <div id=\"cb-progress-bar\">\n <div class=\"progressbar-value\"></div>\n </div>\n</div>\n";
});
templates['toolbar'] = template(function (Handlebars,depth0,helpers,partials,data) {
this.compilerInfo = [2,'>= 1.0.0-rc.3'];
helpers = helpers || Handlebars.helpers; data = data || {};
return "\n<div class=\"toolbar\">\n\n <ul class=\"pull-left\">\n <li class=\"close\">\n <button data-trigger=\"click\" data-action=\"close\" title=\"close\" class=\"icon-remove-sign\"></button>\n </li>\n <li class=\"close separator\"></li>\n <li>\n <button title=\"image settings\" class=\"icon-settings\" data-toggle=\"dropdown\"></button>\n <div class=\"dropdown\">\n <form name=\"image-enhancements\" data-trigger=\"reset\" data-action=\"resetEnhancements\">\n <div class=\"sliders\">\n <div class=\"control-group\">\n <label title=\"adjust brightness\" class=\"icon-sun\"></label>\n <input data-trigger=\"change\" data-action=\"brightness\" type=\"range\" min=\"-100\" max=\"100\" step=\"1\" value=\"0\">\n </div>\n <div class=\"control-group\">\n <label title=\"adjust contrast\" class=\"icon-adjust\"></label>\n <input data-trigger=\"change\" data-action=\"contrast\" type=\"range\" min=\"-1\" max=\"1\" step=\"0.1\" value=\"0\">\n </div>\n <div class=\"control-group\">\n <label title=\"sharpen\" class=\"icon-droplet\"></label>\n <input data-trigger=\"change\" data-action=\"sharpen\" type=\"range\" min=\"0\" max=\"1\" step=\"0.1\" value=\"0\">\n </div>\n </div>\n <div class=\"control-group pull-left\">\n <input id=\"image-desaturate\" type=\"checkbox\" data-trigger=\"change\" data-action=\"desaturate\">\n <label for=\"image-desaturate\">desaturate</label>\n </div>\n <div class=\"control-group pull-right\">\n <input type=\"reset\" value=\"reset\">\n </div>\n </form>\n </div>\n </li>\n <li>\n <button data-trigger=\"click\" data-action=\"toggleLayout\" title=\"toggle one/two pages at a time\" class=\"icon-file layout layout-single\"></button>\n <button data-trigger=\"click\" data-action=\"toggleLayout\" title=\"toggle one/two pages at a time\" class=\"icon-copy layout layout-double\"></button>\n </li>\n <li>\n <button data-trigger=\"click\" data-action=\"zoomOut\" title=\"zoom out\" class=\"icon-zoom-out\"></button>\n </li>\n <li>\n <button data-trigger=\"click\" data-action=\"zoomIn\" title=\"zoom in\" class=\"icon-zoom-in\"></button>\n </li>\n <li>\n <button data-trigger=\"click\" data-action=\"fitWidth\" title=\"fit page to window width\" class=\"icon-expand\"></button>\n </li>\n <li>\n <button data-trigger=\"click\" data-action=\"toggleReadingMode\" title=\"switch reading direction\" class=\"icon-arrow-right-3 manga-false\"></button>\n <button data-trigger=\"click\" data-action=\"toggleReadingMode\" title=\"switch reading direction\" class=\"icon-arrow-left-3 manga-true\"></button>\n </li>\n </ul>\n\n <ul class=\"pull-right\">\n <li><span id=\"current-page\"></span> / <span id=\"page-count\"></span></li>\n </ul>\n\n</div>\n";
});
})();

BIN
lib/tests/img/1.png Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 1.9 KiB

BIN
lib/tests/img/2.png Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 1.9 KiB

BIN
lib/tests/img/3.png Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 1.9 KiB

BIN
lib/tests/img/4.png Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 1.9 KiB

BIN
lib/tests/img/5.png Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 3.6 KiB

BIN
lib/tests/img/6.png Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 1.9 KiB

27
lib/tests/index.html Normal file
View file

@ -0,0 +1,27 @@
<!DOCTYPE HTML>
<html>
<head>
<title>Comic Book Reader Test Suite</title>
<script src="../vendor/jquery-2.0.0.min.js"></script>
<link rel="stylesheet" href="vendor/qunit-1.11.0.css" type="text/css" media="screen" />
<script src="vendor/qunit-1.11.0.js"></script>
<script src="unit/logger.js"></script>
<script src="../vendor/pixastic/pixastic.js"></script>
<script src="../vendor/pixastic/pixastic.effects.js"></script>
<script src="../vendor/pixastic/pixastic.worker.js"></script>
<script src="../vendor/handlebars.runtime-1.0.rc.1.min.js"></script>
<script src="../templates.js"></script>
<script src="../ComicBook.js"></script>
<script src="unit/ComicBook.js"></script>
</head>
<body>
<div>
<div id="qunit"></div>
<div id="qunit-fixture"></div>
</div>
</body>
</html>

63
lib/tests/phantom.js Normal file
View file

@ -0,0 +1,63 @@
// Simple phantom.js integration script
// Taken from Twitter Bootstrap
function waitFor(testFx, onReady, timeOutMillis) {
var maxtimeOutMillis = timeOutMillis ? timeOutMillis : 5001 //< Default Max Timout is 5s
, start = new Date().getTime()
, condition = false
, interval = setInterval(function () {
if ((new Date().getTime() - start < maxtimeOutMillis) && !condition) {
// If not time-out yet and condition not yet fulfilled
condition = (typeof(testFx) === "string" ? eval(testFx) : testFx()) //< defensive code
} else {
if (!condition) {
// If condition still not fulfilled (timeout but condition is 'false')
console.log("'waitFor()' timeout")
phantom.exit(1)
} else {
// Condition fulfilled (timeout and/or condition is 'true')
typeof(onReady) === "string" ? eval(onReady) : onReady() //< Do what it's supposed to do once the condition is fulfilled
clearInterval(interval) //< Stop this interval
}
}
}, 100) //< repeat check every 100ms
}
if (phantom.args.length === 0 || phantom.args.length > 2) {
console.log('Usage: phantom.js URL')
phantom.exit()
}
var page = new WebPage()
// Route "console.log()" calls from within the Page context to the main Phantom context (i.e. current "this")
page.onConsoleMessage = function(msg) {
console.log(msg)
};
page.open(phantom.args[0], function(status){
if (status !== "success") {
console.log("Unable to access network")
phantom.exit()
} else {
waitFor(function(){
return page.evaluate(function(){
var el = document.getElementById('qunit-testresult')
if (el && el.innerText.match('completed')) {
return true
}
return false
})
}, function(){
var failedNum = page.evaluate(function(){
var el = document.getElementById('qunit-testresult')
try {
return el.getElementsByClassName('failed')[0].innerHTML
} catch (e) { }
return 10000
});
phantom.exit((parseInt(failedNum, 10) > 0) ? 1 : 0)
})
}
})

25
lib/tests/server.js Executable file
View file

@ -0,0 +1,25 @@
/*
* Simple connect server for phantom.js
* Adapted from Twitter Bootstrap
*/
var connect = require('connect'),
http = require('http'),
fs = require('fs'),
app = connect(),
pid_path = __dirname + '/pid.txt';
// clean up after failed test runs
if (fs.existsSync(pid_path)) {
try {
var pid = fs.readFileSync(pid_path, { encoding: 'utf-8' });
process.kill(pid, 'SIGHUP');
} catch (e) {}
fs.unlinkSync(pid_path);
}
app.use(connect.static(__dirname + '/../../'));
http.createServer(app).listen(3000);
fs.writeFileSync(pid_path, process.pid, 'utf-8');

62
lib/tests/unit/ComicBook.js Normal file
View file

@ -0,0 +1,62 @@
/* global $: false, module: false, test: false, equal: false, ComicBook: false console: false */
$(function () {
'use strict';
var $fixture;
var book;
function initBook() {
$fixture = $('#qunit-fixture');
$fixture.append('<canvas id="comic"></canvas>');
book = new ComicBook(
'comic',
['img/1.png','img/2.png','img/3.png','img/4.png','img/5.png','img/6.png'],
{ libPath: '../vendor/' }
);
}
module('not yet rendered comic', {
setup: initBook
});
test('controls shouldn\'t be renderd yet', function () {
equal($('.cb-control, .toolbar').length, 0, 'book not drawn yet, nothing should be rendered');
});
module('rendered comic', {
setup: function () {
initBook();
book.draw();
},
teardown: function () {
}
});
test('all controls should be rendered', function () {
equal($('.cb-control, .toolbar').length, 5, 'All toolbar elements should have rendered after book.draw');
});
// navigate on keyboard
// don't navigate if nothing left
// show current page
// customise keyboard control
// dropdown menus
// apply effects
// maximise
// minimise
// fit width
// single page / double page
// single page should allow double page spreads
// preloading
// update hash
// resume based on hash
// load from middle of page
// emit custom events based on data-attributes
// destroy
});

24
lib/tests/unit/logger.js Normal file
View file

@ -0,0 +1,24 @@
/* jshint strict: false */
/* global console: false, QUnit: false */
// Logging setup for phantom integration
// Taken from Twitter Bootstrap
QUnit.begin = function () {
console.log('Starting test suite');
console.log('================================================\n');
};
QUnit.moduleDone = function (opts) {
if (opts.failed === 0) {
console.log('\u2714 All tests passed in "' + opts.name + '" module');
} else {
console.log('\u2716 ' + opts.failed + ' tests failed in "' + opts.name + '" module');
}
};
QUnit.done = function (opts) {
console.log('\n================================================');
console.log('Tests completed in ' + opts.runtime + ' milliseconds');
console.log(opts.passed + ' tests of ' + opts.total + ' passed, ' + opts.failed + ' failed.');
};

244
lib/tests/vendor/qunit-1.11.0.css vendored Normal file
View file

@ -0,0 +1,244 @@
/**
* QUnit v1.11.0 - A JavaScript Unit Testing Framework
*
* http://qunitjs.com
*
* Copyright 2012 jQuery Foundation and other contributors
* Released under the MIT license.
* http://jquery.org/license
*/
/** Font Family and Sizes */
#qunit-tests, #qunit-header, #qunit-banner, #qunit-testrunner-toolbar, #qunit-userAgent, #qunit-testresult {
font-family: "Helvetica Neue Light", "HelveticaNeue-Light", "Helvetica Neue", Calibri, Helvetica, Arial, sans-serif;
}
#qunit-testrunner-toolbar, #qunit-userAgent, #qunit-testresult, #qunit-tests li { font-size: small; }
#qunit-tests { font-size: smaller; }
/** Resets */
#qunit-tests, #qunit-header, #qunit-banner, #qunit-userAgent, #qunit-testresult, #qunit-modulefilter {
margin: 0;
padding: 0;
}
/** Header */
#qunit-header {
padding: 0.5em 0 0.5em 1em;
color: #8699a4;
background-color: #0d3349;
font-size: 1.5em;
line-height: 1em;
font-weight: normal;
border-radius: 5px 5px 0 0;
-moz-border-radius: 5px 5px 0 0;
-webkit-border-top-right-radius: 5px;
-webkit-border-top-left-radius: 5px;
}
#qunit-header a {
text-decoration: none;
color: #c2ccd1;
}
#qunit-header a:hover,
#qunit-header a:focus {
color: #fff;
}
#qunit-testrunner-toolbar label {
display: inline-block;
padding: 0 .5em 0 .1em;
}
#qunit-banner {
height: 5px;
}
#qunit-testrunner-toolbar {
padding: 0.5em 0 0.5em 2em;
color: #5E740B;
background-color: #eee;
overflow: hidden;
}
#qunit-userAgent {
padding: 0.5em 0 0.5em 2.5em;
background-color: #2b81af;
color: #fff;
text-shadow: rgba(0, 0, 0, 0.5) 2px 2px 1px;
}
#qunit-modulefilter-container {
float: right;
}
/** Tests: Pass/Fail */
#qunit-tests {
list-style-position: inside;
}
#qunit-tests li {
padding: 0.4em 0.5em 0.4em 2.5em;
border-bottom: 1px solid #fff;
list-style-position: inside;
}
#qunit-tests.hidepass li.pass, #qunit-tests.hidepass li.running {
display: none;
}
#qunit-tests li strong {
cursor: pointer;
}
#qunit-tests li a {
padding: 0.5em;
color: #c2ccd1;
text-decoration: none;
}
#qunit-tests li a:hover,
#qunit-tests li a:focus {
color: #000;
}
#qunit-tests li .runtime {
float: right;
font-size: smaller;
}
.qunit-assert-list {
margin-top: 0.5em;
padding: 0.5em;
background-color: #fff;
border-radius: 5px;
-moz-border-radius: 5px;
-webkit-border-radius: 5px;
}
.qunit-collapsed {
display: none;
}
#qunit-tests table {
border-collapse: collapse;
margin-top: .2em;
}
#qunit-tests th {
text-align: right;
vertical-align: top;
padding: 0 .5em 0 0;
}
#qunit-tests td {
vertical-align: top;
}
#qunit-tests pre {
margin: 0;
white-space: pre-wrap;
word-wrap: break-word;
}
#qunit-tests del {
background-color: #e0f2be;
color: #374e0c;
text-decoration: none;
}
#qunit-tests ins {
background-color: #ffcaca;
color: #500;
text-decoration: none;
}
/*** Test Counts */
#qunit-tests b.counts { color: black; }
#qunit-tests b.passed { color: #5E740B; }
#qunit-tests b.failed { color: #710909; }
#qunit-tests li li {
padding: 5px;
background-color: #fff;
border-bottom: none;
list-style-position: inside;
}
/*** Passing Styles */
#qunit-tests li li.pass {
color: #3c510c;
background-color: #fff;
border-left: 10px solid #C6E746;
}
#qunit-tests .pass { color: #528CE0; background-color: #D2E0E6; }
#qunit-tests .pass .test-name { color: #366097; }
#qunit-tests .pass .test-actual,
#qunit-tests .pass .test-expected { color: #999999; }
#qunit-banner.qunit-pass { background-color: #C6E746; }
/*** Failing Styles */
#qunit-tests li li.fail {
color: #710909;
background-color: #fff;
border-left: 10px solid #EE5757;
white-space: pre;
}
#qunit-tests > li:last-child {
border-radius: 0 0 5px 5px;
-moz-border-radius: 0 0 5px 5px;
-webkit-border-bottom-right-radius: 5px;
-webkit-border-bottom-left-radius: 5px;
}
#qunit-tests .fail { color: #000000; background-color: #EE5757; }
#qunit-tests .fail .test-name,
#qunit-tests .fail .module-name { color: #000000; }
#qunit-tests .fail .test-actual { color: #EE5757; }
#qunit-tests .fail .test-expected { color: green; }
#qunit-banner.qunit-fail { background-color: #EE5757; }
/** Result */
#qunit-testresult {
padding: 0.5em 0.5em 0.5em 2.5em;
color: #2b81af;
background-color: #D2E0E6;
border-bottom: 1px solid white;
}
#qunit-testresult .module-name {
font-weight: bold;
}
/** Fixture */
#qunit-fixture {
position: absolute;
top: -10000px;
left: -10000px;
width: 1000px;
height: 1000px;
}

2152
lib/tests/vendor/qunit-1.11.0.js vendored Normal file
View file

File diff suppressed because it is too large Load diff

2
lib/vendor/handlebars.runtime-1.0.rc.1.min.js vendored Executable file
View file

@ -0,0 +1,2 @@
// lib/handlebars/base.js
/*jshint eqnull:true*/this.Handlebars={},function(e){e.VERSION="1.0.rc.1",e.helpers={},e.partials={},e.registerHelper=function(e,t,n){n&&(t.not=n),this.helpers[e]=t},e.registerPartial=function(e,t){this.partials[e]=t},e.registerHelper("helperMissing",function(e){if(arguments.length===2)return undefined;throw new Error("Could not find property '"+e+"'")});var t=Object.prototype.toString,n="[object Function]";e.registerHelper("blockHelperMissing",function(r,i){var s=i.inverse||function(){},o=i.fn,u="",a=t.call(r);return a===n&&(r=r.call(this)),r===!0?o(this):r===!1||r==null?s(this):a==="[object Array]"?r.length>0?e.helpers.each(r,i):s(this):o(r)}),e.K=function(){},e.createFrame=Object.create||function(t){e.K.prototype=t;var n=new e.K;return e.K.prototype=null,n},e.registerHelper("each",function(t,n){var r=n.fn,i=n.inverse,s=0,o="",u;n.data&&(u=e.createFrame(n.data));if(t&&typeof t=="object")if(t instanceof Array)for(var a=t.length;s<a;s++)u&&(u.index=s),o+=r(t[s],{data:u});else for(var f in t)t.hasOwnProperty(f)&&(u&&(u.key=f),o+=r(t[f],{data:u}),s++);return s===0&&(o=i(this)),o}),e.registerHelper("if",function(r,i){var s=t.call(r);return s===n&&(r=r.call(this)),!r||e.Utils.isEmpty(r)?i.inverse(this):i.fn(this)}),e.registerHelper("unless",function(t,n){var r=n.fn,i=n.inverse;return n.fn=i,n.inverse=r,e.helpers["if"].call(this,t,n)}),e.registerHelper("with",function(e,t){return t.fn(e)}),e.registerHelper("log",function(t){e.log(t)})}(this.Handlebars);var errorProps=["description","fileName","lineNumber","message","name","number","stack"];Handlebars.Exception=function(e){var t=Error.prototype.constructor.apply(this,arguments);for(var n=0;n<errorProps.length;n++)this[errorProps[n]]=t[errorProps[n]]},Handlebars.Exception.prototype=new Error,Handlebars.SafeString=function(e){this.string=e},Handlebars.SafeString.prototype.toString=function(){return this.string.toString()},function(){var e={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#x27;","`":"&#x60;"},t=/[&<>"'`]/g,n=/[&<>"'`]/,r=function(t){return e[t]||"&amp;"};Handlebars.Utils={escapeExpression:function(e){return e instanceof Handlebars.SafeString?e.toString():e==null||e===!1?"":n.test(e)?e.replace(t,r):e},isEmpty:function(e){return typeof e=="undefined"?!0:e===null?!0:e===!1?!0:Object.prototype.toString.call(e)==="[object Array]"&&e.length===0?!0:!1}}}(),Handlebars.VM={template:function(e){var t={escapeExpression:Handlebars.Utils.escapeExpression,invokePartial:Handlebars.VM.invokePartial,programs:[],program:function(e,t,n){var r=this.programs[e];return n?Handlebars.VM.program(t,n):r?r:(r=this.programs[e]=Handlebars.VM.program(t),r)},programWithDepth:Handlebars.VM.programWithDepth,noop:Handlebars.VM.noop};return function(n,r){return r=r||{},e.call(t,Handlebars,n,r.helpers,r.partials,r.data)}},programWithDepth:function(e,t,n){var r=Array.prototype.slice.call(arguments,2);return function(n,i){return i=i||{},e.apply(this,[n,i.data||t].concat(r))}},program:function(e,t){return function(n,r){return r=r||{},e(n,r.data||t)}},noop:function(){return""},invokePartial:function(e,t,n,r,i,s){var o={helpers:r,partials:i,data:s};if(e===undefined)throw new Handlebars.Exception("The partial "+t+" could not be found");if(e instanceof Function)return e(n,o);if(!Handlebars.compile)throw new Handlebars.Exception("The partial "+t+" could not be compiled when running in runtime-only mode");return i[t]=Handlebars.compile(e,{data:s!==undefined}),i[t](n,o)}},Handlebars.template=Handlebars.VM.template;

6
lib/vendor/jquery-2.0.0.min.js vendored Executable file
View file

File diff suppressed because one or more lines are too long

0
lib/vendor/pixastic/README vendored Executable file
View file

174
lib/vendor/pixastic/index.html vendored Executable file
View file

@ -0,0 +1,174 @@
<!doctype html>
<html lang="en-US">
<head>
<meta charset="UTF-8">
<title>Pixastic</title>
<link rel="stylesheet" href="styles.css" />
<script src="pixastic.js"></script>
<script src="pixastic.effects.js"></script>
<script src="pixastic.worker.js"></script>
<script>
window.onload = function() {
function doTest(test) {
var img = document.getElementById("original-image"),
canvas = document.getElementById("output-canvas"),
ctx = canvas.getContext("2d"),
progress = document.getElementById("progress-inner"),
P;
canvas.style.display = "none";
canvas.width = img.width;
canvas.height = img.height;
canvas.title = test.effect;
ctx.drawImage(img, 0, 0);
P = new Pixastic(ctx);
P[test.effect](test.options).done(function() {
canvas.style.display = "block";
}, function(p) {
progress.style.height = (p * 100) + "%";
});
}
var tests = [
{
effect : "posterize",
options : {
levels : 5
}
}, {
effect : "solarize"
}, {
effect : "colorfilter",
options : {
r : 0,
g : 194 / 255,
b : 177 / 255,
luminosity : 0
}
}, {
effect : "findedges"
}, {
effect : "emboss",
options : {
amount : 0.5,
angle : 135 / 180 * Math.PI
}
}, {
effect : "edgeenhance3x3"
}, {
effect : "edgeenhance5x5"
}, {
effect : "sharpen3x3",
options : {
strength : 0.5
}
}, {
effect : "sharpen5x5",
options : {
strength : 0.1
}
}, {
effect : "soften3x3"
}, {
effect : "soften5x5"
}, {
effect : "laplace3x3"
}, {
effect : "laplace5x5"
}, {
effect : "crossedges",
options : {
strength : 0.5
}
}, {
effect : "coloradjust",
options : {
r : 0,
g : 0.3,
b : 0
}
}, {
effect : "blur",
options : {
kernelSize : 5
}
},{
effect : "glow",
options : {
kernelSize : 5,
amount : 1.0
}
}, {
effect : "hsl",
options : {
hue : -0.8,
saturation : 0.5,
lightness : -0.3
}
},{
effect : "fliph"
},{
effect : "flipv"
},{
effect : "desaturate"
},{
effect : "brightness",
options : {
brightness : -1.00,
contrast : -0.1
}
},{
effect : "sepia",
},{
effect : "invert",
},{
effect : "noise",
options : {
amount : 0.5,
strength : 0.5,
mono : true
}
},{
effect : "removenoise"
},{
effect : "lighten",
options : {
amount : 0.5
}
}
];
var ul = document.getElementById("testlist"),
li;
for (var i=0;i<tests.length;i++) {
li = document.createElement("li");
li.innerHTML = tests[i].effect;
li.setAttribute("data-test", i);
ul.appendChild(li);
}
ul.addEventListener("click", function(e) {
var target = e.target || e.srcElement,
test;
if (target.tagName == "LI") {
test = tests[target.getAttribute("data-test")];
doTest(test);
}
}, false);
}
</script>
</head>
<body>
<ul id="testlist"></ul>
<img src="sample-images/monalisa.jpg" id="original-image">
<div id="progress"><div id="progress-inner"></div></div>
<canvas id="output-canvas"></canvas>
</body>
</html>

674
lib/vendor/pixastic/license-gpl-3.0.txt vendored Executable file
View file

@ -0,0 +1,674 @@
GNU 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.
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 <http://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
<http://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
<http://www.gnu.org/philosophy/why-not-lgpl.html>.

469
lib/vendor/pixastic/license-mpl.txt vendored Executable file
View file

@ -0,0 +1,469 @@
MOZILLA PUBLIC LICENSE
Version 1.1
---------------
1. Definitions.
1.0.1. "Commercial Use" means distribution or otherwise making the
Covered Code available to a third party.
1.1. "Contributor" means each entity that creates or contributes to
the creation of Modifications.
1.2. "Contributor Version" means the combination of the Original
Code, prior Modifications used by a Contributor, and the Modifications
made by that particular Contributor.
1.3. "Covered Code" means the Original Code or Modifications or the
combination of the Original Code and Modifications, in each case
including portions thereof.
1.4. "Electronic Distribution Mechanism" means a mechanism generally
accepted in the software development community for the electronic
transfer of data.
1.5. "Executable" means Covered Code in any form other than Source
Code.
1.6. "Initial Developer" means the individual or entity identified
as the Initial Developer in the Source Code notice required by Exhibit
A.
1.7. "Larger Work" means a work which combines Covered Code or
portions thereof with code not governed by the terms of this License.
1.8. "License" means this document.
1.8.1. "Licensable" means having the right to grant, to the maximum
extent possible, whether at the time of the initial grant or
subsequently acquired, any and all of the rights conveyed herein.
1.9. "Modifications" means any addition to or deletion from the
substance or structure of either the Original Code or any previous
Modifications. When Covered Code is released as a series of files, a
Modification is:
A. Any addition to or deletion from the contents of a file
containing Original Code or previous Modifications.
B. Any new file that contains any part of the Original Code or
previous Modifications.
1.10. "Original Code" means Source Code of computer software code
which is described in the Source Code notice required by Exhibit A as
Original Code, and which, at the time of its release under this
License is not already Covered Code governed by this License.
1.10.1. "Patent Claims" means any patent claim(s), now owned or
hereafter acquired, including without limitation, method, process,
and apparatus claims, in any patent Licensable by grantor.
1.11. "Source Code" means the preferred form of the Covered Code for
making modifications to it, including all modules it contains, plus
any associated interface definition files, scripts used to control
compilation and installation of an Executable, or source code
differential comparisons against either the Original Code or another
well known, available Covered Code of the Contributor's choice. The
Source Code can be in a compressed or archival form, provided the
appropriate decompression or de-archiving software is widely available
for no charge.
1.12. "You" (or "Your") means an individual or a legal entity
exercising rights under, and complying with all of the terms of, this
License or a future version of this License issued under Section 6.1.
For legal entities, "You" includes any entity which controls, is
controlled by, or is under common control with You. For purposes of
this definition, "control" means (a) the power, direct or indirect,
to cause the direction or management of such entity, whether by
contract or otherwise, or (b) ownership of more than fifty percent
(50%) of the outstanding shares or beneficial ownership of such
entity.
2. Source Code License.
2.1. The Initial Developer Grant.
The Initial Developer hereby grants You a world-wide, royalty-free,
non-exclusive license, subject to third party intellectual property
claims:
(a) under intellectual property rights (other than patent or
trademark) Licensable by Initial Developer to use, reproduce,
modify, display, perform, sublicense and distribute the Original
Code (or portions thereof) with or without Modifications, and/or
as part of a Larger Work; and
(b) under Patents Claims infringed by the making, using or
selling of Original Code, to make, have made, use, practice,
sell, and offer for sale, and/or otherwise dispose of the
Original Code (or portions thereof).
(c) the licenses granted in this Section 2.1(a) and (b) are
effective on the date Initial Developer first distributes
Original Code under the terms of this License.
(d) Notwithstanding Section 2.1(b) above, no patent license is
granted: 1) for code that You delete from the Original Code; 2)
separate from the Original Code; or 3) for infringements caused
by: i) the modification of the Original Code or ii) the
combination of the Original Code with other software or devices.
2.2. Contributor Grant.
Subject to third party intellectual property claims, each Contributor
hereby grants You a world-wide, royalty-free, non-exclusive license
(a) under intellectual property rights (other than patent or
trademark) Licensable by Contributor, to use, reproduce, modify,
display, perform, sublicense and distribute the Modifications
created by such Contributor (or portions thereof) either on an
unmodified basis, with other Modifications, as Covered Code
and/or as part of a Larger Work; and
(b) under Patent Claims infringed by the making, using, or
selling of Modifications made by that Contributor either alone
and/or in combination with its Contributor Version (or portions
of such combination), to make, use, sell, offer for sale, have
made, and/or otherwise dispose of: 1) Modifications made by that
Contributor (or portions thereof); and 2) the combination of
Modifications made by that Contributor with its Contributor
Version (or portions of such combination).
(c) the licenses granted in Sections 2.2(a) and 2.2(b) are
effective on the date Contributor first makes Commercial Use of
the Covered Code.
(d) Notwithstanding Section 2.2(b) above, no patent license is
granted: 1) for any code that Contributor has deleted from the
Contributor Version; 2) separate from the Contributor Version;
3) for infringements caused by: i) third party modifications of
Contributor Version or ii) the combination of Modifications made
by that Contributor with other software (except as part of the
Contributor Version) or other devices; or 4) under Patent Claims
infringed by Covered Code in the absence of Modifications made by
that Contributor.
3. Distribution Obligations.
3.1. Application of License.
The Modifications which You create or to which You contribute are
governed by the terms of this License, including without limitation
Section 2.2. The Source Code version of Covered Code may be
distributed only under the terms of this License or a future version
of this License released under Section 6.1, and You must include a
copy of this License with every copy of the Source Code You
distribute. You may not offer or impose any terms on any Source Code
version that alters or restricts the applicable version of this
License or the recipients' rights hereunder. However, You may include
an additional document offering the additional rights described in
Section 3.5.
3.2. Availability of Source Code.
Any Modification which You create or to which You contribute must be
made available in Source Code form under the terms of this License
either on the same media as an Executable version or via an accepted
Electronic Distribution Mechanism to anyone to whom you made an
Executable version available; and if made available via Electronic
Distribution Mechanism, must remain available for at least twelve (12)
months after the date it initially became available, or at least six
(6) months after a subsequent version of that particular Modification
has been made available to such recipients. You are responsible for
ensuring that the Source Code version remains available even if the
Electronic Distribution Mechanism is maintained by a third party.
3.3. Description of Modifications.
You must cause all Covered Code to which You contribute to contain a
file documenting the changes You made to create that Covered Code and
the date of any change. You must include a prominent statement that
the Modification is derived, directly or indirectly, from Original
Code provided by the Initial Developer and including the name of the
Initial Developer in (a) the Source Code, and (b) in any notice in an
Executable version or related documentation in which You describe the
origin or ownership of the Covered Code.
3.4. Intellectual Property Matters
(a) Third Party Claims.
If Contributor has knowledge that a license under a third party's
intellectual property rights is required to exercise the rights
granted by such Contributor under Sections 2.1 or 2.2,
Contributor must include a text file with the Source Code
distribution titled "LEGAL" which describes the claim and the
party making the claim in sufficient detail that a recipient will
know whom to contact. If Contributor obtains such knowledge after
the Modification is made available as described in Section 3.2,
Contributor shall promptly modify the LEGAL file in all copies
Contributor makes available thereafter and shall take other steps
(such as notifying appropriate mailing lists or newsgroups)
reasonably calculated to inform those who received the Covered
Code that new knowledge has been obtained.
(b) Contributor APIs.
If Contributor's Modifications include an application programming
interface and Contributor has knowledge of patent licenses which
are reasonably necessary to implement that API, Contributor must
also include this information in the LEGAL file.
(c) Representations.
Contributor represents that, except as disclosed pursuant to
Section 3.4(a) above, Contributor believes that Contributor's
Modifications are Contributor's original creation(s) and/or
Contributor has sufficient rights to grant the rights conveyed by
this License.
3.5. Required Notices.
You must duplicate the notice in Exhibit A in each file of the Source
Code. If it is not possible to put such notice in a particular Source
Code file due to its structure, then You must include such notice in a
location (such as a relevant directory) where a user would be likely
to look for such a notice. If You created one or more Modification(s)
You may add your name as a Contributor to the notice described in
Exhibit A. You must also duplicate this License in any documentation
for the Source Code where You describe recipients' rights or ownership
rights relating to Covered Code. You may choose to offer, and to
charge a fee for, warranty, support, indemnity or liability
obligations to one or more recipients of Covered Code. However, You
may do so only on Your own behalf, and not on behalf of the Initial
Developer or any Contributor. You must make it absolutely clear than
any such warranty, support, indemnity or liability obligation is
offered by You alone, and You hereby agree to indemnify the Initial
Developer and every Contributor for any liability incurred by the
Initial Developer or such Contributor as a result of warranty,
support, indemnity or liability terms You offer.
3.6. Distribution of Executable Versions.
You may distribute Covered Code in Executable form only if the
requirements of Section 3.1-3.5 have been met for that Covered Code,
and if You include a notice stating that the Source Code version of
the Covered Code is available under the terms of this License,
including a description of how and where You have fulfilled the
obligations of Section 3.2. The notice must be conspicuously included
in any notice in an Executable version, related documentation or
collateral in which You describe recipients' rights relating to the
Covered Code. You may distribute the Executable version of Covered
Code or ownership rights under a license of Your choice, which may
contain terms different from this License, provided that You are in
compliance with the terms of this License and that the license for the
Executable version does not attempt to limit or alter the recipient's
rights in the Source Code version from the rights set forth in this
License. If You distribute the Executable version under a different
license You must make it absolutely clear that any terms which differ
from this License are offered by You alone, not by the Initial
Developer or any Contributor. You hereby agree to indemnify the
Initial Developer and every Contributor for any liability incurred by
the Initial Developer or such Contributor as a result of any such
terms You offer.
3.7. Larger Works.
You may create a Larger Work by combining Covered Code with other code
not governed by the terms of this License and distribute the Larger
Work as a single product. In such a case, You must make sure the
requirements of this License are fulfilled for the Covered Code.
4. Inability to Comply Due to Statute or Regulation.
If it is impossible for You to comply with any of the terms of this
License with respect to some or all of the Covered Code due to
statute, judicial order, or regulation then You must: (a) comply with
the terms of this License to the maximum extent possible; and (b)
describe the limitations and the code they affect. Such description
must be included in the LEGAL file described in Section 3.4 and must
be included with all distributions of the Source Code. Except to the
extent prohibited by statute or regulation, such description must be
sufficiently detailed for a recipient of ordinary skill to be able to
understand it.
5. Application of this License.
This License applies to code to which the Initial Developer has
attached the notice in Exhibit A and to related Covered Code.
6. Versions of the License.
6.1. New Versions.
Netscape Communications Corporation ("Netscape") may publish revised
and/or new versions of the License from time to time. Each version
will be given a distinguishing version number.
6.2. Effect of New Versions.
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 Netscape. No one
other than Netscape has the right to modify the terms applicable to
Covered Code created under this License.
6.3. Derivative Works.
If You create or use a modified version of this License (which you may
only do in order to apply it to code which is not already Covered Code
governed by this License), You must (a) rename Your license so that
the phrases "Mozilla", "MOZILLAPL", "MOZPL", "Netscape",
"MPL", "NPL" or any confusingly similar phrase do not appear in your
license (except to note that your license differs from this License)
and (b) otherwise make it clear that Your version of the license
contains terms which differ from the Mozilla Public License and
Netscape Public License. (Filling in the name of the Initial
Developer, Original Code or Contributor in the notice described in
Exhibit A shall not of themselves be deemed to be modifications of
this License.)
7. DISCLAIMER OF WARRANTY.
COVERED CODE IS PROVIDED UNDER THIS LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
WITHOUT LIMITATION, WARRANTIES THAT THE COVERED CODE IS FREE OF
DEFECTS, MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE OR NON-INFRINGING.
THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE COVERED CODE
IS WITH YOU. SHOULD ANY COVERED CODE PROVE DEFECTIVE IN ANY RESPECT,
YOU (NOT THE INITIAL DEVELOPER OR ANY OTHER CONTRIBUTOR) ASSUME THE
COST OF ANY NECESSARY SERVICING, REPAIR OR CORRECTION. THIS DISCLAIMER
OF WARRANTY CONSTITUTES AN ESSENTIAL PART OF THIS LICENSE. NO USE OF
ANY COVERED CODE IS AUTHORIZED HEREUNDER EXCEPT UNDER THIS DISCLAIMER.
8. TERMINATION.
8.1. This License and the rights granted hereunder will terminate
automatically if You fail to comply with terms herein and fail to cure
such breach within 30 days of becoming aware of the breach. All
sublicenses to the Covered Code which are properly granted shall
survive any termination of this License. Provisions which, by their
nature, must remain in effect beyond the termination of this License
shall survive.
8.2. If You initiate litigation by asserting a patent infringement
claim (excluding declatory judgment actions) against Initial Developer
or a Contributor (the Initial Developer or Contributor against whom
You file such action is referred to as "Participant") alleging that:
(a) such Participant's Contributor Version directly or indirectly
infringes any patent, then any and all rights granted by such
Participant to You under Sections 2.1 and/or 2.2 of this License
shall, upon 60 days notice from Participant terminate prospectively,
unless if within 60 days after receipt of notice You either: (i)
agree in writing to pay Participant a mutually agreeable reasonable
royalty for Your past and future use of Modifications made by such
Participant, or (ii) withdraw Your litigation claim with respect to
the Contributor Version against such Participant. If within 60 days
of notice, a reasonable royalty and payment arrangement are not
mutually agreed upon in writing by the parties or the litigation claim
is not withdrawn, the rights granted by Participant to You under
Sections 2.1 and/or 2.2 automatically terminate at the expiration of
the 60 day notice period specified above.
(b) any software, hardware, or device, other than such Participant's
Contributor Version, directly or indirectly infringes any patent, then
any rights granted to You by such Participant under Sections 2.1(b)
and 2.2(b) are revoked effective as of the date You first made, used,
sold, distributed, or had made, Modifications made by that
Participant.
8.3. If You assert a patent infringement claim against Participant
alleging that such Participant's Contributor Version directly or
indirectly infringes any patent where such claim is resolved (such as
by license or settlement) prior to the initiation of patent
infringement litigation, then the reasonable value of the licenses
granted by such Participant under Sections 2.1 or 2.2 shall be taken
into account in determining the amount or value of any payment or
license.
8.4. In the event of termination under Sections 8.1 or 8.2 above,
all end user license agreements (excluding distributors and resellers)
which have been validly granted by You or any distributor hereunder
prior to termination shall survive termination.
9. LIMITATION OF LIABILITY.
UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, WHETHER TORT
(INCLUDING NEGLIGENCE), CONTRACT, OR OTHERWISE, SHALL YOU, THE INITIAL
DEVELOPER, ANY OTHER CONTRIBUTOR, OR ANY DISTRIBUTOR OF COVERED CODE,
OR ANY SUPPLIER OF ANY OF SUCH PARTIES, BE LIABLE TO ANY PERSON FOR
ANY INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES OF ANY
CHARACTER INCLUDING, WITHOUT LIMITATION, DAMAGES FOR LOSS OF GOODWILL,
WORK STOPPAGE, COMPUTER FAILURE OR MALFUNCTION, OR ANY AND ALL OTHER
COMMERCIAL DAMAGES OR LOSSES, EVEN IF SUCH PARTY SHALL HAVE BEEN
INFORMED OF THE POSSIBILITY OF SUCH DAMAGES. THIS LIMITATION OF
LIABILITY SHALL NOT APPLY TO LIABILITY FOR DEATH OR PERSONAL INJURY
RESULTING FROM SUCH PARTY'S NEGLIGENCE TO THE EXTENT APPLICABLE LAW
PROHIBITS SUCH LIMITATION. SOME JURISDICTIONS DO NOT ALLOW THE
EXCLUSION OR LIMITATION OF INCIDENTAL OR CONSEQUENTIAL DAMAGES, SO
THIS EXCLUSION AND LIMITATION MAY NOT APPLY TO YOU.
10. U.S. GOVERNMENT END USERS.
The Covered Code is a "commercial item," as that term is defined in
48 C.F.R. 2.101 (Oct. 1995), consisting of "commercial computer
software" and "commercial computer software documentation," as such
terms are used in 48 C.F.R. 12.212 (Sept. 1995). Consistent with 48
C.F.R. 12.212 and 48 C.F.R. 227.7202-1 through 227.7202-4 (June 1995),
all U.S. Government End Users acquire Covered Code with only those
rights set forth herein.
11. MISCELLANEOUS.
This License represents the complete agreement concerning subject
matter hereof. If any provision of this License is held to be
unenforceable, such provision shall be reformed only to the extent
necessary to make it enforceable. This License shall be governed by
California law provisions (except to the extent applicable law, if
any, provides otherwise), excluding its conflict-of-law provisions.
With respect to disputes in which at least one party is a citizen of,
or an entity chartered or registered to do business in the United
States of America, any litigation relating to this License shall be
subject to the jurisdiction of the Federal Courts of the Northern
District of California, with venue lying in Santa Clara County,
California, with the losing party responsible for costs, including
without limitation, court costs and reasonable attorneys' fees and
expenses. The application of the United Nations Convention on
Contracts for the International Sale of Goods is expressly excluded.
Any law or regulation which provides that the language of a contract
shall be construed against the drafter shall not apply to this
License.
12. RESPONSIBILITY FOR CLAIMS.
As between Initial Developer and the Contributors, each party is
responsible for claims and damages arising, directly or indirectly,
out of its utilization of rights under this License and You agree to
work with Initial Developer and Contributors to distribute such
responsibility on an equitable basis. Nothing herein is intended or
shall be deemed to constitute any admission of liability.
13. MULTIPLE-LICENSED CODE.
Initial Developer may designate portions of the Covered Code as
"Multiple-Licensed". "Multiple-Licensed" means that the Initial
Developer permits you to utilize portions of the Covered Code under
Your choice of the NPL or the alternative licenses, if any, specified
by the Initial Developer in the file described in Exhibit A.
EXHIBIT A -Mozilla Public License.
``The contents of this file are subject to the Mozilla Public License
Version 1.1 (the "License"); you may not use this file except in
compliance with the License. You may obtain a copy of the License at
http://www.mozilla.org/MPL/
Software distributed under the License is distributed on an "AS IS"
basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
License for the specific language governing rights and limitations
under the License.
The Original Code is ______________________________________.
The Initial Developer of the Original Code is ________________________.
Portions created by ______________________ are Copyright (C) ______
_______________________. All Rights Reserved.
Contributor(s): ______________________________________.
Alternatively, the contents of this file may be used under the terms
of the _____ license (the "[___] License"), in which case the
provisions of [______] License are applicable instead of those
above. If you wish to allow use of your version of this file only
under the terms of the [____] License and not to allow others to use
your version of this file under the MPL, indicate your decision by
deleting the provisions above and replace them with the notice and
other provisions required by the [___] License. If you do not delete
the provisions above, a recipient may use your version of this file
under either the MPL or the [___] License."
[NOTE: The text of this Exhibit A may differ slightly from the text of
the notices in the Source Code files of the Original Code. You should
use the text of this Exhibit A rather than the text found in the
Original Code Source Code for Your Modifications.]

1191
lib/vendor/pixastic/pixastic.effects.js vendored Executable file
View file

File diff suppressed because it is too large Load diff

286
lib/vendor/pixastic/pixastic.js vendored Executable file
View file

@ -0,0 +1,286 @@
/*!
* Pixastic - JavaScript Image Processing
* http://pixastic.com/
* Copyright 2012, Jacob Seidelin
*
* Dual licensed under the MPL 1.1 or GPLv3 licenses.
* http://pixastic.com/license-mpl.txt
* http://pixastic.com/license-gpl-3.0.txt
*
*/
var Pixastic = (function() {
var worker;
function createImageData(ctx, width, height) {
if (ctx.createImageData) {
return ctx.createImageData(width, height);
} else {
return ctx.getImageData(0, 0, width, height);
}
}
function Pixastic(ctx, workerControlPath) {
var P = {},
width = ctx.canvas.width,
height = ctx.canvas.height,
queue = [],
workerControlPath = workerControlPath || "";
if (!worker) {
if (typeof window.Worker != "undefined") {
try {
worker = new window.Worker(workerControlPath + "pixastic.worker.control.js");
} catch(e) {
if (location.protocol == "file:") {
Pixastic.log("Could not create real worker, running from file://")
} else {
Pixastic.log("Could not create real worker.")
}
}
}
if (!worker) {
worker = new Pixastic.Worker();
}
}
for (var e in Pixastic.Effects) {
if (Pixastic.Effects.hasOwnProperty(e)) {
(function(e) {
P[e] = function(options) {
queue.push({
effect : e,
options : options
});
return P;
}
P.done = function(callback, progress) {
var inData, outData;
try {
inData = ctx.getImageData(0, 0, width, height);
} catch(e) {
if (location.protocol == "file:") {
throw new Error("Could not access image data, running from file://");
} else {
throw new Error("Could not access image data, is canvas tainted by cross-origin data?");
}
}
outData = createImageData(ctx, width, height);
worker.postMessage({
queue : queue,
inData : inData,
outData : outData,
width : width,
height : height
});
worker.onmessage = function(message) {
var d = message.data;
switch (d.event) {
case "done" :
ctx.putImageData(d.data, 0, 0);
if (callback) {
callback();
}
if (progress) {
progress(1);
}
break;
case "progress" :
if (progress) {
progress(d.data);
}
break;
case "error" :
break;
}
}
if (progress) {
progress(0);
}
}
})(e);
}
}
return P;
}
Pixastic.Worker = function() {
var me = this;
function processMessage(data) {
var queue = data.queue,
inData = data.inData,
outData = data.outData,
width = data.width,
height = data.height,
tmpData;
for (var i=0;i<queue.length;i++) {
var e = queue[i].effect,
options = queue[i].options,
progressCallback;
if (i > 0) {
tmpData = inData;
inData = outData;
outData = tmpData;
}
if (typeof importScripts == "function") {
progressCallback = function(p) {
me.onmessage({
data : {
event : "progress",
data : (i + p) / queue.length
}
});
return p;
}
}
Pixastic.Effects[e](inData.data, outData.data, width, height, options, progressCallback);
me.onmessage({
data : {
event : "progress",
data : (i+1) / queue.length
}
});
}
me.onmessage({
data : {
event : "done",
data : outData
}
});
}
this.postMessage = function(data) {
setTimeout(function() {
processMessage(data)
}, 0);
};
this.onmessage = function() {};
}
Pixastic.log = function(str) {
if (typeof console != "undefined" && console.log) {
console.log("Pixastic: " + str);
}
};
function toCanvas(o) {
var canvas;
if (typeof o == "object") {
if (typeof o.tagName == "string") {
if (o.tagName.toLowerCase() == "canvas" || o.tagName.toLowerCase() == "img") {
canvas = document.createElement("canvas");
canvas.width = o.width;
canvas.height = o.height;
canvas.getContext("2d").drawImage(o, 0,0);
}
} else if ((window.ImageData && o instanceof window.ImageData)
|| (typeof o.width == "number" && typeof o.height == "number" && typeof o.data == "object")) {
canvas = document.createElement("canvas");
canvas.width = o.width;
canvas.height = o.height;
canvas.getContext("2d").putImageData(o, 0, 0);
}
}
return canvas;
};
function toImage(o) {
var canvas = toCanvas(o),
image = new Image();
image.width = canvas.width;
image.height = canvas.height;
image.src = canvas.toDataURL();
return image;
};
function toImageData(o) {
var canvas = toCanvas(o),
ctx = canvas.getContext("2d");
return ctx.getImageData(0, 0, canvas.width, canvas.height);
};
function histogram(imageData) {
var values = [],
i, p,
data = imageData.data,
round = Math.round,
maxValue,
n = imageData.width * imageData.height;
for (i=0;i<256;i++) {
values[i] = 0;
}
for (i=0;i<n;i++) {
p = i * 4;
values[ round((data[p]+data[p+1]+data[p+2])/3) ]++;
}
maxValue = 0;
for (i=0;i<256;i++) {
if (values[i] > maxValue) {
maxValue = values[i];
}
}
return {
maxValue : maxValue,
values : values
};
}
Pixastic.toCanvas = toCanvas;
Pixastic.toImage = toImage;
Pixastic.toImageData = toImageData;
Pixastic.histogram = histogram;
Pixastic.Color = {
rgb2hsl : function(r, g, b) {
if (r < 0) r = 0;
if (g < 0) g = 0;
if (b < 0) b = 0;
if (r > 255) r = 0;
if (g > 255) g = 0;
if (b > 255) b = 0;
},
rgb2hsv : function(r, g, b) {
},
rgb2hex : function(r, g, b) {
},
hsl2rgb : function(h, s, l) {
},
hsv2rgb : function(h, s, v) {
}
}
return Pixastic;
})();

13
lib/vendor/pixastic/pixastic.worker.control.js vendored Executable file
View file

@ -0,0 +1,13 @@
importScripts("pixastic.js");
importScripts("pixastic.effects.js");
var worker = new Pixastic.Worker();
worker.onmessage = function(message) {
postMessage(message.data);
}
onmessage = function(message) {
worker.postMessage(message.data);
}

47
lib/vendor/pixastic/pixastic.worker.js vendored Executable file
View file

@ -0,0 +1,47 @@
Pixastic.Worker = function() {
var me = this;
function processMessage(data) {
var queue = data.queue,
inData = data.inData,
outData = data.outData,
width = data.width,
height = data.height,
tmpData;
for (var i=0;i<queue.length;i++) {
var e = queue[i].effect,
options = queue[i].options;
if (i > 0) {
tmpData = inData;
inData = outData;
outData = tmpData;
}
Pixastic.Effects[e](inData.data, outData.data, width, height, options);
me.onmessage({
data : {
event : "progress",
data : (i+1) / queue.length
}
});
}
me.onmessage({
data : {
event : "done",
data : outData
}
});
}
this.postMessage = function(data) {
setTimeout(function() {
processMessage(data)
}, 0);
}
this.onmessage = function() {};
}

BIN
lib/vendor/pixastic/sample-images/earth.png vendored Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 396 KiB

BIN
lib/vendor/pixastic/sample-images/monalisa.jpg vendored Executable file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 52 KiB

45
lib/vendor/pixastic/styles.css vendored Executable file
View file

@ -0,0 +1,45 @@
#original-image,
#output-canvas {
display : block;
float : left;
margin : 10px;
}
ul#testlist {
display : block;
float : left;
width : 300px;
list-style : none;
padding : 0;
margin : 10px;
max-height : 512px;
overflow : auto;
}
ul#testlist li {
margin-bottom : 5px;
background-color : rgb(200,220,255);
padding : 4px;
font-family : sans-serif;
font-size : 14px;
cursor : pointer;
}
ul#testlist li:hover {
background-color : rgb(200,240,255);
}
div#progress {
float : left;
width : 20px;
height : 512px;
margin-top : 10px;
box-sizing : border-box;
border : 1px solid black;
}
div#progress div {
width : 100%;
height : 0;
background-color : rgb(190,220,190);
}

26
package.json Executable file
View file

@ -0,0 +1,26 @@
{
"name": "comic-reader",
"description": "A HTML5 comic book reader.",
"version": "0.5.0",
"keywords": ["comic", "book", "reader"],
"homepage": "http://reader.justforcomics.com",
"author": "Bala Clark",
"scripts": { "test": "make test" },
"repository": {
"type": "git",
"url": "https://github.com/balaclark/HTML5-Comic-Book-Reader.git"
},
"licenses": [
{
"type": "Apache-2.0",
"url": "http://www.apache.org/licenses/LICENSE-2.0"
}
],
"devDependencies": {
"handlebars": "1.0.10",
"uglify-js": "1.3.4",
"jshint": "1.1.0",
"connect": "2.7.8",
"phantomjs": "1.9.0-3"
}
}

2
templates/loadingOverlay.handlebars Normal file
View file

@ -0,0 +1,2 @@
<div id="cb-loading-overlay" class="cb-control"></div>

4
templates/navigateLeft.handlebars Normal file
View file

@ -0,0 +1,4 @@
<div data-trigger="click" data-action="navigation" data-navigate-side="left" class="cb-control navigate navigate-left ">
<span class="icon-arrow-left"></span>
</div>

4
templates/navigateRight.handlebars Normal file
View file

@ -0,0 +1,4 @@
<div data-trigger="click" data-action="navigation" data-navigate-side="right" class="cb-control navigate navigate-right">
<span class="icon-arrow-right"></span>
</div>

5
templates/progressbar.handlebars Normal file
View file

@ -0,0 +1,5 @@
<div id="cb-status" class="cb-control">
<div id="cb-progress-bar">
<div class="progressbar-value"></div>
</div>
</div>

60
templates/toolbar.handlebars Normal file
View file

@ -0,0 +1,60 @@
<div class="toolbar">
<ul class="pull-left">
<li class="close">
<button data-trigger="click" data-action="close" title="close" class="icon-remove-sign"></button>
</li>
<li class="close separator"></li>
<li>
<button title="image settings" class="icon-settings" data-toggle="dropdown"></button>
<div class="dropdown">
<form name="image-enhancements" data-trigger="reset" data-action="resetEnhancements">
<div class="sliders">
<div class="control-group">
<label title="adjust brightness" class="icon-sun"></label>
<input data-trigger="change" data-action="brightness" type="range" min="-100" max="100" step="1" value="0">
</div>
<div class="control-group">
<label title="adjust contrast" class="icon-adjust"></label>
<input data-trigger="change" data-action="contrast" type="range" min="-1" max="1" step="0.1" value="0">
</div>
<div class="control-group">
<label title="sharpen" class="icon-droplet"></label>
<input data-trigger="change" data-action="sharpen" type="range" min="0" max="1" step="0.1" value="0">
</div>
</div>
<div class="control-group pull-left">
<input id="image-desaturate" type="checkbox" data-trigger="change" data-action="desaturate">
<label for="image-desaturate">desaturate</label>
</div>
<div class="control-group pull-right">
<input type="reset" value="reset">
</div>
</form>
</div>
</li>
<li>
<button data-trigger="click" data-action="toggleLayout" title="toggle one/two pages at a time" class="icon-file layout layout-single"></button>
<button data-trigger="click" data-action="toggleLayout" title="toggle one/two pages at a time" class="icon-copy layout layout-double"></button>
</li>
<li>
<button data-trigger="click" data-action="zoomOut" title="zoom out" class="icon-zoom-out"></button>
</li>
<li>
<button data-trigger="click" data-action="zoomIn" title="zoom in" class="icon-zoom-in"></button>
</li>
<li>
<button data-trigger="click" data-action="fitWidth" title="fit page to window width" class="icon-expand"></button>
</li>
<li>
<button data-trigger="click" data-action="toggleReadingMode" title="switch reading direction" class="icon-arrow-right-3 manga-false"></button>
<button data-trigger="click" data-action="toggleReadingMode" title="switch reading direction" class="icon-arrow-left-3 manga-true"></button>
</li>
</ul>
<ul class="pull-right">
<li><span id="current-page"></span> / <span id="page-count"></span></li>
</ul>
</div>