From fd0034dca599ad46b211e055ba0a1347d65efeb4 Mon Sep 17 00:00:00 2001 From: maniospas Date: Sun, 18 Aug 2024 01:50:03 +0300 Subject: [PATCH] new docs --- .../nodeClassification/Scripting.java | 32 +- README.md | 2 +- docs/allclasses-frame.html | 123 - docs/allclasses-index.html | 505 - docs/allclasses-noframe.html | 123 - docs/allpackages-index.html | 108 - docs/classification/LogisticRegression.html | 165 - .../LogisticRegressionExample.html | 168 - docs/classification/MLP.html | 165 - docs/classification/MLPExample.html | 168 - .../class-use/LogisticRegression.html | 59 - .../class-use/LogisticRegressionExample.html | 59 - docs/classification/class-use/MLP.html | 59 - docs/classification/class-use/MLPExample.html | 59 - docs/classification/package-summary.html | 90 - docs/classification/package-tree.html | 74 - docs/classification/package-use.html | 59 - docs/constant-values.html | 152 - docs/deprecated-list.html | 120 - docs/element-list | 22 - docs/graphClassification/MeanPooling.html | 165 - docs/graphClassification/SortPooling.html | 164 - docs/graphClassification/TrajectoryData.html | 182 - .../class-use/MeanPooling.html | 59 - .../class-use/SortPooling.html | 59 - .../class-use/TrajectoryData.html | 59 - docs/graphClassification/package-summary.html | 90 - docs/graphClassification/package-tree.html | 75 - docs/graphClassification/package-use.html | 59 - docs/help-doc.html | 188 - docs/index-files/index-1.html | 295 - docs/index-files/index-10.html | 75 - docs/index-files/index-11.html | 164 - docs/index-files/index-12.html | 247 - docs/index-files/index-13.html | 106 - docs/index-files/index-14.html | 89 - docs/index-files/index-15.html | 202 - docs/index-files/index-16.html | 248 - docs/index-files/index-17.html | 409 - docs/index-files/index-18.html | 361 - docs/index-files/index-19.html | 96 - docs/index-files/index-2.html | 93 - docs/index-files/index-20.html | 90 - docs/index-files/index-21.html | 83 - docs/index-files/index-22.html | 75 - docs/index-files/index-23.html | 118 - docs/index-files/index-3.html | 200 - docs/index-files/index-4.html | 164 - docs/index-files/index-5.html | 120 - docs/index-files/index-6.html | 135 - docs/index-files/index-7.html | 323 - docs/index-files/index-8.html | 76 - docs/index-files/index-9.html | 129 - docs/index.html | 1492 ++- docs/jquery-ui.overrides.css | 34 - docs/jquery/external/jquery/jquery.js | 9789 ----------------- .../images/ui-bg_flat_0_aaaaaa_40x100.png | Bin 212 -> 0 bytes .../images/ui-bg_flat_75_ffffff_40x100.png | Bin 208 -> 0 bytes .../images/ui-bg_glass_55_fbf9ee_1x400.png | Bin 335 -> 0 bytes .../images/ui-bg_glass_65_ffffff_1x400.png | Bin 207 -> 0 bytes .../images/ui-bg_glass_75_dadada_1x400.png | Bin 262 -> 0 bytes .../images/ui-bg_glass_75_e6e6e6_1x400.png | Bin 262 -> 0 bytes .../images/ui-bg_glass_95_fef1ec_1x400.png | Bin 332 -> 0 bytes .../ui-bg_highlight-soft_75_cccccc_1x100.png | Bin 280 -> 0 bytes .../jquery/images/ui-icons_222222_256x240.png | Bin 6922 -> 0 bytes .../jquery/images/ui-icons_2e83ff_256x240.png | Bin 4549 -> 0 bytes .../jquery/images/ui-icons_454545_256x240.png | Bin 6992 -> 0 bytes .../jquery/images/ui-icons_888888_256x240.png | Bin 6999 -> 0 bytes .../jquery/images/ui-icons_cd0a0a_256x240.png | Bin 4549 -> 0 bytes docs/jquery/jquery-1.10.2.js | 9789 ----------------- docs/jquery/jquery-ui.css | 544 - docs/jquery/jquery-ui.js | 2610 ----- docs/jquery/jquery-ui.min.css | 7 - docs/jquery/jquery-ui.min.js | 7 - docs/jquery/jquery-ui.structure.css | 152 - docs/jquery/jquery-ui.structure.min.css | 5 - .../jquery/jszip-utils/dist/jszip-utils-ie.js | 56 - .../jszip-utils/dist/jszip-utils-ie.min.js | 10 - docs/jquery/jszip-utils/dist/jszip-utils.js | 118 - .../jszip-utils/dist/jszip-utils.min.js | 10 - docs/jquery/jszip/dist/jszip.js | 9155 --------------- docs/jquery/jszip/dist/jszip.min.js | 14 - docs/legal/COPYRIGHT | 1 - docs/legal/LICENSE | 1 - docs/legal/jquery.md | 72 - docs/legal/jqueryUI.md | 49 - docs/member-search-index.js | 1 - docs/member-search-index.zip | Bin 5233 -> 0 bytes docs/mklab/JGNN/AppTest.html | 352 - docs/mklab/JGNN/LSTMTest.html | 129 - docs/mklab/JGNN/LearningTest.html | 129 - docs/mklab/JGNN/NNOperationTest.html | 129 - docs/mklab/JGNN/PrimitiveTest.html | 1254 --- docs/mklab/JGNN/TensorTest.html | 160 - docs/mklab/JGNN/adhoc/Dataset.html | 256 - docs/mklab/JGNN/adhoc/IdConverter.html | 319 - docs/mklab/JGNN/adhoc/ModelBuilder.html | 641 -- .../mklab/JGNN/adhoc/builders/GCNBuilder.html | 444 - .../adhoc/builders/GraphFilterBuilder.html | 189 - .../JGNN/adhoc/builders/LayeredBuilder.html | 450 - .../adhoc/builders/class-use/GCNBuilder.html | 128 - .../class-use/GraphFilterBuilder.html | 87 - .../builders/class-use/LayeredBuilder.html | 124 - .../JGNN/adhoc/builders/package-summary.html | 91 - .../JGNN/adhoc/builders/package-tree.html | 79 - .../JGNN/adhoc/builders/package-use.html | 88 - docs/mklab/JGNN/adhoc/class-use/Dataset.html | 96 - .../JGNN/adhoc/class-use/IdConverter.html | 98 - .../JGNN/adhoc/class-use/ModelBuilder.html | 194 - docs/mklab/JGNN/adhoc/datasets/Citeseer.html | 139 - docs/mklab/JGNN/adhoc/datasets/Cora.html | 139 - docs/mklab/JGNN/adhoc/datasets/Pubmed.html | 139 - .../adhoc/datasets/class-use/Citeseer.html | 59 - .../JGNN/adhoc/datasets/class-use/Cora.html | 59 - .../JGNN/adhoc/datasets/class-use/Pubmed.html | 59 - .../JGNN/adhoc/datasets/package-summary.html | 107 - .../JGNN/adhoc/datasets/package-tree.html | 79 - .../JGNN/adhoc/datasets/package-use.html | 59 - docs/mklab/JGNN/adhoc/package-summary.html | 115 - docs/mklab/JGNN/adhoc/package-tree.html | 75 - docs/mklab/JGNN/adhoc/package-use.html | 121 - .../mklab/JGNN/adhoc/parsers/FastBuilder.html | 593 - docs/mklab/JGNN/adhoc/parsers/GCNBuilder.html | 593 - .../adhoc/parsers/GraphFilterBuilder.html | 196 - .../JGNN/adhoc/parsers/LayeredBuilder.html | 631 -- .../adhoc/parsers/class-use/FastBuilder.html | 151 - .../adhoc/parsers/class-use/GCNBuilder.html | 151 - .../parsers/class-use/GraphFilterBuilder.html | 87 - .../parsers/class-use/LayeredBuilder.html | 151 - .../JGNN/adhoc/parsers/package-summary.html | 105 - .../JGNN/adhoc/parsers/package-tree.html | 78 - .../mklab/JGNN/adhoc/parsers/package-use.html | 89 - docs/mklab/JGNN/builders/GCNBuilder.html | 249 - .../JGNN/builders/class-use/GCNBuilder.html | 98 - docs/mklab/JGNN/builders/package-frame.html | 29 - docs/mklab/JGNN/builders/package-summary.html | 105 - docs/mklab/JGNN/builders/package-tree.html | 77 - docs/mklab/JGNN/builders/package-use.html | 83 - docs/mklab/JGNN/class-use/AppTest.html | 152 - docs/mklab/JGNN/class-use/LSTMTest.html | 59 - docs/mklab/JGNN/class-use/LearningTest.html | 59 - .../mklab/JGNN/class-use/NNOperationTest.html | 59 - docs/mklab/JGNN/class-use/PrimitiveTest.html | 152 - docs/mklab/JGNN/class-use/TensorTest.html | 59 - docs/mklab/JGNN/core/Distribution.html | 230 - docs/mklab/JGNN/core/LSTM.LSTMState.html | 175 - docs/mklab/JGNN/core/LSTM.html | 270 - docs/mklab/JGNN/core/Loss.html | 218 - docs/mklab/JGNN/core/Matrix.html | 1218 -- docs/mklab/JGNN/core/MatrixTest.html | 288 - docs/mklab/JGNN/core/Memory.Scope.html | 164 - docs/mklab/JGNN/core/Memory.html | 202 - docs/mklab/JGNN/core/Model.html | 481 - docs/mklab/JGNN/core/ModelBuilder.html | 335 - docs/mklab/JGNN/core/ModelInitializer.html | 178 - docs/mklab/JGNN/core/ModelTraining.Loss.html | 223 - docs/mklab/JGNN/core/ModelTraining.html | 256 - docs/mklab/JGNN/core/NNOperation.html | 364 - docs/mklab/JGNN/core/Optimizer.html | 148 - docs/mklab/JGNN/core/Slice.html | 352 - docs/mklab/JGNN/core/Tensor.html | 1613 --- docs/mklab/JGNN/core/TensorTest.html | 610 - docs/mklab/JGNN/core/ThreadPool.html | 208 - .../JGNN/core/class-use/Distribution.html | 131 - .../JGNN/core/class-use/LSTM.LSTMState.html | 103 - docs/mklab/JGNN/core/class-use/LSTM.html | 84 - docs/mklab/JGNN/core/class-use/Loss.html | 134 - docs/mklab/JGNN/core/class-use/Matrix.html | 509 - .../mklab/JGNN/core/class-use/MatrixTest.html | 59 - .../JGNN/core/class-use/Memory.Scope.html | 84 - docs/mklab/JGNN/core/class-use/Memory.html | 59 - docs/mklab/JGNN/core/class-use/Model.html | 219 - .../JGNN/core/class-use/ModelBuilder.html | 147 - .../JGNN/core/class-use/ModelInitializer.html | 109 - .../core/class-use/ModelTraining.Loss.html | 101 - .../JGNN/core/class-use/ModelTraining.html | 99 - .../JGNN/core/class-use/NNOperation.html | 298 - docs/mklab/JGNN/core/class-use/Optimizer.html | 220 - docs/mklab/JGNN/core/class-use/Slice.html | 157 - docs/mklab/JGNN/core/class-use/Tensor.html | 1336 --- .../mklab/JGNN/core/class-use/TensorTest.html | 59 - .../mklab/JGNN/core/class-use/ThreadPool.html | 86 - docs/mklab/JGNN/core/distribution/Normal.html | 302 - .../mklab/JGNN/core/distribution/Uniform.html | 323 - .../core/distribution/class-use/Normal.html | 90 - .../core/distribution/class-use/Uniform.html | 96 - .../JGNN/core/distribution/package-frame.html | 30 - .../core/distribution/package-summary.html | 107 - .../JGNN/core/distribution/package-tree.html | 74 - .../JGNN/core/distribution/package-use.html | 87 - docs/mklab/JGNN/core/loss/Accuracy.html | 223 - .../JGNN/core/loss/BinaryCrossEntropy.html | 249 - .../core/loss/CategoricalCrossEntropy.html | 249 - .../JGNN/core/loss/class-use/Accuracy.html | 59 - .../loss/class-use/BinaryCrossEntropy.html | 59 - .../class-use/CategoricalCrossEntropy.html | 59 - .../mklab/JGNN/core/loss/package-summary.html | 115 - docs/mklab/JGNN/core/loss/package-tree.html | 79 - docs/mklab/JGNN/core/loss/package-use.html | 59 - docs/mklab/JGNN/core/matrix/AccessCol.html | 369 - docs/mklab/JGNN/core/matrix/AccessRow.html | 369 - .../JGNN/core/matrix/ColumnRepetition.html | 391 - docs/mklab/JGNN/core/matrix/DenseMatrix.html | 369 - docs/mklab/JGNN/core/matrix/Diagonal.html | 362 - docs/mklab/JGNN/core/matrix/RepeatMatrix.html | 369 - .../mklab/JGNN/core/matrix/RowRepetition.html | 375 - docs/mklab/JGNN/core/matrix/SparseMatrix.html | 417 - .../JGNN/core/matrix/SparseSymmetric.html | 408 - .../JGNN/core/matrix/TransposedMatrix.html | 430 - docs/mklab/JGNN/core/matrix/WrapCols.html | 449 - docs/mklab/JGNN/core/matrix/WrapRows.html | 449 - .../JGNN/core/matrix/class-use/AccessCol.html | 59 - .../JGNN/core/matrix/class-use/AccessRow.html | 59 - .../matrix/class-use/ColumnRepetition.html | 59 - .../core/matrix/class-use/DenseMatrix.html | 86 - .../JGNN/core/matrix/class-use/Diagonal.html | 59 - .../core/matrix/class-use/RepeatMatrix.html | 59 - .../core/matrix/class-use/RowRepetition.html | 59 - .../core/matrix/class-use/SparseMatrix.html | 91 - .../matrix/class-use/SparseSymmetric.html | 59 - .../matrix/class-use/TransposedMatrix.html | 59 - .../JGNN/core/matrix/class-use/WrapCols.html | 104 - .../JGNN/core/matrix/class-use/WrapRows.html | 104 - .../mklab/JGNN/core/matrix/package-frame.html | 39 - .../JGNN/core/matrix/package-summary.html | 148 - docs/mklab/JGNN/core/matrix/package-tree.html | 92 - docs/mklab/JGNN/core/matrix/package-use.html | 114 - docs/mklab/JGNN/core/package-frame.html | 48 - docs/mklab/JGNN/core/package-summary.html | 145 - docs/mklab/JGNN/core/package-tree.html | 89 - docs/mklab/JGNN/core/package-use.html | 347 - .../JGNN/core/tensor/AccessSubtensor.html | 355 - docs/mklab/JGNN/core/tensor/DenseTensor.html | 378 - docs/mklab/JGNN/core/tensor/RepeatTensor.html | 324 - docs/mklab/JGNN/core/tensor/SparseTensor.html | 364 - .../tensor/class-use/AccessSubtensor.html | 59 - .../core/tensor/class-use/DenseTensor.html | 59 - .../core/tensor/class-use/RepeatTensor.html | 59 - .../core/tensor/class-use/SparseTensor.html | 59 - .../mklab/JGNN/core/tensor/package-frame.html | 32 - .../JGNN/core/tensor/package-summary.html | 115 - docs/mklab/JGNN/core/tensor/package-tree.html | 80 - docs/mklab/JGNN/core/tensor/package-use.html | 59 - docs/mklab/JGNN/core/util/Loss.html | 490 - docs/mklab/JGNN/core/util/LossTest.html | 205 - docs/mklab/JGNN/core/util/Range.html | 210 - docs/mklab/JGNN/core/util/Range2D.html | 213 - docs/mklab/JGNN/core/util/Sort.html | 169 - docs/mklab/JGNN/core/util/class-use/Loss.html | 59 - .../JGNN/core/util/class-use/LossTest.html | 59 - .../mklab/JGNN/core/util/class-use/Range.html | 59 - .../JGNN/core/util/class-use/Range2D.html | 59 - docs/mklab/JGNN/core/util/class-use/Sort.html | 59 - docs/mklab/JGNN/core/util/package-frame.html | 36 - .../mklab/JGNN/core/util/package-summary.html | 122 - docs/mklab/JGNN/core/util/package-tree.html | 82 - docs/mklab/JGNN/core/util/package-use.html | 59 - docs/mklab/JGNN/data/IdConverter.html | 380 - docs/mklab/JGNN/data/Measure.html | 177 - docs/mklab/JGNN/data/TrainingData.html | 135 - .../JGNN/data/class-use/IdConverter.html | 103 - docs/mklab/JGNN/data/class-use/Measure.html | 93 - .../JGNN/data/class-use/TrainingData.html | 59 - docs/mklab/JGNN/data/datasets/Dataset.html | 251 - .../JGNN/data/datasets/Datasets.Adult.html | 138 - .../data/datasets/Datasets.BreastCancer.html | 138 - .../JGNN/data/datasets/Datasets.CALLS.html | 138 - .../JGNN/data/datasets/Datasets.CiteSeer.html | 138 - .../JGNN/data/datasets/Datasets.Cora.html | 138 - .../data/datasets/Datasets.CoraGraph.html | 138 - .../JGNN/data/datasets/Datasets.ENRON.html | 138 - .../JGNN/data/datasets/Datasets.FRIENDS.html | 138 - .../data/datasets/Datasets.Lymphography.html | 138 - .../JGNN/data/datasets/Datasets.MESSAGES.html | 138 - .../JGNN/data/datasets/Datasets.MUTAG.html | 138 - .../JGNN/data/datasets/Datasets.PubMed.html | 138 - .../JGNN/data/datasets/Datasets.SMS.html | 138 - docs/mklab/JGNN/data/datasets/Datasets.html | 180 - .../JGNN/data/datasets/class-use/Dataset.html | 120 - .../datasets/class-use/Datasets.Adult.html | 59 - .../class-use/Datasets.BreastCancer.html | 59 - .../datasets/class-use/Datasets.CALLS.html | 59 - .../datasets/class-use/Datasets.CiteSeer.html | 59 - .../datasets/class-use/Datasets.Cora.html | 59 - .../class-use/Datasets.CoraGraph.html | 59 - .../datasets/class-use/Datasets.ENRON.html | 59 - .../datasets/class-use/Datasets.FRIENDS.html | 59 - .../class-use/Datasets.Lymphography.html | 59 - .../datasets/class-use/Datasets.MESSAGES.html | 59 - .../datasets/class-use/Datasets.MUTAG.html | 59 - .../datasets/class-use/Datasets.PubMed.html | 59 - .../data/datasets/class-use/Datasets.SMS.html | 59 - .../data/datasets/class-use/Datasets.html | 59 - .../JGNN/data/datasets/package-frame.html | 43 - .../JGNN/data/datasets/package-summary.html | 125 - .../JGNN/data/datasets/package-tree.html | 90 - .../mklab/JGNN/data/datasets/package-use.html | 83 - docs/mklab/JGNN/data/package-frame.html | 34 - docs/mklab/JGNN/data/package-summary.html | 107 - docs/mklab/JGNN/data/package-tree.html | 80 - docs/mklab/JGNN/data/package-use.html | 111 - docs/mklab/JGNN/examples/Classification.html | 302 - .../JGNN/examples/GNNClassification.html | 307 - docs/mklab/JGNN/examples/LinkPrediction.html | 307 - .../JGNN/examples/ModelCustomDefinition.html | 302 - .../JGNN/examples/ModelSimpleTraining.html | 307 - .../examples/ModelSymbolicDefinition.html | 302 - docs/mklab/JGNN/examples/Operations.html | 307 - docs/mklab/JGNN/examples/Primitives.html | 307 - docs/mklab/JGNN/examples/SimpleNetwork.html | 307 - .../examples/class-use/Classification.html | 152 - .../examples/class-use/GNNClassification.html | 152 - .../examples/class-use/LinkPrediction.html | 152 - .../class-use/ModelCustomDefinition.html | 152 - .../class-use/ModelSimpleTraining.html | 152 - .../class-use/ModelSymbolicDefinition.html | 152 - .../JGNN/examples/class-use/Operations.html | 152 - .../JGNN/examples/class-use/Primitives.html | 152 - .../examples/class-use/SimpleNetwork.html | 152 - .../LogisticRegressionExample.html | 310 - .../examples/classification/MLPExample.html | 310 - .../class-use/LogisticRegressionExample.html | 152 - .../classification/class-use/MLPExample.html | 152 - .../classification/package-frame.html | 30 - .../classification/package-summary.html | 184 - .../examples/classification/package-tree.html | 166 - .../examples/classification/package-use.html | 152 - .../nodeClassification/GNNClassification.html | 307 - .../nodeClassification/LinkPrediction.html | 307 - .../class-use/GNNClassification.html | 152 - .../class-use/LinkPrediction.html | 152 - .../nodeClassification/package-frame.html | 30 - .../nodeClassification/package-summary.html | 174 - .../nodeClassification/package-tree.html | 166 - .../nodeClassification/package-use.html | 152 - docs/mklab/JGNN/examples/package-frame.html | 37 - docs/mklab/JGNN/examples/package-summary.html | 202 - docs/mklab/JGNN/examples/package-tree.html | 173 - docs/mklab/JGNN/examples/package-use.html | 152 - .../primitives/ModelSimpleTraining.html | 307 - .../examples/primitives/SimpleNetwork.html | 307 - .../class-use/ModelSimpleTraining.html | 152 - .../primitives/class-use/SimpleNetwork.html | 152 - .../examples/primitives/package-frame.html | 30 - .../examples/primitives/package-summary.html | 174 - .../examples/primitives/package-tree.html | 166 - .../JGNN/examples/primitives/package-use.html | 152 - .../JGNN/initializers/KaimingNormal.html | 141 - .../JGNN/initializers/KaimingUniform.html | 141 - .../VariancePreservingInitializer.html | 191 - .../mklab/JGNN/initializers/XavierNormal.html | 141 - .../JGNN/initializers/XavierUniform.html | 141 - .../initializers/class-use/KaimingNormal.html | 59 - .../class-use/KaimingUniform.html | 59 - .../VariancePreservingInitializer.html | 101 - .../initializers/class-use/XavierNormal.html | 59 - .../initializers/class-use/XavierUniform.html | 59 - .../JGNN/initializers/package-summary.html | 124 - .../mklab/JGNN/initializers/package-tree.html | 84 - docs/mklab/JGNN/initializers/package-use.html | 86 - docs/mklab/JGNN/measures/AUC.html | 171 - docs/mklab/JGNN/measures/Accuracy.html | 183 - docs/mklab/JGNN/measures/Precision.html | 171 - docs/mklab/JGNN/measures/RMSE.html | 171 - docs/mklab/JGNN/measures/class-use/AUC.html | 59 - .../JGNN/measures/class-use/Accuracy.html | 59 - .../JGNN/measures/class-use/Precision.html | 59 - docs/mklab/JGNN/measures/class-use/RMSE.html | 59 - docs/mklab/JGNN/measures/package-frame.html | 32 - docs/mklab/JGNN/measures/package-summary.html | 90 - docs/mklab/JGNN/measures/package-tree.html | 80 - docs/mklab/JGNN/measures/package-use.html | 59 - .../models/relational/ClassificationGCN.html | 207 - .../RelationalData.NegativeSamplingType.html | 231 - .../models/relational/RelationalData.html | 211 - .../JGNN/models/relational/RelationalGCN.html | 298 - .../class-use/ClassificationGCN.html | 59 - .../RelationalData.NegativeSamplingType.html | 107 - .../relational/class-use/RelationalData.html | 59 - .../relational/class-use/RelationalGCN.html | 59 - .../JGNN/models/relational/package-frame.html | 35 - .../models/relational/package-summary.html | 102 - .../JGNN/models/relational/package-tree.html | 93 - .../JGNN/models/relational/package-use.html | 81 - docs/mklab/JGNN/nn/Initializer.html | 178 - docs/mklab/JGNN/nn/LSTM.LSTMState.html | 175 - docs/mklab/JGNN/nn/LSTM.html | 270 - docs/mklab/JGNN/nn/Loss.html | 218 - docs/mklab/JGNN/nn/Model.html | 527 - docs/mklab/JGNN/nn/ModelBuilder.html | 604 - docs/mklab/JGNN/nn/ModelTraining.html | 259 - docs/mklab/JGNN/nn/NNOperation.html | 440 - docs/mklab/JGNN/nn/Optimizer.html | 163 - docs/mklab/JGNN/nn/activations/Exp.html | 201 - docs/mklab/JGNN/nn/activations/L1.html | 188 - docs/mklab/JGNN/nn/activations/LRelu.html | 204 - docs/mklab/JGNN/nn/activations/NExp.html | 202 - docs/mklab/JGNN/nn/activations/PRelu.html | 196 - docs/mklab/JGNN/nn/activations/Relu.html | 205 - docs/mklab/JGNN/nn/activations/Sigmoid.html | 201 - docs/mklab/JGNN/nn/activations/Tanh.html | 201 - .../JGNN/nn/activations/class-use/Exp.html | 59 - .../JGNN/nn/activations/class-use/L1.html | 59 - .../JGNN/nn/activations/class-use/LRelu.html | 59 - .../JGNN/nn/activations/class-use/NExp.html | 59 - .../JGNN/nn/activations/class-use/PRelu.html | 59 - .../JGNN/nn/activations/class-use/Relu.html | 59 - .../nn/activations/class-use/Sigmoid.html | 59 - .../JGNN/nn/activations/class-use/Tanh.html | 59 - .../JGNN/nn/activations/package-frame.html | 33 - .../JGNN/nn/activations/package-summary.html | 129 - .../JGNN/nn/activations/package-tree.html | 84 - .../JGNN/nn/activations/package-use.html | 59 - docs/mklab/JGNN/nn/class-use/Initializer.html | 128 - .../JGNN/nn/class-use/LSTM.LSTMState.html | 103 - docs/mklab/JGNN/nn/class-use/LSTM.html | 84 - docs/mklab/JGNN/nn/class-use/Loss.html | 134 - docs/mklab/JGNN/nn/class-use/Model.html | 194 - .../mklab/JGNN/nn/class-use/ModelBuilder.html | 185 - .../JGNN/nn/class-use/ModelTraining.html | 122 - docs/mklab/JGNN/nn/class-use/NNOperation.html | 377 - docs/mklab/JGNN/nn/class-use/Optimizer.html | 197 - .../JGNN/nn/initializers/KaimingNormal.html | 141 - .../JGNN/nn/initializers/KaimingUniform.html | 141 - .../VariancePreservingInitializer.html | 191 - .../JGNN/nn/initializers/XavierNormal.html | 141 - .../JGNN/nn/initializers/XavierUniform.html | 141 - .../initializers/class-use/KaimingNormal.html | 59 - .../class-use/KaimingUniform.html | 59 - .../VariancePreservingInitializer.html | 101 - .../initializers/class-use/XavierNormal.html | 59 - .../initializers/class-use/XavierUniform.html | 59 - .../JGNN/nn/initializers/package-summary.html | 116 - .../JGNN/nn/initializers/package-tree.html | 84 - .../JGNN/nn/initializers/package-use.html | 86 - docs/mklab/JGNN/nn/inputs/Constant.html | 227 - docs/mklab/JGNN/nn/inputs/Parameter.html | 276 - docs/mklab/JGNN/nn/inputs/Variable.html | 229 - .../JGNN/nn/inputs/class-use/Constant.html | 59 - .../JGNN/nn/inputs/class-use/Parameter.html | 120 - .../JGNN/nn/inputs/class-use/Variable.html | 97 - docs/mklab/JGNN/nn/inputs/package-frame.html | 31 - .../mklab/JGNN/nn/inputs/package-summary.html | 105 - docs/mklab/JGNN/nn/inputs/package-tree.html | 82 - docs/mklab/JGNN/nn/inputs/package-use.html | 102 - docs/mklab/JGNN/nn/loss/Accuracy.html | 223 - .../JGNN/nn/loss/BinaryCrossEntropy.html | 249 - .../JGNN/nn/loss/CategoricalCrossEntropy.html | 249 - .../JGNN/nn/loss/class-use/Accuracy.html | 59 - .../nn/loss/class-use/BinaryCrossEntropy.html | 59 - .../class-use/CategoricalCrossEntropy.html | 59 - docs/mklab/JGNN/nn/loss/package-summary.html | 107 - docs/mklab/JGNN/nn/loss/package-tree.html | 79 - docs/mklab/JGNN/nn/loss/package-use.html | 59 - docs/mklab/JGNN/nn/operations/Add.html | 148 - docs/mklab/JGNN/nn/operations/Attention.html | 180 - docs/mklab/JGNN/nn/operations/Complement.html | 148 - docs/mklab/JGNN/nn/operations/Concat.html | 148 - docs/mklab/JGNN/nn/operations/Dropout.html | 212 - docs/mklab/JGNN/nn/operations/From.html | 193 - docs/mklab/JGNN/nn/operations/Gather.html | 148 - .../JGNN/nn/operations/LSTM.LSTMState.html | 175 - docs/mklab/JGNN/nn/operations/LSTM.html | 270 - docs/mklab/JGNN/nn/operations/Log.html | 148 - docs/mklab/JGNN/nn/operations/MatMul.html | 201 - docs/mklab/JGNN/nn/operations/Multiply.html | 201 - docs/mklab/JGNN/nn/operations/Reduce.html | 143 - docs/mklab/JGNN/nn/operations/Repeat.html | 149 - docs/mklab/JGNN/nn/operations/Reshape.html | 225 - docs/mklab/JGNN/nn/operations/To.html | 199 - docs/mklab/JGNN/nn/operations/Transpose.html | 148 - .../JGNN/nn/operations/class-use/Add.html | 59 - .../nn/operations/class-use/Attention.html | 59 - .../nn/operations/class-use/Complement.html | 59 - .../JGNN/nn/operations/class-use/Concat.html | 59 - .../JGNN/nn/operations/class-use/Dropout.html | 59 - .../JGNN/nn/operations/class-use/From.html | 59 - .../JGNN/nn/operations/class-use/Gather.html | 59 - .../operations/class-use/LSTM.LSTMState.html | 103 - .../JGNN/nn/operations/class-use/LSTM.html | 84 - .../JGNN/nn/operations/class-use/Log.html | 59 - .../JGNN/nn/operations/class-use/MatMul.html | 59 - .../nn/operations/class-use/Multiply.html | 59 - .../JGNN/nn/operations/class-use/Reduce.html | 59 - .../JGNN/nn/operations/class-use/Repeat.html | 59 - .../JGNN/nn/operations/class-use/Reshape.html | 85 - .../JGNN/nn/operations/class-use/To.html | 59 - .../nn/operations/class-use/Transpose.html | 59 - .../JGNN/nn/operations/package-frame.html | 37 - .../JGNN/nn/operations/package-summary.html | 158 - .../JGNN/nn/operations/package-tree.html | 93 - .../mklab/JGNN/nn/operations/package-use.html | 87 - docs/mklab/JGNN/nn/optimizers/Adam.html | 289 - .../JGNN/nn/optimizers/BatchOptimizer.html | 252 - .../JGNN/nn/optimizers/GradientDescent.html | 229 - .../JGNN/nn/optimizers/Regularization.html | 215 - .../JGNN/nn/optimizers/class-use/Adam.html | 59 - .../optimizers/class-use/BatchOptimizer.html | 59 - .../optimizers/class-use/GradientDescent.html | 59 - .../optimizers/class-use/Regularization.html | 59 - .../JGNN/nn/optimizers/package-frame.html | 32 - .../JGNN/nn/optimizers/package-summary.html | 113 - .../JGNN/nn/optimizers/package-tree.html | 76 - .../mklab/JGNN/nn/optimizers/package-use.html | 59 - docs/mklab/JGNN/nn/package-summary.html | 141 - docs/mklab/JGNN/nn/package-tree.html | 83 - docs/mklab/JGNN/nn/package-use.html | 242 - docs/mklab/JGNN/nn/pooling/Attention.html | 180 - docs/mklab/JGNN/nn/pooling/Max.html | 157 - docs/mklab/JGNN/nn/pooling/Mean.html | 188 - docs/mklab/JGNN/nn/pooling/SoftMax.html | 157 - docs/mklab/JGNN/nn/pooling/Sort.html | 174 - docs/mklab/JGNN/nn/pooling/Sum.html | 188 - docs/mklab/JGNN/nn/pooling/SumT.html | 314 - .../JGNN/nn/pooling/class-use/Attention.html | 59 - docs/mklab/JGNN/nn/pooling/class-use/Max.html | 59 - .../mklab/JGNN/nn/pooling/class-use/Mean.html | 59 - .../JGNN/nn/pooling/class-use/SoftMax.html | 59 - .../mklab/JGNN/nn/pooling/class-use/Sort.html | 84 - docs/mklab/JGNN/nn/pooling/class-use/Sum.html | 59 - .../mklab/JGNN/nn/pooling/class-use/SumT.html | 152 - docs/mklab/JGNN/nn/pooling/package-frame.html | 31 - .../JGNN/nn/pooling/package-summary.html | 115 - docs/mklab/JGNN/nn/pooling/package-tree.html | 81 - docs/mklab/JGNN/nn/pooling/package-use.html | 81 - docs/mklab/JGNN/package-frame.html | 31 - docs/mklab/JGNN/package-summary.html | 99 - docs/mklab/JGNN/package-tree.html | 73 - docs/mklab/JGNN/package-use.html | 59 - docs/module-search-index.js | 1 - docs/nodeClassification/APPNP.html | 170 - docs/nodeClassification/GAT.html | 165 - docs/nodeClassification/GCN.html | 170 - docs/nodeClassification/GCNII.html | 165 - .../GNNBuilderClassification.html | 165 - .../nodeClassification/GNNClassification.html | 165 - docs/nodeClassification/HetGCN.html | 165 - docs/nodeClassification/LinkPrediction.html | 165 - docs/nodeClassification/MessagePassing.html | 170 - docs/nodeClassification/PageRank.html | 165 - .../PageRankClassification.html | 165 - docs/nodeClassification/class-use/APPNP.html | 59 - docs/nodeClassification/class-use/GAT.html | 59 - docs/nodeClassification/class-use/GCN.html | 59 - docs/nodeClassification/class-use/GCNII.html | 59 - .../class-use/GNNBuilderClassification.html | 59 - .../class-use/GNNClassification.html | 59 - docs/nodeClassification/class-use/HetGCN.html | 59 - .../class-use/LinkPrediction.html | 59 - .../class-use/MessagePassing.html | 59 - .../class-use/PageRank.html | 59 - .../class-use/PageRankClassification.html | 59 - docs/nodeClassification/package-summary.html | 100 - docs/nodeClassification/package-tree.html | 78 - docs/nodeClassification/package-use.html | 59 - docs/overview-frame.html | 52 - docs/overview-summary.html | 26 - docs/overview-tree.html | 232 - docs/package-search-index.js | 1 - docs/package-search-index.zip | Bin 342 -> 0 bytes docs/primitives/ModelBuilderInternals.html | 171 - docs/primitives/ModelSimpleTraining.html | 165 - docs/primitives/SimpleNetwork.html | 170 - .../class-use/ModelBuilderInternals.html | 59 - .../class-use/ModelSimpleTraining.html | 59 - docs/primitives/class-use/SimpleNetwork.html | 59 - docs/primitives/package-summary.html | 91 - docs/primitives/package-tree.html | 74 - docs/primitives/package-use.html | 59 - docs/resources/glass.png | Bin 499 -> 0 bytes docs/resources/x.png | Bin 394 -> 0 bytes .../images/ui-bg_glass_55_fbf9ee_1x400.png | Bin 335 -> 0 bytes .../images/ui-bg_glass_65_dadada_1x400.png | Bin 262 -> 0 bytes .../images/ui-bg_glass_75_dadada_1x400.png | Bin 262 -> 0 bytes .../images/ui-bg_glass_75_e6e6e6_1x400.png | Bin 262 -> 0 bytes .../images/ui-bg_glass_95_fef1ec_1x400.png | Bin 332 -> 0 bytes .../ui-bg_highlight-soft_75_cccccc_1x100.png | Bin 280 -> 0 bytes .../images/ui-icons_222222_256x240.png | Bin 6922 -> 0 bytes .../images/ui-icons_2e83ff_256x240.png | Bin 4549 -> 0 bytes .../images/ui-icons_454545_256x240.png | Bin 6992 -> 0 bytes .../images/ui-icons_888888_256x240.png | Bin 6999 -> 0 bytes .../images/ui-icons_cd0a0a_256x240.png | Bin 4549 -> 0 bytes docs/script-dir/jquery-3.5.1.min.js | 2 - docs/script-dir/jquery-ui.min.css | 7 - docs/script-dir/jquery-ui.min.js | 6 - docs/script-dir/jquery-ui.structure.min.css | 5 - docs/script.js | 132 - docs/search.js | 354 - docs/stylesheet.css | 865 -- docs/tag-search-index.js | 1 - docs/tutorial/Learning.html | 165 - docs/tutorial/NN.html | 165 - docs/tutorial/class-use/Learning.html | 59 - docs/tutorial/class-use/NN.html | 59 - docs/tutorial/package-summary.html | 90 - docs/tutorial/package-tree.html | 74 - docs/tutorial/package-use.html | 59 - docs/type-search-index.js | 1 - docs/type-search-index.zip | Bin 1017 -> 0 bytes 599 files changed, 1417 insertions(+), 118073 deletions(-) delete mode 100644 docs/allclasses-frame.html delete mode 100644 docs/allclasses-index.html delete mode 100644 docs/allclasses-noframe.html delete mode 100644 docs/allpackages-index.html delete mode 100644 docs/classification/LogisticRegression.html delete mode 100644 docs/classification/LogisticRegressionExample.html delete mode 100644 docs/classification/MLP.html delete mode 100644 docs/classification/MLPExample.html delete mode 100644 docs/classification/class-use/LogisticRegression.html delete mode 100644 docs/classification/class-use/LogisticRegressionExample.html delete mode 100644 docs/classification/class-use/MLP.html delete mode 100644 docs/classification/class-use/MLPExample.html delete mode 100644 docs/classification/package-summary.html delete mode 100644 docs/classification/package-tree.html delete mode 100644 docs/classification/package-use.html delete mode 100644 docs/constant-values.html delete mode 100644 docs/deprecated-list.html delete mode 100644 docs/element-list delete mode 100644 docs/graphClassification/MeanPooling.html delete mode 100644 docs/graphClassification/SortPooling.html delete mode 100644 docs/graphClassification/TrajectoryData.html delete mode 100644 docs/graphClassification/class-use/MeanPooling.html delete mode 100644 docs/graphClassification/class-use/SortPooling.html delete mode 100644 docs/graphClassification/class-use/TrajectoryData.html delete mode 100644 docs/graphClassification/package-summary.html delete mode 100644 docs/graphClassification/package-tree.html delete mode 100644 docs/graphClassification/package-use.html delete mode 100644 docs/help-doc.html delete mode 100644 docs/index-files/index-1.html delete mode 100644 docs/index-files/index-10.html delete mode 100644 docs/index-files/index-11.html delete mode 100644 docs/index-files/index-12.html delete mode 100644 docs/index-files/index-13.html delete mode 100644 docs/index-files/index-14.html delete mode 100644 docs/index-files/index-15.html delete mode 100644 docs/index-files/index-16.html delete mode 100644 docs/index-files/index-17.html delete mode 100644 docs/index-files/index-18.html delete mode 100644 docs/index-files/index-19.html delete mode 100644 docs/index-files/index-2.html delete mode 100644 docs/index-files/index-20.html delete mode 100644 docs/index-files/index-21.html delete mode 100644 docs/index-files/index-22.html delete mode 100644 docs/index-files/index-23.html delete mode 100644 docs/index-files/index-3.html delete mode 100644 docs/index-files/index-4.html delete mode 100644 docs/index-files/index-5.html delete mode 100644 docs/index-files/index-6.html delete mode 100644 docs/index-files/index-7.html delete mode 100644 docs/index-files/index-8.html delete mode 100644 docs/index-files/index-9.html delete mode 100644 docs/jquery-ui.overrides.css delete mode 100644 docs/jquery/external/jquery/jquery.js delete mode 100644 docs/jquery/images/ui-bg_flat_0_aaaaaa_40x100.png delete mode 100644 docs/jquery/images/ui-bg_flat_75_ffffff_40x100.png delete mode 100644 docs/jquery/images/ui-bg_glass_55_fbf9ee_1x400.png delete mode 100644 docs/jquery/images/ui-bg_glass_65_ffffff_1x400.png delete mode 100644 docs/jquery/images/ui-bg_glass_75_dadada_1x400.png delete mode 100644 docs/jquery/images/ui-bg_glass_75_e6e6e6_1x400.png delete mode 100644 docs/jquery/images/ui-bg_glass_95_fef1ec_1x400.png delete mode 100644 docs/jquery/images/ui-bg_highlight-soft_75_cccccc_1x100.png delete mode 100644 docs/jquery/images/ui-icons_222222_256x240.png delete mode 100644 docs/jquery/images/ui-icons_2e83ff_256x240.png delete mode 100644 docs/jquery/images/ui-icons_454545_256x240.png delete mode 100644 docs/jquery/images/ui-icons_888888_256x240.png delete mode 100644 docs/jquery/images/ui-icons_cd0a0a_256x240.png delete mode 100644 docs/jquery/jquery-1.10.2.js delete mode 100644 docs/jquery/jquery-ui.css delete mode 100644 docs/jquery/jquery-ui.js delete mode 100644 docs/jquery/jquery-ui.min.css delete mode 100644 docs/jquery/jquery-ui.min.js delete mode 100644 docs/jquery/jquery-ui.structure.css delete mode 100644 docs/jquery/jquery-ui.structure.min.css delete mode 100644 docs/jquery/jszip-utils/dist/jszip-utils-ie.js delete mode 100644 docs/jquery/jszip-utils/dist/jszip-utils-ie.min.js delete mode 100644 docs/jquery/jszip-utils/dist/jszip-utils.js delete mode 100644 docs/jquery/jszip-utils/dist/jszip-utils.min.js delete mode 100644 docs/jquery/jszip/dist/jszip.js delete mode 100644 docs/jquery/jszip/dist/jszip.min.js delete mode 100644 docs/legal/COPYRIGHT delete mode 100644 docs/legal/LICENSE delete mode 100644 docs/legal/jquery.md delete mode 100644 docs/legal/jqueryUI.md delete mode 100644 docs/member-search-index.js delete mode 100644 docs/member-search-index.zip delete mode 100644 docs/mklab/JGNN/AppTest.html delete mode 100644 docs/mklab/JGNN/LSTMTest.html delete mode 100644 docs/mklab/JGNN/LearningTest.html delete mode 100644 docs/mklab/JGNN/NNOperationTest.html delete mode 100644 docs/mklab/JGNN/PrimitiveTest.html delete mode 100644 docs/mklab/JGNN/TensorTest.html delete mode 100644 docs/mklab/JGNN/adhoc/Dataset.html delete mode 100644 docs/mklab/JGNN/adhoc/IdConverter.html delete mode 100644 docs/mklab/JGNN/adhoc/ModelBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/GCNBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/GraphFilterBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/LayeredBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/class-use/GCNBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/class-use/GraphFilterBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/class-use/LayeredBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/package-summary.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/package-tree.html delete mode 100644 docs/mklab/JGNN/adhoc/builders/package-use.html delete mode 100644 docs/mklab/JGNN/adhoc/class-use/Dataset.html delete mode 100644 docs/mklab/JGNN/adhoc/class-use/IdConverter.html delete mode 100644 docs/mklab/JGNN/adhoc/class-use/ModelBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/Citeseer.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/Cora.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/Pubmed.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/class-use/Citeseer.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/class-use/Cora.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/class-use/Pubmed.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/package-summary.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/package-tree.html delete mode 100644 docs/mklab/JGNN/adhoc/datasets/package-use.html delete mode 100644 docs/mklab/JGNN/adhoc/package-summary.html delete mode 100644 docs/mklab/JGNN/adhoc/package-tree.html delete mode 100644 docs/mklab/JGNN/adhoc/package-use.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/FastBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/GCNBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/GraphFilterBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/LayeredBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/class-use/FastBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/class-use/GCNBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/class-use/GraphFilterBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/class-use/LayeredBuilder.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/package-summary.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/package-tree.html delete mode 100644 docs/mklab/JGNN/adhoc/parsers/package-use.html delete mode 100644 docs/mklab/JGNN/builders/GCNBuilder.html delete mode 100644 docs/mklab/JGNN/builders/class-use/GCNBuilder.html delete mode 100644 docs/mklab/JGNN/builders/package-frame.html delete mode 100644 docs/mklab/JGNN/builders/package-summary.html delete mode 100644 docs/mklab/JGNN/builders/package-tree.html delete mode 100644 docs/mklab/JGNN/builders/package-use.html delete mode 100644 docs/mklab/JGNN/class-use/AppTest.html delete mode 100644 docs/mklab/JGNN/class-use/LSTMTest.html delete mode 100644 docs/mklab/JGNN/class-use/LearningTest.html delete mode 100644 docs/mklab/JGNN/class-use/NNOperationTest.html delete mode 100644 docs/mklab/JGNN/class-use/PrimitiveTest.html delete mode 100644 docs/mklab/JGNN/class-use/TensorTest.html delete mode 100644 docs/mklab/JGNN/core/Distribution.html delete mode 100644 docs/mklab/JGNN/core/LSTM.LSTMState.html delete mode 100644 docs/mklab/JGNN/core/LSTM.html delete mode 100644 docs/mklab/JGNN/core/Loss.html delete mode 100644 docs/mklab/JGNN/core/Matrix.html delete mode 100644 docs/mklab/JGNN/core/MatrixTest.html delete mode 100644 docs/mklab/JGNN/core/Memory.Scope.html delete mode 100644 docs/mklab/JGNN/core/Memory.html delete mode 100644 docs/mklab/JGNN/core/Model.html delete mode 100644 docs/mklab/JGNN/core/ModelBuilder.html delete mode 100644 docs/mklab/JGNN/core/ModelInitializer.html delete mode 100644 docs/mklab/JGNN/core/ModelTraining.Loss.html delete mode 100644 docs/mklab/JGNN/core/ModelTraining.html delete mode 100644 docs/mklab/JGNN/core/NNOperation.html delete mode 100644 docs/mklab/JGNN/core/Optimizer.html delete mode 100644 docs/mklab/JGNN/core/Slice.html delete mode 100644 docs/mklab/JGNN/core/Tensor.html delete mode 100644 docs/mklab/JGNN/core/TensorTest.html delete mode 100644 docs/mklab/JGNN/core/ThreadPool.html delete mode 100644 docs/mklab/JGNN/core/class-use/Distribution.html delete mode 100644 docs/mklab/JGNN/core/class-use/LSTM.LSTMState.html delete mode 100644 docs/mklab/JGNN/core/class-use/LSTM.html delete mode 100644 docs/mklab/JGNN/core/class-use/Loss.html delete mode 100644 docs/mklab/JGNN/core/class-use/Matrix.html delete mode 100644 docs/mklab/JGNN/core/class-use/MatrixTest.html delete mode 100644 docs/mklab/JGNN/core/class-use/Memory.Scope.html delete mode 100644 docs/mklab/JGNN/core/class-use/Memory.html delete mode 100644 docs/mklab/JGNN/core/class-use/Model.html delete mode 100644 docs/mklab/JGNN/core/class-use/ModelBuilder.html delete mode 100644 docs/mklab/JGNN/core/class-use/ModelInitializer.html delete mode 100644 docs/mklab/JGNN/core/class-use/ModelTraining.Loss.html delete mode 100644 docs/mklab/JGNN/core/class-use/ModelTraining.html delete mode 100644 docs/mklab/JGNN/core/class-use/NNOperation.html delete mode 100644 docs/mklab/JGNN/core/class-use/Optimizer.html delete mode 100644 docs/mklab/JGNN/core/class-use/Slice.html delete mode 100644 docs/mklab/JGNN/core/class-use/Tensor.html delete mode 100644 docs/mklab/JGNN/core/class-use/TensorTest.html delete mode 100644 docs/mklab/JGNN/core/class-use/ThreadPool.html delete mode 100644 docs/mklab/JGNN/core/distribution/Normal.html delete mode 100644 docs/mklab/JGNN/core/distribution/Uniform.html delete mode 100644 docs/mklab/JGNN/core/distribution/class-use/Normal.html delete mode 100644 docs/mklab/JGNN/core/distribution/class-use/Uniform.html delete mode 100644 docs/mklab/JGNN/core/distribution/package-frame.html delete mode 100644 docs/mklab/JGNN/core/distribution/package-summary.html delete mode 100644 docs/mklab/JGNN/core/distribution/package-tree.html delete mode 100644 docs/mklab/JGNN/core/distribution/package-use.html delete mode 100644 docs/mklab/JGNN/core/loss/Accuracy.html delete mode 100644 docs/mklab/JGNN/core/loss/BinaryCrossEntropy.html delete mode 100644 docs/mklab/JGNN/core/loss/CategoricalCrossEntropy.html delete mode 100644 docs/mklab/JGNN/core/loss/class-use/Accuracy.html delete mode 100644 docs/mklab/JGNN/core/loss/class-use/BinaryCrossEntropy.html delete mode 100644 docs/mklab/JGNN/core/loss/class-use/CategoricalCrossEntropy.html delete mode 100644 docs/mklab/JGNN/core/loss/package-summary.html delete mode 100644 docs/mklab/JGNN/core/loss/package-tree.html delete mode 100644 docs/mklab/JGNN/core/loss/package-use.html delete mode 100644 docs/mklab/JGNN/core/matrix/AccessCol.html delete mode 100644 docs/mklab/JGNN/core/matrix/AccessRow.html delete mode 100644 docs/mklab/JGNN/core/matrix/ColumnRepetition.html delete mode 100644 docs/mklab/JGNN/core/matrix/DenseMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/Diagonal.html delete mode 100644 docs/mklab/JGNN/core/matrix/RepeatMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/RowRepetition.html delete mode 100644 docs/mklab/JGNN/core/matrix/SparseMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/SparseSymmetric.html delete mode 100644 docs/mklab/JGNN/core/matrix/TransposedMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/WrapCols.html delete mode 100644 docs/mklab/JGNN/core/matrix/WrapRows.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/AccessCol.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/AccessRow.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/ColumnRepetition.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/DenseMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/Diagonal.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/RepeatMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/RowRepetition.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/SparseMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/SparseSymmetric.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/TransposedMatrix.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/WrapCols.html delete mode 100644 docs/mklab/JGNN/core/matrix/class-use/WrapRows.html delete mode 100644 docs/mklab/JGNN/core/matrix/package-frame.html delete mode 100644 docs/mklab/JGNN/core/matrix/package-summary.html delete mode 100644 docs/mklab/JGNN/core/matrix/package-tree.html delete mode 100644 docs/mklab/JGNN/core/matrix/package-use.html delete mode 100644 docs/mklab/JGNN/core/package-frame.html delete mode 100644 docs/mklab/JGNN/core/package-summary.html delete mode 100644 docs/mklab/JGNN/core/package-tree.html delete mode 100644 docs/mklab/JGNN/core/package-use.html delete mode 100644 docs/mklab/JGNN/core/tensor/AccessSubtensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/DenseTensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/RepeatTensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/SparseTensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/class-use/AccessSubtensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/class-use/DenseTensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/class-use/RepeatTensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/class-use/SparseTensor.html delete mode 100644 docs/mklab/JGNN/core/tensor/package-frame.html delete mode 100644 docs/mklab/JGNN/core/tensor/package-summary.html delete mode 100644 docs/mklab/JGNN/core/tensor/package-tree.html delete mode 100644 docs/mklab/JGNN/core/tensor/package-use.html delete mode 100644 docs/mklab/JGNN/core/util/Loss.html delete mode 100644 docs/mklab/JGNN/core/util/LossTest.html delete mode 100644 docs/mklab/JGNN/core/util/Range.html delete mode 100644 docs/mklab/JGNN/core/util/Range2D.html delete mode 100644 docs/mklab/JGNN/core/util/Sort.html delete mode 100644 docs/mklab/JGNN/core/util/class-use/Loss.html delete mode 100644 docs/mklab/JGNN/core/util/class-use/LossTest.html delete mode 100644 docs/mklab/JGNN/core/util/class-use/Range.html delete mode 100644 docs/mklab/JGNN/core/util/class-use/Range2D.html delete mode 100644 docs/mklab/JGNN/core/util/class-use/Sort.html delete mode 100644 docs/mklab/JGNN/core/util/package-frame.html delete mode 100644 docs/mklab/JGNN/core/util/package-summary.html delete mode 100644 docs/mklab/JGNN/core/util/package-tree.html delete mode 100644 docs/mklab/JGNN/core/util/package-use.html delete mode 100644 docs/mklab/JGNN/data/IdConverter.html delete mode 100644 docs/mklab/JGNN/data/Measure.html delete mode 100644 docs/mklab/JGNN/data/TrainingData.html delete mode 100644 docs/mklab/JGNN/data/class-use/IdConverter.html delete mode 100644 docs/mklab/JGNN/data/class-use/Measure.html delete mode 100644 docs/mklab/JGNN/data/class-use/TrainingData.html delete mode 100644 docs/mklab/JGNN/data/datasets/Dataset.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.Adult.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.BreastCancer.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.CALLS.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.CiteSeer.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.Cora.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.CoraGraph.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.ENRON.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.FRIENDS.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.Lymphography.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.MESSAGES.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.MUTAG.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.PubMed.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.SMS.html delete mode 100644 docs/mklab/JGNN/data/datasets/Datasets.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Dataset.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.Adult.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.BreastCancer.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.CALLS.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.CiteSeer.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.Cora.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.CoraGraph.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.ENRON.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.FRIENDS.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.Lymphography.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.MESSAGES.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.MUTAG.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.PubMed.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.SMS.html delete mode 100644 docs/mklab/JGNN/data/datasets/class-use/Datasets.html delete mode 100644 docs/mklab/JGNN/data/datasets/package-frame.html delete mode 100644 docs/mklab/JGNN/data/datasets/package-summary.html delete mode 100644 docs/mklab/JGNN/data/datasets/package-tree.html delete mode 100644 docs/mklab/JGNN/data/datasets/package-use.html delete mode 100644 docs/mklab/JGNN/data/package-frame.html delete mode 100644 docs/mklab/JGNN/data/package-summary.html delete mode 100644 docs/mklab/JGNN/data/package-tree.html delete mode 100644 docs/mklab/JGNN/data/package-use.html delete mode 100644 docs/mklab/JGNN/examples/Classification.html delete mode 100644 docs/mklab/JGNN/examples/GNNClassification.html delete mode 100644 docs/mklab/JGNN/examples/LinkPrediction.html delete mode 100644 docs/mklab/JGNN/examples/ModelCustomDefinition.html delete mode 100644 docs/mklab/JGNN/examples/ModelSimpleTraining.html delete mode 100644 docs/mklab/JGNN/examples/ModelSymbolicDefinition.html delete mode 100644 docs/mklab/JGNN/examples/Operations.html delete mode 100644 docs/mklab/JGNN/examples/Primitives.html delete mode 100644 docs/mklab/JGNN/examples/SimpleNetwork.html delete mode 100644 docs/mklab/JGNN/examples/class-use/Classification.html delete mode 100644 docs/mklab/JGNN/examples/class-use/GNNClassification.html delete mode 100644 docs/mklab/JGNN/examples/class-use/LinkPrediction.html delete mode 100644 docs/mklab/JGNN/examples/class-use/ModelCustomDefinition.html delete mode 100644 docs/mklab/JGNN/examples/class-use/ModelSimpleTraining.html delete mode 100644 docs/mklab/JGNN/examples/class-use/ModelSymbolicDefinition.html delete mode 100644 docs/mklab/JGNN/examples/class-use/Operations.html delete mode 100644 docs/mklab/JGNN/examples/class-use/Primitives.html delete mode 100644 docs/mklab/JGNN/examples/class-use/SimpleNetwork.html delete mode 100644 docs/mklab/JGNN/examples/classification/LogisticRegressionExample.html delete mode 100644 docs/mklab/JGNN/examples/classification/MLPExample.html delete mode 100644 docs/mklab/JGNN/examples/classification/class-use/LogisticRegressionExample.html delete mode 100644 docs/mklab/JGNN/examples/classification/class-use/MLPExample.html delete mode 100644 docs/mklab/JGNN/examples/classification/package-frame.html delete mode 100644 docs/mklab/JGNN/examples/classification/package-summary.html delete mode 100644 docs/mklab/JGNN/examples/classification/package-tree.html delete mode 100644 docs/mklab/JGNN/examples/classification/package-use.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/GNNClassification.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/LinkPrediction.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/class-use/GNNClassification.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/class-use/LinkPrediction.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/package-frame.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/package-summary.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/package-tree.html delete mode 100644 docs/mklab/JGNN/examples/nodeClassification/package-use.html delete mode 100644 docs/mklab/JGNN/examples/package-frame.html delete mode 100644 docs/mklab/JGNN/examples/package-summary.html delete mode 100644 docs/mklab/JGNN/examples/package-tree.html delete mode 100644 docs/mklab/JGNN/examples/package-use.html delete mode 100644 docs/mklab/JGNN/examples/primitives/ModelSimpleTraining.html delete mode 100644 docs/mklab/JGNN/examples/primitives/SimpleNetwork.html delete mode 100644 docs/mklab/JGNN/examples/primitives/class-use/ModelSimpleTraining.html delete mode 100644 docs/mklab/JGNN/examples/primitives/class-use/SimpleNetwork.html delete mode 100644 docs/mklab/JGNN/examples/primitives/package-frame.html delete mode 100644 docs/mklab/JGNN/examples/primitives/package-summary.html delete mode 100644 docs/mklab/JGNN/examples/primitives/package-tree.html delete mode 100644 docs/mklab/JGNN/examples/primitives/package-use.html delete mode 100644 docs/mklab/JGNN/initializers/KaimingNormal.html delete mode 100644 docs/mklab/JGNN/initializers/KaimingUniform.html delete mode 100644 docs/mklab/JGNN/initializers/VariancePreservingInitializer.html delete mode 100644 docs/mklab/JGNN/initializers/XavierNormal.html delete mode 100644 docs/mklab/JGNN/initializers/XavierUniform.html delete mode 100644 docs/mklab/JGNN/initializers/class-use/KaimingNormal.html delete mode 100644 docs/mklab/JGNN/initializers/class-use/KaimingUniform.html delete mode 100644 docs/mklab/JGNN/initializers/class-use/VariancePreservingInitializer.html delete mode 100644 docs/mklab/JGNN/initializers/class-use/XavierNormal.html delete mode 100644 docs/mklab/JGNN/initializers/class-use/XavierUniform.html delete mode 100644 docs/mklab/JGNN/initializers/package-summary.html delete mode 100644 docs/mklab/JGNN/initializers/package-tree.html delete mode 100644 docs/mklab/JGNN/initializers/package-use.html delete mode 100644 docs/mklab/JGNN/measures/AUC.html delete mode 100644 docs/mklab/JGNN/measures/Accuracy.html delete mode 100644 docs/mklab/JGNN/measures/Precision.html delete mode 100644 docs/mklab/JGNN/measures/RMSE.html delete mode 100644 docs/mklab/JGNN/measures/class-use/AUC.html delete mode 100644 docs/mklab/JGNN/measures/class-use/Accuracy.html delete mode 100644 docs/mklab/JGNN/measures/class-use/Precision.html delete mode 100644 docs/mklab/JGNN/measures/class-use/RMSE.html delete mode 100644 docs/mklab/JGNN/measures/package-frame.html delete mode 100644 docs/mklab/JGNN/measures/package-summary.html delete mode 100644 docs/mklab/JGNN/measures/package-tree.html delete mode 100644 docs/mklab/JGNN/measures/package-use.html delete mode 100644 docs/mklab/JGNN/models/relational/ClassificationGCN.html delete mode 100644 docs/mklab/JGNN/models/relational/RelationalData.NegativeSamplingType.html delete mode 100644 docs/mklab/JGNN/models/relational/RelationalData.html delete mode 100644 docs/mklab/JGNN/models/relational/RelationalGCN.html delete mode 100644 docs/mklab/JGNN/models/relational/class-use/ClassificationGCN.html delete mode 100644 docs/mklab/JGNN/models/relational/class-use/RelationalData.NegativeSamplingType.html delete mode 100644 docs/mklab/JGNN/models/relational/class-use/RelationalData.html delete mode 100644 docs/mklab/JGNN/models/relational/class-use/RelationalGCN.html delete mode 100644 docs/mklab/JGNN/models/relational/package-frame.html delete mode 100644 docs/mklab/JGNN/models/relational/package-summary.html delete mode 100644 docs/mklab/JGNN/models/relational/package-tree.html delete mode 100644 docs/mklab/JGNN/models/relational/package-use.html delete mode 100644 docs/mklab/JGNN/nn/Initializer.html delete mode 100644 docs/mklab/JGNN/nn/LSTM.LSTMState.html delete mode 100644 docs/mklab/JGNN/nn/LSTM.html delete mode 100644 docs/mklab/JGNN/nn/Loss.html delete mode 100644 docs/mklab/JGNN/nn/Model.html delete mode 100644 docs/mklab/JGNN/nn/ModelBuilder.html delete mode 100644 docs/mklab/JGNN/nn/ModelTraining.html delete mode 100644 docs/mklab/JGNN/nn/NNOperation.html delete mode 100644 docs/mklab/JGNN/nn/Optimizer.html delete mode 100644 docs/mklab/JGNN/nn/activations/Exp.html delete mode 100644 docs/mklab/JGNN/nn/activations/L1.html delete mode 100644 docs/mklab/JGNN/nn/activations/LRelu.html delete mode 100644 docs/mklab/JGNN/nn/activations/NExp.html delete mode 100644 docs/mklab/JGNN/nn/activations/PRelu.html delete mode 100644 docs/mklab/JGNN/nn/activations/Relu.html delete mode 100644 docs/mklab/JGNN/nn/activations/Sigmoid.html delete mode 100644 docs/mklab/JGNN/nn/activations/Tanh.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/Exp.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/L1.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/LRelu.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/NExp.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/PRelu.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/Relu.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/Sigmoid.html delete mode 100644 docs/mklab/JGNN/nn/activations/class-use/Tanh.html delete mode 100644 docs/mklab/JGNN/nn/activations/package-frame.html delete mode 100644 docs/mklab/JGNN/nn/activations/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/activations/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/activations/package-use.html delete mode 100644 docs/mklab/JGNN/nn/class-use/Initializer.html delete mode 100644 docs/mklab/JGNN/nn/class-use/LSTM.LSTMState.html delete mode 100644 docs/mklab/JGNN/nn/class-use/LSTM.html delete mode 100644 docs/mklab/JGNN/nn/class-use/Loss.html delete mode 100644 docs/mklab/JGNN/nn/class-use/Model.html delete mode 100644 docs/mklab/JGNN/nn/class-use/ModelBuilder.html delete mode 100644 docs/mklab/JGNN/nn/class-use/ModelTraining.html delete mode 100644 docs/mklab/JGNN/nn/class-use/NNOperation.html delete mode 100644 docs/mklab/JGNN/nn/class-use/Optimizer.html delete mode 100644 docs/mklab/JGNN/nn/initializers/KaimingNormal.html delete mode 100644 docs/mklab/JGNN/nn/initializers/KaimingUniform.html delete mode 100644 docs/mklab/JGNN/nn/initializers/VariancePreservingInitializer.html delete mode 100644 docs/mklab/JGNN/nn/initializers/XavierNormal.html delete mode 100644 docs/mklab/JGNN/nn/initializers/XavierUniform.html delete mode 100644 docs/mklab/JGNN/nn/initializers/class-use/KaimingNormal.html delete mode 100644 docs/mklab/JGNN/nn/initializers/class-use/KaimingUniform.html delete mode 100644 docs/mklab/JGNN/nn/initializers/class-use/VariancePreservingInitializer.html delete mode 100644 docs/mklab/JGNN/nn/initializers/class-use/XavierNormal.html delete mode 100644 docs/mklab/JGNN/nn/initializers/class-use/XavierUniform.html delete mode 100644 docs/mklab/JGNN/nn/initializers/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/initializers/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/initializers/package-use.html delete mode 100644 docs/mklab/JGNN/nn/inputs/Constant.html delete mode 100644 docs/mklab/JGNN/nn/inputs/Parameter.html delete mode 100644 docs/mklab/JGNN/nn/inputs/Variable.html delete mode 100644 docs/mklab/JGNN/nn/inputs/class-use/Constant.html delete mode 100644 docs/mklab/JGNN/nn/inputs/class-use/Parameter.html delete mode 100644 docs/mklab/JGNN/nn/inputs/class-use/Variable.html delete mode 100644 docs/mklab/JGNN/nn/inputs/package-frame.html delete mode 100644 docs/mklab/JGNN/nn/inputs/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/inputs/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/inputs/package-use.html delete mode 100644 docs/mklab/JGNN/nn/loss/Accuracy.html delete mode 100644 docs/mklab/JGNN/nn/loss/BinaryCrossEntropy.html delete mode 100644 docs/mklab/JGNN/nn/loss/CategoricalCrossEntropy.html delete mode 100644 docs/mklab/JGNN/nn/loss/class-use/Accuracy.html delete mode 100644 docs/mklab/JGNN/nn/loss/class-use/BinaryCrossEntropy.html delete mode 100644 docs/mklab/JGNN/nn/loss/class-use/CategoricalCrossEntropy.html delete mode 100644 docs/mklab/JGNN/nn/loss/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/loss/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/loss/package-use.html delete mode 100644 docs/mklab/JGNN/nn/operations/Add.html delete mode 100644 docs/mklab/JGNN/nn/operations/Attention.html delete mode 100644 docs/mklab/JGNN/nn/operations/Complement.html delete mode 100644 docs/mklab/JGNN/nn/operations/Concat.html delete mode 100644 docs/mklab/JGNN/nn/operations/Dropout.html delete mode 100644 docs/mklab/JGNN/nn/operations/From.html delete mode 100644 docs/mklab/JGNN/nn/operations/Gather.html delete mode 100644 docs/mklab/JGNN/nn/operations/LSTM.LSTMState.html delete mode 100644 docs/mklab/JGNN/nn/operations/LSTM.html delete mode 100644 docs/mklab/JGNN/nn/operations/Log.html delete mode 100644 docs/mklab/JGNN/nn/operations/MatMul.html delete mode 100644 docs/mklab/JGNN/nn/operations/Multiply.html delete mode 100644 docs/mklab/JGNN/nn/operations/Reduce.html delete mode 100644 docs/mklab/JGNN/nn/operations/Repeat.html delete mode 100644 docs/mklab/JGNN/nn/operations/Reshape.html delete mode 100644 docs/mklab/JGNN/nn/operations/To.html delete mode 100644 docs/mklab/JGNN/nn/operations/Transpose.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Add.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Attention.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Complement.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Concat.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Dropout.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/From.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Gather.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/LSTM.LSTMState.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/LSTM.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Log.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/MatMul.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Multiply.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Reduce.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Repeat.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Reshape.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/To.html delete mode 100644 docs/mklab/JGNN/nn/operations/class-use/Transpose.html delete mode 100644 docs/mklab/JGNN/nn/operations/package-frame.html delete mode 100644 docs/mklab/JGNN/nn/operations/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/operations/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/operations/package-use.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/Adam.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/BatchOptimizer.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/GradientDescent.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/Regularization.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/class-use/Adam.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/class-use/BatchOptimizer.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/class-use/GradientDescent.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/class-use/Regularization.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/package-frame.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/optimizers/package-use.html delete mode 100644 docs/mklab/JGNN/nn/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/package-use.html delete mode 100644 docs/mklab/JGNN/nn/pooling/Attention.html delete mode 100644 docs/mklab/JGNN/nn/pooling/Max.html delete mode 100644 docs/mklab/JGNN/nn/pooling/Mean.html delete mode 100644 docs/mklab/JGNN/nn/pooling/SoftMax.html delete mode 100644 docs/mklab/JGNN/nn/pooling/Sort.html delete mode 100644 docs/mklab/JGNN/nn/pooling/Sum.html delete mode 100644 docs/mklab/JGNN/nn/pooling/SumT.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/Attention.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/Max.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/Mean.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/SoftMax.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/Sort.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/Sum.html delete mode 100644 docs/mklab/JGNN/nn/pooling/class-use/SumT.html delete mode 100644 docs/mklab/JGNN/nn/pooling/package-frame.html delete mode 100644 docs/mklab/JGNN/nn/pooling/package-summary.html delete mode 100644 docs/mklab/JGNN/nn/pooling/package-tree.html delete mode 100644 docs/mklab/JGNN/nn/pooling/package-use.html delete mode 100644 docs/mklab/JGNN/package-frame.html delete mode 100644 docs/mklab/JGNN/package-summary.html delete mode 100644 docs/mklab/JGNN/package-tree.html delete mode 100644 docs/mklab/JGNN/package-use.html delete mode 100644 docs/module-search-index.js delete mode 100644 docs/nodeClassification/APPNP.html delete mode 100644 docs/nodeClassification/GAT.html delete mode 100644 docs/nodeClassification/GCN.html delete mode 100644 docs/nodeClassification/GCNII.html delete mode 100644 docs/nodeClassification/GNNBuilderClassification.html delete mode 100644 docs/nodeClassification/GNNClassification.html delete mode 100644 docs/nodeClassification/HetGCN.html delete mode 100644 docs/nodeClassification/LinkPrediction.html delete mode 100644 docs/nodeClassification/MessagePassing.html delete mode 100644 docs/nodeClassification/PageRank.html delete mode 100644 docs/nodeClassification/PageRankClassification.html delete mode 100644 docs/nodeClassification/class-use/APPNP.html delete mode 100644 docs/nodeClassification/class-use/GAT.html delete mode 100644 docs/nodeClassification/class-use/GCN.html delete mode 100644 docs/nodeClassification/class-use/GCNII.html delete mode 100644 docs/nodeClassification/class-use/GNNBuilderClassification.html delete mode 100644 docs/nodeClassification/class-use/GNNClassification.html delete mode 100644 docs/nodeClassification/class-use/HetGCN.html delete mode 100644 docs/nodeClassification/class-use/LinkPrediction.html delete mode 100644 docs/nodeClassification/class-use/MessagePassing.html delete mode 100644 docs/nodeClassification/class-use/PageRank.html delete mode 100644 docs/nodeClassification/class-use/PageRankClassification.html delete mode 100644 docs/nodeClassification/package-summary.html delete mode 100644 docs/nodeClassification/package-tree.html delete mode 100644 docs/nodeClassification/package-use.html delete mode 100644 docs/overview-frame.html delete mode 100644 docs/overview-summary.html delete mode 100644 docs/overview-tree.html delete mode 100644 docs/package-search-index.js delete mode 100644 docs/package-search-index.zip delete mode 100644 docs/primitives/ModelBuilderInternals.html delete mode 100644 docs/primitives/ModelSimpleTraining.html delete mode 100644 docs/primitives/SimpleNetwork.html delete mode 100644 docs/primitives/class-use/ModelBuilderInternals.html delete mode 100644 docs/primitives/class-use/ModelSimpleTraining.html delete mode 100644 docs/primitives/class-use/SimpleNetwork.html delete mode 100644 docs/primitives/package-summary.html delete mode 100644 docs/primitives/package-tree.html delete mode 100644 docs/primitives/package-use.html delete mode 100644 docs/resources/glass.png delete mode 100644 docs/resources/x.png delete mode 100644 docs/script-dir/images/ui-bg_glass_55_fbf9ee_1x400.png delete mode 100644 docs/script-dir/images/ui-bg_glass_65_dadada_1x400.png delete mode 100644 docs/script-dir/images/ui-bg_glass_75_dadada_1x400.png delete mode 100644 docs/script-dir/images/ui-bg_glass_75_e6e6e6_1x400.png delete mode 100644 docs/script-dir/images/ui-bg_glass_95_fef1ec_1x400.png delete mode 100644 docs/script-dir/images/ui-bg_highlight-soft_75_cccccc_1x100.png delete mode 100644 docs/script-dir/images/ui-icons_222222_256x240.png delete mode 100644 docs/script-dir/images/ui-icons_2e83ff_256x240.png delete mode 100644 docs/script-dir/images/ui-icons_454545_256x240.png delete mode 100644 docs/script-dir/images/ui-icons_888888_256x240.png delete mode 100644 docs/script-dir/images/ui-icons_cd0a0a_256x240.png delete mode 100644 docs/script-dir/jquery-3.5.1.min.js delete mode 100644 docs/script-dir/jquery-ui.min.css delete mode 100644 docs/script-dir/jquery-ui.min.js delete mode 100644 docs/script-dir/jquery-ui.structure.min.css delete mode 100644 docs/script.js delete mode 100644 docs/search.js delete mode 100644 docs/stylesheet.css delete mode 100644 docs/tag-search-index.js delete mode 100644 docs/tutorial/Learning.html delete mode 100644 docs/tutorial/NN.html delete mode 100644 docs/tutorial/class-use/Learning.html delete mode 100644 docs/tutorial/class-use/NN.html delete mode 100644 docs/tutorial/package-summary.html delete mode 100644 docs/tutorial/package-tree.html delete mode 100644 docs/tutorial/package-use.html delete mode 100644 docs/type-search-index.js delete mode 100644 docs/type-search-index.zip diff --git a/JGNN/src/examples/nodeClassification/Scripting.java b/JGNN/src/examples/nodeClassification/Scripting.java index b7533d55..7ac48496 100644 --- a/JGNN/src/examples/nodeClassification/Scripting.java +++ b/JGNN/src/examples/nodeClassification/Scripting.java @@ -26,15 +26,37 @@ public static void main(String[] args) throws Exception { Dataset dataset = new Cora(); dataset.graph().setMainDiagonal(1).setToSymmetricNormalization(); + String architectures = """ + fn classify(nodes, h, epochs: !3000, patience: !100, lr: !0.01) { + return softmax(h[nodes], dim: "row"); + } + fn gcnlayer(A, h, hidden: 16, reg: 0.005) { + h = A@h@matrix(?, hidden, reg) + vector(hidden); + return h; + } + fn gcn(A, h, classes: extern) { + h = gcnlayer(A, h); + h = dropout(relu(h), 0.5); + h = gcnlayer(A, h, hidden: classes); + return h; + } + fn ngcn(A, h, nodes) { + h = classify(nodes, gcn(A,h)); + return h; + } + """; + + long numSamples = dataset.samples().getSlice().size(); + long numClasses = dataset.labels().getCols(); ModelBuilder modelBuilder = new Neuralang() - .parse(Paths.get("../architectures.nn")) + .parse(architectures) .constant("A", dataset.graph()) .constant("h", dataset.features()) .var("nodes") - .config("classes", dataset.labels().getCols()) - .config("hidden", 16) - .out("classify(nodes, gcn(A,h))") - .autosize(new EmptyTensor(dataset.samples().getSlice().size())); + .config("classes", numClasses) + .config("hidden", numClasses+2) + .out("ngcn(A,h, nodes)") + .autosize(new EmptyTensor(numSamples)); ModelTraining trainer = new ModelTraining() .configFrom(modelBuilder) diff --git a/README.md b/README.md index 22069e6c..d984c36c 100644 --- a/README.md +++ b/README.md @@ -7,7 +7,7 @@ A native Java library for graph neural networks. ## :dart: About Graph Neural Networks (GNNs) are getting more and more popular, for example to -make predictions based on relational information, and to perform inference +make predictions based on relational information, or to perform inference on small datasets. JGNN provides cross-platform implementations of this machine learning paradigm that do not require dedicated hardware or firmware. diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html deleted file mode 100644 index 1166aa9a..00000000 --- a/docs/allclasses-frame.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - -All Classes - - - - - - - - - - - - -

All Classes

-
- -
- - diff --git a/docs/allclasses-index.html b/docs/allclasses-index.html deleted file mode 100644 index ddedb937..00000000 --- a/docs/allclasses-index.html +++ /dev/null @@ -1,505 +0,0 @@ - - - - -All Classes and Interfaces - - - - - - - - - - - - - - - -
- -
-
-
-

All Classes and Interfaces

-
-
-
-
-
-
Class
-
Description
-
AccessCol
-
-
Accesses a column of a Matrix as if it were a dense Tensor.
-
-
AccessRow
-
-
Accesses a row of a Matrix as if it were a dense Tensor.
-
-
AccessSubtensor
-
-
Wraps a base Tensor by traversing only its elements in a specified range (from begin, up to end-1).
-
-
Accuracy
-
-
Implements an accuracy Loss of row-by-row comparison.
-
-
Adam
-
-
Thic class implements an Adam Optimizer as explained in the paper: - Kingma, Diederik P., and Jimmy Ba.
-
-
Add
-
-
Implements a NNOperation that adds its two inputs.
-
-
APPNP
-
-
Demonstrates classification with an APPNP GNN.
-
-
Attention
-
-
Implements a NNOperation that creates a version of adjacency matrices - with column-wise attention involving neighbor similarity.
-
-
BatchOptimizer
-
-
Wraps an Optimizer by accumulating derivatives and calling - Optimizer.update(Tensor, Tensor) with the average derivative - after a fixed number of accumulations.
-
-
BinaryCrossEntropy
-
-
Implements a binary cross-entropy Loss.
- For more than one output dimensions use CategoricalCrossEntropy
-
-
CategoricalCrossEntropy
-
-
Implements a categorical cross-entropy Loss.
- For binary classification of one output use BinaryCrossEntropy
-
-
Citeseer
-
-
Downloads and constructs the Citeseer node classification Dataset.
-
-
ColumnRepetition
-
-
Defines a matrix whose columns are all a copy of a Tensor.
-
-
Complement
-
-
Implements a NNOperation that performs the operation 1-x for its simple input x.
-
-
Concat
-
-
Implements a NNOperation that concatenates its two matrix inputs.
-
-
Constant
-
-
Implements a NNOperation that holds a constant tensor.
-
-
Cora
-
-
Downloads and constructs the Cora node classification Dataset.
-
-
Dataset
-
-
This class provides the backbone with which to define datasets.
-
-
DenseMatrix
-
-
Implements a dense Matrix where all elements are stored in memory.
-
-
DenseTensor
-
-
This class provides a dense Tensor that wraps an array of doubles.
-
-
Diagonal
-
-
Implements a square matrix whose diagonal elements are determined by the correspond values of - an underlying tensor and off-diagonal elements are zero.
-
-
Distribution
-
-
This interface abstracts a probability distribution - that can be passed to Tensor.setToRandom(Distribution) - for random tensor initialization.
-
-
Dropout
-
-
Implements a NNOperation that converts its first argument to a ColumnRepetition matrix - with a number of columns equal to the second argument.
-
-
Exp
-
-
Implements a NNOperation that performs an exponential transformation of its single input.
-
-
FastBuilder
-
-
Extends the capabilities of LayeredBuilder to use - for node classification.
-
-
From
-
-
Implements a NNOperation that lists the first element of the 2D matrix element iterator.
-
-
GAT
-
 
-
Gather
-
-
Implements a NNOperation that performs the equivalent of TensorFlow's gather operation.
-
-
GCN
-
-
Demonstrates classification with the GCN architecture.
-
-
GCNII
-
 
-
GradientDescent
-
-
Implements a gradient descent Optimizer.
-
-
HetGCN
-
 
-
IdConverter
-
-
Converts back-and-forth between objects and unique ids.
-
-
Initializer
-
-
This class defines an abstract interface for applying initializers to models.
-
-
KaimingNormal
-
-
This is a VariancePreservingInitializer.
-
-
KaimingUniform
-
-
This is a VariancePreservingInitializer.
-
-
L1
-
-
Implements a NNOperation that performs a L1 transformation of its single input - by row or column.
-
-
LayeredBuilder
-
-
Extends the capabilities of the ModelBuilder - with the ability to define multilayer (e.g.
-
-
Learning
-
-
This implementation covers code of the Learning tutorial.
-
-
Log
-
-
Implements a NNOperation that outputs the natural logarithm of its single input.
-
-
LogisticRegression
-
-
Demonstrates classification with logistic regression.
-
-
Loss
-
-
Provides computation and (partial) derivation of popular activation functions - and cross-entropy loss functions.
-
-
Loss
-
-
This class provides an abstract implementation of loss functions - to be used during Model training.
-
-
LossTest
-
 
-
LRelu
-
-
Implements a NNOperation that performs a leaky relu operation, where the first argument is a tensor on which - it is applied and the second one should be a tensor wrapping a double value (consider initializing this with as a - Constant holding a tensor generated with Tensor.fromDouble(double)) where - the wrapped value indicates the negative region's slope.
-
-
LSTM
-
 
-
LSTM.LSTMState
-
 
-
MatMul
-
-
Implements a NNOperation that multiplies its two matrix inputs.
-
-
Matrix
-
-
This class provides an abstract implementation of Matrix functionalities.
-
-
MatrixTest
-
 
-
Max
-
-
Implements a NNOperation that performs row-wise or column-wise - maximum reduction on vector tensors or matrices.
-
-
Mean
-
-
Implements a NNOperation that performs row-wise or column-wise - mean reduction on vector tensors or matrices.
-
-
MeanPooling
-
 
-
Memory
-
-
A memory management systems for thread-safe allocation and release of arrays of doubles.
-
-
Memory.Scope
-
 
-
MessagePassing
-
-
Demonstrates classification with a message passing architecture.
-
-
MLP
-
-
Demonstrates classification with a two-layer perceptron
-
-
Model
-
-
This class is a way to organize NNOperation trees into trainable machine - learning models.
-
-
ModelBuilder
-
-
This class and subclasses can be used to create Model instances - by automatically creating and managing NNOperation instances based on - textual descriptions.
-
-
ModelBuilderInternals
-
-
Demonstrates model builder internal node access that allows training with - a symbolically defined loss function.
-
-
ModelTraining
-
-
This is a helper class that automates the definition of training processes of Model instances - by defining the number of epochs, loss functions, number of batches and the ability to use ThreadPool - for parallelized batch computations.
-
-
Multiply
-
-
Implements a NNOperation that multiplies its two inputs element-by-element.
-
-
NExp
-
-
Implements a NNOperation that performs an exponential transformation of - its single input, but only on the non-zero elements.
-
-
NN
-
-
This implementation covers code of the Neural Networks tutorial.
-
-
NNOperation
-
-
This class defines an abstract neural network operation with forward and backpropagation capabilities.
-
-
Normal
-
-
Implements a Normal Distribution of given mean and standard deviation.
-
-
Optimizer
-
-
Provides an interface for training tensors.
-
-
Parameter
-
-
Implements a NNOperation that holds and returns a parameter tensor.
-
-
PRelu
-
 
-
Pubmed
-
-
Downloads and constructs the Pubmed node classification Dataset.
-
-
Range
-
-
Implements an iterator that traverses a range (similar to Python's range(min, max) method).
-
-
Range2D
-
-
Implements an iterator that traverses a two-dimensional range (min, max) x (min2, max2).
-
-
Reduce
-
 
-
Regularization
-
-
Wraps an Optimizer by applying the derivative of L2 loss - on every tensor during Optimizer.update(Tensor, Tensor).
-
-
Relu
-
-
Implements a NNOperation that performs a relu transformation of its single input first introduced by - Hahnloser, Richard HR, Rahul Sarpeshkar, Misha A.
-
-
Repeat
-
-
Implements a NNOperation that converts its first argument to a ColumnRepetition matrix - with a number of columns equal to the second argument.
-
-
RepeatMatrix
-
-
Implements a Matrix whose elements are all equals.
-
-
RepeatTensor
-
-
This class provides Tensor whose elements are all equal.
-
-
Reshape
-
-
Implements a NNOperation that reshapes a matrix.
-
-
RowRepetition
-
-
Defines a matrix whose rows are all a copy of a Tensor.
-
-
Sigmoid
-
-
Implements a NNOperation that performs a sigmoid transformation of its single input.
-
-
SimpleNetwork
-
-
Demonstrates custom initialization of parameters.
-
-
Slice
-
-
This class provices an interface with which to define data slices, - for instance to sample labels.
-
-
SoftMax
-
-
Implements a NNOperation that performs row-wise or column-wise - softmax on vector tensors or matrices.
-
-
Sort
-
 
-
Sort
-
 
-
SortPooling
-
 
-
SparseMatrix
-
-
A sparse Matrix that allocates memory only for non-zero elements.
-
-
SparseSymmetric
-
Deprecated. -
Under development.
-
-
SparseTensor
-
-
This class provides a sparse Tensor with many zero elements.
-
-
Sum
-
-
Implements a NNOperation that performs row-wise or column-wise - sum reduction on vector tensors or matrices.
-
-
Tanh
-
-
Implements a NNOperation that performs a tanh transformation of its single input.
-
-
Tensor
-
-
This class provides a native java implementation of Tensor functionalities.
-
-
TensorTest
-
 
-
TensorTest
-
 
-
ThreadPool
-
-
This class provides thread execution pool utilities while keeping track of thread - identifiers for use by thread-specific NNOperation.
-
-
To
-
-
Implements a NNOperation that lists the second element of the 2D matrix element iterator.
-
-
TrajectoryData
-
-
This class generates trajectory graph labels.
-
-
Transpose
-
-
Implements a NNOperation that performs matrix transposition.
-
-
TransposedMatrix
-
-
Generates a transposed version of a base matrix, with which it shares elements.
-
-
Uniform
-
-
Implements a Uniform Distribution of given bounds.
-
-
Variable
-
-
Implements a NNOperation that represents Model inputs.
-
-
VariancePreservingInitializer
-
-
This class describes a broad class of Initializer strategies, in which - dense neural layer initialization is controlled so that variance is mostly preserved from - inputs to outputs to avoid vanishing or exploding gradients in the first training - runs.
-
-
WrapCols
-
-
Wraps a list of tensors into a matrix with the tensors as columns.
-
-
WrapRows
-
-
Wraps a list of tensors into a matrix with the tensors as rows.
-
-
XavierNormal
-
-
This is a VariancePreservingInitializer.
-
-
XavierUniform
-
-
This is a VariancePreservingInitializer.
-
-
-
-
-
-
-
- - diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html deleted file mode 100644 index 23b6cd5b..00000000 --- a/docs/allclasses-noframe.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - -All Classes - - - - - - - - - - - - -

All Classes

-
- -
- - diff --git a/docs/allpackages-index.html b/docs/allpackages-index.html deleted file mode 100644 index 12f8af34..00000000 --- a/docs/allpackages-index.html +++ /dev/null @@ -1,108 +0,0 @@ - - - - -All Packages - - - - - - - - - - - - - - - -
- -
-
-
-

All Packages

-
-
Package Summary
-
-
Package
-
Description
-
classification
-
 
-
graphClassification
-
 
-
mklab.JGNN
-
 
-
mklab.JGNN.adhoc
-
 
-
mklab.JGNN.adhoc.datasets
-
 
-
mklab.JGNN.adhoc.parsers
-
 
-
mklab.JGNN.core
-
 
-
mklab.JGNN.core.distribution
-
 
-
mklab.JGNN.core.matrix
-
 
-
mklab.JGNN.core.tensor
-
 
-
mklab.JGNN.core.util
-
 
-
mklab.JGNN.nn
-
 
-
mklab.JGNN.nn.activations
-
 
-
mklab.JGNN.nn.initializers
-
 
-
mklab.JGNN.nn.inputs
-
 
-
mklab.JGNN.nn.loss
-
 
-
mklab.JGNN.nn.operations
-
 
-
mklab.JGNN.nn.optimizers
-
 
-
mklab.JGNN.nn.pooling
-
 
-
nodeClassification
-
 
-
primitives
-
 
-
tutorial
-
 
-
-
-
-
- - diff --git a/docs/classification/LogisticRegression.html b/docs/classification/LogisticRegression.html deleted file mode 100644 index fea378ff..00000000 --- a/docs/classification/LogisticRegression.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - -LogisticRegression - - - - - - - - - - - - - - - -
- -
-
- -
-
Package classification
-

Class LogisticRegression

-
-
java.lang.Object -
classification.LogisticRegression
-
-
-
-
public class LogisticRegression -extends Object
-
Demonstrates classification with logistic regression.
-
-
Author:
-
Emmanouil Krasanakis
-
-
-
- -
-
-
    - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      LogisticRegression

      -
      public LogisticRegression()
      -
      -
      • -
    -
    -
    • - -
  • -
    -

    Method Details

    -
      -
    • -
      -

      main

      -
      public static void main(String[] args)
      -
      -
      • -
    -
    -
    • -
-
- -
-
-
- - diff --git a/docs/classification/LogisticRegressionExample.html b/docs/classification/LogisticRegressionExample.html deleted file mode 100644 index 35fc0bca..00000000 --- a/docs/classification/LogisticRegressionExample.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - -LogisticRegressionExample - - - - - - - - - - - - - - - -
- -
-
- -
-
Package classification
-

Class LogisticRegressionExample

-
-
java.lang.Object -
classification.LogisticRegressionExample
-
-
-
-
public class LogisticRegressionExample -extends Object
-
Tasks : node classification
- Algorithms : logistic regression
- Datasets : Lymphography
- Demonstrates : dataset parsing, ModelBuilder, ModelTraining, accuracy evaluation
-
-
Author:
-
Emmanouil Krasanakis
-
-
-
- -
-
-
    - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      LogisticRegressionExample

      -
      public LogisticRegressionExample()
      -
      -
      • -
    -
    -
    • - -
  • -
    -

    Method Details

    -
      -
    • -
      -

      main

      -
      public static void main(String[] args)
      -
      -
      • -
    -
    -
    • -
-
- -
-
-
- - diff --git a/docs/classification/MLP.html b/docs/classification/MLP.html deleted file mode 100644 index 43ea0cce..00000000 --- a/docs/classification/MLP.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - -MLP - - - - - - - - - - - - - - - -
- -
-
- -
-
Package classification
-

Class MLP

-
-
java.lang.Object -
classification.MLP
-
-
-
-
public class MLP -extends Object
-
Demonstrates classification with a two-layer perceptron
-
-
Author:
-
Emmanouil Krasanakis
-
-
-
- -
-
-
    - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      MLP

      -
      public MLP()
      -
      -
      • -
    -
    -
    • - -
  • -
    -

    Method Details

    -
      -
    • -
      -

      main

      -
      public static void main(String[] args)
      -
      -
      • -
    -
    -
    • -
-
- -
-
-
- - diff --git a/docs/classification/MLPExample.html b/docs/classification/MLPExample.html deleted file mode 100644 index a5d29c02..00000000 --- a/docs/classification/MLPExample.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - -MLPExample - - - - - - - - - - - - - - - -
- -
-
- -
-
Package classification
-

Class MLPExample

-
-
java.lang.Object -
classification.MLPExample
-
-
-
-
public class MLPExample -extends Object
-
Tasks : node classification
- Algorithms : multilayer perceptron
- Datasets : Lymphography
- Demonstrates : dataset parsing, ModelBuilder, ModelTraining, accuracy evaluation, named dimensions, automatic parsing, ModelInitializer
-
-
Author:
-
Emmanouil Krasanakis
-
-
-
- -
-
-
    - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      MLPExample

      -
      public MLPExample()
      -
      -
      • -
    -
    -
    • - -
  • -
    -

    Method Details

    -
      -
    • -
      -

      main

      -
      public static void main(String[] args)
      -
      -
      • -
    -
    -
    • -
-
- -
-
-
- - diff --git a/docs/classification/class-use/LogisticRegression.html b/docs/classification/class-use/LogisticRegression.html deleted file mode 100644 index 62ec83ee..00000000 --- a/docs/classification/class-use/LogisticRegression.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class classification.LogisticRegression - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
classification.LogisticRegression

-
-No usage of classification.LogisticRegression
-
-
- - diff --git a/docs/classification/class-use/LogisticRegressionExample.html b/docs/classification/class-use/LogisticRegressionExample.html deleted file mode 100644 index 6fd58307..00000000 --- a/docs/classification/class-use/LogisticRegressionExample.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class classification.LogisticRegressionExample - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
classification.LogisticRegressionExample

-
-No usage of classification.LogisticRegressionExample
-
-
- - diff --git a/docs/classification/class-use/MLP.html b/docs/classification/class-use/MLP.html deleted file mode 100644 index a1479278..00000000 --- a/docs/classification/class-use/MLP.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class classification.MLP - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
classification.MLP

-
-No usage of classification.MLP
-
-
- - diff --git a/docs/classification/class-use/MLPExample.html b/docs/classification/class-use/MLPExample.html deleted file mode 100644 index 04a7c196..00000000 --- a/docs/classification/class-use/MLPExample.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class classification.MLPExample - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
classification.MLPExample

-
-No usage of classification.MLPExample
-
-
- - diff --git a/docs/classification/package-summary.html b/docs/classification/package-summary.html deleted file mode 100644 index a1b22868..00000000 --- a/docs/classification/package-summary.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -classification - - - - - - - - - - - - - - - -
- -
-
-
-

Package classification

-
-
-
package classification
-
-
    -
  • -
    -
    Classes
    -
    -
    Class
    -
    Description
    -
    LogisticRegression
    -
    -
    Demonstrates classification with logistic regression.
    -
    -
    MLP
    -
    -
    Demonstrates classification with a two-layer perceptron
    -
    -
    -
    -
    • -
-
-
-
-
- - diff --git a/docs/classification/package-tree.html b/docs/classification/package-tree.html deleted file mode 100644 index 8440d452..00000000 --- a/docs/classification/package-tree.html +++ /dev/null @@ -1,74 +0,0 @@ - - - - -classification Class Hierarchy - - - - - - - - - - - - - - - -
- -
-
-
-

Hierarchy For Package classification

-Package Hierarchies: - -
-
-

Class Hierarchy

- -
-
-
-
- - diff --git a/docs/classification/package-use.html b/docs/classification/package-use.html deleted file mode 100644 index ddff7256..00000000 --- a/docs/classification/package-use.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Package classification - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Package
classification

-
-No usage of classification
-
-
- - diff --git a/docs/constant-values.html b/docs/constant-values.html deleted file mode 100644 index de191a3c..00000000 --- a/docs/constant-values.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - -Constant Field Values - - - - - - - - - - - - - - -
- -
- - -
Skip navigation links
- - - - -
-
-
    -
  • Prev
    • -
  • Next
    • -
- - -
    -
  • - - -
    • -
-
- - -
- - -
- -
-
 
- -
-

Constant Field Values

-

Contents

-
- -
- - -
Skip navigation links
- - - - -
-
-
    -
  • Prev
    • -
  • Next
    • -
- - -
- - -
- - -
- - - diff --git a/docs/deprecated-list.html b/docs/deprecated-list.html deleted file mode 100644 index 6fd65f6e..00000000 --- a/docs/deprecated-list.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - -Deprecated List - - - - - - - - - - - - - - - -
- -
-
-
-

Deprecated API

-

Contents

- -
- -
    -
  • -
    -
    Deprecated Methods
    -
    -
    Method
    -
    Description
    -
    mklab.JGNN.core.Tensor.persist()
    -
    -
    This method may not be present in future versions - of the library, depending on whether memory reuse proves useful or nor.
    -
    -
    mklab.JGNN.core.Tensor.release()
    -
    -
    This method may not be present in future versions - of the library, depending on whether memory reuse proves useful or nor.
    -
    -
    -
    -
    • -
- -
-
-
- - diff --git a/docs/element-list b/docs/element-list deleted file mode 100644 index 9e7e62db..00000000 --- a/docs/element-list +++ /dev/null @@ -1,22 +0,0 @@ -classification -graphClassification -mklab.JGNN -mklab.JGNN.adhoc -mklab.JGNN.adhoc.datasets -mklab.JGNN.adhoc.parsers -mklab.JGNN.core -mklab.JGNN.core.distribution -mklab.JGNN.core.matrix -mklab.JGNN.core.tensor -mklab.JGNN.core.util -mklab.JGNN.nn -mklab.JGNN.nn.activations -mklab.JGNN.nn.initializers -mklab.JGNN.nn.inputs -mklab.JGNN.nn.loss -mklab.JGNN.nn.operations -mklab.JGNN.nn.optimizers -mklab.JGNN.nn.pooling -nodeClassification -primitives -tutorial diff --git a/docs/graphClassification/MeanPooling.html b/docs/graphClassification/MeanPooling.html deleted file mode 100644 index aca516d3..00000000 --- a/docs/graphClassification/MeanPooling.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - -MeanPooling - - - - - - - - - - - - - - - -
- -
-
- -
-
Package graphClassification
-

Class MeanPooling

-
-
java.lang.Object -
graphClassification.MeanPooling
-
-
-
-
public class MeanPooling -extends Object
-
-
- -
-
-
    - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      MeanPooling

      -
      public MeanPooling()
      -
      -
      • -
    -
    -
    • - -
  • -
    -

    Method Details

    - -
    -
    • -
-
- -
-
-
- - diff --git a/docs/graphClassification/SortPooling.html b/docs/graphClassification/SortPooling.html deleted file mode 100644 index 9186bb8f..00000000 --- a/docs/graphClassification/SortPooling.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - -SortPooling - - - - - - - - - - - - - - - -
- -
-
- -
-
Package graphClassification
-

Class SortPooling

-
-
java.lang.Object -
graphClassification.SortPooling
-
-
-
-
public class SortPooling -extends Object
-
-
Author:
-
github.com/gavalian, Emmanouil Krasanakis
-
-
-
- -
-
-
    - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      SortPooling

      -
      public SortPooling()
      -
      -
      • -
    -
    -
    • - -
  • -
    -

    Method Details

    -
      -
    • -
      -

      main

      -
      public static void main(String[] args)
      -
      -
      • -
    -
    -
    • -
-
- -
-
-
- - diff --git a/docs/graphClassification/TrajectoryData.html b/docs/graphClassification/TrajectoryData.html deleted file mode 100644 index 78c77aa0..00000000 --- a/docs/graphClassification/TrajectoryData.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - -TrajectoryData - - - - - - - - - - - - - - - -
- -
-
- -
-
Package graphClassification
-

Class TrajectoryData

-
-
java.lang.Object -
graphClassification.TrajectoryData
-
-
-
-
public class TrajectoryData -extends Object
-
This class generates trajectory graph labels. - Graph nodes correspond to points in time.
-
-
Author:
-
github.com/gavalian (author), Emmanouil Krasanakis (editing)
-
-
-
- -
-
-
    - -
  • -
    -

    Field Details

    - -
    -
    • - -
  • -
    -

    Constructor Details

    -
      -
    • -
      -

      TrajectoryData

      -
      public TrajectoryData(int numGraphs)
      -
      -
      • -
    -
    -
    • -
-
- -
-
-
- - diff --git a/docs/graphClassification/class-use/MeanPooling.html b/docs/graphClassification/class-use/MeanPooling.html deleted file mode 100644 index c11be0d5..00000000 --- a/docs/graphClassification/class-use/MeanPooling.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class graphClassification.MeanPooling - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
graphClassification.MeanPooling

-
-No usage of graphClassification.MeanPooling
-
-
- - diff --git a/docs/graphClassification/class-use/SortPooling.html b/docs/graphClassification/class-use/SortPooling.html deleted file mode 100644 index 9cdf7563..00000000 --- a/docs/graphClassification/class-use/SortPooling.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class graphClassification.SortPooling - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
graphClassification.SortPooling

-
-No usage of graphClassification.SortPooling
-
-
- - diff --git a/docs/graphClassification/class-use/TrajectoryData.html b/docs/graphClassification/class-use/TrajectoryData.html deleted file mode 100644 index 3be88944..00000000 --- a/docs/graphClassification/class-use/TrajectoryData.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Class graphClassification.TrajectoryData - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
graphClassification.TrajectoryData

-
-No usage of graphClassification.TrajectoryData
-
-
- - diff --git a/docs/graphClassification/package-summary.html b/docs/graphClassification/package-summary.html deleted file mode 100644 index 18495709..00000000 --- a/docs/graphClassification/package-summary.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -graphClassification - - - - - - - - - - - - - - - -
- -
-
-
-

Package graphClassification

-
-
-
package graphClassification
-
- -
-
-
-
- - diff --git a/docs/graphClassification/package-tree.html b/docs/graphClassification/package-tree.html deleted file mode 100644 index 5123faaf..00000000 --- a/docs/graphClassification/package-tree.html +++ /dev/null @@ -1,75 +0,0 @@ - - - - -graphClassification Class Hierarchy - - - - - - - - - - - - - - - -
- -
-
-
-

Hierarchy For Package graphClassification

-Package Hierarchies: - -
-
-

Class Hierarchy

- -
-
-
-
- - diff --git a/docs/graphClassification/package-use.html b/docs/graphClassification/package-use.html deleted file mode 100644 index d3da52ab..00000000 --- a/docs/graphClassification/package-use.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Uses of Package graphClassification - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Package
graphClassification

-
-No usage of graphClassification
-
-
- - diff --git a/docs/help-doc.html b/docs/help-doc.html deleted file mode 100644 index 4c00fac3..00000000 --- a/docs/help-doc.html +++ /dev/null @@ -1,188 +0,0 @@ - - - - -API Help - - - - - - - - - - - - - - - -
- -
-
-

JavaDoc Help

- -
-
-

Navigation

-Starting from the Overview page, you can browse the documentation using the links in each page, and in the navigation bar at the top of each page. The Index and Search box allow you to navigate to specific declarations and summary pages, including: All Packages, All Classes and Interfaces - -
-
-
-

Kinds of Pages

-The following sections describe the different kinds of pages in this collection. -
-

Overview

-

The Overview page is the front page of this API document and provides a list of all packages with a summary for each. This page can also contain an overall description of the set of packages.

-
-
-

Package

-

Each package has a page that contains a list of its classes and interfaces, with a summary for each. These pages may contain the following categories:

-
    -
  • Interfaces
    • -
  • Classes
    • -
  • Enums
    • -
  • Exceptions
    • -
  • Errors
    • -
  • Annotation Types
    • -
-
-
-

Class or Interface

-

Each class, interface, nested class and nested interface has its own separate page. Each of these pages has three sections consisting of a declaration and description, member summary tables, and detailed member descriptions. Entries in each of these sections are omitted if they are empty or not applicable.

-
    -
  • Class Inheritance Diagram
    • -
  • Direct Subclasses
    • -
  • All Known Subinterfaces
    • -
  • All Known Implementing Classes
    • -
  • Class or Interface Declaration
    • -
  • Class or Interface Description
    • -
-
-
    -
  • Nested Class Summary
    • -
  • Enum Constant Summary
    • -
  • Field Summary
    • -
  • Property Summary
    • -
  • Constructor Summary
    • -
  • Method Summary
    • -
  • Required Element Summary
    • -
  • Optional Element Summary
    • -
-
-
    -
  • Enum Constant Details
    • -
  • Field Details
    • -
  • Property Details
    • -
  • Constructor Details
    • -
  • Method Details
    • -
  • Element Details
    • -
-

Note: Annotation interfaces have required and optional elements, but not methods. Only enum classes have enum constants. The components of a record class are displayed as part of the declaration of the record class. Properties are a feature of JavaFX.

-

The summary entries are alphabetical, while the detailed descriptions are in the order they appear in the source code. This preserves the logical groupings established by the programmer.

-
-
-

Other Files

-

Packages and modules may contain pages with additional information related to the declarations nearby.

-
-
-

Use

-

Each documented package, class and interface has its own Use page. This page describes what packages, classes, methods, constructors and fields use any part of the given class or package. Given a class or interface A, its Use page includes subclasses of A, fields declared as A, methods that return A, and methods and constructors with parameters of type A. You can access this page by first going to the package, class or interface, then clicking on the USE link in the navigation bar.

-
-
-

Tree (Class Hierarchy)

-

There is a Class Hierarchy page for all packages, plus a hierarchy for each package. Each hierarchy page contains a list of classes and a list of interfaces. Classes are organized by inheritance structure starting with java.lang.Object. Interfaces do not inherit from java.lang.Object.

-
    -
  • When viewing the Overview page, clicking on TREE displays the hierarchy for all packages.
    • -
  • When viewing a particular package, class or interface page, clicking on TREE displays the hierarchy for only that package.
    • -
-
-
-

Deprecated API

-

The Deprecated API page lists all of the API that have been deprecated. A deprecated API is not recommended for use, generally due to shortcomings, and a replacement API is usually given. Deprecated APIs may be removed in future implementations.

-
-
-

All Packages

-

The All Packages page contains an alphabetic index of all packages contained in the documentation.

-
-
-

All Classes and Interfaces

-

The All Classes and Interfaces page contains an alphabetic index of all classes and interfaces contained in the documentation, including annotation interfaces, enum classes, and record classes.

-
-
-

Index

-

The Index contains an alphabetic index of all classes, interfaces, constructors, methods, and fields in the documentation, as well as summary pages such as All Packages, All Classes and Interfaces.

-
-
-
-This help file applies to API documentation generated by the standard doclet.
-
-
- - diff --git a/docs/index-files/index-1.html b/docs/index-files/index-1.html deleted file mode 100644 index 65b8751b..00000000 --- a/docs/index-files/index-1.html +++ /dev/null @@ -1,295 +0,0 @@ - - - - -A-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

A

-
-
abs() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the absolute value of tensor elements.
-
-
accessCol(long) - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves the given column as a tensor.
-
-
accessCol(long) - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
AccessCol - Class in mklab.JGNN.core.matrix
-
-
Accesses a column of a Matrix as if it were a dense Tensor.
-
-
AccessCol(Matrix, long) - Constructor for class mklab.JGNN.core.matrix.AccessCol
-
-
Instantiates a see-through access of a matrix column.
-
-
accessColumns() - Method in class mklab.JGNN.core.Matrix
-
-
Organizes specific matrix columns to a list of tensors that share entries.
-
-
accessColumns(long...) - Method in class mklab.JGNN.core.Matrix
-
-
Organizes specific matrix columns to a list of tensors that share entries.
-
-
accessColumns(Iterable<Long>) - Method in class mklab.JGNN.core.Matrix
-
-
Organizes some matrix columns to a list of tensors that share entries.
-
-
accessColumns(Tensor) - Method in class mklab.JGNN.core.Matrix
-
-
Organizes matrix columns to a list of tensors that share entries.
-
-
accessDim(long, String) - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves either the given row or column as a trensor.
-
-
accessRow(long) - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves the given row as a tensor.
-
-
accessRow(long) - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
AccessRow - Class in mklab.JGNN.core.matrix
-
-
Accesses a row of a Matrix as if it were a dense Tensor.
-
-
AccessRow(Matrix, long) - Constructor for class mklab.JGNN.core.matrix.AccessRow
-
-
Instantiates a see-through access of a matrix row.
-
-
accessRows() - Method in class mklab.JGNN.core.Matrix
-
-
Organizes matrix rows to a list of tensors that share entries.
-
-
accessRows(long...) - Method in class mklab.JGNN.core.Matrix
-
-
Organizes specific matrix rows to a list of tensors that share entries.
-
-
accessRows(Iterable<Long>) - Method in class mklab.JGNN.core.Matrix
-
-
Organizes some matrix rows to a list of tensors that share entries.
-
-
accessRows(Tensor) - Method in class mklab.JGNN.core.Matrix
-
-
Organizes specific matrix rows to a list of tensors that share entries.
-
-
accessSubtensor(long) - Method in class mklab.JGNN.core.Tensor
-
-
Wraps a range of elements within a tensor - without allocating memory anew.
-
-
accessSubtensor(long, long) - Method in class mklab.JGNN.core.Tensor
-
-
Wraps a range of elements within a tensor - without allocating memory anew.
-
-
AccessSubtensor - Class in mklab.JGNN.core.tensor
-
-
Wraps a base Tensor by traversing only its elements in a specified range (from begin, up to end-1).
-
-
AccessSubtensor(Tensor, long) - Constructor for class mklab.JGNN.core.tensor.AccessSubtensor
-
-
Instantiates a see-through access of a tensor elements.
-
-
AccessSubtensor(Tensor, long, long) - Constructor for class mklab.JGNN.core.tensor.AccessSubtensor
-
-
Instantiates a see-through access of a tensor elements.
-
-
Accuracy - Class in mklab.JGNN.nn.loss
-
-
Implements an accuracy Loss of row-by-row comparison.
-
-
Accuracy() - Constructor for class mklab.JGNN.nn.loss.Accuracy
-
-
Instantiates a row-by-row accuracy loss.
-
-
Adam - Class in mklab.JGNN.nn.optimizers
-
-
Thic class implements an Adam Optimizer as explained in the paper: - Kingma, Diederik P., and Jimmy Ba.
-
-
Adam() - Constructor for class mklab.JGNN.nn.optimizers.Adam
-
-
Initializes an NDAdam instance of an Adam optimizer with the default parameters recommended by the papers.
-
-
Adam(boolean, double) - Constructor for class mklab.JGNN.nn.optimizers.Adam
-
-
Initializes an Adam optimizer with the default parameters recommended by the papers - but allows for the specification of the learning rate and whether NDAdam or simple Adam - is used.
-
-
Adam(boolean, double, double, double) - Constructor for class mklab.JGNN.nn.optimizers.Adam
-
-
Initializes an NDAdam instance of an Adam optimizer with the default parameters with custom parameters.
-
-
Adam(boolean, double, double, double, double) - Constructor for class mklab.JGNN.nn.optimizers.Adam
-
 
-
Adam(double) - Constructor for class mklab.JGNN.nn.optimizers.Adam
-
-
Initializes an NDAdam instance of an Adam optimizer with the default parameters recommended by the papers - but allows for the specification of the learning rate.
-
-
add(double) - Method in class mklab.JGNN.core.Tensor
-
 
-
add(Tensor) - Method in class mklab.JGNN.core.Tensor
-
 
-
Add - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that adds its two inputs.
-
-
Add() - Constructor for class mklab.JGNN.nn.operations.Add
-
 
-
addInput(Variable) - Method in class mklab.JGNN.nn.Model
-
-
Adds to the model's inputs the provided Variable.
-
-
addInput(NNOperation) - Method in class mklab.JGNN.nn.inputs.Parameter
-
 
-
addInput(NNOperation) - Method in class mklab.JGNN.nn.NNOperation
-
 
-
addOutput(NNOperation) - Method in class mklab.JGNN.nn.Model
-
-
Adds to the model's output the output of the provided operation.
-
-
aggregate(LSTM) - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
allBaseMatrixTypes(long, long) - Method in class mklab.JGNN.core.MatrixTest
-
 
-
allMatrixTypes(long) - Method in class mklab.JGNN.core.MatrixTest
-
 
-
allocate(int, Object) - Static method in class mklab.JGNN.core.Memory
-
 
-
allSquareMatrixTypes(long) - Method in class mklab.JGNN.core.MatrixTest
-
 
-
allTensorTypes() - Method in class mklab.JGNN.core.TensorTest
-
 
-
allTensorTypes(long) - Method in class mklab.JGNN.core.TensorTest
-
 
-
allTensorTypesRandom(long) - Method in class mklab.JGNN.core.TensorTest
-
 
-
apply(Model) - Method in class mklab.JGNN.nn.Initializer
-
-
Applies the initializer to a given model's parameters.
-
-
apply(Model) - Method in class mklab.JGNN.nn.initializers.VariancePreservingInitializer
-
 
-
APPNP - Class in nodeClassification
-
-
Demonstrates classification with an APPNP GNN.
-
-
APPNP() - Constructor for class nodeClassification.APPNP
-
 
-
argmax() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the position of the maximum tensor element.
-
-
argmin() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the position of the minimum tensor element.
-
-
asColumn() - Method in class mklab.JGNN.core.Tensor
-
-
Accesses the tensor through a single-column matrix with the tensor as the only row.
-
-
asRow() - Method in class mklab.JGNN.core.Tensor
-
-
Accesses the tensor through a single-row matrix with the tensor as the only column.
-
-
assertBackwardValidity() - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Asserts that all components parsed into a call graph with - ModelBuilder.operation(String) are eventually used by at least one ModelBuilder.out(String) - component.
-
-
assertFinite() - Method in class mklab.JGNN.core.Tensor
-
-
Asserts that the tensor holds only finite values.
-
-
assertForwardValidity(List<Integer>) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
 
-
assertMatching(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Asserts that the tensor's dimensions match with another tensor.
-
-
assertSize(long) - Method in class mklab.JGNN.core.Tensor
-
-
Asserts that the tensor's Tensor.size() matches the given size.
-
-
assign(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Performs a sparse assignment.
-
-
asTensor() - Method in class mklab.JGNN.core.Slice
-
-
Creates a dense tensor holding the slice's identifiers.
-
-
asTransposed() - Method in class mklab.JGNN.core.Matrix
-
-
Creates a transposed version of the matrix that accesses the same elements (thus, editing one - edits the other) without allocating additional memory.
-
-
asTransposed() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
Attention - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that creates a version of adjacency matrices - with column-wise attention involving neighbor similarity.
-
-
Attention() - Constructor for class mklab.JGNN.nn.operations.Attention
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-10.html b/docs/index-files/index-10.html deleted file mode 100644 index 70cbb736..00000000 --- a/docs/index-files/index-10.html +++ /dev/null @@ -1,75 +0,0 @@ - - - - -K-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

K

-
-
KaimingNormal - Class in mklab.JGNN.nn.initializers
-
-
This is a VariancePreservingInitializer.
-
-
KaimingNormal() - Constructor for class mklab.JGNN.nn.initializers.KaimingNormal
-
 
-
KaimingUniform - Class in mklab.JGNN.nn.initializers
-
-
This is a VariancePreservingInitializer.
-
-
KaimingUniform() - Constructor for class mklab.JGNN.nn.initializers.KaimingUniform
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-11.html b/docs/index-files/index-11.html deleted file mode 100644 index 2680166e..00000000 --- a/docs/index-files/index-11.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - -L-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

L

-
-
L1 - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs a L1 transformation of its single input - by row or column.
-
-
L1() - Constructor for class mklab.JGNN.nn.activations.L1
-
 
-
L1(boolean) - Constructor for class mklab.JGNN.nn.activations.L1
-
 
-
labels - Variable in class graphClassification.TrajectoryData
-
 
-
labels() - Method in class mklab.JGNN.adhoc.Dataset
-
-
Retrieves the dataset's sample labels in one-hot encoding.
-
-
layer(String) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Applies an FastBuilder.operation(String) and increases the layer identifier count.
-
-
layer(String) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Applies an LayeredBuilder.operation(String) and increases the layer identifier count.
-
-
LayeredBuilder - Class in mklab.JGNN.adhoc.parsers
-
-
Extends the capabilities of the ModelBuilder - with the ability to define multilayer (e.g.
-
-
LayeredBuilder() - Constructor for class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Instantiates a layered builder with input name h0.
-
-
LayeredBuilder(String) - Constructor for class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Instantiates a layered builder with the given symbol as an input name.
-
-
layerRepeat(String, int) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Repeats a FastBuilder.layer(String) definition a number of times.
-
-
layerRepeat(String, int) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Repeats a LayeredBuilder.layer(String) definition a number of times.
-
-
Learning - Class in tutorial
-
-
This implementation covers code of the Learning tutorial.
-
-
Learning() - Constructor for class tutorial.Learning
-
 
-
load(Path) - Static method in class mklab.JGNN.adhoc.ModelBuilder
-
 
-
log() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the logarithm of tensor elements.
-
-
Log - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that outputs the natural logarithm of its single input.
-
-
Log() - Constructor for class mklab.JGNN.nn.operations.Log
-
 
-
LogisticRegression - Class in classification
-
-
Demonstrates classification with logistic regression.
-
-
LogisticRegression() - Constructor for class classification.LogisticRegression
-
 
-
Loss - Class in mklab.JGNN.nn
-
-
This class provides an abstract implementation of loss functions - to be used during Model training.
-
-
Loss - Interface in mklab.JGNN.core.util
-
-
Provides computation and (partial) derivation of popular activation functions - and cross-entropy loss functions.
-
-
Loss() - Constructor for class mklab.JGNN.nn.Loss
-
 
-
LossTest - Class in mklab.JGNN.core.util
-
 
-
LossTest() - Constructor for class mklab.JGNN.core.util.LossTest
-
 
-
LRelu - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs a leaky relu operation, where the first argument is a tensor on which - it is applied and the second one should be a tensor wrapping a double value (consider initializing this with as a - Constant holding a tensor generated with Tensor.fromDouble(double)) where - the wrapped value indicates the negative region's slope.
-
-
LRelu() - Constructor for class mklab.JGNN.nn.activations.LRelu
-
 
-
LSTM - Class in mklab.JGNN.nn.operations
-
 
-
LSTM(Optimizer, int, int) - Constructor for class mklab.JGNN.nn.operations.LSTM
-
 
-
LSTM.LSTMState - Class in mklab.JGNN.nn.operations
-
 
-
LSTMState(Tensor, Tensor) - Constructor for class mklab.JGNN.nn.operations.LSTM.LSTMState
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-12.html b/docs/index-files/index-12.html deleted file mode 100644 index 98efaaba..00000000 --- a/docs/index-files/index-12.html +++ /dev/null @@ -1,247 +0,0 @@ - - - - -M-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

M

-
-
main(String[]) - Static method in class classification.LogisticRegression
-
 
-
main(String[]) - Static method in class classification.MLP
-
 
-
main(String[]) - Static method in class graphClassification.MeanPooling
-
 
-
main(String[]) - Static method in class graphClassification.SortPooling
-
 
-
main(String[]) - Static method in class nodeClassification.APPNP
-
 
-
main(String[]) - Static method in class nodeClassification.GAT
-
 
-
main(String[]) - Static method in class nodeClassification.GCN
-
 
-
main(String[]) - Static method in class nodeClassification.GCNII
-
 
-
main(String[]) - Static method in class nodeClassification.HetGCN
-
 
-
main(String[]) - Static method in class nodeClassification.MessagePassing
-
 
-
main(String[]) - Static method in class primitives.ModelBuilderInternals
-
 
-
main(String[]) - Static method in class primitives.SimpleNetwork
-
 
-
main(String[]) - Static method in class tutorial.Learning
-
 
-
main(String[]) - Static method in class tutorial.NN
-
 
-
matmul(Matrix) - Method in class mklab.JGNN.core.Matrix
-
-
Performs the matrix multiplication of this*with and the recipient.
-
-
matmul(Matrix, boolean, boolean) - Method in class mklab.JGNN.core.Matrix
-
-
Can be used to perform fast computation of the matrix multiplications -
this*with, -
this.transposed()*with -
this*with.transposed(), -
this.transposed()*with.transposed() -
while avoiding the overhead of calling - Matrix.transposed().
-
-
MatMul - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that multiplies its two matrix inputs.
-
-
MatMul() - Constructor for class mklab.JGNN.nn.operations.MatMul
-
 
-
Matrix - Class in mklab.JGNN.core
-
-
This class provides an abstract implementation of Matrix functionalities.
-
-
MatrixTest - Class in mklab.JGNN.core
-
 
-
MatrixTest() - Constructor for class mklab.JGNN.core.MatrixTest
-
 
-
max() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the maximum tensor element.
-
-
Max - Class in mklab.JGNN.nn.pooling
-
-
Implements a NNOperation that performs row-wise or column-wise - maximum reduction on vector tensors or matrices.
-
-
Max() - Constructor for class mklab.JGNN.nn.pooling.Max
-
 
-
Max(boolean) - Constructor for class mklab.JGNN.nn.pooling.Max
-
 
-
Mean - Class in mklab.JGNN.nn.pooling
-
-
Implements a NNOperation that performs row-wise or column-wise - mean reduction on vector tensors or matrices.
-
-
Mean() - Constructor for class mklab.JGNN.nn.pooling.Mean
-
 
-
Mean(boolean) - Constructor for class mklab.JGNN.nn.pooling.Mean
-
 
-
MeanPooling - Class in graphClassification
-
 
-
MeanPooling() - Constructor for class graphClassification.MeanPooling
-
 
-
Memory - Class in mklab.JGNN.core
-
-
A memory management systems for thread-safe allocation and release of arrays of doubles.
-
-
Memory() - Constructor for class mklab.JGNN.core.Memory
-
 
-
Memory.Scope - Class in mklab.JGNN.core
-
 
-
MessagePassing - Class in nodeClassification
-
-
Demonstrates classification with a message passing architecture.
-
-
MessagePassing() - Constructor for class nodeClassification.MessagePassing
-
 
-
min() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the minimum tensor element.
-
-
mklab.JGNN.adhoc - package mklab.JGNN.adhoc
-
 
-
mklab.JGNN.adhoc.datasets - package mklab.JGNN.adhoc.datasets
-
 
-
mklab.JGNN.adhoc.parsers - package mklab.JGNN.adhoc.parsers
-
 
-
mklab.JGNN.core - package mklab.JGNN.core
-
 
-
mklab.JGNN.core.distribution - package mklab.JGNN.core.distribution
-
 
-
mklab.JGNN.core.matrix - package mklab.JGNN.core.matrix
-
 
-
mklab.JGNN.core.tensor - package mklab.JGNN.core.tensor
-
 
-
mklab.JGNN.core.util - package mklab.JGNN.core.util
-
 
-
mklab.JGNN.nn - package mklab.JGNN.nn
-
 
-
mklab.JGNN.nn.activations - package mklab.JGNN.nn.activations
-
 
-
mklab.JGNN.nn.initializers - package mklab.JGNN.nn.initializers
-
 
-
mklab.JGNN.nn.inputs - package mklab.JGNN.nn.inputs
-
 
-
mklab.JGNN.nn.loss - package mklab.JGNN.nn.loss
-
 
-
mklab.JGNN.nn.operations - package mklab.JGNN.nn.operations
-
 
-
mklab.JGNN.nn.optimizers - package mklab.JGNN.nn.optimizers
-
 
-
mklab.JGNN.nn.pooling - package mklab.JGNN.nn.pooling
-
 
-
MLP - Class in classification
-
-
Demonstrates classification with a two-layer perceptron
-
-
MLP() - Constructor for class classification.MLP
-
 
-
Model - Class in mklab.JGNN.nn
-
-
This class is a way to organize NNOperation trees into trainable machine - learning models.
-
-
Model() - Constructor for class mklab.JGNN.nn.Model
-
-
Deprecated. -
Prefer using model builders for symbolic model definitions.
-
-
-
ModelBuilder - Class in mklab.JGNN.adhoc
-
-
This class and subclasses can be used to create Model instances - by automatically creating and managing NNOperation instances based on - textual descriptions.
-
-
ModelBuilder() - Constructor for class mklab.JGNN.adhoc.ModelBuilder
-
 
-
ModelBuilder(Model) - Constructor for class mklab.JGNN.adhoc.ModelBuilder
-
 
-
ModelBuilderInternals - Class in primitives
-
-
Demonstrates model builder internal node access that allows training with - a symbolically defined loss function.
-
-
ModelBuilderInternals() - Constructor for class primitives.ModelBuilderInternals
-
 
-
ModelTraining - Class in mklab.JGNN.nn
-
-
This is a helper class that automates the definition of training processes of Model instances - by defining the number of epochs, loss functions, number of batches and the ability to use ThreadPool - for parallelized batch computations.
-
-
ModelTraining() - Constructor for class mklab.JGNN.nn.ModelTraining
-
 
-
multiply(double) - Method in class mklab.JGNN.core.Tensor
-
 
-
multiply(Tensor) - Method in class mklab.JGNN.core.Tensor
-
 
-
Multiply - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that multiplies its two inputs element-by-element.
-
-
Multiply() - Constructor for class mklab.JGNN.nn.operations.Multiply
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-13.html b/docs/index-files/index-13.html deleted file mode 100644 index 0964c80c..00000000 --- a/docs/index-files/index-13.html +++ /dev/null @@ -1,106 +0,0 @@ - - - - -N-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

N

-
-
negative() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the negative of tensor elements.
-
-
NExp - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs an exponential transformation of - its single input, but only on the non-zero elements.
-
-
NExp() - Constructor for class mklab.JGNN.nn.activations.NExp
-
 
-
next() - Method in class mklab.JGNN.core.util.Range
-
 
-
next() - Method in class mklab.JGNN.core.util.Range2D
-
 
-
NN - Class in tutorial
-
-
This implementation covers code of the Neural Networks tutorial.
-
-
NN() - Constructor for class tutorial.NN
-
 
-
NNOperation - Class in mklab.JGNN.nn
-
-
This class defines an abstract neural network operation with forward and backpropagation capabilities.
-
-
nodeClassification - package nodeClassification
-
 
-
norm() - Method in class mklab.JGNN.core.Tensor
-
 
-
Normal - Class in mklab.JGNN.core.distribution
-
-
Implements a Normal Distribution of given mean and standard deviation.
-
-
Normal() - Constructor for class mklab.JGNN.core.distribution.Normal
-
-
Instantiates a normal distribution with zero mean and standard deviation equal to 1.
-
-
Normal(double, double) - Constructor for class mklab.JGNN.core.distribution.Normal
-
-
Instantiates a normal distribution with a given mean and standard deviation.
-
-
normalized() - Method in class mklab.JGNN.core.Tensor
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-14.html b/docs/index-files/index-14.html deleted file mode 100644 index b33c1aad..00000000 --- a/docs/index-files/index-14.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -O-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

O

-
-
onesMask() - Method in class mklab.JGNN.core.Matrix
-
-
Produces a mask that indicates the non-zero elements of the matrix.
-
-
operation(String) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Parses one or more operations split by new line characters or ; - to add to the execution graph.
-
-
operation(String) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
 
-
operation(String) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
Optimizer - Interface in mklab.JGNN.nn
-
-
Provides an interface for training tensors.
-
-
out(String) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares the component with the given name an output of the - managed model.
-
-
out(String) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
output(Tensor, LSTM.LSTMState) - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-15.html b/docs/index-files/index-15.html deleted file mode 100644 index 13667eb5..00000000 --- a/docs/index-files/index-15.html +++ /dev/null @@ -1,202 +0,0 @@ - - - - -P-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

P

-
-
param(String, double, Tensor) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares a learnable Paramater component with the given name, - learning L2 regularization, and initial value.
-
-
param(String, double, Tensor) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
 
-
param(String, double, Tensor) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
param(String, Tensor) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares a learnable mklab.JGNN.nn.inputs.Paramater component with the given name, - zero regularization, and initial value.
-
-
param(String, Tensor) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
 
-
param(String, Tensor) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
Parameter - Class in mklab.JGNN.nn.inputs
-
-
Implements a NNOperation that holds and returns a parameter tensor.
-
-
Parameter(Tensor) - Constructor for class mklab.JGNN.nn.inputs.Parameter
-
 
-
Parameter(Tensor, double) - Constructor for class mklab.JGNN.nn.inputs.Parameter
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
persist() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
persist() - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
persist() - Method in class mklab.JGNN.core.tensor.AccessSubtensor
-
 
-
persist() - Method in class mklab.JGNN.core.tensor.DenseTensor
-
 
-
persist() - Method in class mklab.JGNN.core.Tensor
-
-
Deprecated. -
This method may not be present in future versions - of the library, depending on whether memory reuse proves useful or nor.
-
-
-
persist() - Method in class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
persist() - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
predict(List<Tensor>) - Method in class mklab.JGNN.nn.Model
-
-
Forward run of the model given a list of input tensors.
-
-
predict(Tensor...) - Method in class mklab.JGNN.nn.Model
-
-
Forward run of the model given an array of input tensors.
-
-
predict(Tensor[]) - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
PRelu - Class in mklab.JGNN.nn.activations
-
 
-
PRelu() - Constructor for class mklab.JGNN.nn.activations.PRelu
-
 
-
primitives - package primitives
-
 
-
print() - Method in class mklab.JGNN.adhoc.ModelBuilder
-
 
-
printState() - Method in class mklab.JGNN.adhoc.ModelBuilder
-
 
-
Pubmed - Class in mklab.JGNN.adhoc.datasets
-
-
Downloads and constructs the Pubmed node classification Dataset.
-
-
Pubmed() - Constructor for class mklab.JGNN.adhoc.datasets.Pubmed
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
put(long, double) - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
put(long, double) - Method in class mklab.JGNN.core.tensor.AccessSubtensor
-
 
-
put(long, double) - Method in class mklab.JGNN.core.tensor.DenseTensor
-
 
-
put(long, double) - Method in class mklab.JGNN.core.Tensor
-
-
Assign a value to a tensor element.
-
-
put(long, double) - Method in class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
put(long, double) - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
put(long, long, double) - Method in class mklab.JGNN.core.Matrix
-
-
Stores values at matrix elements.
-
-
putAdd(long, double) - Method in class mklab.JGNN.core.Tensor
-
-
Add a value to a tensor element.
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-16.html b/docs/index-files/index-16.html deleted file mode 100644 index 72472979..00000000 --- a/docs/index-files/index-16.html +++ /dev/null @@ -1,248 +0,0 @@ - - - - -R-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

R

-
-
range(double, double) - Method in class mklab.JGNN.core.Slice
-
-
Performs the Slice.range(double, double) operation - but replaces values of from and end - with (int)(from*size()) and (int)(end*size()) - so that fractional ranges can be obtained.
-
-
range(int, int) - Method in class mklab.JGNN.core.Slice
-
-
Obtains the identifiers in a given range of the (shuffled) slice.
-
-
Range - Class in mklab.JGNN.core.util
-
-
Implements an iterator that traverses a range (similar to Python's range(min, max) method).
-
-
Range(long, long) - Constructor for class mklab.JGNN.core.util.Range
-
 
-
Range2D - Class in mklab.JGNN.core.util
-
-
Implements an iterator that traverses a two-dimensional range (min, max) x (min2, max2).
-
-
Range2D(long, long, long, long) - Constructor for class mklab.JGNN.core.util.Range2D
-
 
-
Reduce - Class in mklab.JGNN.nn.operations
-
 
-
Reduce() - Constructor for class mklab.JGNN.nn.operations.Reduce
-
 
-
register(double[]) - Method in class mklab.JGNN.core.Memory.Scope
-
 
-
Regularization - Class in mklab.JGNN.nn.optimizers
-
-
Wraps an Optimizer by applying the derivative of L2 loss - on every tensor during Optimizer.update(Tensor, Tensor).
-
-
Regularization(Optimizer, double) - Constructor for class mklab.JGNN.nn.optimizers.Regularization
-
-
Initializes a Regularization.
-
-
release() - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
release() - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
release() - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
release() - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
release() - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
release() - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
release() - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
release() - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
release() - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
release() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
release() - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
release() - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
release() - Method in class mklab.JGNN.core.tensor.AccessSubtensor
-
 
-
release() - Method in class mklab.JGNN.core.tensor.DenseTensor
-
 
-
release() - Method in class mklab.JGNN.core.Tensor
-
-
Deprecated. -
This method may not be present in future versions - of the library, depending on whether memory reuse proves useful or nor.
-
-
-
release() - Method in class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
release() - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
release(double[]) - Static method in class mklab.JGNN.core.Memory
-
 
-
relu(double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The relu activation x if x > 0, 0 otherwise
-
-
relu(Tensor) - Static method in interface mklab.JGNN.core.util.Loss
-
-
Applies Loss.relu(double) element-by-element.
-
-
Relu - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs a relu transformation of its single input first introduced by - Hahnloser, Richard HR, Rahul Sarpeshkar, Misha A.
-
-
Relu() - Constructor for class mklab.JGNN.nn.activations.Relu
-
 
-
reluDerivative(double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of the Loss.relu(double) function.
-
-
reluDerivative(Tensor) - Static method in interface mklab.JGNN.core.util.Loss
-
-
Applies Loss.reluDerivative(double) function.
-
-
rememberAs(String) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Remembers the last layer's output per a given identifier so that {layerId} - within future FastBuilder.layer(String) definitions is made to refer to the - current layer.
-
-
rememberAs(String) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Sets the current layer identifier to a specific symbol layerId - so that future usage of {layerId} is automatically replaced with - the identifier.
-
-
Repeat - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that converts its first argument to a ColumnRepetition matrix - with a number of columns equal to the second argument.
-
-
Repeat() - Constructor for class mklab.JGNN.nn.operations.Repeat
-
 
-
RepeatMatrix - Class in mklab.JGNN.core.matrix
-
-
Implements a Matrix whose elements are all equals.
-
-
RepeatMatrix(double, long, long) - Constructor for class mklab.JGNN.core.matrix.RepeatMatrix
-
-
Generates a dense matrix with the designated number of rows and columns.
-
-
RepeatTensor - Class in mklab.JGNN.core.tensor
-
-
This class provides Tensor whose elements are all equal.
-
-
RepeatTensor(double, long) - Constructor for class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
reset() - Method in interface mklab.JGNN.nn.Optimizer
-
-
Resets (and lets the garbage collector free) optimizer memory.
-
-
reset() - Method in class mklab.JGNN.nn.optimizers.Adam
-
 
-
reset() - Method in class mklab.JGNN.nn.optimizers.BatchOptimizer
-
 
-
reset() - Method in class mklab.JGNN.nn.optimizers.GradientDescent
-
 
-
reset() - Method in class mklab.JGNN.nn.optimizers.Regularization
-
 
-
Reshape - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that reshapes a matrix.
-
-
Reshape(long, long) - Constructor for class mklab.JGNN.nn.operations.Reshape
-
 
-
RowRepetition - Class in mklab.JGNN.core.matrix
-
-
Defines a matrix whose rows are all a copy of a Tensor.
-
-
RowRepetition(Tensor, long) - Constructor for class mklab.JGNN.core.matrix.RowRepetition
-
-
Instantiates a matrix repeating a tensor to be treated as a row.
-
-
run(List<Tensor>) - Method in class mklab.JGNN.nn.NNOperation
-
-
Performs a forward pass in the operation without inducing any kind of learning or storing the outcome.
-
-
run(Tensor...) - Method in class mklab.JGNN.nn.NNOperation
-
-
Performs a forward pass in the operation without inducing any kind of learning or storing the outcome.
-
-
runModel(ArrayList<Tensor>) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
This is a wrapper for getModel().predict(inputs) - without returning output values (use ModelBuilder.get(String) - afterwards to view outputs.
-
-
runModel(Tensor...) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
This is a wrapper for getModel().predict(inputs) - without returning output values (use ModelBuilder.get(String) - afterwards to view outputs.
-
-
runPrediction() - Method in class mklab.JGNN.nn.NNOperation
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-17.html b/docs/index-files/index-17.html deleted file mode 100644 index 14e85f6f..00000000 --- a/docs/index-files/index-17.html +++ /dev/null @@ -1,409 +0,0 @@ - - - - -S-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

S

-
-
sample() - Method in class mklab.JGNN.core.distribution.Normal
-
 
-
sample() - Method in interface mklab.JGNN.core.Distribution
-
-
Retrieves a new sample from the distribution.
-
-
sample() - Method in class mklab.JGNN.core.distribution.Uniform
-
 
-
samples() - Method in class mklab.JGNN.adhoc.Dataset
-
-
Retrieves a converter that maps samples to long identifiers that match them to - rows of Dataset.features(), Dataset.labels(), and Dataset.graph() matrices.
-
-
samplesAsFeatures() - Method in class mklab.JGNN.core.Slice
-
-
Constructs a column matrix holding identifiers in - the range 0,1,..Slice.size()-1 so that the pattern - slice.samplesAsFeatures().accessRows(slice.range(from, end)) - retrieves one-element tensors holding - slice[from], slice[from+1], ...
-
-
save(Path) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
 
-
scope() - Static method in class mklab.JGNN.core.Memory
-
 
-
selfAbs() - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory set of each element to its absolute value.
-
-
selfAdd(double) - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory addition to the Tensor, storing the result in itself.
-
-
selfAdd(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory addition to the Tensor, storing the result in itself.
-
-
selfAdd(Tensor, double) - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory weighted addition to the Tensor, storing the result in itself.
-
-
selfExpMinusOne() - Method in class mklab.JGNN.core.Tensor
-
-
Sets the exponential minus 1 of tensor elements.
-
-
selfInverse() - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory the inverse of each non-zero element.
-
-
selfLog() - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory set of each element to the logarithm of its absolute value.
-
-
selfMultiply(double) - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory multiplication on the Tensor, storing the result to itself.
-
-
selfMultiply(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory multiplication on the Tensor, storing the result in itself .
-
-
selfNegative() - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory set of each element to the negative of itself.
-
-
selfSqrt() - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory set of each element to the square root of its absolute value.
-
-
selfSubtract(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Performs in-memory subtraction from the Tensor, storing the result in itself.
-
-
set(Tensor) - Method in class mklab.JGNN.nn.inputs.Parameter
-
-
Forcefully sets the parameter's value tensor to the desired value.
-
-
setColName(String) - Method in class mklab.JGNN.core.Matrix
-
-
Sets a name for the matrix's column dimension.
-
-
setDescription(String) - Method in class mklab.JGNN.nn.NNOperation
-
 
-
setDeviation(double) - Method in class mklab.JGNN.core.distribution.Normal
-
 
-
setDeviation(double) - Method in interface mklab.JGNN.core.Distribution
-
-
Sets the standard deviation of the distribution.
-
-
setDeviation(double) - Method in class mklab.JGNN.core.distribution.Uniform
-
 
-
setDiagonal(long, double) - Method in class mklab.JGNN.core.Matrix
-
-
Sets the matrix's specified diagonal elements to a given value.
-
-
setDimensionName(String) - Method in class mklab.JGNN.core.Tensor
-
-
Sets a name for the tensor's one dimension.
-
-
setDimensionName(String) - Method in class mklab.JGNN.nn.pooling.Sort
-
 
-
setDimensionName(String, String) - Method in class mklab.JGNN.adhoc.IdConverter
-
-
Sets dimension names for one-hot encodings.
-
-
setDimensionName(String, String) - Method in class mklab.JGNN.core.Matrix
-
-
Sets a name for the matrix's row and column dimensions.
-
-
setDimensionName(String, String) - Method in class mklab.JGNN.nn.operations.Reshape
-
 
-
setDimensionName(Tensor) - Method in class mklab.JGNN.core.Matrix
-
 
-
setDimensionName(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Fills in dimension names per an example Tensor.isMatching(mklab.JGNN.core.Tensor) tensor.
-
-
setEnabled(boolean) - Method in class mklab.JGNN.nn.operations.Dropout
-
 
-
setEpochs(int) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setLoss(Loss) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setMainDiagonal(double) - Method in class mklab.JGNN.core.Matrix
-
-
Sets the matrix's specified main diagonal elements to a given value value.
-
-
setMean(double) - Method in class mklab.JGNN.core.distribution.Normal
-
 
-
setMean(double) - Method in interface mklab.JGNN.core.Distribution
-
-
Sets the mean of the distribution.
-
-
setMean(double) - Method in class mklab.JGNN.core.distribution.Uniform
-
 
-
setNumBatches(int) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setOptimizer(Optimizer) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setParallelizedStochasticGradientDescent(boolean) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setPatience(int) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setRange(double, double) - Method in class mklab.JGNN.core.distribution.Uniform
-
-
Sets the random of the uniform distribution.
-
-
setRowName(String) - Method in class mklab.JGNN.core.Matrix
-
-
Sets a name for the matrix's row dimension.
-
-
setSeed(long) - Method in class mklab.JGNN.core.distribution.Normal
-
 
-
setSeed(long) - Method in interface mklab.JGNN.core.Distribution
-
-
Sets the distribution's seed.
-
-
setSeed(long) - Method in class mklab.JGNN.core.distribution.Uniform
-
 
-
setTo(Tensor) - Method in class mklab.JGNN.nn.inputs.Variable
-
 
-
setToNormalized() - Method in class mklab.JGNN.core.Tensor
-
-
L2-normalizes the tensor's elements.
-
-
setToOnes() - Method in class mklab.JGNN.core.Tensor
-
-
Set all tensor element values to 1.
-
-
setToProbability() - Method in class mklab.JGNN.core.Tensor
-
-
Divides the tensor's elements with their sum.
-
-
setToRandom() - Method in class mklab.JGNN.core.Tensor
-
-
Set tensor elements to random values from the uniform range [0,1]
-
-
setToRandom(Distribution) - Method in class mklab.JGNN.core.Tensor
-
-
Set tensor elements to random values by sampling them from a given Distribution - instance.
-
-
setToSymmetricNormalization() - Method in class mklab.JGNN.core.Matrix
-
-
Sets the Matrix to its symmetrically normalized transformation - by appropriately adjusting its element values.
-
-
setToUniform() - Method in class mklab.JGNN.core.Tensor
-
-
Set all tensor element values to 1/Tensor.size()
-
-
setToZero() - Method in class mklab.JGNN.core.Tensor
-
-
Set all tensor element values to 0.
-
-
setValidationLoss(Loss) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setVerbose(boolean) - Method in class mklab.JGNN.nn.ModelTraining
-
 
-
setZeroCopyType(Matrix) - Method in class mklab.JGNN.core.matrix.WrapCols
-
-
Sets a prototype matrix from which to borrow copying operations.
-
-
setZeroCopyType(Matrix) - Method in class mklab.JGNN.core.matrix.WrapRows
-
-
Sets a prototype matrix from which to borrow copying operations.
-
-
shuffle() - Method in class mklab.JGNN.core.Slice
-
-
Shuffles the slice.
-
-
shuffle(int) - Method in class mklab.JGNN.core.Slice
-
-
Shuffles the slice with a provided randomization seed.
-
-
sigmoid(double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The sigmoid function 1/(1+exp(-x)).
-
-
sigmoid(Tensor) - Static method in interface mklab.JGNN.core.util.Loss
-
-
Applies Loss.sigmoid(double) element-by-element.
-
-
Sigmoid - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs a sigmoid transformation of its single input.
-
-
Sigmoid() - Constructor for class mklab.JGNN.nn.activations.Sigmoid
-
 
-
sigmoidDerivative(double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of the Loss.sigmoid(double) function.
-
-
sigmoidDerivative(Tensor) - Static method in interface mklab.JGNN.core.util.Loss
-
-
Applies Loss.sigmoidDerivative(double) function.
-
-
SimpleNetwork - Class in primitives
-
-
Demonstrates custom initialization of parameters.
-
-
SimpleNetwork() - Constructor for class primitives.SimpleNetwork
-
 
-
size() - Method in class mklab.JGNN.adhoc.IdConverter
-
-
The number of registered identifiers.
-
-
size() - Method in class mklab.JGNN.core.Slice
-
-
Retrieves the size of the slice.
-
-
size() - Method in class mklab.JGNN.core.Tensor
-
 
-
Slice - Class in mklab.JGNN.core
-
-
This class provices an interface with which to define data slices, - for instance to sample labels.
-
-
Slice(Iterable<Long>) - Constructor for class mklab.JGNN.core.Slice
-
-
Instantiates the data slice from a collection of element identifiers.
-
-
SoftMax - Class in mklab.JGNN.nn.pooling
-
-
Implements a NNOperation that performs row-wise or column-wise - softmax on vector tensors or matrices.
-
-
SoftMax() - Constructor for class mklab.JGNN.nn.pooling.SoftMax
-
 
-
SoftMax(boolean) - Constructor for class mklab.JGNN.nn.pooling.SoftMax
-
 
-
Sort - Class in mklab.JGNN.core.util
-
 
-
Sort - Class in mklab.JGNN.nn.pooling
-
 
-
Sort() - Constructor for class mklab.JGNN.core.util.Sort
-
 
-
Sort(int) - Constructor for class mklab.JGNN.nn.pooling.Sort
-
 
-
sortedIndexes(double[]) - Static method in class mklab.JGNN.core.util.Sort
-
 
-
sortedIndexes(ArrayList<Double>) - Static method in class mklab.JGNN.core.util.Sort
-
 
-
SortPooling - Class in graphClassification
-
 
-
SortPooling() - Constructor for class graphClassification.SortPooling
-
 
-
SparseMatrix - Class in mklab.JGNN.core.matrix
-
-
A sparse Matrix that allocates memory only for non-zero elements.
-
-
SparseMatrix(long, long) - Constructor for class mklab.JGNN.core.matrix.SparseMatrix
-
-
Generates a sparse matrix with the designated number of rows and columns.
-
-
SparseSymmetric - Class in mklab.JGNN.core.matrix
-
-
Deprecated. -
Under development.
-
-
-
SparseSymmetric(long, long) - Constructor for class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
-
Generates a symmetric matrix with the designated number of rows and columns.
-
-
SparseTensor - Class in mklab.JGNN.core.tensor
-
-
This class provides a sparse Tensor with many zero elements.
-
-
SparseTensor() - Constructor for class mklab.JGNN.core.tensor.SparseTensor
-
 
-
SparseTensor(long) - Constructor for class mklab.JGNN.core.tensor.SparseTensor
-
 
-
sqrt() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the square root of tensor elements.
-
-
startTape() - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
submit(Runnable) - Method in class mklab.JGNN.core.ThreadPool
-
-
Submits a runnable to be executed at some future point by a thread, - for example via ThreadPool.getInstance().submit(new Runnable(){public void run(){...}});.
-
-
subtensorShouldAccessCorrectElements() - Method in class mklab.JGNN.core.TensorTest
-
 
-
subtract(Tensor) - Method in class mklab.JGNN.core.Tensor
-
 
-
sum() - Method in class mklab.JGNN.core.Tensor
-
 
-
Sum - Class in mklab.JGNN.nn.pooling
-
-
Implements a NNOperation that performs row-wise or column-wise - sum reduction on vector tensors or matrices.
-
-
Sum() - Constructor for class mklab.JGNN.nn.pooling.Sum
-
 
-
Sum(boolean) - Constructor for class mklab.JGNN.nn.pooling.Sum
-
 
-
symmetricMatrixShouldWork() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
symmetricNormalization() - Method in class mklab.JGNN.core.Matrix
-
-
Creates a copy of the Matrix that holds its symmetrically normalized version.
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-18.html b/docs/index-files/index-18.html deleted file mode 100644 index 4f23161c..00000000 --- a/docs/index-files/index-18.html +++ /dev/null @@ -1,361 +0,0 @@ - - - - -T-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

T

-
-
tanh(double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The tanh activation (exp(x)-exp(-x))/(exp(x)+exp(-x))
-
-
tanh(Tensor) - Static method in interface mklab.JGNN.core.util.Loss
-
-
Applies Loss.tanh(double) element-by-element.
-
-
Tanh - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs a tanh transformation of its single input.
-
-
Tanh() - Constructor for class mklab.JGNN.nn.activations.Tanh
-
 
-
tanhDerivative(double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of the Loss.tanh(double) function.
-
-
tanhDerivative(Tensor) - Static method in interface mklab.JGNN.core.util.Loss
-
-
Applies Loss.tanhDerivative(double) function.
-
-
Tensor - Class in mklab.JGNN.core
-
-
This class provides a native java implementation of Tensor functionalities.
-
-
Tensor(long) - Constructor for class mklab.JGNN.core.Tensor
-
-
Construct that creates a tensor of zeros given its number of elements
-
-
TensorTest - Class in mklab.JGNN.core
-
 
-
TensorTest - Class in mklab.JGNN
-
 
-
TensorTest() - Constructor for class mklab.JGNN.core.TensorTest
-
 
-
TensorTest() - Constructor for class mklab.JGNN.TensorTest
-
 
-
testAddition() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testAsColum() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testAsRow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testAssertFinite() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testAssertNotFinite() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testAssertSize() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testCopy() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testDenseTensorSerialization() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testDescription() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testDimensions() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testDot() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testDoubleConversion() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testDoubleConversion() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testFiniteDerivative() - Method in class mklab.JGNN.core.util.LossTest
-
 
-
testFiniteLoss() - Method in class mklab.JGNN.core.util.LossTest
-
 
-
testGetOverflow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testGetUnderflow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testImpossibleMultiplication() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testIncompatibleOperation() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testInvalidSubtensorConstructorArgument() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testInverse() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testLargeCrossEntropyDerivativeLabel() - Method in class mklab.JGNN.core.util.LossTest
-
 
-
testMatrixMultiplication() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testMultiplication() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testMultiplicationWithZero() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testNegativeCrossEntropyDerivativeLabel() - Method in class mklab.JGNN.core.util.LossTest
-
 
-
testNegativeCrossEntropyDerivativePrediction() - Method in class mklab.JGNN.core.util.LossTest
-
 
-
testNewTensorCreation() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testNonbinaryCrossEntropyDerivativeLabel() - Method in class mklab.JGNN.core.util.LossTest
-
 
-
testNormalization() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testNullTensorDeerialization() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testNumeric() - Method in class mklab.JGNN.TensorTest
-
 
-
testNumNonZero() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testOneHotNumNonZero() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testPut() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testPutInfinity() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testPutNan() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testPutOverflow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testPutUnderflow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRange() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRange2D() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testRange2DOutOfBounds() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testRangeOutOfBounds() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensor() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensorCopy() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensorMultiplication() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensorNonFinite() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensorOverflow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensorPut() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testRepeatTensorUnderflow() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSelfOperations() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSetToRandom() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSubtensorCopy() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSubtensorOriginalAccess() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSubtensorWrongEnd() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSubtensorWrongRange() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSubtensorWrongStart() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testSummaryStatistics() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testTensorDimensions() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testToProbability() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testToString() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testTransform() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testTransposition() - Method in class mklab.JGNN.core.MatrixTest
-
 
-
testTripleDot() - Method in class mklab.JGNN.core.TensorTest
-
 
-
testZeroCopy() - Method in class mklab.JGNN.core.TensorTest
-
 
-
ThreadPool - Class in mklab.JGNN.core
-
-
This class provides thread execution pool utilities while keeping track of thread - identifiers for use by thread-specific NNOperation.
-
-
To - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that lists the second element of the 2D matrix element iterator.
-
-
To() - Constructor for class mklab.JGNN.nn.operations.To
-
 
-
toArray() - Method in class mklab.JGNN.core.Tensor
-
-
Retrieves a representation of the Tensor as an array of doubles.
-
-
toDense() - Method in class mklab.JGNN.core.Matrix
-
-
Creates a copy of the matrix organized as a dense matrix.
-
-
toDouble() - Method in class mklab.JGNN.core.Tensor
-
-
Converts a tensor of Tensor.size()==1 to double.
-
-
toNonZeroString() - Method in class mklab.JGNN.core.Matrix
-
 
-
toProbability() - Method in class mklab.JGNN.core.Tensor
-
 
-
toSparse() - Method in class mklab.JGNN.core.Matrix
-
-
Creates a copy of the matrix organized as a sparse matrix.
-
-
toString() - Method in class mklab.JGNN.core.Matrix
-
 
-
toString() - Method in class mklab.JGNN.core.Tensor
-
-
A string serialization of the tensor that can be used by the constructor DenseTensor(String) to create an identical copy.
-
-
train(Tensor[], Tensor) - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
train(Loss, Optimizer, List<Tensor>, List<Tensor>) - Method in class mklab.JGNN.nn.Model
-
-
Performs the training of #train(Optimizer, List, List, List) for unit weights.
-
-
train(Loss, Optimizer, List<Tensor>, List<Tensor>, List<Tensor>) - Method in class mklab.JGNN.nn.Model
-
-
Performs one parameter adjustment step (e.g.
-
-
train(Model, Matrix, Matrix, Slice, Slice) - Method in class mklab.JGNN.nn.ModelTraining
-
-
Trains a Model instance based on current settings.
-
-
train(ModelTraining, Matrix, Matrix, Slice, Slice) - Method in class mklab.JGNN.nn.Model
-
-
Trains the model by appropriately calling - ModelTraining.train(Model, Matrix, Matrix, Slice, Slice) - with the provided parameters.
-
-
trainOnOutputError(Tensor[], Tensor) - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
trainTowardsZero(Optimizer, List<Tensor>) - Method in class mklab.JGNN.nn.Model
-
-
Is equivalent to calling Model.train(Loss, Optimizer, List, List) - for new Zero() loss.
-
-
TrajectoryData - Class in graphClassification
-
-
This class generates trajectory graph labels.
-
-
TrajectoryData(int) - Constructor for class graphClassification.TrajectoryData
-
 
-
transform(Tensor) - Method in class mklab.JGNN.core.Matrix
-
-
Performs the linear algebra transformation A*x where A is this matrix and x a vector
-
-
Transpose - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that performs matrix transposition.
-
-
Transpose() - Constructor for class mklab.JGNN.nn.operations.Transpose
-
 
-
transposed() - Method in class mklab.JGNN.core.Matrix
-
-
Creates a transposed copy of the matrix.
-
-
TransposedMatrix - Class in mklab.JGNN.core.matrix
-
-
Generates a transposed version of a base matrix, with which it shares elements.
-
-
TransposedMatrix(Matrix) - Constructor for class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.tensor.AccessSubtensor
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.tensor.DenseTensor
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
traverseNonZeroElements() - Method in class mklab.JGNN.core.Tensor
-
-
Retrieves positions within the tensor that may hold non-zero elements.
-
-
tutorial - package tutorial
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-19.html b/docs/index-files/index-19.html deleted file mode 100644 index b68ded1b..00000000 --- a/docs/index-files/index-19.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -U-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

U

-
-
Uniform - Class in mklab.JGNN.core.distribution
-
-
Implements a Uniform Distribution of given bounds.
-
-
Uniform() - Constructor for class mklab.JGNN.core.distribution.Uniform
-
-
Instantiates a uniform distribution that samples values from the range [0,1].
-
-
Uniform(double, double) - Constructor for class mklab.JGNN.core.distribution.Uniform
-
-
Instantiates a uniform distribution that samples values from the given range [from, to].
-
-
unregister(double[]) - Method in class mklab.JGNN.core.Memory.Scope
-
 
-
update(Tensor, Tensor) - Method in interface mklab.JGNN.nn.Optimizer
-
-
In-place updates the value of a tensor given its gradient.
-
-
update(Tensor, Tensor) - Method in class mklab.JGNN.nn.optimizers.Adam
-
 
-
update(Tensor, Tensor) - Method in class mklab.JGNN.nn.optimizers.BatchOptimizer
-
 
-
update(Tensor, Tensor) - Method in class mklab.JGNN.nn.optimizers.GradientDescent
-
 
-
update(Tensor, Tensor) - Method in class mklab.JGNN.nn.optimizers.Regularization
-
 
-
updateAll() - Method in class mklab.JGNN.nn.optimizers.BatchOptimizer
-
-
Updates all tracked variables with pending batch calculations using the - wrapped optimizer.
-
-
updateTape(Tensor, LSTM.LSTMState, Tensor) - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-2.html b/docs/index-files/index-2.html deleted file mode 100644 index e2005259..00000000 --- a/docs/index-files/index-2.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -B-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

B

-
-
BatchOptimizer - Class in mklab.JGNN.nn.optimizers
-
-
Wraps an Optimizer by accumulating derivatives and calling - Optimizer.update(Tensor, Tensor) with the average derivative - after a fixed number of accumulations.
-
-
BatchOptimizer(Optimizer) - Constructor for class mklab.JGNN.nn.optimizers.BatchOptimizer
-
-
Initializes a BatchOptimizer that accumulates derivatives and updates them - only when BatchOptimizer.updateAll() is called.
-
-
BatchOptimizer(Optimizer, long) - Constructor for class mklab.JGNN.nn.optimizers.BatchOptimizer
-
-
Initializes a BatchOptimizer that accumulates derivatives and updates them - with BatchOptimizer.updateAll() after every fixed number of updates.
-
-
BinaryCrossEntropy - Class in mklab.JGNN.nn.loss
-
-
Implements a binary cross-entropy Loss.
- For more than one output dimensions use CategoricalCrossEntropy
-
-
BinaryCrossEntropy() - Constructor for class mklab.JGNN.nn.loss.BinaryCrossEntropy
-
-
Initializes binary cross entropy with 1.E-12 epsilon value.
-
-
BinaryCrossEntropy(double) - Constructor for class mklab.JGNN.nn.loss.BinaryCrossEntropy
-
-
Initializes binary cross entropy with and epsilon value - to bound its outputs in the range [log(epsilon), -log(epsilon)] instead of (-inf, inf).
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-20.html b/docs/index-files/index-20.html deleted file mode 100644 index 1c6079e4..00000000 --- a/docs/index-files/index-20.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -V-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

V

-
-
var(String) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares a component with the given name to be used as an input - of the managed model.
-
-
var(String) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
Variable - Class in mklab.JGNN.nn.inputs
-
-
Implements a NNOperation that represents Model inputs.
-
-
Variable() - Constructor for class mklab.JGNN.nn.inputs.Variable
-
 
-
VariancePreservingInitializer - Class in mklab.JGNN.nn.initializers
-
-
This class describes a broad class of Initializer strategies, in which - dense neural layer initialization is controlled so that variance is mostly preserved from - inputs to outputs to avoid vanishing or exploding gradients in the first training - runs.
-
-
VariancePreservingInitializer() - Constructor for class mklab.JGNN.nn.initializers.VariancePreservingInitializer
-
 
-
view() - Method in class mklab.JGNN.nn.NNOperation
-
-
Retrieves a string that views internal data being processed by the current thread, - including gradients.
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-21.html b/docs/index-files/index-21.html deleted file mode 100644 index 88a07004..00000000 --- a/docs/index-files/index-21.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -W-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

W

-
-
waitForConclusion() - Method in class mklab.JGNN.core.ThreadPool
-
-
Waits until all threads in the pool have finished.
-
-
WrapCols - Class in mklab.JGNN.core.matrix
-
-
Wraps a list of tensors into a matrix with the tensors as columns.
-
-
WrapCols(List<Tensor>) - Constructor for class mklab.JGNN.core.matrix.WrapCols
-
 
-
WrapCols(Tensor...) - Constructor for class mklab.JGNN.core.matrix.WrapCols
-
 
-
WrapRows - Class in mklab.JGNN.core.matrix
-
-
Wraps a list of tensors into a matrix with the tensors as rows.
-
-
WrapRows(List<Tensor>) - Constructor for class mklab.JGNN.core.matrix.WrapRows
-
 
-
WrapRows(Tensor...) - Constructor for class mklab.JGNN.core.matrix.WrapRows
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-22.html b/docs/index-files/index-22.html deleted file mode 100644 index aa84f500..00000000 --- a/docs/index-files/index-22.html +++ /dev/null @@ -1,75 +0,0 @@ - - - - -X-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

X

-
-
XavierNormal - Class in mklab.JGNN.nn.initializers
-
-
This is a VariancePreservingInitializer.
-
-
XavierNormal() - Constructor for class mklab.JGNN.nn.initializers.XavierNormal
-
 
-
XavierUniform - Class in mklab.JGNN.nn.initializers
-
-
This is a VariancePreservingInitializer.
-
-
XavierUniform() - Constructor for class mklab.JGNN.nn.initializers.XavierUniform
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-23.html b/docs/index-files/index-23.html deleted file mode 100644 index 136bf8ea..00000000 --- a/docs/index-files/index-23.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - -Z-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

Z

-
-
zeroCopy() - Method in class mklab.JGNN.core.Matrix
-
-
Creates a Matrix with the same class and dimensions and all element set to zero.
-
-
zeroCopy() - Method in class mklab.JGNN.core.Tensor
-
-
Creates a tensor of the same class with the same size and all element set to zero.
-
-
zeroCopy(long) - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
zeroCopy(long) - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
zeroCopy(long) - Method in class mklab.JGNN.core.Matrix
-
-
Creates a Matrix with the same class and dimensions and all element set to zero.
-
-
zeroCopy(long) - Method in class mklab.JGNN.core.tensor.AccessSubtensor
-
 
-
zeroCopy(long) - Method in class mklab.JGNN.core.tensor.DenseTensor
-
 
-
zeroCopy(long) - Method in class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
zeroCopy(long) - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
zeroCopy(long) - Method in class mklab.JGNN.core.Tensor
-
-
Creates a tensor of the same class with a given size and all element set to zero.
-
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
zeroCopy(long, long) - Method in class mklab.JGNN.core.Matrix
-
-
Creates a matrix of the same class and all element set to zero, but with - a given number of rows and columns.
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-3.html b/docs/index-files/index-3.html deleted file mode 100644 index 1c41fc6a..00000000 --- a/docs/index-files/index-3.html +++ /dev/null @@ -1,200 +0,0 @@ - - - - -C-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

C

-
-
cast(Class<Type>) - Method in class mklab.JGNN.core.Tensor
-
-
Performs the equivalent of Java's typecasting that fits - in functional interfaces.
-
-
CategoricalCrossEntropy - Class in mklab.JGNN.nn.loss
-
-
Implements a categorical cross-entropy Loss.
- For binary classification of one output use BinaryCrossEntropy
-
-
CategoricalCrossEntropy() - Constructor for class mklab.JGNN.nn.loss.CategoricalCrossEntropy
-
-
Initializes categorical cross entropy with 1.E-12 epsilon value.
-
-
CategoricalCrossEntropy(double) - Constructor for class mklab.JGNN.nn.loss.CategoricalCrossEntropy
-
-
Initializes categorical cross entropy with and epsilon value - to bound its outputs in the range [log(epsilon), -log(epsilon)] instead of (-inf, inf).
-
-
Citeseer - Class in mklab.JGNN.adhoc.datasets
-
-
Downloads and constructs the Citeseer node classification Dataset.
-
-
Citeseer() - Constructor for class mklab.JGNN.adhoc.datasets.Citeseer
-
 
-
classes() - Method in class mklab.JGNN.adhoc.Dataset
-
-
Retrieves a converter that maps class names to label dimentions.
-
-
classification - package classification
-
 
-
classify() - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Adds a classification layer that gather the number of inputs nodes - and applies softmax on all of them.
-
-
clearPrediction() - Method in class mklab.JGNN.nn.NNOperation
-
 
-
ColumnRepetition - Class in mklab.JGNN.core.matrix
-
-
Defines a matrix whose columns are all a copy of a Tensor.
-
-
ColumnRepetition(long, Tensor) - Constructor for class mklab.JGNN.core.matrix.ColumnRepetition
-
-
Instantiates a matrix repeating a tensor to be treated as a column.
-
-
Complement - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that performs the operation 1-x for its simple input x.
-
-
Complement() - Constructor for class mklab.JGNN.nn.operations.Complement
-
 
-
concat(int) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Concatenates horizontally the output of a number of given layers, - starting from the last one and going backwards.
-
-
concat(int) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Concatenates horizontally the output of a number of given layers, - starting from the last one and going backwards.
-
-
Concat - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that concatenates its two matrix inputs.
-
-
Concat() - Constructor for class mklab.JGNN.nn.operations.Concat
-
 
-
config(String, double) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares a configuration hyperparameter, which can be used to declare - matrix and vector parameters during ModelBuilder.operation(String) expressions.
-
-
config(String, double) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
 
-
config(String, double) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
constant(String, double) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares a non-learnable constant component with the given name.
-
-
constant(String, double) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
 
-
constant(String, double) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
constant(String, Tensor) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Declares a non-learnable constant component with the given name.
-
-
constant(String, Tensor) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
 
-
constant(String, Tensor) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
 
-
Constant - Class in mklab.JGNN.nn.inputs
-
-
Implements a NNOperation that holds a constant tensor.
-
-
Constant(Tensor) - Constructor for class mklab.JGNN.nn.inputs.Constant
-
-
Creates a constant holding a tensor.
-
-
contains(Object) - Method in class mklab.JGNN.adhoc.IdConverter
-
-
Checks whether the object has been registered with IdConverter.getOrCreateId(Object).
-
-
copy() - Method in class mklab.JGNN.core.Tensor
-
-
Creates a Tensor.zeroCopy() and transfers to it all potentially non-zero element values.
-
-
Cora - Class in mklab.JGNN.adhoc.datasets
-
-
Downloads and constructs the Cora node classification Dataset.
-
-
Cora() - Constructor for class mklab.JGNN.adhoc.datasets.Cora
-
 
-
createFirstState() - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
crossEntropy(double, double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
A cross entropy loss for one sample computes as -label*log(output) -(1-label)*log(1-output).
-
-
crossEntropyDerivative(double, double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of the Loss.crossEntropy(double, double) loss.
-
-
crossEntropyDerivativeCategorical(double, double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of the #crossEntropyCategorical(double, double) loss.
-
-
crossEntropySigmoidDerivative(double, double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of crossEntropy(sigmoid(x), label) with respect to x.
-
-
crossEntropyTanhDerivative(double, double) - Static method in interface mklab.JGNN.core.util.Loss
-
-
The derivative of crossEntropy(tanh(x), label) with respect to x.
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-4.html b/docs/index-files/index-4.html deleted file mode 100644 index 4732d5f1..00000000 --- a/docs/index-files/index-4.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - -D-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

D

-
-
Dataset - Class in mklab.JGNN.adhoc
-
-
This class provides the backbone with which to define datasets.
-
-
Dataset() - Constructor for class mklab.JGNN.adhoc.Dataset
-
 
-
debugging - Variable in class mklab.JGNN.nn.NNOperation
-
 
-
DenseMatrix - Class in mklab.JGNN.core.matrix
-
-
Implements a dense Matrix where all elements are stored in memory.
-
-
DenseMatrix(long, long) - Constructor for class mklab.JGNN.core.matrix.DenseMatrix
-
-
Generates a dense matrix with the designated number of rows and columns.
-
-
DenseTensor - Class in mklab.JGNN.core.tensor
-
-
This class provides a dense Tensor that wraps an array of doubles.
-
-
DenseTensor() - Constructor for class mklab.JGNN.core.tensor.DenseTensor
-
 
-
DenseTensor(double...) - Constructor for class mklab.JGNN.core.tensor.DenseTensor
-
 
-
DenseTensor(long) - Constructor for class mklab.JGNN.core.tensor.DenseTensor
-
-
Constructs a dense tensor holding zero values.
-
-
DenseTensor(String) - Constructor for class mklab.JGNN.core.tensor.DenseTensor
-
-
Reconstructs a serialized Tensor (i.e.
-
-
DenseTensor(Iterator<? extends Number>) - Constructor for class mklab.JGNN.core.tensor.DenseTensor
-
-
Constructs a dense tensor from an iterator holding - that outputs its values.
-
-
density() - Method in class mklab.JGNN.core.Tensor
-
-
Provides the memory allocation density of Tensor.getNonZeroElements() - compare to the size of the tensor.
-
-
derivative(Tensor, Tensor) - Method in class mklab.JGNN.nn.loss.Accuracy
-
 
-
derivative(Tensor, Tensor) - Method in class mklab.JGNN.nn.loss.BinaryCrossEntropy
-
 
-
derivative(Tensor, Tensor) - Method in class mklab.JGNN.nn.loss.CategoricalCrossEntropy
-
 
-
derivative(Tensor, Tensor) - Method in class mklab.JGNN.nn.Loss
-
-
Provides the derivative of a loss function at its evaluation point.
-
-
describe() - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Creates a description of the builded model's internal execution graph.
-
-
describe() - Method in class mklab.JGNN.core.Matrix
-
 
-
describe() - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
describe() - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
describe() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
describe() - Method in class mklab.JGNN.core.Tensor
-
-
Describes the type, size and other characteristics of the tensor.
-
-
describe() - Method in class mklab.JGNN.nn.NNOperation
-
-
Retrieves an concise description of the operation that shows metadata - and potential data descriptions processed by the current thread.
-
-
Diagonal - Class in mklab.JGNN.core.matrix
-
-
Implements a square matrix whose diagonal elements are determined by the correspond values of - an underlying tensor and off-diagonal elements are zero.
-
-
Distribution - Interface in mklab.JGNN.core
-
-
This interface abstracts a probability distribution - that can be passed to Tensor.setToRandom(Distribution) - for random tensor initialization.
-
-
dot(Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Performs the dot product between this and another tensor.
-
-
dot(Tensor, Tensor) - Method in class mklab.JGNN.core.Tensor
-
-
Performs the triple dot product between this and two other tensors.
-
-
Dropout - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that converts its first argument to a ColumnRepetition matrix - with a number of columns equal to the second argument.
-
-
Dropout() - Constructor for class mklab.JGNN.nn.operations.Dropout
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-5.html b/docs/index-files/index-5.html deleted file mode 100644 index f8b2069b..00000000 --- a/docs/index-files/index-5.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - -E-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

E

-
-
endTape() - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
enter() - Method in class mklab.JGNN.core.Memory.Scope
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.Tensor
-
-
Provides an estimation for the non-zero number of elements stored in the tensor, - where this number is equal to the size for dense tensors, but equal to the actual - number of non-zero elements for sparse tensors.
-
-
estimateNumNonZeroElements() - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
evaluate(Tensor, Tensor) - Method in class mklab.JGNN.nn.loss.Accuracy
-
 
-
evaluate(Tensor, Tensor) - Method in class mklab.JGNN.nn.loss.BinaryCrossEntropy
-
 
-
evaluate(Tensor, Tensor) - Method in class mklab.JGNN.nn.loss.CategoricalCrossEntropy
-
 
-
evaluate(Tensor, Tensor) - Method in class mklab.JGNN.nn.Loss
-
-
Provides a numerical evaluation of a loss function, so that - lower values correspond to better predictions.
-
-
exit() - Method in class mklab.JGNN.core.Memory.Scope
-
 
-
Exp - Class in mklab.JGNN.nn.activations
-
-
Implements a NNOperation that performs an exponential transformation of its single input.
-
-
Exp() - Constructor for class mklab.JGNN.nn.activations.Exp
-
 
-
expMinusOne() - Method in class mklab.JGNN.core.Tensor
-
-
Computes the exponential minus 1 of tensor elements.
-
-
external(Tensor, Tensor) - Static method in class mklab.JGNN.core.Matrix
-
-
Produces the external product of two tensors.
-
-
eye(long) - Static method in class mklab.JGNN.core.Matrix
-
-
Creates a sparse unit matrix.
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-6.html b/docs/index-files/index-6.html deleted file mode 100644 index 26258aab..00000000 --- a/docs/index-files/index-6.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - -F-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

F

-
-
FastBuilder - Class in mklab.JGNN.adhoc.parsers
-
-
Extends the capabilities of LayeredBuilder to use - for node classification.
-
-
FastBuilder() - Constructor for class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Deprecated. -
This constructor should only be used by loading.
-
-
-
FastBuilder(Matrix, Matrix) - Constructor for class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Creates a graph neural network builder from an - normalized adjacency matrix and a node feature matrix.
-
-
features - Variable in class graphClassification.TrajectoryData
-
 
-
features() - Method in class mklab.JGNN.adhoc.Dataset
-
-
Retrieves the dataset's feature matrix.
-
-
forward(List<Tensor>) - Method in class mklab.JGNN.nn.activations.L1
-
 
-
forward(List<Tensor>) - Method in class mklab.JGNN.nn.operations.Attention
-
 
-
forward(List<Tensor>) - Method in class mklab.JGNN.nn.pooling.Mean
-
 
-
forward(List<Tensor>) - Method in class mklab.JGNN.nn.pooling.Sum
-
 
-
From - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that lists the first element of the 2D matrix element iterator.
-
-
From() - Constructor for class mklab.JGNN.nn.operations.From
-
 
-
fromDouble(double) - Static method in class mklab.JGNN.core.Matrix
-
-
Converts a given value to a JGNN-compatible 1x1 matrix.
-
-
fromDouble(double) - Static method in class mklab.JGNN.core.Tensor
-
-
Converts a given value to a JGNN-compatible dense tensor.
-
-
fromRange(long) - Static method in class mklab.JGNN.core.Tensor
-
-
Creates a dense tensor holding the desired range [0, 1, ..., end-1].
-
-
fromRange(long, long) - Static method in class mklab.JGNN.core.Tensor
-
-
Creates a dense tensor holding the desired range [start, start+1, ..., end-1].
-
-
futureConfigs(String, Function<Integer, Double>, int) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Defines a number of FastBuilder.config(String, double) symbols involving a {l} - notation, for example so that they can be used during FastBuilder.layerRepeat(String, int).
-
-
futureConfigs(String, Function<Integer, Double>, int) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Defines a number of LayeredBuilder.config(String, double) symbols involving a {l} - notation, for example so that they can be used during LayeredBuilder.layerRepeat(String, int).
-
-
futureConstants(String, Function<Integer, Double>, int) - Method in class mklab.JGNN.adhoc.parsers.FastBuilder
-
-
Defines a number of FastBuilder.constant(String, double) symbols involving a {l} - notation, for example so that they can be used during FastBuilder.layerRepeat(String, int).
-
-
futureConstants(String, Function<Integer, Double>, int) - Method in class mklab.JGNN.adhoc.parsers.LayeredBuilder
-
-
Defines a number of LayeredBuilder.constant(String, double) symbols involving a {l} - notation, for example so that they can be used during LayeredBuilder.layerRepeat(String, int).
-
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-7.html b/docs/index-files/index-7.html deleted file mode 100644 index 8ff30214..00000000 --- a/docs/index-files/index-7.html +++ /dev/null @@ -1,323 +0,0 @@ - - - - -G-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

G

-
-
GAT - Class in nodeClassification
-
 
-
GAT() - Constructor for class nodeClassification.GAT
-
 
-
Gather - Class in mklab.JGNN.nn.operations
-
-
Implements a NNOperation that performs the equivalent of TensorFlow's gather operation.
-
-
Gather() - Constructor for class mklab.JGNN.nn.operations.Gather
-
 
-
GCN - Class in nodeClassification
-
-
Demonstrates classification with the GCN architecture.
-
-
GCN() - Constructor for class nodeClassification.GCN
-
 
-
GCNII - Class in nodeClassification
-
 
-
GCNII() - Constructor for class nodeClassification.GCNII
-
 
-
get() - Method in class mklab.JGNN.nn.inputs.Parameter
-
-
Gets sets the parameter's value tensor
-
-
get(long) - Method in class mklab.JGNN.adhoc.IdConverter
-
-
Retrieves the object corresponding to a given identifier.
-
-
get(long) - Method in class mklab.JGNN.core.matrix.AccessCol
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.AccessRow
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
get(long) - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
get(long) - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
get(long) - Method in class mklab.JGNN.core.tensor.AccessSubtensor
-
 
-
get(long) - Method in class mklab.JGNN.core.tensor.DenseTensor
-
 
-
get(long) - Method in class mklab.JGNN.core.Tensor
-
-
Retrieves the value of a tensor element at a given position.
-
-
get(long) - Method in class mklab.JGNN.core.tensor.RepeatTensor
-
 
-
get(long) - Method in class mklab.JGNN.core.tensor.SparseTensor
-
 
-
get(long, long) - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves the value stored at a matrix element.
-
-
get(String) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Retrieves the NNOperation registered with the provided - name, for example to investigates its value.
-
-
getColName() - Method in class mklab.JGNN.core.Matrix
-
 
-
getCols() - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves the number of columns of a matrix.
-
-
getColumn() - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
-
Retrieves the wrapped column tensor.
-
-
getCurrentThreadId() - Static method in class mklab.JGNN.core.ThreadPool
-
-
Retrieves a unique integer indicating the currently running thread.
-
-
getDepthLastOperations() - Method in class mklab.JGNN.nn.Model
-
-
Retrieves a list of operations by traversing the model's execution - graph with the depth-first algorithm in the inverse edge - order (starting from the outputs).
-
-
getDescription() - Method in class mklab.JGNN.nn.NNOperation
-
 
-
getDeviation() - Method in interface mklab.JGNN.core.Distribution
-
-
Retrieves the distribution's standard deviation.
-
-
getDeviation() - Method in class mklab.JGNN.core.distribution.Normal
-
 
-
getDeviation() - Method in class mklab.JGNN.core.distribution.Uniform
-
 
-
getDimensionName() - Method in class mklab.JGNN.core.Tensor
-
 
-
getDimensionSize(String) - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves the value of the dimension with the given name.
-
-
getExecutionGraphDot() - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Exports the builded model's execution graph into a .dot format - representation.
-
-
getId(Object) - Method in class mklab.JGNN.adhoc.IdConverter
-
-
Retrieves an identifier.
-
-
getInputs() - Method in class mklab.JGNN.nn.Model
-
-
Retrieves a list of model inputs.
-
-
getInputs() - Method in class mklab.JGNN.nn.NNOperation
-
-
Retrieves a list of input operations within a model's execution graph.
-
-
getInstance() - Static method in class mklab.JGNN.core.ThreadPool
-
-
Retrieves the singleton ThreadPool instance used by JGNN.
-
-
getLastTapeError() - Method in class mklab.JGNN.nn.NNOperation
-
 
-
getMean() - Method in interface mklab.JGNN.core.Distribution
-
-
Retrieves the distribution's mean.
-
-
getMean() - Method in class mklab.JGNN.core.distribution.Normal
-
 
-
getMean() - Method in class mklab.JGNN.core.distribution.Uniform
-
 
-
getMemory() - Method in class mklab.JGNN.nn.operations.LSTM.LSTMState
-
 
-
getModel() - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Retrieves the model currently built by the builder.
-
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.Exp
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.LRelu
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.NExp
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.PRelu
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.Relu
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.Sigmoid
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.activations.Tanh
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.NNOperation
-
-
Retrieves the degree of non-linearity of the operation - to be used by VariancePreservingInitializer.
-
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.operations.MatMul
-
 
-
getNonLinearity(int, double, double) - Method in class mklab.JGNN.nn.operations.Multiply
-
 
-
getNonZeroElements() - Method in class mklab.JGNN.core.Tensor
-
-
Retrieves an iterable that wraps Tensor.traverseNonZeroElements().
-
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.ColumnRepetition
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.DenseMatrix
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.Diagonal
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves an iterable that traverses (row, col) entry pairs - of non zero entries.
-
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.RepeatMatrix
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.RowRepetition
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.SparseMatrix
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.SparseSymmetric
-
-
Deprecated.
- 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.TransposedMatrix
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.WrapCols
-
 
-
getNonZeroEntries() - Method in class mklab.JGNN.core.matrix.WrapRows
-
 
-
getOptimizer() - Method in class mklab.JGNN.nn.operations.LSTM
-
 
-
getOrCreateId(Object) - Method in class mklab.JGNN.adhoc.IdConverter
-
-
Retrieves an identifier for a given object, creating one if none exists.
-
-
getOutput() - Method in class mklab.JGNN.nn.operations.LSTM.LSTMState
-
 
-
getOutputs() - Method in class mklab.JGNN.nn.Model
-
-
Retrieves a list of model outputs.
-
-
getOutputs() - Method in class mklab.JGNN.nn.NNOperation
-
-
Retrieves a list of output operations within a model's execution graph.
-
-
getParameters() - Method in class mklab.JGNN.nn.Model
-
-
Retrieves a list of all parameters eventually leading to the model's outputs.
-
-
getPrediction() - Method in class mklab.JGNN.nn.NNOperation
-
 
-
getRowName() - Method in class mklab.JGNN.core.Matrix
-
 
-
getRows() - Method in class mklab.JGNN.core.Matrix
-
-
Retrieves the number of rows of a matrix.
-
-
getSimpleDescription() - Method in class mklab.JGNN.nn.NNOperation
-
-
Provides a simple description to show when drawing .dot format diagrams.
-
-
getSimpleDescription() - Method in class mklab.JGNN.nn.operations.Reshape
-
 
-
getSlice() - Method in class mklab.JGNN.adhoc.IdConverter
-
-
Returns a slice of all registered identifiers.
-
-
GradientDescent - Class in mklab.JGNN.nn.optimizers
-
-
Implements a gradient descent Optimizer.
-
-
GradientDescent(double) - Constructor for class mklab.JGNN.nn.optimizers.GradientDescent
-
-
Initializes a GradientDescent optimizer with fixed learning rate.
-
-
GradientDescent(double, double) - Constructor for class mklab.JGNN.nn.optimizers.GradientDescent
-
-
Initializes a GradientDescent optimizer with degrading learning rate.
-
-
graph() - Method in class mklab.JGNN.adhoc.Dataset
-
-
Retrieves the dataset's graph.
-
-
graphClassification - package graphClassification
-
 
-
graphs - Variable in class graphClassification.TrajectoryData
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-8.html b/docs/index-files/index-8.html deleted file mode 100644 index 01a1ff16..00000000 --- a/docs/index-files/index-8.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -H-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

H

-
-
hasComponent(String) - Method in class mklab.JGNN.adhoc.ModelBuilder
-
-
Checks whether the builder has added to its managed model a component of - the given name.
-
-
hasNext() - Method in class mklab.JGNN.core.util.Range
-
 
-
hasNext() - Method in class mklab.JGNN.core.util.Range2D
-
 
-
HetGCN - Class in nodeClassification
-
 
-
HetGCN() - Constructor for class nodeClassification.HetGCN
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index-files/index-9.html b/docs/index-files/index-9.html deleted file mode 100644 index 4bf88f70..00000000 --- a/docs/index-files/index-9.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - -I-Index - - - - - - - - - - - - - - - -
- -
-
-
-

Index

-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages -

I

-
-
IdConverter - Class in mklab.JGNN.adhoc
-
-
Converts back-and-forth between objects and unique ids.
-
-
IdConverter() - Constructor for class mklab.JGNN.adhoc.IdConverter
-
-
Instantiates an empty converter to be filled with IdConverter.getOrCreateId(Object).
-
-
IdConverter(List<?>) - Constructor for class mklab.JGNN.adhoc.IdConverter
-
-
Instantiates the converter on a list of objects to register - with IdConverter.getOrCreateId(Object) on.
-
-
init(Initializer) - Method in class mklab.JGNN.nn.Model
-
-
Apply the provided initializer on the model to set first values to its - parameters.
-
-
Initializer - Class in mklab.JGNN.nn
-
-
This class defines an abstract interface for applying initializers to models.
-
-
Initializer() - Constructor for class mklab.JGNN.nn.Initializer
-
 
-
inverse() - Method in class mklab.JGNN.core.Tensor
-
 
-
isCachable() - Method in class mklab.JGNN.nn.inputs.Constant
-
 
-
isCachable() - Method in class mklab.JGNN.nn.inputs.Parameter
-
 
-
isCachable() - Method in class mklab.JGNN.nn.inputs.Variable
-
 
-
isCachable() - Method in class mklab.JGNN.nn.NNOperation
-
-
Checks whether the operation's output should be cached given - that it is a constant.
-
-
isCachable() - Method in class mklab.JGNN.nn.operations.Dropout
-
 
-
isCachable() - Method in class mklab.JGNN.nn.operations.From
-
 
-
isCachable() - Method in class mklab.JGNN.nn.operations.Reshape
-
 
-
isCachable() - Method in class mklab.JGNN.nn.operations.To
-
 
-
isConstant() - Method in class mklab.JGNN.nn.inputs.Constant
-
 
-
isConstant() - Method in class mklab.JGNN.nn.inputs.Parameter
-
 
-
isConstant() - Method in class mklab.JGNN.nn.inputs.Variable
-
 
-
isConstant() - Method in class mklab.JGNN.nn.NNOperation
-
-
Checks whether the operation yields a constant output, - so that propagation does not try to compute partial derivatives for it.
-
-
isEnabled() - Method in class mklab.JGNN.nn.operations.Dropout
-
 
-
iterator() - Method in class mklab.JGNN.core.Slice
-
 
-
iterator() - Method in class mklab.JGNN.core.Tensor
-
 
-
iterator() - Method in class mklab.JGNN.core.util.Range
-
 
-
iterator() - Method in class mklab.JGNN.core.util.Range2D
-
 
-
-A B C D E F G H I K L M N O P R S T U V W X Z 
All Classes and Interfaces|All Packages
-
-
- - diff --git a/docs/index.html b/docs/index.html index 364af3d9..ea077e96 100644 --- a/docs/index.html +++ b/docs/index.html @@ -1,107 +1,1393 @@ - + + - -Overview - - - - - - - - - - - + + + JGNN + + + + - - - -
- -
-
- -
-
-
+ + + + +
+

JGNN

+

Graph Neural Networks (GNNs) are getting more and more popular, for example to + make predictions based on relational information, or to perform inference + on small datasets. JGNN provides cross-platform implementations of this machine + learning paradigm that do not require dedicated hardware or firmware. While + reading this guidebook, keep in mind that this is not a library for running + computationally intensive architectures; it has no GPU support and does not + plan to add any (unless the latter becomes integrated in the base Java virtual + machine). Instead, the goal is to provide highly portable solutions + that can run under smaller compute and available memory. So, while complex + architectures like gated attention networks with many layers and hidden dimensions + can be created using the libary, running them fastly may require compromises + in terms of the number of learned parameters or computational complexity. + The forte of JGNN lies is porting more lightweight counterparts in applications + grappling with limited resources.

+ +
+

1. Setup

+

The simplest way to set up JGNN is to download it as JAR package from + the project's releases + and add it in a Java project's dependencies. However, those working with Maven + or Gradle can also add JGNN's latest release as a dependency from the JitPack + repository. Follow the link below for full instructions.
+ download JGNN +

+

+ For instance, the fields in the snippet below may be added in a maven .pom file + to work with the latest nightly release.

+ 
<repositories>
+	<repository>
+		<id>jitpack.io</id>
+		<url>https://jitpack.io</url>
+	</repository>
+</repositories>
+<dependencies>
+	<dependency>
+		<groupId>com.github.MKLab-ITI</groupId>
+		<artifactId>JGNN</artifactId>
+		<version>v1.3.20-nightly</version>
+	</dependency>
+</dependencies>
+
+ +
+

2. Quickstart

+ +

Here we demonstrate JGNN on a node classification + task. Graph classification is also supported, but we choose the simpler + concept for a first taste. For this task, GNN architectures are typically written + as message-passing mechanisms that diffuse node representations across graphs, + and our demonstration focuses on this scenario. In particular, + node neighbors pick up, aggregate (e.g., average), and transform + incoming representations to update theirs. Alternatives that boast higher + expressive power do exist and are also supported, but simple architectures + may be just as good or better than complex alternatives in solving + practical problems + [Krasanakis et al., 2024]. + Simple architectures also enjoy reduced resource consumption. Before delving deeper + into JGNN's functionalities, you are encouraged to work with + the boilerplate code snippets provided here.

+ + +

Before starting with Java code, below we build some neural components + in a scripting language called Neurallang. JGNN can parse strings containing such definitions + to create trainable models with little effort. Other ways to declare + architectures exist too, but Neuralang declarations fully decouple GNN architectures from Java code. + Notice that the language is function-based, where double dots : + indicate set or default hyperparameter values. Furthermore, the Neuralang keyword + extern indicates a value declared by the parsing Java code, + whereas values prepended with ! are broadcasted everywhere. + Matrices and vectors are declared as required based on their dimensions and + regulariation hyperparameter, where ? indicates hyperparameters + that are dynamically determined when parsing the code with Java. + More details on Neuralang are presented later.

+ + 
fn classify(nodes, h, epochs: !3000, patience: !100, lr: !0.01) {
+	return softmax(h[nodes], dim: "row");
+}
+fn gcnlayer(A, h, hidden: 16, reg: 0.005) {
+	return A@h@matrix(?, hidden, reg) + vector(hidden);
+}
+fn gcn(A, h, classes: extern) {
+	h = gcnlayer(A, h);
+	h = dropout(relu(h), 0.5);
+	return gcnlayer(A, h, hidden: classes);
+}
+fn ngcn(A, h, nodes) {  // a node classification gcn
+	return classify(nodes, gcn(A,h));
+}
+ + +

Let us now move to the GNN code. + We first load the Cora dataset from those shipped + with the library for usage in prototyping and testing. The first time this dataset + runs, it automatically downloads some data and stores them in a local downloads/ + folder. The data are then loaded into a graph adjacency matrix, node features, + and node labels. Before doing anything else, we apply the renormalization trick, + which makes GNN computations numerically stable by adding self-loops to all nodes. + We also create a symmetric normalization of the adjacency matrix. which is required + by the model we impelement next. Both operations use in-place arithmetics to + directly alter raw data.

+ + 
Dataset dataset = new Cora();
+dataset.graph().setMainDiagonal(1).setToSymmetricNormalization();
+ + +

We now need to generate a trainable model. In GNNs, models are generated from model builders. + These differ by which Neuralang capabilities they can parse - mainly whether they go beyond + support of simple expressions involving operators only. The builder chosen here supports the whole + language, but in turn misses out on some Java-side methods that help fill parts of the architecture + with boilerplate patterns. To use the selected builder, save the first Neuralang snippet + to a file and retrieve it with the + expression String architecture = Paths.get("filename.nn");. + (Use a Rust language highlighter for visual assistance when writting in Neuralang.) + Alternatively, avoid external files by inlining the definition within Java code through + a multiline string per String architecture = """ ... """;. + This string is parsed within a functional programming chain, where + each method call returns the modelBuilder instance to continue calling more methods. +

+ +

For our model builder, we set remaining hyperparameters and overwrite the default value + for "hidden" using the + .config(String, double) method. We also determine + which variables are constants, namely the adjacency matrix A and node + representation h, and that node identifiers is a variable that serves + as the architecture's inputs. There could be multiple inputs, so this distinction of what + is a constant and what is a variable depends mostly on the which quantities change + during training. In the case of node classification, both the adjacency matrix and + node features remain constant, as we work in one graph. Finally, the definition + sets an Neuralang expression as the architecture's output + by calling the .out(String) method, + and applies the .autosize(Tensor...) method to infer hyperparameter + values denoted with ? from an example input (for faster inference, we + provide dataless list of node identifiers as input).

+ + 
long numSamples = dataset.samples().getSlice().size();
+long numClasses = dataset.labels().getCols();
+ModelBuilder modelBuilder = new Neuralang()
+	.parse(architecture)
+	.constant("A", dataset.graph())
+	.constant("h", dataset.features())
+	.var("nodes")
+	.config("classes", numClasses)
+	.config("hidden", numClasses+2)
+	.out("ngcn(A, h, nodes)")
+	.autosize(new EmptyTensor(numSamples));
+ +
+ + +
+

3. GNN Builders

+

We already touched on the subject of GNN architecture builders when the Neuralang language + was first introduced in the introductory demonstration. To recap, there are different kinds of + builders, some of which do not implement all features of the language in favor of + simplifying parts of architecture definitions with hard-coded Java implementations. + Here we cover the base GNNBuilder class that can only parse simple expressions, + the FastBuilder class that introduces node classification boilerplate code, + and the Neuralang class that parses the full language, including function definitions + and handling configurations through expressions.

+ +

3.1. ModelBuilder

+ [Under construction] + +

So far, we have discussed the propagation mechanisms of + GNNs, which consider the features of all nodes. However, + in a node classification setting, training data labels + are typically available only for certain nodes. We thus + need a mechanism to retrieve the predictions of the top + neural layer for certain nodes and pass them through a + softmax activation.

+ +

This can be achieved with normal neural model definitions + using the gather bracket operation after declaring a + variable of which nodes to retrieve:

+ + 
.var("nodes")
+.layer("h{l} = softmax(h{l})")
+.operation("output = h{l}[nodes]")
+ +

Recall that h{l} always points to the top + layer when writing a new layer. This way, the built + model takes as inputs a set of nodes, performs the + forward pass of the architecture, and then selects the + provided nodes to use as outputs (and backpropagate + from). All nodes are needed for + training because they are made aware of each other via + the graph's structure. + To simplify how node classification architectures are + defined, the above symbolic snippet is automatically + generated and applied by calling the + .classify() method of the + FastBuilder instead. +

+ + +

3.2. FastBuilder

+

The FastBuilder class for building GNN architectures extends the generic + LayerBuilder with common graph neural network operations. The main difference + is that it is initialized with a square matrix A, which is typically expected to + be a normalization of the (sparse) adjacency matrix, and a feature matrix h0. + This builder annotates layer representations with h{l} for the last layer + and h{l+1} for the next one, where the layer counter symbol {l} + is incremented by one when, instead of simply parsing an expression, the .layer(String) + method is used. Before tackling layer definitions, the builder is instantiated in the way shown below. + Be careful that sending specific tensors to the builder's constructor still allows external + edits. +

+ + 
FastBuilder modelBuilder = new FastBuilder(adjacency, features);
+ +

The base operation of message passing GNNs, which are often used for node classification, + is to propagate node representations to neighbors via graph edges. Then, neighbors aggregate + the received representation, where aggregation typically consists of a weighted average per + the normalized adjacency matrix's edge weights. For symmetric normalization, this the + weighted sum is compatible with spectral graph signal processing. The operation to perform + one propagation can be written as .layer("h{l+1}=A @ h{l}"). + However, the propagation's outcome is often further transformed further by passing through a dense + layer. This is demonstrated in the following snippet, where two layers of propagation and + dense transformation are stacked. Usage of the layer counter symbol {l} lets + the written code read similarly to what you would find in a paper.

+ + 
modelBuilder
+	.layer("h{l+1}=relu(A@(h{l}@matrix(features, hidden, reg))+vector(hidden))")
+	.layer("h{l+1}=A@(h{l}@matrix(hidden, classes, reg))+vector(classes)");
+ +

Many architectures also perform edge dropout, which is as simple as applying dropout on the adjacency + matrix on each layer like so: .layer("h{l+1}=dropout(A,0.5) @ h{l}"). + However, performance gains of this practice tend to be minimal in research papers, and we recommend + ignoring this practice in favor of faster computations; although only non-zero + elements of sparse matrices are + +

Recent areas of heterogeneous graph research explicitly + use the graph Laplacian, which you can insert into the + architecture as a normal constant like so: .constant("L", adjacency.negative().cast(Matrix.class).setMainDiagonal(1)) + More complex concepts can be modeled with edge attention, + which gathers and performs the dot product of edge nodes + to provide new edge weights. This yields an adjacency + matrix weighting unique to the layer per: .operation("A{l} = L1(nexp(att(A, h{l})))"). + However, it is recommended to stay away from these kinds + of complex architectures when learning from large + graphs, as JGNN is designed to be lightweight and not + fast. Consider using other systems to learn complex GNNs in GPUs + if 1-2% accuracy gains are worth the loss of portability.

+ + +

3.3. Neuralang

+ [Under construction] + +

3.4. Debugging

+

JGNN offers high-level tools for debugging + architectures. Here we cover what errors to + expect, what diagnostics to run, and how to make + sense of error messages to fix erroneous + architectures. First, When parsing operations, + values should be assigned to variables before + subsequent use. Model builders, including the + NeuraLang builder, check for unused + variables and raise respective runtime + exceptions. For example, consider a FastBuilder that + tries to parse the following expression, where hl is a typographical error of + h{l}. An exception is thrown.

+ + 
.layer("h{l+1}=relu(hl@matrix(features, 32, reg)+vector(32))")
+ 
Exception in thread "main" java.lang.RuntimeException: Symbol hl not defined.
+ +

Model builders are responsible for creating + and managing directed acyclic graphs (DAGs) in models + they are creating. DAGs are not to be confused with graph + inputs GNNs manage, but are just an organization of + Java components. During parsing, builders + may create temporary variables, which start with + the _tmp prefix and are followed by + a number. Temporary variables often link + components to other that use them. + The easiest way to understand execution DAGs is + to look at them. The library provides two tools + for this purpose: a .print() method + that prints built functional flows in the system + console, and a .getExecutionGraphDot() + method that returns a String holding the execution graph in + .dot format for visualization with + tools like GraphViz. +

+ +

Another error-checking procedure consists of + checking for model operations that do not + eventually reach any outputs, for example, one + of the output operation outcomes defined by + .out(String). Avoiding this + behavior is important as it messes with graph + traversal counting during backpropagation. + To accommodate complex use cases, these + checks are manually performed, and expected at + the end of model building with the + method .assertBackwardValidity() + that throws an exception if an invalid model is found. + Performing this assertion early on in + model building will likely throw exceptions that + are not logical errors, given that independend + outputs may be combined later. Backward validity errors + look like this the following example. This + indicates that the component + _tmp102 does not lead to an output, + and we should look at the execution tree to + understand its role.

+ + 
Exception in thread "main" java.lang.RuntimeException: The component class mklab.JGNN.nn.operations.Multiply: _tmp102 = null does not lead to an output
+at mklab.JGNN.nn.ModelBuilder.assertBackwardValidity(ModelBuilder.java:504)
+at nodeClassification.APPNP.main(APPNP.java:45)
+ +
+ +

There are two main mechanisms for identifying +logically erroneous architectures: a) mismatched +dimension size, and b) mismatched dimension +names. Of the two, dimension sizes are easier to +comprehend since they just mean that operations +are mathematically invalid.

+ +

On the other hand, dimension names need to be +determined for starting data, such as model +inputs and parameters, and are automatically +inferred from operations on such primitives. For +in-line declaration of parameters in operations +or layers, dimension names are copied from any +hyperparameters. Therefore, for easier +debugging, prefer using functional expressions +that declare hyperparameters:

+ +
new ModelBuilder()
+.config("features", 7)
+.config("hidden", 64)
+.var("x")
+.operation("h = x@matrix(features, hidden)");
+ +

instead of the simpler:

+ +
new ModelBuilder().var(x).operation("h = x@matrix(features, hidden)")
+ +

Both mismatched dimensions and mismatched + dimension names throw runtime exceptions. The + beginning of their error console traces should + start with something like this:

+ +
java.lang.IllegalArgumentException: Mismatched matrix sizes between SparseMatrix (3327,32) 52523/106464 entries and DenseMatrix (64, classes 6)
+During the forward pass of class mklab.JGNN.nn.operations.MatMul: _tmp4 = null with the following inputs:
+class mklab.JGNN.nn.activations.Relu: h1 = SparseMatrix (3327,32) 52523/106464 entries
+class mklab.JGNN.nn.inputs.Parameter: _tmp5 = DenseMatrix (64, classes 6)
+java.lang.IllegalArgumentException: Mismatched matrix sizes between SparseMatrix (3327,32) 52523/106464 entries and DenseMatrix (64, classes 6)
+at mklab.JGNN.core.Matrix.matmul(Matrix.java:258)
+at mklab.JGNN.nn.operations.MatMul.forward(MatMul.java:21)
+at mklab.JGNN.nn.NNOperation.runPrediction(NNOperation.java:180)
+at mklab.JGNN.nn.NNOperation.runPrediction(NNOperation.java:170)
+at mklab.JGNN.nn.NNOperation.runPrediction(NNOperation.java:170)
+at mklab.JGNN.nn.NNOperation.runPrediction(NNOperation.java:170)
+at mklab.JGNN.nn.NNOperation.runPrediction(NNOperation.java:170)
+at mklab.JGNN.nn.NNOperation.runPrediction(NNOperation.java:170)
+...
+ +

For example, this tells us that the architecture + encounters mismatched matrix sizes when trying + to multiply a 3327x32 SparseMatrix with a 64x6 + dense matrix. Understanding the exact error is + easy—the inner matrix dimensions of matrix + multiplication do not agree. However, we need to + find the error within our architecture to fix + it.

+ +

To do this, continue reading and see the message + During the forward pass of class mklab.JGNN.nn.operations.MatMul: _tmp4 = null. This tells us that the problem + occurs when trying to calculate + _tmp4, which is currently assigned + a null tensor as value. Some more + information is available to see what the + operation's inputs are like—in this case, they + coincide with the multiplication's inputs, but + this will not always be the case. +

+ +

The important point is to go back to the + execution tree and see during which exact + operation this variable is defined. There, we + will undoubtedly find that some dimension had 64 + instead of 32 elements or conversely.

+ +

Monitoring Operations

+

In addition to all other debugging mechanisms, +JGNN presents a way to show when forward and +backward operations of specific code components +are executed and with what kinds of arguments. +This can be particularly useful when testing new +components in real (complex) architectures. +The practice consists of calling a +monitor(...) function within +operations. This does not affect what +expressions do and only enables printing +execution tree operations on operation +components. For example, the next snippet +monitors the outcome of matrix multiplication: +

+
builder.operation("h = relu(monitor(x@matrix(features, 64)) + vector(64))")
+ +

3.4. Generalized message passing

+

Similarly, JGNN also supports the the fully generized + message-passing scheme between node neighbors to support + complex types of relational analysis, such as edge attributes. + However, this option may be computationally intense compared + to simpler alternatives. In this generalization, + each edge is responsible for appropriately + transforming and propagating representations to + node neighbors. This process can capture various + settings of interest + [Velickovic, 2022]. + In the more general sense, messages in GNNs can + be matrices whose rows correspond to edges and + columns to edge features. In the simplest scenario, you + can create such matrices by gathering the features of edge + source anddestination nodes by accessing the respective + elements of a feature matrix + h{l}. To do this, first + obtain edge source indexes + src=from(A) and destination indexes + dst=to(A) where A is + an adjacency matrix: +

+ + 
modelBuilder
+	.operation("src=from(A)")
+	.operation("dst=to(A)")
+	.operation("message{l}=h{l}[src] | h{l}[dst]");
+ +

The model builder parses | as the + horizontal concatenation expression. One may + also construct a global independent edge feature + matrix and concatenate that as well.

+ +

Given a constructed message, continue by defining any kind of ad-hoc + mechanism or neural processing of messages with + traditional matrix operations (take care to define correct matrix sizes + for dense transformations, e.g., twice the number of + columns as H{l} in the previous + snippet). For any kind of LayeredBuilder, + don't forget that message{l} within + operations is needed to obtain a message from the representations + h{l} that is not accidentally shared with future layers. +

+ +

Receiver mechanisms need to perform some kind of + reduction on messages. JGNN implements summation + reduction, given that this has the same + theoretical expressive power as maximum-based + reduction but is easier to backpropagate + through. Perform this like so:

+ + 
modelBuilder
+	.operation("received{l}=reduce(transformed_message{l}, A)")
+ +

Note that the sum is weighted per the values of + the adjacency matrix A. Thus, + perform adjacency matrix normalization only if + you want such weighting to occur.

+ +

You can finally define layers that transform node + representations while accounting for received + messages:

+ + 
modelBuilder
+	.config("2feats{l}", ...)
+	.layer("h{l+1}=(h{l} | received{l})@matrix(2feats,dims) + vector(dims)")
+ +

where 2feats{l} is configured to a + matching number of dimensions as the sum of the + number of columns of h{l} and + transformed_message{l}. +

+ +

A common realization of message-passing GNNs is + via sparse-dense matrix multiplication to + emulate neighbor attention per + A.(hTh), where + A is a sparse adjacency matrix, + . is the Hadamard product + (element-by-element multiplication), and + h is a dense matrix whose rows hold + respective node representations. JGNN implements + this operation, and you can include it in + symbolic definitions with the expression + att(A, h). Its implementation is + considerably more lightweight than the + equivalent message-passing mechanism. +

+ +

True neighbor attention in the style of gated + attention networks can be implemented by + exponentiating all non-zero elements of the + adjacency matrix and performing row-wise + normalization per L1(nexp(att(A, h))).

+ + + +

As an example of how to define a full GNN with symbolic + parsing, let's define the well-known APPNP architecture. + This architecture comprises two dense layers and + propagates their predictions through the graph structure + with a fixed-depth approximation of the personalized + PageRank algorithm.

+ +

To define the architecture, let's consider a + Dataset dataset loaded by the library, for + which we normalize the adjacency matrix and send + everything to the GNN builder class. We let the outcome + of the first two dense layers be remembered as + h{0} (this is not + h0), define a diffusion rate constant + a, and then perform 10 times the + personalized PageRank diffusion scheme on a graph with + edge dropout of 0.5. This is all achieved with the same + layer and layerRepeat methods + as neural builders: +

+ + 
dataset.graph().setMainDiagonal(1).setToSymmetricNormalization();
+long numClasses = dataset.labels().getCols();
+
+ModelBuilder modelBuilder = new FastBuilder(dataset.graph(), dataset.features())
+	.config("reg", 0.005)
+	.config("hidden", 16)
+	.config("classes", numClasses)
+	.layer("h{l+1}=relu(h{l}@matrix(features, hidden, reg)+vector(hidden))")
+	.layer("h{l+1}=h{l}@matrix(hidden, classes)+vector(classes)")
+	.rememberAs("0")
+	.constant("a", 0.9)
+	.layerRepeat("h{l+1} = a*(dropout(A, 0.5)@h{l})+(1-a)*h{0}", 10)
+	.classify();
+ +

GNN classification models can be backpropagated by + considering a list of node indices and desired + predictions for those nodes. However, you can also use + the interfaces discussed in the learning tutorial + to automate the training process and control it in a + fixed manner.

+ +

Recall that training requires calling the model's method + .train(optimizer, features, labels, train, + valid). The important question is what to + consider as training inputs and outputs, given that node + features and the graph are passed to the + FastBuilder constructor. +

+ +

The answer is that the (ordered) list of all node + identifiers 0,1,2,... constitutes the + training inputs and the corresponding labels constitute + the outputs. You can create a slice of identifiers and + use JGNN to design the training process:

+ + 
Slice nodes = dataset.samples().getSlice().shuffle(100);  // or nodes = new Slice(0, numNodes).shuffle(100);
+Model model = modelBuilder()
+.getModel()
+.init(...)
+.train(trainer,
+   nodes.samplesAsFeatures(), 
+   dataset.labels(), 
+   nodes.range(0, trainSplit), 
+   nodes.range(trainSplit, validationSplit));
+ +

In the above snippet, the label matrix can have zeros for + the nodes not used for training. If only the first nodes + have known labels, the label matrix may also have fewer + rows.

+ + + +
+

4. Create Data

+

If you have been following the tutorial, we have only used + automatically downloaded datasets till now. In practice, you + will want to use your own data. Here, we cover how to manually + fill in data, as well as which operations are provided to manipulate + those data. Read more of these operations to learn how to process neural + inputs, post-process learning outcomes, create custom + parameters, contribute to the library with more components, + or make derivative works based on native Java vector and + matrix arithmetics. Covered operations are also performed + under-the-hood by Neuralang, so there is no need to dive in + too deep in the first read of this guidebook. +

+ +

4.1. Fill in data

+

In the simplest case, both the number of nodes or data samples, and + the number of feature dimensions are known beforehand. If so, create + dense feature matrices with the following code. This uses the + minimum memory necessary to construct the feature matrix. If + features are dense (do not have a lot of zeros), + consider using the DenseMatrix class + instead of initializing a sparse matrix, like below.

+ + 
Matrix features = new SparseMatrix(numNodes, numFeatures);
+for(long nodeId=0; nodeId<numNodes; nodeId++)
+	for(long featureId=0; featureId<numFeatures; featureId++)
+		features.put(nodeId, featureId, 1);
+
+ +

Sometimes, it is easier to read node or sample features + line-by-line, for instance, when reading a .csv + file. In this case, store each line as a separate tensor, + so that list of row tensors can then be converted into a + feature matrix like in the example below.

+ + 
ArrayList rows = new ArrayList();
+try(BufferedReader reader = new BufferedReader(new FileReader(file))){
+	String line = reader.readLine();
+	while (line != null) {
+		String[] cols = line.split(",");
+		Tensor features = new SparseTensor(cols.length);
+		for(int col=0;col<cols.length;col++)
+			features.put(col, Double.parseDouble(cols[col]));
+		rows.add(features);
+		line = reader.readLine();
+	}
+}
+Matrix features = new WrapRows(rows).toSparse();
+ + +

Creating adjacency matrices is similar to creating + preallocated feature matrices. When in doubt, use the sparse + format for adjacency matrices, as their allocated memory scales + with the square of the number of nodes. Note that many GNNs + consider bidirectional (i.e., non-directed) edges, in which case + both should be added together. Use the following snippet as a + template for constructing adjacency matrices. Recall that JGNN + follows a function chain notation; in this case, each modification + returns the matrix instance for further modifications. + Don't forget to normalize or apply the + renormalization trick (self-edges) on matrices if these + are needed by your architecture, for instance by calling + adjacency.setMainDiagonal(1).setToSymmetricNormalization(); + after matrix construction.

+ + 
Matrix adjacency = new SparseMatrix(numNodes, numNodes);
+for(Entry<Long, Long> edge : edges)
+	matrix
+		.put(edge.getKey(), edge.getValue(), 1)
+		.put(edge.getValue(), edge.getKey(), 1);
+ +

4.2. Identifiers

+

The above snippets all make use of numerical node identifiers. To + manage these, JGNN provides an IdConverter class. + You can convert hashable + objects (e.g., Strings) to identifiers by calling + IdConverter.getOrCreateId(object). The same + functionality is also helpful for one-hot encoding of + class labels. To search only for previously + registered identifiers, use + IdConverter.get(object). + For example, construct a label matrix of one-hot + encodings for training data:

+ + 
IdConverter nodeIds = new IdConverter();
+IdConverter classIds = new IdConverter();
+for(Entry entry : nodeLabels) {
+	nodeids.getOrCreateId(entry.getKey());
+	classIds.getOrCreateId(entry.getValue());
+}
+Matrix labels = new SparseMatrix(nodeIds.size(), classIds.size());
+for(Entry entry : nodeLabels) 
+labels.put(nodeids.get(entry.getKey()), classIds.get(entry.getValue()), 1);
+ +

Reverse-search the IdConverter to obtain the original object + of predictions using IdConverter.get(String). For example: +

+ + 
long nodeId = nodeIds.get("nodeName");
+Tensor prediction = labels.accessRow(nodeId);
+long predictedClassId = prediction.argmax();
+System.out.println(classIds.get(predictedClassId));
+ + +

4.3. Tensor Operations

+

Tensor operations are performed element-by-element and + can be split into the following categories:

+ +
    +
  • arithmetic - combine the values of + two tensors to create a new one
    • +
  • in-place arithmetic - combine the + values of two tensors to alter the first one
    • +
  • summary statistics - output simple + numeric values
    • +
  • element access - manipulation of + specific values
    • +
+ +

In-place arithmetics follow the same naming + conventions of base arithmetics and begin with a "self" + prefix for pairwise operations or "setTo" prefix to + perform operators. First we present commonly used operations + applicable to all tensors, whose functionality is inferable from + their name and argument types.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
OperationTypeComments
Tensor copy()arithmetic
Tensor zeroCopy()arithmeticZero copies share the same type with the + tensor and comprise only zeros.
Tensor add(Tensor)arithmetic
Tensor substract(Tensor)arithmetic
Tensor multiply(Tensor)arithmeticMultiplication is performed + element-by-element.
Tensor multiply(double)arithmetic
Tensor normalized()arithmeticDivision with L2 norm (if non-zero).
Tensor toProbability()arithmeticDivision with the sum (if non-zero).
Tensor setToZero()in-place arithmetic
Tensor selfAdd(Tensor)in-place arithmetic
Tensor selfSubtract(Tensor)in-place arithmetic
Tensor setMultiply(Tensor)in-place arithmetic
Tensor selfMultiply(double)in-place arithmetic
Tensor setToRandom()in-place arithmeticelement selected from uniform distribution + in the range [0,1]
Tensor setToOnes()in-place arithmetic
Tensor setToNormalized()in-place arithmeticDivision with L2 norm (if non-zero).
Tensor setToProbability()in-place arithmeticDivision with the sum (if non-zero).
double dot(Tensor)summary statistics
double norm()summary statisticsThe L2 norm.
double sum()summary statistics
double max()summary statistics
double min()summary statistics
long argmax()summary statistics
long argmin()summary statistics
double toDouble()summary statisticsConverts tensor with exactly one element to + a double (throws exception if more + elements).
Tensor set(long position, double value)element accessIs in-place.
double get(long position)element access
Iterator getNonZeroElements()element accessTraverses all elements for dense + tensors, but skips zero elements for + sparse tensors. (Guarantee: there is no + non-zero element not traversed.) Returns + element positions. To write code that + accommodates both dense and + sparse tensors, ensure that iterating over indices + elements is performed with this method.
String describe()summary statisticsDescription of type and dimensions.
+ +

Prefer in-place arithmetic operations when + transforming tensor values or for intermediate + calculation steps, as these do not allocate new + memory. For example, the following code can be + used for creating and normalizing a tensor of + ones without using additional memory:

+ + 
Tensor normalized = new DenseTensor(10).setToOnes().setToNormalized();
+ +

Initialize a dense or sparse tensor with their number + of elements. If there are many zero elements expected, + prefer using a sparse tensor.

+ + 
Tensor denseTensor = new mklab.JGNN.tensor.DenseTensor(long size);
+Tensor sparseTensor = new mklab.JGNN.tensor.SparseTensor(long size);
+ +

For example, one-hot encodings for classification + problems can be generated with the following + code. This creates a dense tensor with + numClasses elements and puts at + element classId the value 1: +

+ + 
int classId = ...;
+int numClasses = ...;
+Tensor oneHotEncoding = new mklab.JGNN.tensor.DenseTensor(numClasses).set(classId, 1);
+ +

Dense tensors are serialized with their + String toString() method and can be + deserialized into new tensors with the + constructor + mklab.JGNN.tensor.DenseTensor(String). +

+

The Matrix class extends the concept + of tensors with additional operations. Under the + hood, matrices linearly store elements and use + computations to transform the (row, col) + position of their elements to respective + positions. The outcome of some methods inherited + from tensors may need to be typecast back into a + matrix (e.g., for all in-place operations).

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
OperationTypeComments
Matrix onesMask()arithmeticCopy of a matrix with elements set + to one.
Matrix transposed()arithmeticThere is no method for in-place + transposition.
Matrix asTransposed()arithmeticShares data with the original.
Tensor getRow(long)arithmeticShares data with the original.
Tensor getCol(long)arithmeticShares data with the original.
Tensor transform(Tensor x)arithmeticOutputs a dense tensor that holds + the linear transformation of the + given tensor (using it as a column + vector) by multiplying it with the + matrix.
Matrix matmul(Matrix with)arithmeticOutputs the matrix multiplication + **this \* with**. There is no + in-place matrix multiplication.
Matrix matmul(Matrix with, boolean transposeSelf, boolean transposeWith)arithmeticDoes not perform memory allocation + to compute transpositions.
Matrix external(Tensor horizontal, Tensor vertical)static methodExternal product of two tensors. Is a dense matrix.
Matrix symmetricNormalization()in-place arithmeticThe symmetrically normalized matrix.
Matrix setToSymmetricNormalization()in-place arithmeticThe symmetrically normalized matrix.
Matrix setMainDiagonal(double value)in-place arithmeticSets diagonal elements.
Matrix setDiagonal(long diagonal, double value)in-place arithmeticSets diagonal elements.
Matrix put(long row, long col, double value)element accessIs in-place.
Iterable<entry<long, Long>> getNonZeroEntries()element accessSimilar to getNonZeroElements() but iterates through (row, col)pairs.
+ +

4.4. Named Dimensions

+

In addition to other operations, some methods + do not affect tensor or matrix values but + are only responsible for naming dimensions. + Functionally, these are decorative and aim + to improve debugging by throwing errors for + incompatible non-null names. For example, + adding two matrices with different dimension + names will result in an error. Likewise, the + inner dimension names during matrix + multiplication should agree. + Arithmetic operations, including + matrix multiplication and copying, + automatically infer dimension names in the + result to ensure only compatible data types + are compared. Dimension names can be freely + changed for any Tensor without + backtracking changes (even for see-through + data types, such as the outcome of + asTransposed()). + Matrices effectively have three + dimension names: for their rows, columns, + and inner data as long as they are treated + as tensors.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
OperationTypeComments
Tensor setDimensionName(String name)arithmeticFor naming tensor dimensions (of + the 1D space tensors lie + in).
Tensor setRowName(String rowName)arithmeticFor naming what kind of + information matrix rows hold + (e.g., "samples").
Tensor setColName(String colName)arithmeticFor naming what kind of + information matrix columns hold + (e.g., "features").
Tensor setDimensionName(String rowName, String colName)arithmeticA shorthand of calling + setRowName(rowName).setColName(colName). +
+ + + +
+

5. Training

+

Most neural network architectures are designed with the idea + of learning to classify nodes or samples. However, GNNs also + provide the capability to classify entire graphs based on + their structure. To define architectures for graph classification, we use + the generic LayeredBuilder class. The main + difference compared to traditional neural networks is + that architecture inputs do not all exhibit the same + size (e.g., some graphs may have more nodes than others) + and therefore cannot be organized into tensors of common + dimensions. Instead, assume that training data are stored in the + following lists:

+ + 
ArrayList adjacencyMatrices = new ArrayList();
+ArrayList nodeFeatures = new ArrayList();
+ArrayList graphLabels = new ArrayList();
+ +

The LayeredBuilder class introduces the + input variable h0 for sample + features. We can use it to pass node features to the + architecture, so we only need to add a second input + storing the (sparse) adjacency matrix:

+ + 
.var("A")
+ +

We can then proceed to define a GNN architecture, for + instance as explained in previous tutorials. This time, + though, we aim to classify entire graphs rather than + individual nodes. For this reason, we need to pool top + layer node representations, for instance by averaging + them across all nodes:

+ + 
.layer("h{l+1}=softmax(mean(h{l}, dim: 'row'))")
+ +

Finally, we need to set up the top layer as the built + model's output per: .out("h{l}") + An example architecture following these principles follows:

+ + 
ModelBuilder builder = new LayeredBuilder()
+    .var("A")  
+    .config("features", nodeLabelIds.size())
+    .config("classes", graphLabelIds.size())
+    .config("hidden", 16)
+    .layer("h{l+1}=relu(A@(h{l}@matrix(features, hidden)))") 
+    .layer("h{l+1}=relu(A@(h{l}@matrix(hidden, classes)))") 
+    .layer("h{l+1}=softmax(mean(h{l}, dim: 'row'))")
+    .out("h{l}");
+ +
+

Training the Architecture

+

For the time being, training architectures like the above + on prepared data requires manually calling the + backpropagation for each epoch and each graph in the + training batch. To do this, first retrieve the model and + initialize its parameters:

+ + 
Model model = builder.getModel().init(new XavierNormal());
+ +

Next, define a loss function and set up a batch + optimization strategy wrapping any base optimizer and + accumulating parameter updates until + BatchOptimizer.updateAll() is called later + on: +

+ + 
Loss loss = new CategoricalCrossEntropy();
+BatchOptimizer optimizer = new BatchOptimizer(new Adam(0.01));
+ +

Finally, training can be conducted by iterating through + epochs and training samples and appropriately calling + the Model.train for combinations of node + features and graph adjacency matrix inputs and graph + label outputs. At the end of each batch (e.g., each + epoch), don't forget to call the + optimizer.updateAll() method to apply the + accumulated gradients. This process can be realized with + the following code: +

+ + 
for(int epoch=0; epoch<300; epoch++) {
+    for(int graphId=0; graphId<graphLabels.size(); graphId++) {
+         Matrix adjacency = adjacencyMatrices.get(graphId);
+         Matrix features = nodeFeatures.get(graphId);
+         Tensor label = graphLabels.get(graphId);
+         model.train(loss, optimizer, 
+              Arrays.asList(features, adjacency), 
+              Arrays.asList(label));
+    }
+    optimizer.updateAll();
+}
+
+ +
+

Sort Pooling

+

Up to now, the example code performs a naive mean pooling + across all graph node features. However, this can prove + insufficient for the top layers, and more sophisticated + pooling mechanisms can be deployed to let GNNs + differentiate between the structural positioning of + nodes to be pooled.

+ +

One computationally light approach to pooling, which JGNN + implements, is sorting nodes based on learned features + before concatenating their features into one vector for + each graph. This process is further simplified by + keeping the top reduced number of nodes to + concatenate their features, where the order is + determined by an arbitrarily selected feature (in our + implementation: the last one, with the previous feature + being used to break ties, and so on).

+ +

The idea is that the selected feature determines + important nodes whose information can be + adopted by others. To apply the above operations, JGNN + provides independent operations to sort nodes, gather + node latent representations, and reshape matrices into + row or column tensors with learnable transformations to + class outputs. These components are demonstrated in the + following code snippet: +

+ + 
long reduced = 5;  // input graphs need to have at least that many nodes
+long hidden = 8;  // many latent dims reduce speed without GPU parallelization
+
+ModelBuilder builder = new LayeredBuilder()        
+    .var("A")  
+    .config("features", 1)
+    .config("classes", 2)
+    .config("reduced", reduced)
+    .config("hidden", hidden)
+    .layer("h{l+1}=relu(A@(h{l}@matrix(features, hidden))+vector(hidden))")
+    .layer("h{l+1}=relu(A@(h{l}@matrix(hidden, hidden))+vector(hidden))")
+    .concat(2) // concatenates the outputs of the last 2 layers
+    .config("hiddenReduced", hidden*2*reduced)  // 2* due to concatenation
+    .operation("z{l}=sort(h{l}, reduced)")
+    .layer("h{l+1}=reshape(h{l}[z{l}], 1, hiddenReduced)")
+    .layer("h{l+1}=h{l}@matrix(hiddenReduced, classes)")
+    .layer("h{l+1}=softmax(h{l}, dim: 'row')")
+    .out("h{l}");
+
+ +
+

Parallelized Training

+

To speed up graph classification, you can use JGNN's + parallelization capabilities to calculate gradients + across multiple threads. Parallelization for node + classification holds little meaning, as the same + propagation mechanism needs to be run on the same graph + in parallel. However, this process yields substantial + speedup for the graph classification + problem.

+ +

Parallelization can make use of JGNN's thread pooling to + perform gradients, wait for the conclusion of submitted + tasks, and then apply all gradient updates. This is + achieved by declaring a batch optimizer to gather all + the gradients. The entire process is detailed in the + following example:

+ + 
for(int epoch=0; epoch<500; epoch++) {
+    // gradient update
+    for(int graphId=0; graphId<dtrain.adjucency.size(); graphId++) {
+        int graphIdentifier = graphId;
+        ThreadPool.getInstance().submit(new Runnable() {
+            @Override
+            public void run() {
+                Matrix adjacency = dtrain.adjucency.get(graphIdentifier);
+                Matrix features= dtrain.features.get(graphIdentifier);
+                Tensor graphLabel = dtrain.labels.get(graphIdentifier).asRow();  
+                model.train(loss, optimizer, 
+		            Arrays.asList(features, adjacency), 
+		            Arrays.asList(graphLabel));
+            }
+        });
+    }
+    ThreadPool.getInstance().waitForConclusion();  // waits for all gradients to finish calculating
+    optimizer.updateAll();
+
+    double acc = 0.0;
+    for(int graphId=0; graphId<dtest.adjucency.size(); graphId++) {
+        Matrix adjacency = dtest.adjucency.get(graphId);
+        Matrix features= dtest.features.get(graphId);
+        Tensor graphLabel = dtest.labels.get(graphId);
+        if(model.predict(Arrays.asList(features, adjacency)).get(0).argmax()==graphLabel.argmax())
+           acc += 1;
+        System.out.println("iter = " + epoch + "  " + acc/dtest.adjucency.size());
+    }
+}
+
+
+ +
+ + + + - + + \ No newline at end of file diff --git a/docs/jquery-ui.overrides.css b/docs/jquery-ui.overrides.css deleted file mode 100644 index 1abff952..00000000 --- a/docs/jquery-ui.overrides.css +++ /dev/null @@ -1,34 +0,0 @@ -/* - * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved. - * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - */ - -.ui-state-active, -.ui-widget-content .ui-state-active, -.ui-widget-header .ui-state-active, -a.ui-button:active, -.ui-button:active, -.ui-button.ui-state-active:hover { - /* Overrides the color of selection used in jQuery UI */ - background: #F8981D; -} diff --git a/docs/jquery/external/jquery/jquery.js b/docs/jquery/external/jquery/jquery.js deleted file mode 100644 index c5c64825..00000000 --- a/docs/jquery/external/jquery/jquery.js +++ /dev/null @@ -1,9789 +0,0 @@ -/*! - * jQuery JavaScript Library v1.10.2 - * http://jquery.com/ - * - * Includes Sizzle.js - * http://sizzlejs.com/ - * - * Copyright 2005, 2013 jQuery Foundation, Inc. and other contributors - * Released under the MIT license - * http://jquery.org/license - * - * Date: 2013-07-03T13:48Z - */ -(function( window, undefined ) { - -// Can't do this because several apps including ASP.NET trace -// the stack via arguments.caller.callee and Firefox dies if -// you try to trace through "use strict" call chains. (#13335) -// Support: Firefox 18+ -//"use strict"; -var - // The deferred used on DOM ready - readyList, - - // A central reference to the root jQuery(document) - rootjQuery, - - // Support: IE<10 - // For `typeof xmlNode.method` instead of `xmlNode.method !== undefined` - core_strundefined = typeof undefined, - - // Use the correct document accordingly with window argument (sandbox) - location = window.location, - document = window.document, - docElem = document.documentElement, - - // Map over jQuery in case of overwrite - _jQuery = window.jQuery, - - // Map over the $ in case of overwrite - _$ = window.$, - - // [[Class]] -> type pairs - class2type = {}, - - // List of deleted data cache ids, so we can reuse them - core_deletedIds = [], - - core_version = "1.10.2", - - // Save a reference to some core methods - core_concat = core_deletedIds.concat, - core_push = core_deletedIds.push, - core_slice = core_deletedIds.slice, - core_indexOf = core_deletedIds.indexOf, - core_toString = class2type.toString, - core_hasOwn = class2type.hasOwnProperty, - core_trim = core_version.trim, - - // Define a local copy of jQuery - jQuery = function( selector, context ) { - // The jQuery object is actually just the init constructor 'enhanced' - return new jQuery.fn.init( selector, context, rootjQuery ); - }, - - // Used for matching numbers - core_pnum = /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source, - - // Used for splitting on whitespace - core_rnotwhite = /\S+/g, - - // Make sure we trim BOM and NBSP (here's looking at you, Safari 5.0 and IE) - rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, - - // A simple way to check for HTML strings - // Prioritize #id over to avoid XSS via location.hash (#9521) - // Strict HTML recognition (#11290: must start with <) - rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]*))$/, - - // Match a standalone tag - rsingleTag = /^<(\w+)\s*\/?>(?:<\/\1>|)$/, - - // JSON RegExp - rvalidchars = /^[\],:{}\s]*$/, - rvalidbraces = /(?:^|:|,)(?:\s*\[)+/g, - rvalidescape = /\\(?:["\\\/bfnrt]|u[\da-fA-F]{4})/g, - rvalidtokens = /"[^"\\\r\n]*"|true|false|null|-?(?:\d+\.|)\d+(?:[eE][+-]?\d+|)/g, - - // Matches dashed string for camelizing - rmsPrefix = /^-ms-/, - rdashAlpha = /-([\da-z])/gi, - - // Used by jQuery.camelCase as callback to replace() - fcamelCase = function( all, letter ) { - return letter.toUpperCase(); - }, - - // The ready event handler - completed = function( event ) { - - // readyState === "complete" is good enough for us to call the dom ready in oldIE - if ( document.addEventListener || event.type === "load" || document.readyState === "complete" ) { - detach(); - jQuery.ready(); - } - }, - // Clean-up method for dom ready events - detach = function() { - if ( document.addEventListener ) { - document.removeEventListener( "DOMContentLoaded", completed, false ); - window.removeEventListener( "load", completed, false ); - - } else { - document.detachEvent( "onreadystatechange", completed ); - window.detachEvent( "onload", completed ); - } - }; - -jQuery.fn = jQuery.prototype = { - // The current version of jQuery being used - jquery: core_version, - - constructor: jQuery, - init: function( selector, context, rootjQuery ) { - var match, elem; - - // HANDLE: $(""), $(null), $(undefined), $(false) - if ( !selector ) { - return this; - } - - // Handle HTML strings - if ( typeof selector === "string" ) { - if ( selector.charAt(0) === "<" && selector.charAt( selector.length - 1 ) === ">" && selector.length >= 3 ) { - // Assume that strings that start and end with <> are HTML and skip the regex check - match = [ null, selector, null ]; - - } else { - match = rquickExpr.exec( selector ); - } - - // Match html or make sure no context is specified for #id - if ( match && (match[1] || !context) ) { - - // HANDLE: $(html) -> $(array) - if ( match[1] ) { - context = context instanceof jQuery ? context[0] : context; - - // scripts is true for back-compat - jQuery.merge( this, jQuery.parseHTML( - match[1], - context && context.nodeType ? context.ownerDocument || context : document, - true - ) ); - - // HANDLE: $(html, props) - if ( rsingleTag.test( match[1] ) && jQuery.isPlainObject( context ) ) { - for ( match in context ) { - // Properties of context are called as methods if possible - if ( jQuery.isFunction( this[ match ] ) ) { - this[ match ]( context[ match ] ); - - // ...and otherwise set as attributes - } else { - this.attr( match, context[ match ] ); - } - } - } - - return this; - - // HANDLE: $(#id) - } else { - elem = document.getElementById( match[2] ); - - // Check parentNode to catch when Blackberry 4.6 returns - // nodes that are no longer in the document #6963 - if ( elem && elem.parentNode ) { - // Handle the case where IE and Opera return items - // by name instead of ID - if ( elem.id !== match[2] ) { - return rootjQuery.find( selector ); - } - - // Otherwise, we inject the element directly into the jQuery object - this.length = 1; - this[0] = elem; - } - - this.context = document; - this.selector = selector; - return this; - } - - // HANDLE: $(expr, $(...)) - } else if ( !context || context.jquery ) { - return ( context || rootjQuery ).find( selector ); - - // HANDLE: $(expr, context) - // (which is just equivalent to: $(context).find(expr) - } else { - return this.constructor( context ).find( selector ); - } - - // HANDLE: $(DOMElement) - } else if ( selector.nodeType ) { - this.context = this[0] = selector; - this.length = 1; - return this; - - // HANDLE: $(function) - // Shortcut for document ready - } else if ( jQuery.isFunction( selector ) ) { - return rootjQuery.ready( selector ); - } - - if ( selector.selector !== undefined ) { - this.selector = selector.selector; - this.context = selector.context; - } - - return jQuery.makeArray( selector, this ); - }, - - // Start with an empty selector - selector: "", - - // The default length of a jQuery object is 0 - length: 0, - - toArray: function() { - return core_slice.call( this ); - }, - - // Get the Nth element in the matched element set OR - // Get the whole matched element set as a clean array - get: function( num ) { - return num == null ? - - // Return a 'clean' array - this.toArray() : - - // Return just the object - ( num < 0 ? this[ this.length + num ] : this[ num ] ); - }, - - // Take an array of elements and push it onto the stack - // (returning the new matched element set) - pushStack: function( elems ) { - - // Build a new jQuery matched element set - var ret = jQuery.merge( this.constructor(), elems ); - - // Add the old object onto the stack (as a reference) - ret.prevObject = this; - ret.context = this.context; - - // Return the newly-formed element set - return ret; - }, - - // Execute a callback for every element in the matched set. - // (You can seed the arguments with an array of args, but this is - // only used internally.) - each: function( callback, args ) { - return jQuery.each( this, callback, args ); - }, - - ready: function( fn ) { - // Add the callback - jQuery.ready.promise().done( fn ); - - return this; - }, - - slice: function() { - return this.pushStack( core_slice.apply( this, arguments ) ); - }, - - first: function() { - return this.eq( 0 ); - }, - - last: function() { - return this.eq( -1 ); - }, - - eq: function( i ) { - var len = this.length, - j = +i + ( i < 0 ? len : 0 ); - return this.pushStack( j >= 0 && j < len ? [ this[j] ] : [] ); - }, - - map: function( callback ) { - return this.pushStack( jQuery.map(this, function( elem, i ) { - return callback.call( elem, i, elem ); - })); - }, - - end: function() { - return this.prevObject || this.constructor(null); - }, - - // For internal use only. - // Behaves like an Array's method, not like a jQuery method. - push: core_push, - sort: [].sort, - splice: [].splice -}; - -// Give the init function the jQuery prototype for later instantiation -jQuery.fn.init.prototype = jQuery.fn; - -jQuery.extend = jQuery.fn.extend = function() { - var src, copyIsArray, copy, name, options, clone, - target = arguments[0] || {}, - i = 1, - length = arguments.length, - deep = false; - - // Handle a deep copy situation - if ( typeof target === "boolean" ) { - deep = target; - target = arguments[1] || {}; - // skip the boolean and the target - i = 2; - } - - // Handle case when target is a string or something (possible in deep copy) - if ( typeof target !== "object" && !jQuery.isFunction(target) ) { - target = {}; - } - - // extend jQuery itself if only one argument is passed - if ( length === i ) { - target = this; - --i; - } - - for ( ; i < length; i++ ) { - // Only deal with non-null/undefined values - if ( (options = arguments[ i ]) != null ) { - // Extend the base object - for ( name in options ) { - src = target[ name ]; - copy = options[ name ]; - - // Prevent never-ending loop - if ( target === copy ) { - continue; - } - - // Recurse if we're merging plain objects or arrays - if ( deep && copy && ( jQuery.isPlainObject(copy) || (copyIsArray = jQuery.isArray(copy)) ) ) { - if ( copyIsArray ) { - copyIsArray = false; - clone = src && jQuery.isArray(src) ? src : []; - - } else { - clone = src && jQuery.isPlainObject(src) ? src : {}; - } - - // Never move original objects, clone them - target[ name ] = jQuery.extend( deep, clone, copy ); - - // Don't bring in undefined values - } else if ( copy !== undefined ) { - target[ name ] = copy; - } - } - } - } - - // Return the modified object - return target; -}; - -jQuery.extend({ - // Unique for each copy of jQuery on the page - // Non-digits removed to match rinlinejQuery - expando: "jQuery" + ( core_version + Math.random() ).replace( /\D/g, "" ), - - noConflict: function( deep ) { - if ( window.$ === jQuery ) { - window.$ = _$; - } - - if ( deep && window.jQuery === jQuery ) { - window.jQuery = _jQuery; - } - - return jQuery; - }, - - // Is the DOM ready to be used? Set to true once it occurs. - isReady: false, - - // A counter to track how many items to wait for before - // the ready event fires. See #6781 - readyWait: 1, - - // Hold (or release) the ready event - holdReady: function( hold ) { - if ( hold ) { - jQuery.readyWait++; - } else { - jQuery.ready( true ); - } - }, - - // Handle when the DOM is ready - ready: function( wait ) { - - // Abort if there are pending holds or we're already ready - if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { - return; - } - - // Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443). - if ( !document.body ) { - return setTimeout( jQuery.ready ); - } - - // Remember that the DOM is ready - jQuery.isReady = true; - - // If a normal DOM Ready event fired, decrement, and wait if need be - if ( wait !== true && --jQuery.readyWait > 0 ) { - return; - } - - // If there are functions bound, to execute - readyList.resolveWith( document, [ jQuery ] ); - - // Trigger any bound ready events - if ( jQuery.fn.trigger ) { - jQuery( document ).trigger("ready").off("ready"); - } - }, - - // See test/unit/core.js for details concerning isFunction. - // Since version 1.3, DOM methods and functions like alert - // aren't supported. They return false on IE (#2968). - isFunction: function( obj ) { - return jQuery.type(obj) === "function"; - }, - - isArray: Array.isArray || function( obj ) { - return jQuery.type(obj) === "array"; - }, - - isWindow: function( obj ) { - /* jshint eqeqeq: false */ - return obj != null && obj == obj.window; - }, - - isNumeric: function( obj ) { - return !isNaN( parseFloat(obj) ) && isFinite( obj ); - }, - - type: function( obj ) { - if ( obj == null ) { - return String( obj ); - } - return typeof obj === "object" || typeof obj === "function" ? - class2type[ core_toString.call(obj) ] || "object" : - typeof obj; - }, - - isPlainObject: function( obj ) { - var key; - - // Must be an Object. - // Because of IE, we also have to check the presence of the constructor property. - // Make sure that DOM nodes and window objects don't pass through, as well - if ( !obj || jQuery.type(obj) !== "object" || obj.nodeType || jQuery.isWindow( obj ) ) { - return false; - } - - try { - // Not own constructor property must be Object - if ( obj.constructor && - !core_hasOwn.call(obj, "constructor") && - !core_hasOwn.call(obj.constructor.prototype, "isPrototypeOf") ) { - return false; - } - } catch ( e ) { - // IE8,9 Will throw exceptions on certain host objects #9897 - return false; - } - - // Support: IE<9 - // Handle iteration over inherited properties before own properties. - if ( jQuery.support.ownLast ) { - for ( key in obj ) { - return core_hasOwn.call( obj, key ); - } - } - - // Own properties are enumerated firstly, so to speed up, - // if last one is own, then all properties are own. - for ( key in obj ) {} - - return key === undefined || core_hasOwn.call( obj, key ); - }, - - isEmptyObject: function( obj ) { - var name; - for ( name in obj ) { - return false; - } - return true; - }, - - error: function( msg ) { - throw new Error( msg ); - }, - - // data: string of html - // context (optional): If specified, the fragment will be created in this context, defaults to document - // keepScripts (optional): If true, will include scripts passed in the html string - parseHTML: function( data, context, keepScripts ) { - if ( !data || typeof data !== "string" ) { - return null; - } - if ( typeof context === "boolean" ) { - keepScripts = context; - context = false; - } - context = context || document; - - var parsed = rsingleTag.exec( data ), - scripts = !keepScripts && []; - - // Single tag - if ( parsed ) { - return [ context.createElement( parsed[1] ) ]; - } - - parsed = jQuery.buildFragment( [ data ], context, scripts ); - if ( scripts ) { - jQuery( scripts ).remove(); - } - return jQuery.merge( [], parsed.childNodes ); - }, - - parseJSON: function( data ) { - // Attempt to parse using the native JSON parser first - if ( window.JSON && window.JSON.parse ) { - return window.JSON.parse( data ); - } - - if ( data === null ) { - return data; - } - - if ( typeof data === "string" ) { - - // Make sure leading/trailing whitespace is removed (IE can't handle it) - data = jQuery.trim( data ); - - if ( data ) { - // Make sure the incoming data is actual JSON - // Logic borrowed from http://json.org/json2.js - if ( rvalidchars.test( data.replace( rvalidescape, "@" ) - .replace( rvalidtokens, "]" ) - .replace( rvalidbraces, "")) ) { - - return ( new Function( "return " + data ) )(); - } - } - } - - jQuery.error( "Invalid JSON: " + data ); - }, - - // Cross-browser xml parsing - parseXML: function( data ) { - var xml, tmp; - if ( !data || typeof data !== "string" ) { - return null; - } - try { - if ( window.DOMParser ) { // Standard - tmp = new DOMParser(); - xml = tmp.parseFromString( data , "text/xml" ); - } else { // IE - xml = new ActiveXObject( "Microsoft.XMLDOM" ); - xml.async = "false"; - xml.loadXML( data ); - } - } catch( e ) { - xml = undefined; - } - if ( !xml || !xml.documentElement || xml.getElementsByTagName( "parsererror" ).length ) { - jQuery.error( "Invalid XML: " + data ); - } - return xml; - }, - - noop: function() {}, - - // Evaluates a script in a global context - // Workarounds based on findings by Jim Driscoll - // http://weblogs.java.net/blog/driscoll/archive/2009/09/08/eval-javascript-global-context - globalEval: function( data ) { - if ( data && jQuery.trim( data ) ) { - // We use execScript on Internet Explorer - // We use an anonymous function so that context is window - // rather than jQuery in Firefox - ( window.execScript || function( data ) { - window[ "eval" ].call( window, data ); - } )( data ); - } - }, - - // Convert dashed to camelCase; used by the css and data modules - // Microsoft forgot to hump their vendor prefix (#9572) - camelCase: function( string ) { - return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); - }, - - nodeName: function( elem, name ) { - return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); - }, - - // args is for internal usage only - each: function( obj, callback, args ) { - var value, - i = 0, - length = obj.length, - isArray = isArraylike( obj ); - - if ( args ) { - if ( isArray ) { - for ( ; i < length; i++ ) { - value = callback.apply( obj[ i ], args ); - - if ( value === false ) { - break; - } - } - } else { - for ( i in obj ) { - value = callback.apply( obj[ i ], args ); - - if ( value === false ) { - break; - } - } - } - - // A special, fast, case for the most common use of each - } else { - if ( isArray ) { - for ( ; i < length; i++ ) { - value = callback.call( obj[ i ], i, obj[ i ] ); - - if ( value === false ) { - break; - } - } - } else { - for ( i in obj ) { - value = callback.call( obj[ i ], i, obj[ i ] ); - - if ( value === false ) { - break; - } - } - } - } - - return obj; - }, - - // Use native String.trim function wherever possible - trim: core_trim && !core_trim.call("\uFEFF\xA0") ? - function( text ) { - return text == null ? - "" : - core_trim.call( text ); - } : - - // Otherwise use our own trimming functionality - function( text ) { - return text == null ? - "" : - ( text + "" ).replace( rtrim, "" ); - }, - - // results is for internal usage only - makeArray: function( arr, results ) { - var ret = results || []; - - if ( arr != null ) { - if ( isArraylike( Object(arr) ) ) { - jQuery.merge( ret, - typeof arr === "string" ? - [ arr ] : arr - ); - } else { - core_push.call( ret, arr ); - } - } - - return ret; - }, - - inArray: function( elem, arr, i ) { - var len; - - if ( arr ) { - if ( core_indexOf ) { - return core_indexOf.call( arr, elem, i ); - } - - len = arr.length; - i = i ? i < 0 ? Math.max( 0, len + i ) : i : 0; - - for ( ; i < len; i++ ) { - // Skip accessing in sparse arrays - if ( i in arr && arr[ i ] === elem ) { - return i; - } - } - } - - return -1; - }, - - merge: function( first, second ) { - var l = second.length, - i = first.length, - j = 0; - - if ( typeof l === "number" ) { - for ( ; j < l; j++ ) { - first[ i++ ] = second[ j ]; - } - } else { - while ( second[j] !== undefined ) { - first[ i++ ] = second[ j++ ]; - } - } - - first.length = i; - - return first; - }, - - grep: function( elems, callback, inv ) { - var retVal, - ret = [], - i = 0, - length = elems.length; - inv = !!inv; - - // Go through the array, only saving the items - // that pass the validator function - for ( ; i < length; i++ ) { - retVal = !!callback( elems[ i ], i ); - if ( inv !== retVal ) { - ret.push( elems[ i ] ); - } - } - - return ret; - }, - - // arg is for internal usage only - map: function( elems, callback, arg ) { - var value, - i = 0, - length = elems.length, - isArray = isArraylike( elems ), - ret = []; - - // Go through the array, translating each of the items to their - if ( isArray ) { - for ( ; i < length; i++ ) { - value = callback( elems[ i ], i, arg ); - - if ( value != null ) { - ret[ ret.length ] = value; - } - } - - // Go through every key on the object, - } else { - for ( i in elems ) { - value = callback( elems[ i ], i, arg ); - - if ( value != null ) { - ret[ ret.length ] = value; - } - } - } - - // Flatten any nested arrays - return core_concat.apply( [], ret ); - }, - - // A global GUID counter for objects - guid: 1, - - // Bind a function to a context, optionally partially applying any - // arguments. - proxy: function( fn, context ) { - var args, proxy, tmp; - - if ( typeof context === "string" ) { - tmp = fn[ context ]; - context = fn; - fn = tmp; - } - - // Quick check to determine if target is callable, in the spec - // this throws a TypeError, but we will just return undefined. - if ( !jQuery.isFunction( fn ) ) { - return undefined; - } - - // Simulated bind - args = core_slice.call( arguments, 2 ); - proxy = function() { - return fn.apply( context || this, args.concat( core_slice.call( arguments ) ) ); - }; - - // Set the guid of unique handler to the same of original handler, so it can be removed - proxy.guid = fn.guid = fn.guid || jQuery.guid++; - - return proxy; - }, - - // Multifunctional method to get and set values of a collection - // The value/s can optionally be executed if it's a function - access: function( elems, fn, key, value, chainable, emptyGet, raw ) { - var i = 0, - length = elems.length, - bulk = key == null; - - // Sets many values - if ( jQuery.type( key ) === "object" ) { - chainable = true; - for ( i in key ) { - jQuery.access( elems, fn, i, key[i], true, emptyGet, raw ); - } - - // Sets one value - } else if ( value !== undefined ) { - chainable = true; - - if ( !jQuery.isFunction( value ) ) { - raw = true; - } - - if ( bulk ) { - // Bulk operations run against the entire set - if ( raw ) { - fn.call( elems, value ); - fn = null; - - // ...except when executing function values - } else { - bulk = fn; - fn = function( elem, key, value ) { - return bulk.call( jQuery( elem ), value ); - }; - } - } - - if ( fn ) { - for ( ; i < length; i++ ) { - fn( elems[i], key, raw ? value : value.call( elems[i], i, fn( elems[i], key ) ) ); - } - } - } - - return chainable ? - elems : - - // Gets - bulk ? - fn.call( elems ) : - length ? fn( elems[0], key ) : emptyGet; - }, - - now: function() { - return ( new Date() ).getTime(); - }, - - // A method for quickly swapping in/out CSS properties to get correct calculations. - // Note: this method belongs to the css module but it's needed here for the support module. - // If support gets modularized, this method should be moved back to the css module. - swap: function( elem, options, callback, args ) { - var ret, name, - old = {}; - - // Remember the old values, and insert the new ones - for ( name in options ) { - old[ name ] = elem.style[ name ]; - elem.style[ name ] = options[ name ]; - } - - ret = callback.apply( elem, args || [] ); - - // Revert the old values - for ( name in options ) { - elem.style[ name ] = old[ name ]; - } - - return ret; - } -}); - -jQuery.ready.promise = function( obj ) { - if ( !readyList ) { - - readyList = jQuery.Deferred(); - - // Catch cases where $(document).ready() is called after the browser event has already occurred. - // we once tried to use readyState "interactive" here, but it caused issues like the one - // discovered by ChrisS here: http://bugs.jquery.com/ticket/12282#comment:15 - if ( document.readyState === "complete" ) { - // Handle it asynchronously to allow scripts the opportunity to delay ready - setTimeout( jQuery.ready ); - - // Standards-based browsers support DOMContentLoaded - } else if ( document.addEventListener ) { - // Use the handy event callback - document.addEventListener( "DOMContentLoaded", completed, false ); - - // A fallback to window.onload, that will always work - window.addEventListener( "load", completed, false ); - - // If IE event model is used - } else { - // Ensure firing before onload, maybe late but safe also for iframes - document.attachEvent( "onreadystatechange", completed ); - - // A fallback to window.onload, that will always work - window.attachEvent( "onload", completed ); - - // If IE and not a frame - // continually check to see if the document is ready - var top = false; - - try { - top = window.frameElement == null && document.documentElement; - } catch(e) {} - - if ( top && top.doScroll ) { - (function doScrollCheck() { - if ( !jQuery.isReady ) { - - try { - // Use the trick by Diego Perini - // http://javascript.nwbox.com/IEContentLoaded/ - top.doScroll("left"); - } catch(e) { - return setTimeout( doScrollCheck, 50 ); - } - - // detach all dom ready events - detach(); - - // and execute any waiting functions - jQuery.ready(); - } - })(); - } - } - } - return readyList.promise( obj ); -}; - -// Populate the class2type map -jQuery.each("Boolean Number String Function Array Date RegExp Object Error".split(" "), function(i, name) { - class2type[ "[object " + name + "]" ] = name.toLowerCase(); -}); - -function isArraylike( obj ) { - var length = obj.length, - type = jQuery.type( obj ); - - if ( jQuery.isWindow( obj ) ) { - return false; - } - - if ( obj.nodeType === 1 && length ) { - return true; - } - - return type === "array" || type !== "function" && - ( length === 0 || - typeof length === "number" && length > 0 && ( length - 1 ) in obj ); -} - -// All jQuery objects should point back to these -rootjQuery = jQuery(document); -/*! - * Sizzle CSS Selector Engine v1.10.2 - * http://sizzlejs.com/ - * - * Copyright 2013 jQuery Foundation, Inc. and other contributors - * Released under the MIT license - * http://jquery.org/license - * - * Date: 2013-07-03 - */ -(function( window, undefined ) { - -var i, - support, - cachedruns, - Expr, - getText, - isXML, - compile, - outermostContext, - sortInput, - - // Local document vars - setDocument, - document, - docElem, - documentIsHTML, - rbuggyQSA, - rbuggyMatches, - matches, - contains, - - // Instance-specific data - expando = "sizzle" + -(new Date()), - preferredDoc = window.document, - dirruns = 0, - done = 0, - classCache = createCache(), - tokenCache = createCache(), - compilerCache = createCache(), - hasDuplicate = false, - sortOrder = function( a, b ) { - if ( a === b ) { - hasDuplicate = true; - return 0; - } - return 0; - }, - - // General-purpose constants - strundefined = typeof undefined, - MAX_NEGATIVE = 1 << 31, - - // Instance methods - hasOwn = ({}).hasOwnProperty, - arr = [], - pop = arr.pop, - push_native = arr.push, - push = arr.push, - slice = arr.slice, - // Use a stripped-down indexOf if we can't use a native one - indexOf = arr.indexOf || function( elem ) { - var i = 0, - len = this.length; - for ( ; i < len; i++ ) { - if ( this[i] === elem ) { - return i; - } - } - return -1; - }, - - booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped", - - // Regular expressions - - // Whitespace characters http://www.w3.org/TR/css3-selectors/#whitespace - whitespace = "[\\x20\\t\\r\\n\\f]", - // http://www.w3.org/TR/css3-syntax/#characters - characterEncoding = "(?:\\\\.|[\\w-]|[^\\x00-\\xa0])+", - - // Loosely modeled on CSS identifier characters - // An unquoted value should be a CSS identifier http://www.w3.org/TR/css3-selectors/#attribute-selectors - // Proper syntax: http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier - identifier = characterEncoding.replace( "w", "w#" ), - - // Acceptable operators http://www.w3.org/TR/selectors/#attribute-selectors - attributes = "\\[" + whitespace + "*(" + characterEncoding + ")" + whitespace + - "*(?:([*^$|!~]?=)" + whitespace + "*(?:(['\"])((?:\\\\.|[^\\\\])*?)\\3|(" + identifier + ")|)|)" + whitespace + "*\\]", - - // Prefer arguments quoted, - // then not containing pseudos/brackets, - // then attribute selectors/non-parenthetical expressions, - // then anything else - // These preferences are here to reduce the number of selectors - // needing tokenize in the PSEUDO preFilter - pseudos = ":(" + characterEncoding + ")(?:\\(((['\"])((?:\\\\.|[^\\\\])*?)\\3|((?:\\\\.|[^\\\\()[\\]]|" + attributes.replace( 3, 8 ) + ")*)|.*)\\)|)", - - // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter - rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + whitespace + "+$", "g" ), - - rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), - rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + "*" ), - - rsibling = new RegExp( whitespace + "*[+~]" ), - rattributeQuotes = new RegExp( "=" + whitespace + "*([^\\]'\"]*)" + whitespace + "*\\]", "g" ), - - rpseudo = new RegExp( pseudos ), - ridentifier = new RegExp( "^" + identifier + "$" ), - - matchExpr = { - "ID": new RegExp( "^#(" + characterEncoding + ")" ), - "CLASS": new RegExp( "^\\.(" + characterEncoding + ")" ), - "TAG": new RegExp( "^(" + characterEncoding.replace( "w", "w*" ) + ")" ), - "ATTR": new RegExp( "^" + attributes ), - "PSEUDO": new RegExp( "^" + pseudos ), - "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + whitespace + - "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + whitespace + - "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), - "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), - // For use in libraries implementing .is() - // We use this for POS matching in `select` - "needsContext": new RegExp( "^" + whitespace + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + - whitespace + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) - }, - - rnative = /^[^{]+\{\s*\[native \w/, - - // Easily-parseable/retrievable ID or TAG or CLASS selectors - rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, - - rinputs = /^(?:input|select|textarea|button)$/i, - rheader = /^h\d$/i, - - rescape = /'|\\/g, - - // CSS escapes http://www.w3.org/TR/CSS21/syndata.html#escaped-characters - runescape = new RegExp( "\\\\([\\da-f]{1,6}" + whitespace + "?|(" + whitespace + ")|.)", "ig" ), - funescape = function( _, escaped, escapedWhitespace ) { - var high = "0x" + escaped - 0x10000; - // NaN means non-codepoint - // Support: Firefox - // Workaround erroneous numeric interpretation of +"0x" - return high !== high || escapedWhitespace ? - escaped : - // BMP codepoint - high < 0 ? - String.fromCharCode( high + 0x10000 ) : - // Supplemental Plane codepoint (surrogate pair) - String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); - }; - -// Optimize for push.apply( _, NodeList ) -try { - push.apply( - (arr = slice.call( preferredDoc.childNodes )), - preferredDoc.childNodes - ); - // Support: Android<4.0 - // Detect silently failing push.apply - arr[ preferredDoc.childNodes.length ].nodeType; -} catch ( e ) { - push = { apply: arr.length ? - - // Leverage slice if possible - function( target, els ) { - push_native.apply( target, slice.call(els) ); - } : - - // Support: IE<9 - // Otherwise append directly - function( target, els ) { - var j = target.length, - i = 0; - // Can't trust NodeList.length - while ( (target[j++] = els[i++]) ) {} - target.length = j - 1; - } - }; -} - -function Sizzle( selector, context, results, seed ) { - var match, elem, m, nodeType, - // QSA vars - i, groups, old, nid, newContext, newSelector; - - if ( ( context ? context.ownerDocument || context : preferredDoc ) !== document ) { - setDocument( context ); - } - - context = context || document; - results = results || []; - - if ( !selector || typeof selector !== "string" ) { - return results; - } - - if ( (nodeType = context.nodeType) !== 1 && nodeType !== 9 ) { - return []; - } - - if ( documentIsHTML && !seed ) { - - // Shortcuts - if ( (match = rquickExpr.exec( selector )) ) { - // Speed-up: Sizzle("#ID") - if ( (m = match[1]) ) { - if ( nodeType === 9 ) { - elem = context.getElementById( m ); - // Check parentNode to catch when Blackberry 4.6 returns - // nodes that are no longer in the document #6963 - if ( elem && elem.parentNode ) { - // Handle the case where IE, Opera, and Webkit return items - // by name instead of ID - if ( elem.id === m ) { - results.push( elem ); - return results; - } - } else { - return results; - } - } else { - // Context is not a document - if ( context.ownerDocument && (elem = context.ownerDocument.getElementById( m )) && - contains( context, elem ) && elem.id === m ) { - results.push( elem ); - return results; - } - } - - // Speed-up: Sizzle("TAG") - } else if ( match[2] ) { - push.apply( results, context.getElementsByTagName( selector ) ); - return results; - - // Speed-up: Sizzle(".CLASS") - } else if ( (m = match[3]) && support.getElementsByClassName && context.getElementsByClassName ) { - push.apply( results, context.getElementsByClassName( m ) ); - return results; - } - } - - // QSA path - if ( support.qsa && (!rbuggyQSA || !rbuggyQSA.test( selector )) ) { - nid = old = expando; - newContext = context; - newSelector = nodeType === 9 && selector; - - // qSA works strangely on Element-rooted queries - // We can work around this by specifying an extra ID on the root - // and working up from there (Thanks to Andrew Dupont for the technique) - // IE 8 doesn't work on object elements - if ( nodeType === 1 && context.nodeName.toLowerCase() !== "object" ) { - groups = tokenize( selector ); - - if ( (old = context.getAttribute("id")) ) { - nid = old.replace( rescape, "\\$&" ); - } else { - context.setAttribute( "id", nid ); - } - nid = "[id='" + nid + "'] "; - - i = groups.length; - while ( i-- ) { - groups[i] = nid + toSelector( groups[i] ); - } - newContext = rsibling.test( selector ) && context.parentNode || context; - newSelector = groups.join(","); - } - - if ( newSelector ) { - try { - push.apply( results, - newContext.querySelectorAll( newSelector ) - ); - return results; - } catch(qsaError) { - } finally { - if ( !old ) { - context.removeAttribute("id"); - } - } - } - } - } - - // All others - return select( selector.replace( rtrim, "$1" ), context, results, seed ); -} - -/** - * Create key-value caches of limited size - * @returns {Function(string, Object)} Returns the Object data after storing it on itself with - * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) - * deleting the oldest entry - */ -function createCache() { - var keys = []; - - function cache( key, value ) { - // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) - if ( keys.push( key += " " ) > Expr.cacheLength ) { - // Only keep the most recent entries - delete cache[ keys.shift() ]; - } - return (cache[ key ] = value); - } - return cache; -} - -/** - * Mark a function for special use by Sizzle - * @param {Function} fn The function to mark - */ -function markFunction( fn ) { - fn[ expando ] = true; - return fn; -} - -/** - * Support testing using an element - * @param {Function} fn Passed the created div and expects a boolean result - */ -function assert( fn ) { - var div = document.createElement("div"); - - try { - return !!fn( div ); - } catch (e) { - return false; - } finally { - // Remove from its parent by default - if ( div.parentNode ) { - div.parentNode.removeChild( div ); - } - // release memory in IE - div = null; - } -} - -/** - * Adds the same handler for all of the specified attrs - * @param {String} attrs Pipe-separated list of attributes - * @param {Function} handler The method that will be applied - */ -function addHandle( attrs, handler ) { - var arr = attrs.split("|"), - i = attrs.length; - - while ( i-- ) { - Expr.attrHandle[ arr[i] ] = handler; - } -} - -/** - * Checks document order of two siblings - * @param {Element} a - * @param {Element} b - * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b - */ -function siblingCheck( a, b ) { - var cur = b && a, - diff = cur && a.nodeType === 1 && b.nodeType === 1 && - ( ~b.sourceIndex || MAX_NEGATIVE ) - - ( ~a.sourceIndex || MAX_NEGATIVE ); - - // Use IE sourceIndex if available on both nodes - if ( diff ) { - return diff; - } - - // Check if b follows a - if ( cur ) { - while ( (cur = cur.nextSibling) ) { - if ( cur === b ) { - return -1; - } - } - } - - return a ? 1 : -1; -} - -/** - * Returns a function to use in pseudos for input types - * @param {String} type - */ -function createInputPseudo( type ) { - return function( elem ) { - var name = elem.nodeName.toLowerCase(); - return name === "input" && elem.type === type; - }; -} - -/** - * Returns a function to use in pseudos for buttons - * @param {String} type - */ -function createButtonPseudo( type ) { - return function( elem ) { - var name = elem.nodeName.toLowerCase(); - return (name === "input" || name === "button") && elem.type === type; - }; -} - -/** - * Returns a function to use in pseudos for positionals - * @param {Function} fn - */ -function createPositionalPseudo( fn ) { - return markFunction(function( argument ) { - argument = +argument; - return markFunction(function( seed, matches ) { - var j, - matchIndexes = fn( [], seed.length, argument ), - i = matchIndexes.length; - - // Match elements found at the specified indexes - while ( i-- ) { - if ( seed[ (j = matchIndexes[i]) ] ) { - seed[j] = !(matches[j] = seed[j]); - } - } - }); - }); -} - -/** - * Detect xml - * @param {Element|Object} elem An element or a document - */ -isXML = Sizzle.isXML = function( elem ) { - // documentElement is verified for cases where it doesn't yet exist - // (such as loading iframes in IE - #4833) - var documentElement = elem && (elem.ownerDocument || elem).documentElement; - return documentElement ? documentElement.nodeName !== "HTML" : false; -}; - -// Expose support vars for convenience -support = Sizzle.support = {}; - -/** - * Sets document-related variables once based on the current document - * @param {Element|Object} [doc] An element or document object to use to set the document - * @returns {Object} Returns the current document - */ -setDocument = Sizzle.setDocument = function( node ) { - var doc = node ? node.ownerDocument || node : preferredDoc, - parent = doc.defaultView; - - // If no document and documentElement is available, return - if ( doc === document || doc.nodeType !== 9 || !doc.documentElement ) { - return document; - } - - // Set our document - document = doc; - docElem = doc.documentElement; - - // Support tests - documentIsHTML = !isXML( doc ); - - // Support: IE>8 - // If iframe document is assigned to "document" variable and if iframe has been reloaded, - // IE will throw "permission denied" error when accessing "document" variable, see jQuery #13936 - // IE6-8 do not support the defaultView property so parent will be undefined - if ( parent && parent.attachEvent && parent !== parent.top ) { - parent.attachEvent( "onbeforeunload", function() { - setDocument(); - }); - } - - /* Attributes - ---------------------------------------------------------------------- */ - - // Support: IE<8 - // Verify that getAttribute really returns attributes and not properties (excepting IE8 booleans) - support.attributes = assert(function( div ) { - div.className = "i"; - return !div.getAttribute("className"); - }); - - /* getElement(s)By* - ---------------------------------------------------------------------- */ - - // Check if getElementsByTagName("*") returns only elements - support.getElementsByTagName = assert(function( div ) { - div.appendChild( doc.createComment("") ); - return !div.getElementsByTagName("*").length; - }); - - // Check if getElementsByClassName can be trusted - support.getElementsByClassName = assert(function( div ) { - div.innerHTML = "
"; - - // Support: Safari<4 - // Catch class over-caching - div.firstChild.className = "i"; - // Support: Opera<10 - // Catch gEBCN failure to find non-leading classes - return div.getElementsByClassName("i").length === 2; - }); - - // Support: IE<10 - // Check if getElementById returns elements by name - // The broken getElementById methods don't pick up programatically-set names, - // so use a roundabout getElementsByName test - support.getById = assert(function( div ) { - docElem.appendChild( div ).id = expando; - return !doc.getElementsByName || !doc.getElementsByName( expando ).length; - }); - - // ID find and filter - if ( support.getById ) { - Expr.find["ID"] = function( id, context ) { - if ( typeof context.getElementById !== strundefined && documentIsHTML ) { - var m = context.getElementById( id ); - // Check parentNode to catch when Blackberry 4.6 returns - // nodes that are no longer in the document #6963 - return m && m.parentNode ? [m] : []; - } - }; - Expr.filter["ID"] = function( id ) { - var attrId = id.replace( runescape, funescape ); - return function( elem ) { - return elem.getAttribute("id") === attrId; - }; - }; - } else { - // Support: IE6/7 - // getElementById is not reliable as a find shortcut - delete Expr.find["ID"]; - - Expr.filter["ID"] = function( id ) { - var attrId = id.replace( runescape, funescape ); - return function( elem ) { - var node = typeof elem.getAttributeNode !== strundefined && elem.getAttributeNode("id"); - return node && node.value === attrId; - }; - }; - } - - // Tag - Expr.find["TAG"] = support.getElementsByTagName ? - function( tag, context ) { - if ( typeof context.getElementsByTagName !== strundefined ) { - return context.getElementsByTagName( tag ); - } - } : - function( tag, context ) { - var elem, - tmp = [], - i = 0, - results = context.getElementsByTagName( tag ); - - // Filter out possible comments - if ( tag === "*" ) { - while ( (elem = results[i++]) ) { - if ( elem.nodeType === 1 ) { - tmp.push( elem ); - } - } - - return tmp; - } - return results; - }; - - // Class - Expr.find["CLASS"] = support.getElementsByClassName && function( className, context ) { - if ( typeof context.getElementsByClassName !== strundefined && documentIsHTML ) { - return context.getElementsByClassName( className ); - } - }; - - /* QSA/matchesSelector - ---------------------------------------------------------------------- */ - - // QSA and matchesSelector support - - // matchesSelector(:active) reports false when true (IE9/Opera 11.5) - rbuggyMatches = []; - - // qSa(:focus) reports false when true (Chrome 21) - // We allow this because of a bug in IE8/9 that throws an error - // whenever `document.activeElement` is accessed on an iframe - // So, we allow :focus to pass through QSA all the time to avoid the IE error - // See http://bugs.jquery.com/ticket/13378 - rbuggyQSA = []; - - if ( (support.qsa = rnative.test( doc.querySelectorAll )) ) { - // Build QSA regex - // Regex strategy adopted from Diego Perini - assert(function( div ) { - // Select is set to empty string on purpose - // This is to test IE's treatment of not explicitly - // setting a boolean content attribute, - // since its presence should be enough - // http://bugs.jquery.com/ticket/12359 - div.innerHTML = ""; - - // Support: IE8 - // Boolean attributes and "value" are not treated correctly - if ( !div.querySelectorAll("[selected]").length ) { - rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); - } - - // Webkit/Opera - :checked should return selected option elements - // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked - // IE8 throws error here and will not see later tests - if ( !div.querySelectorAll(":checked").length ) { - rbuggyQSA.push(":checked"); - } - }); - - assert(function( div ) { - - // Support: Opera 10-12/IE8 - // ^= $= *= and empty values - // Should not select anything - // Support: Windows 8 Native Apps - // The type attribute is restricted during .innerHTML assignment - var input = doc.createElement("input"); - input.setAttribute( "type", "hidden" ); - div.appendChild( input ).setAttribute( "t", "" ); - - if ( div.querySelectorAll("[t^='']").length ) { - rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); - } - - // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) - // IE8 throws error here and will not see later tests - if ( !div.querySelectorAll(":enabled").length ) { - rbuggyQSA.push( ":enabled", ":disabled" ); - } - - // Opera 10-11 does not throw on post-comma invalid pseudos - div.querySelectorAll("*,:x"); - rbuggyQSA.push(",.*:"); - }); - } - - if ( (support.matchesSelector = rnative.test( (matches = docElem.webkitMatchesSelector || - docElem.mozMatchesSelector || - docElem.oMatchesSelector || - docElem.msMatchesSelector) )) ) { - - assert(function( div ) { - // Check to see if it's possible to do matchesSelector - // on a disconnected node (IE 9) - support.disconnectedMatch = matches.call( div, "div" ); - - // This should fail with an exception - // Gecko does not error, returns false instead - matches.call( div, "[s!='']:x" ); - rbuggyMatches.push( "!=", pseudos ); - }); - } - - rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join("|") ); - rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join("|") ); - - /* Contains - ---------------------------------------------------------------------- */ - - // Element contains another - // Purposefully does not implement inclusive descendent - // As in, an element does not contain itself - contains = rnative.test( docElem.contains ) || docElem.compareDocumentPosition ? - function( a, b ) { - var adown = a.nodeType === 9 ? a.documentElement : a, - bup = b && b.parentNode; - return a === bup || !!( bup && bup.nodeType === 1 && ( - adown.contains ? - adown.contains( bup ) : - a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 - )); - } : - function( a, b ) { - if ( b ) { - while ( (b = b.parentNode) ) { - if ( b === a ) { - return true; - } - } - } - return false; - }; - - /* Sorting - ---------------------------------------------------------------------- */ - - // Document order sorting - sortOrder = docElem.compareDocumentPosition ? - function( a, b ) { - - // Flag for duplicate removal - if ( a === b ) { - hasDuplicate = true; - return 0; - } - - var compare = b.compareDocumentPosition && a.compareDocumentPosition && a.compareDocumentPosition( b ); - - if ( compare ) { - // Disconnected nodes - if ( compare & 1 || - (!support.sortDetached && b.compareDocumentPosition( a ) === compare) ) { - - // Choose the first element that is related to our preferred document - if ( a === doc || contains(preferredDoc, a) ) { - return -1; - } - if ( b === doc || contains(preferredDoc, b) ) { - return 1; - } - - // Maintain original order - return sortInput ? - ( indexOf.call( sortInput, a ) - indexOf.call( sortInput, b ) ) : - 0; - } - - return compare & 4 ? -1 : 1; - } - - // Not directly comparable, sort on existence of method - return a.compareDocumentPosition ? -1 : 1; - } : - function( a, b ) { - var cur, - i = 0, - aup = a.parentNode, - bup = b.parentNode, - ap = [ a ], - bp = [ b ]; - - // Exit early if the nodes are identical - if ( a === b ) { - hasDuplicate = true; - return 0; - - // Parentless nodes are either documents or disconnected - } else if ( !aup || !bup ) { - return a === doc ? -1 : - b === doc ? 1 : - aup ? -1 : - bup ? 1 : - sortInput ? - ( indexOf.call( sortInput, a ) - indexOf.call( sortInput, b ) ) : - 0; - - // If the nodes are siblings, we can do a quick check - } else if ( aup === bup ) { - return siblingCheck( a, b ); - } - - // Otherwise we need full lists of their ancestors for comparison - cur = a; - while ( (cur = cur.parentNode) ) { - ap.unshift( cur ); - } - cur = b; - while ( (cur = cur.parentNode) ) { - bp.unshift( cur ); - } - - // Walk down the tree looking for a discrepancy - while ( ap[i] === bp[i] ) { - i++; - } - - return i ? - // Do a sibling check if the nodes have a common ancestor - siblingCheck( ap[i], bp[i] ) : - - // Otherwise nodes in our document sort first - ap[i] === preferredDoc ? -1 : - bp[i] === preferredDoc ? 1 : - 0; - }; - - return doc; -}; - -Sizzle.matches = function( expr, elements ) { - return Sizzle( expr, null, null, elements ); -}; - -Sizzle.matchesSelector = function( elem, expr ) { - // Set document vars if needed - if ( ( elem.ownerDocument || elem ) !== document ) { - setDocument( elem ); - } - - // Make sure that attribute selectors are quoted - expr = expr.replace( rattributeQuotes, "='$1']" ); - - if ( support.matchesSelector && documentIsHTML && - ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && - ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { - - try { - var ret = matches.call( elem, expr ); - - // IE 9's matchesSelector returns false on disconnected nodes - if ( ret || support.disconnectedMatch || - // As well, disconnected nodes are said to be in a document - // fragment in IE 9 - elem.document && elem.document.nodeType !== 11 ) { - return ret; - } - } catch(e) {} - } - - return Sizzle( expr, document, null, [elem] ).length > 0; -}; - -Sizzle.contains = function( context, elem ) { - // Set document vars if needed - if ( ( context.ownerDocument || context ) !== document ) { - setDocument( context ); - } - return contains( context, elem ); -}; - -Sizzle.attr = function( elem, name ) { - // Set document vars if needed - if ( ( elem.ownerDocument || elem ) !== document ) { - setDocument( elem ); - } - - var fn = Expr.attrHandle[ name.toLowerCase() ], - // Don't get fooled by Object.prototype properties (jQuery #13807) - val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? - fn( elem, name, !documentIsHTML ) : - undefined; - - return val === undefined ? - support.attributes || !documentIsHTML ? - elem.getAttribute( name ) : - (val = elem.getAttributeNode(name)) && val.specified ? - val.value : - null : - val; -}; - -Sizzle.error = function( msg ) { - throw new Error( "Syntax error, unrecognized expression: " + msg ); -}; - -/** - * Document sorting and removing duplicates - * @param {ArrayLike} results - */ -Sizzle.uniqueSort = function( results ) { - var elem, - duplicates = [], - j = 0, - i = 0; - - // Unless we *know* we can detect duplicates, assume their presence - hasDuplicate = !support.detectDuplicates; - sortInput = !support.sortStable && results.slice( 0 ); - results.sort( sortOrder ); - - if ( hasDuplicate ) { - while ( (elem = results[i++]) ) { - if ( elem === results[ i ] ) { - j = duplicates.push( i ); - } - } - while ( j-- ) { - results.splice( duplicates[ j ], 1 ); - } - } - - return results; -}; - -/** - * Utility function for retrieving the text value of an array of DOM nodes - * @param {Array|Element} elem - */ -getText = Sizzle.getText = function( elem ) { - var node, - ret = "", - i = 0, - nodeType = elem.nodeType; - - if ( !nodeType ) { - // If no nodeType, this is expected to be an array - for ( ; (node = elem[i]); i++ ) { - // Do not traverse comment nodes - ret += getText( node ); - } - } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { - // Use textContent for elements - // innerText usage removed for consistency of new lines (see #11153) - if ( typeof elem.textContent === "string" ) { - return elem.textContent; - } else { - // Traverse its children - for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { - ret += getText( elem ); - } - } - } else if ( nodeType === 3 || nodeType === 4 ) { - return elem.nodeValue; - } - // Do not include comment or processing instruction nodes - - return ret; -}; - -Expr = Sizzle.selectors = { - - // Can be adjusted by the user - cacheLength: 50, - - createPseudo: markFunction, - - match: matchExpr, - - attrHandle: {}, - - find: {}, - - relative: { - ">": { dir: "parentNode", first: true }, - " ": { dir: "parentNode" }, - "+": { dir: "previousSibling", first: true }, - "~": { dir: "previousSibling" } - }, - - preFilter: { - "ATTR": function( match ) { - match[1] = match[1].replace( runescape, funescape ); - - // Move the given value to match[3] whether quoted or unquoted - match[3] = ( match[4] || match[5] || "" ).replace( runescape, funescape ); - - if ( match[2] === "~=" ) { - match[3] = " " + match[3] + " "; - } - - return match.slice( 0, 4 ); - }, - - "CHILD": function( match ) { - /* matches from matchExpr["CHILD"] - 1 type (only|nth|...) - 2 what (child|of-type) - 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) - 4 xn-component of xn+y argument ([+-]?\d*n|) - 5 sign of xn-component - 6 x of xn-component - 7 sign of y-component - 8 y of y-component - */ - match[1] = match[1].toLowerCase(); - - if ( match[1].slice( 0, 3 ) === "nth" ) { - // nth-* requires argument - if ( !match[3] ) { - Sizzle.error( match[0] ); - } - - // numeric x and y parameters for Expr.filter.CHILD - // remember that false/true cast respectively to 0/1 - match[4] = +( match[4] ? match[5] + (match[6] || 1) : 2 * ( match[3] === "even" || match[3] === "odd" ) ); - match[5] = +( ( match[7] + match[8] ) || match[3] === "odd" ); - - // other types prohibit arguments - } else if ( match[3] ) { - Sizzle.error( match[0] ); - } - - return match; - }, - - "PSEUDO": function( match ) { - var excess, - unquoted = !match[5] && match[2]; - - if ( matchExpr["CHILD"].test( match[0] ) ) { - return null; - } - - // Accept quoted arguments as-is - if ( match[3] && match[4] !== undefined ) { - match[2] = match[4]; - - // Strip excess characters from unquoted arguments - } else if ( unquoted && rpseudo.test( unquoted ) && - // Get excess from tokenize (recursively) - (excess = tokenize( unquoted, true )) && - // advance to the next closing parenthesis - (excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length) ) { - - // excess is a negative index - match[0] = match[0].slice( 0, excess ); - match[2] = unquoted.slice( 0, excess ); - } - - // Return only captures needed by the pseudo filter method (type and argument) - return match.slice( 0, 3 ); - } - }, - - filter: { - - "TAG": function( nodeNameSelector ) { - var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); - return nodeNameSelector === "*" ? - function() { return true; } : - function( elem ) { - return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; - }; - }, - - "CLASS": function( className ) { - var pattern = classCache[ className + " " ]; - - return pattern || - (pattern = new RegExp( "(^|" + whitespace + ")" + className + "(" + whitespace + "|$)" )) && - classCache( className, function( elem ) { - return pattern.test( typeof elem.className === "string" && elem.className || typeof elem.getAttribute !== strundefined && elem.getAttribute("class") || "" ); - }); - }, - - "ATTR": function( name, operator, check ) { - return function( elem ) { - var result = Sizzle.attr( elem, name ); - - if ( result == null ) { - return operator === "!="; - } - if ( !operator ) { - return true; - } - - result += ""; - - return operator === "=" ? result === check : - operator === "!=" ? result !== check : - operator === "^=" ? check && result.indexOf( check ) === 0 : - operator === "*=" ? check && result.indexOf( check ) > -1 : - operator === "$=" ? check && result.slice( -check.length ) === check : - operator === "~=" ? ( " " + result + " " ).indexOf( check ) > -1 : - operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : - false; - }; - }, - - "CHILD": function( type, what, argument, first, last ) { - var simple = type.slice( 0, 3 ) !== "nth", - forward = type.slice( -4 ) !== "last", - ofType = what === "of-type"; - - return first === 1 && last === 0 ? - - // Shortcut for :nth-*(n) - function( elem ) { - return !!elem.parentNode; - } : - - function( elem, context, xml ) { - var cache, outerCache, node, diff, nodeIndex, start, - dir = simple !== forward ? "nextSibling" : "previousSibling", - parent = elem.parentNode, - name = ofType && elem.nodeName.toLowerCase(), - useCache = !xml && !ofType; - - if ( parent ) { - - // :(first|last|only)-(child|of-type) - if ( simple ) { - while ( dir ) { - node = elem; - while ( (node = node[ dir ]) ) { - if ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) { - return false; - } - } - // Reverse direction for :only-* (if we haven't yet done so) - start = dir = type === "only" && !start && "nextSibling"; - } - return true; - } - - start = [ forward ? parent.firstChild : parent.lastChild ]; - - // non-xml :nth-child(...) stores cache data on `parent` - if ( forward && useCache ) { - // Seek `elem` from a previously-cached index - outerCache = parent[ expando ] || (parent[ expando ] = {}); - cache = outerCache[ type ] || []; - nodeIndex = cache[0] === dirruns && cache[1]; - diff = cache[0] === dirruns && cache[2]; - node = nodeIndex && parent.childNodes[ nodeIndex ]; - - while ( (node = ++nodeIndex && node && node[ dir ] || - - // Fallback to seeking `elem` from the start - (diff = nodeIndex = 0) || start.pop()) ) { - - // When found, cache indexes on `parent` and break - if ( node.nodeType === 1 && ++diff && node === elem ) { - outerCache[ type ] = [ dirruns, nodeIndex, diff ]; - break; - } - } - - // Use previously-cached element index if available - } else if ( useCache && (cache = (elem[ expando ] || (elem[ expando ] = {}))[ type ]) && cache[0] === dirruns ) { - diff = cache[1]; - - // xml :nth-child(...) or :nth-last-child(...) or :nth(-last)?-of-type(...) - } else { - // Use the same loop as above to seek `elem` from the start - while ( (node = ++nodeIndex && node && node[ dir ] || - (diff = nodeIndex = 0) || start.pop()) ) { - - if ( ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) && ++diff ) { - // Cache the index of each encountered element - if ( useCache ) { - (node[ expando ] || (node[ expando ] = {}))[ type ] = [ dirruns, diff ]; - } - - if ( node === elem ) { - break; - } - } - } - } - - // Incorporate the offset, then check against cycle size - diff -= last; - return diff === first || ( diff % first === 0 && diff / first >= 0 ); - } - }; - }, - - "PSEUDO": function( pseudo, argument ) { - // pseudo-class names are case-insensitive - // http://www.w3.org/TR/selectors/#pseudo-classes - // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters - // Remember that setFilters inherits from pseudos - var args, - fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || - Sizzle.error( "unsupported pseudo: " + pseudo ); - - // The user may use createPseudo to indicate that - // arguments are needed to create the filter function - // just as Sizzle does - if ( fn[ expando ] ) { - return fn( argument ); - } - - // But maintain support for old signatures - if ( fn.length > 1 ) { - args = [ pseudo, pseudo, "", argument ]; - return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? - markFunction(function( seed, matches ) { - var idx, - matched = fn( seed, argument ), - i = matched.length; - while ( i-- ) { - idx = indexOf.call( seed, matched[i] ); - seed[ idx ] = !( matches[ idx ] = matched[i] ); - } - }) : - function( elem ) { - return fn( elem, 0, args ); - }; - } - - return fn; - } - }, - - pseudos: { - // Potentially complex pseudos - "not": markFunction(function( selector ) { - // Trim the selector passed to compile - // to avoid treating leading and trailing - // spaces as combinators - var input = [], - results = [], - matcher = compile( selector.replace( rtrim, "$1" ) ); - - return matcher[ expando ] ? - markFunction(function( seed, matches, context, xml ) { - var elem, - unmatched = matcher( seed, null, xml, [] ), - i = seed.length; - - // Match elements unmatched by `matcher` - while ( i-- ) { - if ( (elem = unmatched[i]) ) { - seed[i] = !(matches[i] = elem); - } - } - }) : - function( elem, context, xml ) { - input[0] = elem; - matcher( input, null, xml, results ); - return !results.pop(); - }; - }), - - "has": markFunction(function( selector ) { - return function( elem ) { - return Sizzle( selector, elem ).length > 0; - }; - }), - - "contains": markFunction(function( text ) { - return function( elem ) { - return ( elem.textContent || elem.innerText || getText( elem ) ).indexOf( text ) > -1; - }; - }), - - // "Whether an element is represented by a :lang() selector - // is based solely on the element's language value - // being equal to the identifier C, - // or beginning with the identifier C immediately followed by "-". - // The matching of C against the element's language value is performed case-insensitively. - // The identifier C does not have to be a valid language name." - // http://www.w3.org/TR/selectors/#lang-pseudo - "lang": markFunction( function( lang ) { - // lang value must be a valid identifier - if ( !ridentifier.test(lang || "") ) { - Sizzle.error( "unsupported lang: " + lang ); - } - lang = lang.replace( runescape, funescape ).toLowerCase(); - return function( elem ) { - var elemLang; - do { - if ( (elemLang = documentIsHTML ? - elem.lang : - elem.getAttribute("xml:lang") || elem.getAttribute("lang")) ) { - - elemLang = elemLang.toLowerCase(); - return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; - } - } while ( (elem = elem.parentNode) && elem.nodeType === 1 ); - return false; - }; - }), - - // Miscellaneous - "target": function( elem ) { - var hash = window.location && window.location.hash; - return hash && hash.slice( 1 ) === elem.id; - }, - - "root": function( elem ) { - return elem === docElem; - }, - - "focus": function( elem ) { - return elem === document.activeElement && (!document.hasFocus || document.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex); - }, - - // Boolean properties - "enabled": function( elem ) { - return elem.disabled === false; - }, - - "disabled": function( elem ) { - return elem.disabled === true; - }, - - "checked": function( elem ) { - // In CSS3, :checked should return both checked and selected elements - // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked - var nodeName = elem.nodeName.toLowerCase(); - return (nodeName === "input" && !!elem.checked) || (nodeName === "option" && !!elem.selected); - }, - - "selected": function( elem ) { - // Accessing this property makes selected-by-default - // options in Safari work properly - if ( elem.parentNode ) { - elem.parentNode.selectedIndex; - } - - return elem.selected === true; - }, - - // Contents - "empty": function( elem ) { - // http://www.w3.org/TR/selectors/#empty-pseudo - // :empty is only affected by element nodes and content nodes(including text(3), cdata(4)), - // not comment, processing instructions, or others - // Thanks to Diego Perini for the nodeName shortcut - // Greater than "@" means alpha characters (specifically not starting with "#" or "?") - for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { - if ( elem.nodeName > "@" || elem.nodeType === 3 || elem.nodeType === 4 ) { - return false; - } - } - return true; - }, - - "parent": function( elem ) { - return !Expr.pseudos["empty"]( elem ); - }, - - // Element/input types - "header": function( elem ) { - return rheader.test( elem.nodeName ); - }, - - "input": function( elem ) { - return rinputs.test( elem.nodeName ); - }, - - "button": function( elem ) { - var name = elem.nodeName.toLowerCase(); - return name === "input" && elem.type === "button" || name === "button"; - }, - - "text": function( elem ) { - var attr; - // IE6 and 7 will map elem.type to 'text' for new HTML5 types (search, etc) - // use getAttribute instead to test this case - return elem.nodeName.toLowerCase() === "input" && - elem.type === "text" && - ( (attr = elem.getAttribute("type")) == null || attr.toLowerCase() === elem.type ); - }, - - // Position-in-collection - "first": createPositionalPseudo(function() { - return [ 0 ]; - }), - - "last": createPositionalPseudo(function( matchIndexes, length ) { - return [ length - 1 ]; - }), - - "eq": createPositionalPseudo(function( matchIndexes, length, argument ) { - return [ argument < 0 ? argument + length : argument ]; - }), - - "even": createPositionalPseudo(function( matchIndexes, length ) { - var i = 0; - for ( ; i < length; i += 2 ) { - matchIndexes.push( i ); - } - return matchIndexes; - }), - - "odd": createPositionalPseudo(function( matchIndexes, length ) { - var i = 1; - for ( ; i < length; i += 2 ) { - matchIndexes.push( i ); - } - return matchIndexes; - }), - - "lt": createPositionalPseudo(function( matchIndexes, length, argument ) { - var i = argument < 0 ? argument + length : argument; - for ( ; --i >= 0; ) { - matchIndexes.push( i ); - } - return matchIndexes; - }), - - "gt": createPositionalPseudo(function( matchIndexes, length, argument ) { - var i = argument < 0 ? argument + length : argument; - for ( ; ++i < length; ) { - matchIndexes.push( i ); - } - return matchIndexes; - }) - } -}; - -Expr.pseudos["nth"] = Expr.pseudos["eq"]; - -// Add button/input type pseudos -for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { - Expr.pseudos[ i ] = createInputPseudo( i ); -} -for ( i in { submit: true, reset: true } ) { - Expr.pseudos[ i ] = createButtonPseudo( i ); -} - -// Easy API for creating new setFilters -function setFilters() {} -setFilters.prototype = Expr.filters = Expr.pseudos; -Expr.setFilters = new setFilters(); - -function tokenize( selector, parseOnly ) { - var matched, match, tokens, type, - soFar, groups, preFilters, - cached = tokenCache[ selector + " " ]; - - if ( cached ) { - return parseOnly ? 0 : cached.slice( 0 ); - } - - soFar = selector; - groups = []; - preFilters = Expr.preFilter; - - while ( soFar ) { - - // Comma and first run - if ( !matched || (match = rcomma.exec( soFar )) ) { - if ( match ) { - // Don't consume trailing commas as valid - soFar = soFar.slice( match[0].length ) || soFar; - } - groups.push( tokens = [] ); - } - - matched = false; - - // Combinators - if ( (match = rcombinators.exec( soFar )) ) { - matched = match.shift(); - tokens.push({ - value: matched, - // Cast descendant combinators to space - type: match[0].replace( rtrim, " " ) - }); - soFar = soFar.slice( matched.length ); - } - - // Filters - for ( type in Expr.filter ) { - if ( (match = matchExpr[ type ].exec( soFar )) && (!preFilters[ type ] || - (match = preFilters[ type ]( match ))) ) { - matched = match.shift(); - tokens.push({ - value: matched, - type: type, - matches: match - }); - soFar = soFar.slice( matched.length ); - } - } - - if ( !matched ) { - break; - } - } - - // Return the length of the invalid excess - // if we're just parsing - // Otherwise, throw an error or return tokens - return parseOnly ? - soFar.length : - soFar ? - Sizzle.error( selector ) : - // Cache the tokens - tokenCache( selector, groups ).slice( 0 ); -} - -function toSelector( tokens ) { - var i = 0, - len = tokens.length, - selector = ""; - for ( ; i < len; i++ ) { - selector += tokens[i].value; - } - return selector; -} - -function addCombinator( matcher, combinator, base ) { - var dir = combinator.dir, - checkNonElements = base && dir === "parentNode", - doneName = done++; - - return combinator.first ? - // Check against closest ancestor/preceding element - function( elem, context, xml ) { - while ( (elem = elem[ dir ]) ) { - if ( elem.nodeType === 1 || checkNonElements ) { - return matcher( elem, context, xml ); - } - } - } : - - // Check against all ancestor/preceding elements - function( elem, context, xml ) { - var data, cache, outerCache, - dirkey = dirruns + " " + doneName; - - // We can't set arbitrary data on XML nodes, so they don't benefit from dir caching - if ( xml ) { - while ( (elem = elem[ dir ]) ) { - if ( elem.nodeType === 1 || checkNonElements ) { - if ( matcher( elem, context, xml ) ) { - return true; - } - } - } - } else { - while ( (elem = elem[ dir ]) ) { - if ( elem.nodeType === 1 || checkNonElements ) { - outerCache = elem[ expando ] || (elem[ expando ] = {}); - if ( (cache = outerCache[ dir ]) && cache[0] === dirkey ) { - if ( (data = cache[1]) === true || data === cachedruns ) { - return data === true; - } - } else { - cache = outerCache[ dir ] = [ dirkey ]; - cache[1] = matcher( elem, context, xml ) || cachedruns; - if ( cache[1] === true ) { - return true; - } - } - } - } - } - }; -} - -function elementMatcher( matchers ) { - return matchers.length > 1 ? - function( elem, context, xml ) { - var i = matchers.length; - while ( i-- ) { - if ( !matchers[i]( elem, context, xml ) ) { - return false; - } - } - return true; - } : - matchers[0]; -} - -function condense( unmatched, map, filter, context, xml ) { - var elem, - newUnmatched = [], - i = 0, - len = unmatched.length, - mapped = map != null; - - for ( ; i < len; i++ ) { - if ( (elem = unmatched[i]) ) { - if ( !filter || filter( elem, context, xml ) ) { - newUnmatched.push( elem ); - if ( mapped ) { - map.push( i ); - } - } - } - } - - return newUnmatched; -} - -function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { - if ( postFilter && !postFilter[ expando ] ) { - postFilter = setMatcher( postFilter ); - } - if ( postFinder && !postFinder[ expando ] ) { - postFinder = setMatcher( postFinder, postSelector ); - } - return markFunction(function( seed, results, context, xml ) { - var temp, i, elem, - preMap = [], - postMap = [], - preexisting = results.length, - - // Get initial elements from seed or context - elems = seed || multipleContexts( selector || "*", context.nodeType ? [ context ] : context, [] ), - - // Prefilter to get matcher input, preserving a map for seed-results synchronization - matcherIn = preFilter && ( seed || !selector ) ? - condense( elems, preMap, preFilter, context, xml ) : - elems, - - matcherOut = matcher ? - // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, - postFinder || ( seed ? preFilter : preexisting || postFilter ) ? - - // ...intermediate processing is necessary - [] : - - // ...otherwise use results directly - results : - matcherIn; - - // Find primary matches - if ( matcher ) { - matcher( matcherIn, matcherOut, context, xml ); - } - - // Apply postFilter - if ( postFilter ) { - temp = condense( matcherOut, postMap ); - postFilter( temp, [], context, xml ); - - // Un-match failing elements by moving them back to matcherIn - i = temp.length; - while ( i-- ) { - if ( (elem = temp[i]) ) { - matcherOut[ postMap[i] ] = !(matcherIn[ postMap[i] ] = elem); - } - } - } - - if ( seed ) { - if ( postFinder || preFilter ) { - if ( postFinder ) { - // Get the final matcherOut by condensing this intermediate into postFinder contexts - temp = []; - i = matcherOut.length; - while ( i-- ) { - if ( (elem = matcherOut[i]) ) { - // Restore matcherIn since elem is not yet a final match - temp.push( (matcherIn[i] = elem) ); - } - } - postFinder( null, (matcherOut = []), temp, xml ); - } - - // Move matched elements from seed to results to keep them synchronized - i = matcherOut.length; - while ( i-- ) { - if ( (elem = matcherOut[i]) && - (temp = postFinder ? indexOf.call( seed, elem ) : preMap[i]) > -1 ) { - - seed[temp] = !(results[temp] = elem); - } - } - } - - // Add elements to results, through postFinder if defined - } else { - matcherOut = condense( - matcherOut === results ? - matcherOut.splice( preexisting, matcherOut.length ) : - matcherOut - ); - if ( postFinder ) { - postFinder( null, results, matcherOut, xml ); - } else { - push.apply( results, matcherOut ); - } - } - }); -} - -function matcherFromTokens( tokens ) { - var checkContext, matcher, j, - len = tokens.length, - leadingRelative = Expr.relative[ tokens[0].type ], - implicitRelative = leadingRelative || Expr.relative[" "], - i = leadingRelative ? 1 : 0, - - // The foundational matcher ensures that elements are reachable from top-level context(s) - matchContext = addCombinator( function( elem ) { - return elem === checkContext; - }, implicitRelative, true ), - matchAnyContext = addCombinator( function( elem ) { - return indexOf.call( checkContext, elem ) > -1; - }, implicitRelative, true ), - matchers = [ function( elem, context, xml ) { - return ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( - (checkContext = context).nodeType ? - matchContext( elem, context, xml ) : - matchAnyContext( elem, context, xml ) ); - } ]; - - for ( ; i < len; i++ ) { - if ( (matcher = Expr.relative[ tokens[i].type ]) ) { - matchers = [ addCombinator(elementMatcher( matchers ), matcher) ]; - } else { - matcher = Expr.filter[ tokens[i].type ].apply( null, tokens[i].matches ); - - // Return special upon seeing a positional matcher - if ( matcher[ expando ] ) { - // Find the next relative operator (if any) for proper handling - j = ++i; - for ( ; j < len; j++ ) { - if ( Expr.relative[ tokens[j].type ] ) { - break; - } - } - return setMatcher( - i > 1 && elementMatcher( matchers ), - i > 1 && toSelector( - // If the preceding token was a descendant combinator, insert an implicit any-element `*` - tokens.slice( 0, i - 1 ).concat({ value: tokens[ i - 2 ].type === " " ? "*" : "" }) - ).replace( rtrim, "$1" ), - matcher, - i < j && matcherFromTokens( tokens.slice( i, j ) ), - j < len && matcherFromTokens( (tokens = tokens.slice( j )) ), - j < len && toSelector( tokens ) - ); - } - matchers.push( matcher ); - } - } - - return elementMatcher( matchers ); -} - -function matcherFromGroupMatchers( elementMatchers, setMatchers ) { - // A counter to specify which element is currently being matched - var matcherCachedRuns = 0, - bySet = setMatchers.length > 0, - byElement = elementMatchers.length > 0, - superMatcher = function( seed, context, xml, results, expandContext ) { - var elem, j, matcher, - setMatched = [], - matchedCount = 0, - i = "0", - unmatched = seed && [], - outermost = expandContext != null, - contextBackup = outermostContext, - // We must always have either seed elements or context - elems = seed || byElement && Expr.find["TAG"]( "*", expandContext && context.parentNode || context ), - // Use integer dirruns iff this is the outermost matcher - dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1); - - if ( outermost ) { - outermostContext = context !== document && context; - cachedruns = matcherCachedRuns; - } - - // Add elements passing elementMatchers directly to results - // Keep `i` a string if there are no elements so `matchedCount` will be "00" below - for ( ; (elem = elems[i]) != null; i++ ) { - if ( byElement && elem ) { - j = 0; - while ( (matcher = elementMatchers[j++]) ) { - if ( matcher( elem, context, xml ) ) { - results.push( elem ); - break; - } - } - if ( outermost ) { - dirruns = dirrunsUnique; - cachedruns = ++matcherCachedRuns; - } - } - - // Track unmatched elements for set filters - if ( bySet ) { - // They will have gone through all possible matchers - if ( (elem = !matcher && elem) ) { - matchedCount--; - } - - // Lengthen the array for every element, matched or not - if ( seed ) { - unmatched.push( elem ); - } - } - } - - // Apply set filters to unmatched elements - matchedCount += i; - if ( bySet && i !== matchedCount ) { - j = 0; - while ( (matcher = setMatchers[j++]) ) { - matcher( unmatched, setMatched, context, xml ); - } - - if ( seed ) { - // Reintegrate element matches to eliminate the need for sorting - if ( matchedCount > 0 ) { - while ( i-- ) { - if ( !(unmatched[i] || setMatched[i]) ) { - setMatched[i] = pop.call( results ); - } - } - } - - // Discard index placeholder values to get only actual matches - setMatched = condense( setMatched ); - } - - // Add matches to results - push.apply( results, setMatched ); - - // Seedless set matches succeeding multiple successful matchers stipulate sorting - if ( outermost && !seed && setMatched.length > 0 && - ( matchedCount + setMatchers.length ) > 1 ) { - - Sizzle.uniqueSort( results ); - } - } - - // Override manipulation of globals by nested matchers - if ( outermost ) { - dirruns = dirrunsUnique; - outermostContext = contextBackup; - } - - return unmatched; - }; - - return bySet ? - markFunction( superMatcher ) : - superMatcher; -} - -compile = Sizzle.compile = function( selector, group /* Internal Use Only */ ) { - var i, - setMatchers = [], - elementMatchers = [], - cached = compilerCache[ selector + " " ]; - - if ( !cached ) { - // Generate a function of recursive functions that can be used to check each element - if ( !group ) { - group = tokenize( selector ); - } - i = group.length; - while ( i-- ) { - cached = matcherFromTokens( group[i] ); - if ( cached[ expando ] ) { - setMatchers.push( cached ); - } else { - elementMatchers.push( cached ); - } - } - - // Cache the compiled function - cached = compilerCache( selector, matcherFromGroupMatchers( elementMatchers, setMatchers ) ); - } - return cached; -}; - -function multipleContexts( selector, contexts, results ) { - var i = 0, - len = contexts.length; - for ( ; i < len; i++ ) { - Sizzle( selector, contexts[i], results ); - } - return results; -} - -function select( selector, context, results, seed ) { - var i, tokens, token, type, find, - match = tokenize( selector ); - - if ( !seed ) { - // Try to minimize operations if there is only one group - if ( match.length === 1 ) { - - // Take a shortcut and set the context if the root selector is an ID - tokens = match[0] = match[0].slice( 0 ); - if ( tokens.length > 2 && (token = tokens[0]).type === "ID" && - support.getById && context.nodeType === 9 && documentIsHTML && - Expr.relative[ tokens[1].type ] ) { - - context = ( Expr.find["ID"]( token.matches[0].replace(runescape, funescape), context ) || [] )[0]; - if ( !context ) { - return results; - } - selector = selector.slice( tokens.shift().value.length ); - } - - // Fetch a seed set for right-to-left matching - i = matchExpr["needsContext"].test( selector ) ? 0 : tokens.length; - while ( i-- ) { - token = tokens[i]; - - // Abort if we hit a combinator - if ( Expr.relative[ (type = token.type) ] ) { - break; - } - if ( (find = Expr.find[ type ]) ) { - // Search, expanding context for leading sibling combinators - if ( (seed = find( - token.matches[0].replace( runescape, funescape ), - rsibling.test( tokens[0].type ) && context.parentNode || context - )) ) { - - // If seed is empty or no tokens remain, we can return early - tokens.splice( i, 1 ); - selector = seed.length && toSelector( tokens ); - if ( !selector ) { - push.apply( results, seed ); - return results; - } - - break; - } - } - } - } - } - - // Compile and execute a filtering function - // Provide `match` to avoid retokenization if we modified the selector above - compile( selector, match )( - seed, - context, - !documentIsHTML, - results, - rsibling.test( selector ) - ); - return results; -} - -// One-time assignments - -// Sort stability -support.sortStable = expando.split("").sort( sortOrder ).join("") === expando; - -// Support: Chrome<14 -// Always assume duplicates if they aren't passed to the comparison function -support.detectDuplicates = hasDuplicate; - -// Initialize against the default document -setDocument(); - -// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) -// Detached nodes confoundingly follow *each other* -support.sortDetached = assert(function( div1 ) { - // Should return 1, but returns 4 (following) - return div1.compareDocumentPosition( document.createElement("div") ) & 1; -}); - -// Support: IE<8 -// Prevent attribute/property "interpolation" -// http://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx -if ( !assert(function( div ) { - div.innerHTML = ""; - return div.firstChild.getAttribute("href") === "#" ; -}) ) { - addHandle( "type|href|height|width", function( elem, name, isXML ) { - if ( !isXML ) { - return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); - } - }); -} - -// Support: IE<9 -// Use defaultValue in place of getAttribute("value") -if ( !support.attributes || !assert(function( div ) { - div.innerHTML = ""; - div.firstChild.setAttribute( "value", "" ); - return div.firstChild.getAttribute( "value" ) === ""; -}) ) { - addHandle( "value", function( elem, name, isXML ) { - if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { - return elem.defaultValue; - } - }); -} - -// Support: IE<9 -// Use getAttributeNode to fetch booleans when getAttribute lies -if ( !assert(function( div ) { - return div.getAttribute("disabled") == null; -}) ) { - addHandle( booleans, function( elem, name, isXML ) { - var val; - if ( !isXML ) { - return (val = elem.getAttributeNode( name )) && val.specified ? - val.value : - elem[ name ] === true ? name.toLowerCase() : null; - } - }); -} - -jQuery.find = Sizzle; -jQuery.expr = Sizzle.selectors; -jQuery.expr[":"] = jQuery.expr.pseudos; -jQuery.unique = Sizzle.uniqueSort; -jQuery.text = Sizzle.getText; -jQuery.isXMLDoc = Sizzle.isXML; -jQuery.contains = Sizzle.contains; - - -})( window ); -// String to Object options format cache -var optionsCache = {}; - -// Convert String-formatted options into Object-formatted ones and store in cache -function createOptions( options ) { - var object = optionsCache[ options ] = {}; - jQuery.each( options.match( core_rnotwhite ) || [], function( _, flag ) { - object[ flag ] = true; - }); - return object; -} - -/* - * Create a callback list using the following parameters: - * - * options: an optional list of space-separated options that will change how - * the callback list behaves or a more traditional option object - * - * By default a callback list will act like an event callback list and can be - * "fired" multiple times. - * - * Possible options: - * - * once: will ensure the callback list can only be fired once (like a Deferred) - * - * memory: will keep track of previous values and will call any callback added - * after the list has been fired right away with the latest "memorized" - * values (like a Deferred) - * - * unique: will ensure a callback can only be added once (no duplicate in the list) - * - * stopOnFalse: interrupt callings when a callback returns false - * - */ -jQuery.Callbacks = function( options ) { - - // Convert options from String-formatted to Object-formatted if needed - // (we check in cache first) - options = typeof options === "string" ? - ( optionsCache[ options ] || createOptions( options ) ) : - jQuery.extend( {}, options ); - - var // Flag to know if list is currently firing - firing, - // Last fire value (for non-forgettable lists) - memory, - // Flag to know if list was already fired - fired, - // End of the loop when firing - firingLength, - // Index of currently firing callback (modified by remove if needed) - firingIndex, - // First callback to fire (used internally by add and fireWith) - firingStart, - // Actual callback list - list = [], - // Stack of fire calls for repeatable lists - stack = !options.once && [], - // Fire callbacks - fire = function( data ) { - memory = options.memory && data; - fired = true; - firingIndex = firingStart || 0; - firingStart = 0; - firingLength = list.length; - firing = true; - for ( ; list && firingIndex < firingLength; firingIndex++ ) { - if ( list[ firingIndex ].apply( data[ 0 ], data[ 1 ] ) === false && options.stopOnFalse ) { - memory = false; // To prevent further calls using add - break; - } - } - firing = false; - if ( list ) { - if ( stack ) { - if ( stack.length ) { - fire( stack.shift() ); - } - } else if ( memory ) { - list = []; - } else { - self.disable(); - } - } - }, - // Actual Callbacks object - self = { - // Add a callback or a collection of callbacks to the list - add: function() { - if ( list ) { - // First, we save the current length - var start = list.length; - (function add( args ) { - jQuery.each( args, function( _, arg ) { - var type = jQuery.type( arg ); - if ( type === "function" ) { - if ( !options.unique || !self.has( arg ) ) { - list.push( arg ); - } - } else if ( arg && arg.length && type !== "string" ) { - // Inspect recursively - add( arg ); - } - }); - })( arguments ); - // Do we need to add the callbacks to the - // current firing batch? - if ( firing ) { - firingLength = list.length; - // With memory, if we're not firing then - // we should call right away - } else if ( memory ) { - firingStart = start; - fire( memory ); - } - } - return this; - }, - // Remove a callback from the list - remove: function() { - if ( list ) { - jQuery.each( arguments, function( _, arg ) { - var index; - while( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { - list.splice( index, 1 ); - // Handle firing indexes - if ( firing ) { - if ( index <= firingLength ) { - firingLength--; - } - if ( index <= firingIndex ) { - firingIndex--; - } - } - } - }); - } - return this; - }, - // Check if a given callback is in the list. - // If no argument is given, return whether or not list has callbacks attached. - has: function( fn ) { - return fn ? jQuery.inArray( fn, list ) > -1 : !!( list && list.length ); - }, - // Remove all callbacks from the list - empty: function() { - list = []; - firingLength = 0; - return this; - }, - // Have the list do nothing anymore - disable: function() { - list = stack = memory = undefined; - return this; - }, - // Is it disabled? - disabled: function() { - return !list; - }, - // Lock the list in its current state - lock: function() { - stack = undefined; - if ( !memory ) { - self.disable(); - } - return this; - }, - // Is it locked? - locked: function() { - return !stack; - }, - // Call all callbacks with the given context and arguments - fireWith: function( context, args ) { - if ( list && ( !fired || stack ) ) { - args = args || []; - args = [ context, args.slice ? args.slice() : args ]; - if ( firing ) { - stack.push( args ); - } else { - fire( args ); - } - } - return this; - }, - // Call all the callbacks with the given arguments - fire: function() { - self.fireWith( this, arguments ); - return this; - }, - // To know if the callbacks have already been called at least once - fired: function() { - return !!fired; - } - }; - - return self; -}; -jQuery.extend({ - - Deferred: function( func ) { - var tuples = [ - // action, add listener, listener list, final state - [ "resolve", "done", jQuery.Callbacks("once memory"), "resolved" ], - [ "reject", "fail", jQuery.Callbacks("once memory"), "rejected" ], - [ "notify", "progress", jQuery.Callbacks("memory") ] - ], - state = "pending", - promise = { - state: function() { - return state; - }, - always: function() { - deferred.done( arguments ).fail( arguments ); - return this; - }, - then: function( /* fnDone, fnFail, fnProgress */ ) { - var fns = arguments; - return jQuery.Deferred(function( newDefer ) { - jQuery.each( tuples, function( i, tuple ) { - var action = tuple[ 0 ], - fn = jQuery.isFunction( fns[ i ] ) && fns[ i ]; - // deferred[ done | fail | progress ] for forwarding actions to newDefer - deferred[ tuple[1] ](function() { - var returned = fn && fn.apply( this, arguments ); - if ( returned && jQuery.isFunction( returned.promise ) ) { - returned.promise() - .done( newDefer.resolve ) - .fail( newDefer.reject ) - .progress( newDefer.notify ); - } else { - newDefer[ action + "With" ]( this === promise ? newDefer.promise() : this, fn ? [ returned ] : arguments ); - } - }); - }); - fns = null; - }).promise(); - }, - // Get a promise for this deferred - // If obj is provided, the promise aspect is added to the object - promise: function( obj ) { - return obj != null ? jQuery.extend( obj, promise ) : promise; - } - }, - deferred = {}; - - // Keep pipe for back-compat - promise.pipe = promise.then; - - // Add list-specific methods - jQuery.each( tuples, function( i, tuple ) { - var list = tuple[ 2 ], - stateString = tuple[ 3 ]; - - // promise[ done | fail | progress ] = list.add - promise[ tuple[1] ] = list.add; - - // Handle state - if ( stateString ) { - list.add(function() { - // state = [ resolved | rejected ] - state = stateString; - - // [ reject_list | resolve_list ].disable; progress_list.lock - }, tuples[ i ^ 1 ][ 2 ].disable, tuples[ 2 ][ 2 ].lock ); - } - - // deferred[ resolve | reject | notify ] - deferred[ tuple[0] ] = function() { - deferred[ tuple[0] + "With" ]( this === deferred ? promise : this, arguments ); - return this; - }; - deferred[ tuple[0] + "With" ] = list.fireWith; - }); - - // Make the deferred a promise - promise.promise( deferred ); - - // Call given func if any - if ( func ) { - func.call( deferred, deferred ); - } - - // All done! - return deferred; - }, - - // Deferred helper - when: function( subordinate /* , ..., subordinateN */ ) { - var i = 0, - resolveValues = core_slice.call( arguments ), - length = resolveValues.length, - - // the count of uncompleted subordinates - remaining = length !== 1 || ( subordinate && jQuery.isFunction( subordinate.promise ) ) ? length : 0, - - // the master Deferred. If resolveValues consist of only a single Deferred, just use that. - deferred = remaining === 1 ? subordinate : jQuery.Deferred(), - - // Update function for both resolve and progress values - updateFunc = function( i, contexts, values ) { - return function( value ) { - contexts[ i ] = this; - values[ i ] = arguments.length > 1 ? core_slice.call( arguments ) : value; - if( values === progressValues ) { - deferred.notifyWith( contexts, values ); - } else if ( !( --remaining ) ) { - deferred.resolveWith( contexts, values ); - } - }; - }, - - progressValues, progressContexts, resolveContexts; - - // add listeners to Deferred subordinates; treat others as resolved - if ( length > 1 ) { - progressValues = new Array( length ); - progressContexts = new Array( length ); - resolveContexts = new Array( length ); - for ( ; i < length; i++ ) { - if ( resolveValues[ i ] && jQuery.isFunction( resolveValues[ i ].promise ) ) { - resolveValues[ i ].promise() - .done( updateFunc( i, resolveContexts, resolveValues ) ) - .fail( deferred.reject ) - .progress( updateFunc( i, progressContexts, progressValues ) ); - } else { - --remaining; - } - } - } - - // if we're not waiting on anything, resolve the master - if ( !remaining ) { - deferred.resolveWith( resolveContexts, resolveValues ); - } - - return deferred.promise(); - } -}); -jQuery.support = (function( support ) { - - var all, a, input, select, fragment, opt, eventName, isSupported, i, - div = document.createElement("div"); - - // Setup - div.setAttribute( "className", "t" ); - div.innerHTML = "
a"; - - // Finish early in limited (non-browser) environments - all = div.getElementsByTagName("*") || []; - a = div.getElementsByTagName("a")[ 0 ]; - if ( !a || !a.style || !all.length ) { - return support; - } - - // First batch of tests - select = document.createElement("select"); - opt = select.appendChild( document.createElement("option") ); - input = div.getElementsByTagName("input")[ 0 ]; - - a.style.cssText = "top:1px;float:left;opacity:.5"; - - // Test setAttribute on camelCase class. If it works, we need attrFixes when doing get/setAttribute (ie6/7) - support.getSetAttribute = div.className !== "t"; - - // IE strips leading whitespace when .innerHTML is used - support.leadingWhitespace = div.firstChild.nodeType === 3; - - // Make sure that tbody elements aren't automatically inserted - // IE will insert them into empty tables - support.tbody = !div.getElementsByTagName("tbody").length; - - // Make sure that link elements get serialized correctly by innerHTML - // This requires a wrapper element in IE - support.htmlSerialize = !!div.getElementsByTagName("link").length; - - // Get the style information from getAttribute - // (IE uses .cssText instead) - support.style = /top/.test( a.getAttribute("style") ); - - // Make sure that URLs aren't manipulated - // (IE normalizes it by default) - support.hrefNormalized = a.getAttribute("href") === "/a"; - - // Make sure that element opacity exists - // (IE uses filter instead) - // Use a regex to work around a WebKit issue. See #5145 - support.opacity = /^0.5/.test( a.style.opacity ); - - // Verify style float existence - // (IE uses styleFloat instead of cssFloat) - support.cssFloat = !!a.style.cssFloat; - - // Check the default checkbox/radio value ("" on WebKit; "on" elsewhere) - support.checkOn = !!input.value; - - // Make sure that a selected-by-default option has a working selected property. - // (WebKit defaults to false instead of true, IE too, if it's in an optgroup) - support.optSelected = opt.selected; - - // Tests for enctype support on a form (#6743) - support.enctype = !!document.createElement("form").enctype; - - // Makes sure cloning an html5 element does not cause problems - // Where outerHTML is undefined, this still works - support.html5Clone = document.createElement("nav").cloneNode( true ).outerHTML !== "<:nav>"; - - // Will be defined later - support.inlineBlockNeedsLayout = false; - support.shrinkWrapBlocks = false; - support.pixelPosition = false; - support.deleteExpando = true; - support.noCloneEvent = true; - support.reliableMarginRight = true; - support.boxSizingReliable = true; - - // Make sure checked status is properly cloned - input.checked = true; - support.noCloneChecked = input.cloneNode( true ).checked; - - // Make sure that the options inside disabled selects aren't marked as disabled - // (WebKit marks them as disabled) - select.disabled = true; - support.optDisabled = !opt.disabled; - - // Support: IE<9 - try { - delete div.test; - } catch( e ) { - support.deleteExpando = false; - } - - // Check if we can trust getAttribute("value") - input = document.createElement("input"); - input.setAttribute( "value", "" ); - support.input = input.getAttribute( "value" ) === ""; - - // Check if an input maintains its value after becoming a radio - input.value = "t"; - input.setAttribute( "type", "radio" ); - support.radioValue = input.value === "t"; - - // #11217 - WebKit loses check when the name is after the checked attribute - input.setAttribute( "checked", "t" ); - input.setAttribute( "name", "t" ); - - fragment = document.createDocumentFragment(); - fragment.appendChild( input ); - - // Check if a disconnected checkbox will retain its checked - // value of true after appended to the DOM (IE6/7) - support.appendChecked = input.checked; - - // WebKit doesn't clone checked state correctly in fragments - support.checkClone = fragment.cloneNode( true ).cloneNode( true ).lastChild.checked; - - // Support: IE<9 - // Opera does not clone events (and typeof div.attachEvent === undefined). - // IE9-10 clones events bound via attachEvent, but they don't trigger with .click() - if ( div.attachEvent ) { - div.attachEvent( "onclick", function() { - support.noCloneEvent = false; - }); - - div.cloneNode( true ).click(); - } - - // Support: IE<9 (lack submit/change bubble), Firefox 17+ (lack focusin event) - // Beware of CSP restrictions (https://developer.mozilla.org/en/Security/CSP) - for ( i in { submit: true, change: true, focusin: true }) { - div.setAttribute( eventName = "on" + i, "t" ); - - support[ i + "Bubbles" ] = eventName in window || div.attributes[ eventName ].expando === false; - } - - div.style.backgroundClip = "content-box"; - div.cloneNode( true ).style.backgroundClip = ""; - support.clearCloneStyle = div.style.backgroundClip === "content-box"; - - // Support: IE<9 - // Iteration over object's inherited properties before its own. - for ( i in jQuery( support ) ) { - break; - } - support.ownLast = i !== "0"; - - // Run tests that need a body at doc ready - jQuery(function() { - var container, marginDiv, tds, - divReset = "padding:0;margin:0;border:0;display:block;box-sizing:content-box;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;", - body = document.getElementsByTagName("body")[0]; - - if ( !body ) { - // Return for frameset docs that don't have a body - return; - } - - container = document.createElement("div"); - container.style.cssText = "border:0;width:0;height:0;position:absolute;top:0;left:-9999px;margin-top:1px"; - - body.appendChild( container ).appendChild( div ); - - // Support: IE8 - // Check if table cells still have offsetWidth/Height when they are set - // to display:none and there are still other visible table cells in a - // table row; if so, offsetWidth/Height are not reliable for use when - // determining if an element has been hidden directly using - // display:none (it is still safe to use offsets if a parent element is - // hidden; don safety goggles and see bug #4512 for more information). - div.innerHTML = "
t
"; - tds = div.getElementsByTagName("td"); - tds[ 0 ].style.cssText = "padding:0;margin:0;border:0;display:none"; - isSupported = ( tds[ 0 ].offsetHeight === 0 ); - - tds[ 0 ].style.display = ""; - tds[ 1 ].style.display = "none"; - - // Support: IE8 - // Check if empty table cells still have offsetWidth/Height - support.reliableHiddenOffsets = isSupported && ( tds[ 0 ].offsetHeight === 0 ); - - // Check box-sizing and margin behavior. - div.innerHTML = ""; - div.style.cssText = "box-sizing:border-box;-moz-box-sizing:border-box;-webkit-box-sizing:border-box;padding:1px;border:1px;display:block;width:4px;margin-top:1%;position:absolute;top:1%;"; - - // Workaround failing boxSizing test due to offsetWidth returning wrong value - // with some non-1 values of body zoom, ticket #13543 - jQuery.swap( body, body.style.zoom != null ? { zoom: 1 } : {}, function() { - support.boxSizing = div.offsetWidth === 4; - }); - - // Use window.getComputedStyle because jsdom on node.js will break without it. - if ( window.getComputedStyle ) { - support.pixelPosition = ( window.getComputedStyle( div, null ) || {} ).top !== "1%"; - support.boxSizingReliable = ( window.getComputedStyle( div, null ) || { width: "4px" } ).width === "4px"; - - // Check if div with explicit width and no margin-right incorrectly - // gets computed margin-right based on width of container. (#3333) - // Fails in WebKit before Feb 2011 nightlies - // WebKit Bug 13343 - getComputedStyle returns wrong value for margin-right - marginDiv = div.appendChild( document.createElement("div") ); - marginDiv.style.cssText = div.style.cssText = divReset; - marginDiv.style.marginRight = marginDiv.style.width = "0"; - div.style.width = "1px"; - - support.reliableMarginRight = - !parseFloat( ( window.getComputedStyle( marginDiv, null ) || {} ).marginRight ); - } - - if ( typeof div.style.zoom !== core_strundefined ) { - // Support: IE<8 - // Check if natively block-level elements act like inline-block - // elements when setting their display to 'inline' and giving - // them layout - div.innerHTML = ""; - div.style.cssText = divReset + "width:1px;padding:1px;display:inline;zoom:1"; - support.inlineBlockNeedsLayout = ( div.offsetWidth === 3 ); - - // Support: IE6 - // Check if elements with layout shrink-wrap their children - div.style.display = "block"; - div.innerHTML = "
"; - div.firstChild.style.width = "5px"; - support.shrinkWrapBlocks = ( div.offsetWidth !== 3 ); - - if ( support.inlineBlockNeedsLayout ) { - // Prevent IE 6 from affecting layout for positioned elements #11048 - // Prevent IE from shrinking the body in IE 7 mode #12869 - // Support: IE<8 - body.style.zoom = 1; - } - } - - body.removeChild( container ); - - // Null elements to avoid leaks in IE - container = div = tds = marginDiv = null; - }); - - // Null elements to avoid leaks in IE - all = select = fragment = opt = a = input = null; - - return support; -})({}); - -var rbrace = /(?:\{[\s\S]*\}|\[[\s\S]*\])$/, - rmultiDash = /([A-Z])/g; - -function internalData( elem, name, data, pvt /* Internal Use Only */ ){ - if ( !jQuery.acceptData( elem ) ) { - return; - } - - var ret, thisCache, - internalKey = jQuery.expando, - - // We have to handle DOM nodes and JS objects differently because IE6-7 - // can't GC object references properly across the DOM-JS boundary - isNode = elem.nodeType, - - // Only DOM nodes need the global jQuery cache; JS object data is - // attached directly to the object so GC can occur automatically - cache = isNode ? jQuery.cache : elem, - - // Only defining an ID for JS objects if its cache already exists allows - // the code to shortcut on the same path as a DOM node with no cache - id = isNode ? elem[ internalKey ] : elem[ internalKey ] && internalKey; - - // Avoid doing any more work than we need to when trying to get data on an - // object that has no data at all - if ( (!id || !cache[id] || (!pvt && !cache[id].data)) && data === undefined && typeof name === "string" ) { - return; - } - - if ( !id ) { - // Only DOM nodes need a new unique ID for each element since their data - // ends up in the global cache - if ( isNode ) { - id = elem[ internalKey ] = core_deletedIds.pop() || jQuery.guid++; - } else { - id = internalKey; - } - } - - if ( !cache[ id ] ) { - // Avoid exposing jQuery metadata on plain JS objects when the object - // is serialized using JSON.stringify - cache[ id ] = isNode ? {} : { toJSON: jQuery.noop }; - } - - // An object can be passed to jQuery.data instead of a key/value pair; this gets - // shallow copied over onto the existing cache - if ( typeof name === "object" || typeof name === "function" ) { - if ( pvt ) { - cache[ id ] = jQuery.extend( cache[ id ], name ); - } else { - cache[ id ].data = jQuery.extend( cache[ id ].data, name ); - } - } - - thisCache = cache[ id ]; - - // jQuery data() is stored in a separate object inside the object's internal data - // cache in order to avoid key collisions between internal data and user-defined - // data. - if ( !pvt ) { - if ( !thisCache.data ) { - thisCache.data = {}; - } - - thisCache = thisCache.data; - } - - if ( data !== undefined ) { - thisCache[ jQuery.camelCase( name ) ] = data; - } - - // Check for both converted-to-camel and non-converted data property names - // If a data property was specified - if ( typeof name === "string" ) { - - // First Try to find as-is property data - ret = thisCache[ name ]; - - // Test for null|undefined property data - if ( ret == null ) { - - // Try to find the camelCased property - ret = thisCache[ jQuery.camelCase( name ) ]; - } - } else { - ret = thisCache; - } - - return ret; -} - -function internalRemoveData( elem, name, pvt ) { - if ( !jQuery.acceptData( elem ) ) { - return; - } - - var thisCache, i, - isNode = elem.nodeType, - - // See jQuery.data for more information - cache = isNode ? jQuery.cache : elem, - id = isNode ? elem[ jQuery.expando ] : jQuery.expando; - - // If there is already no cache entry for this object, there is no - // purpose in continuing - if ( !cache[ id ] ) { - return; - } - - if ( name ) { - - thisCache = pvt ? cache[ id ] : cache[ id ].data; - - if ( thisCache ) { - - // Support array or space separated string names for data keys - if ( !jQuery.isArray( name ) ) { - - // try the string as a key before any manipulation - if ( name in thisCache ) { - name = [ name ]; - } else { - - // split the camel cased version by spaces unless a key with the spaces exists - name = jQuery.camelCase( name ); - if ( name in thisCache ) { - name = [ name ]; - } else { - name = name.split(" "); - } - } - } else { - // If "name" is an array of keys... - // When data is initially created, via ("key", "val") signature, - // keys will be converted to camelCase. - // Since there is no way to tell _how_ a key was added, remove - // both plain key and camelCase key. #12786 - // This will only penalize the array argument path. - name = name.concat( jQuery.map( name, jQuery.camelCase ) ); - } - - i = name.length; - while ( i-- ) { - delete thisCache[ name[i] ]; - } - - // If there is no data left in the cache, we want to continue - // and let the cache object itself get destroyed - if ( pvt ? !isEmptyDataObject(thisCache) : !jQuery.isEmptyObject(thisCache) ) { - return; - } - } - } - - // See jQuery.data for more information - if ( !pvt ) { - delete cache[ id ].data; - - // Don't destroy the parent cache unless the internal data object - // had been the only thing left in it - if ( !isEmptyDataObject( cache[ id ] ) ) { - return; - } - } - - // Destroy the cache - if ( isNode ) { - jQuery.cleanData( [ elem ], true ); - - // Use delete when supported for expandos or `cache` is not a window per isWindow (#10080) - /* jshint eqeqeq: false */ - } else if ( jQuery.support.deleteExpando || cache != cache.window ) { - /* jshint eqeqeq: true */ - delete cache[ id ]; - - // When all else fails, null - } else { - cache[ id ] = null; - } -} - -jQuery.extend({ - cache: {}, - - // The following elements throw uncatchable exceptions if you - // attempt to add expando properties to them. - noData: { - "applet": true, - "embed": true, - // Ban all objects except for Flash (which handle expandos) - "object": "clsid:D27CDB6E-AE6D-11cf-96B8-444553540000" - }, - - hasData: function( elem ) { - elem = elem.nodeType ? jQuery.cache[ elem[jQuery.expando] ] : elem[ jQuery.expando ]; - return !!elem && !isEmptyDataObject( elem ); - }, - - data: function( elem, name, data ) { - return internalData( elem, name, data ); - }, - - removeData: function( elem, name ) { - return internalRemoveData( elem, name ); - }, - - // For internal use only. - _data: function( elem, name, data ) { - return internalData( elem, name, data, true ); - }, - - _removeData: function( elem, name ) { - return internalRemoveData( elem, name, true ); - }, - - // A method for determining if a DOM node can handle the data expando - acceptData: function( elem ) { - // Do not set data on non-element because it will not be cleared (#8335). - if ( elem.nodeType && elem.nodeType !== 1 && elem.nodeType !== 9 ) { - return false; - } - - var noData = elem.nodeName && jQuery.noData[ elem.nodeName.toLowerCase() ]; - - // nodes accept data unless otherwise specified; rejection can be conditional - return !noData || noData !== true && elem.getAttribute("classid") === noData; - } -}); - -jQuery.fn.extend({ - data: function( key, value ) { - var attrs, name, - data = null, - i = 0, - elem = this[0]; - - // Special expections of .data basically thwart jQuery.access, - // so implement the relevant behavior ourselves - - // Gets all values - if ( key === undefined ) { - if ( this.length ) { - data = jQuery.data( elem ); - - if ( elem.nodeType === 1 && !jQuery._data( elem, "parsedAttrs" ) ) { - attrs = elem.attributes; - for ( ; i < attrs.length; i++ ) { - name = attrs[i].name; - - if ( name.indexOf("data-") === 0 ) { - name = jQuery.camelCase( name.slice(5) ); - - dataAttr( elem, name, data[ name ] ); - } - } - jQuery._data( elem, "parsedAttrs", true ); - } - } - - return data; - } - - // Sets multiple values - if ( typeof key === "object" ) { - return this.each(function() { - jQuery.data( this, key ); - }); - } - - return arguments.length > 1 ? - - // Sets one value - this.each(function() { - jQuery.data( this, key, value ); - }) : - - // Gets one value - // Try to fetch any internally stored data first - elem ? dataAttr( elem, key, jQuery.data( elem, key ) ) : null; - }, - - removeData: function( key ) { - return this.each(function() { - jQuery.removeData( this, key ); - }); - } -}); - -function dataAttr( elem, key, data ) { - // If nothing was found internally, try to fetch any - // data from the HTML5 data-* attribute - if ( data === undefined && elem.nodeType === 1 ) { - - var name = "data-" + key.replace( rmultiDash, "-$1" ).toLowerCase(); - - data = elem.getAttribute( name ); - - if ( typeof data === "string" ) { - try { - data = data === "true" ? true : - data === "false" ? false : - data === "null" ? null : - // Only convert to a number if it doesn't change the string - +data + "" === data ? +data : - rbrace.test( data ) ? jQuery.parseJSON( data ) : - data; - } catch( e ) {} - - // Make sure we set the data so it isn't changed later - jQuery.data( elem, key, data ); - - } else { - data = undefined; - } - } - - return data; -} - -// checks a cache object for emptiness -function isEmptyDataObject( obj ) { - var name; - for ( name in obj ) { - - // if the public data object is empty, the private is still empty - if ( name === "data" && jQuery.isEmptyObject( obj[name] ) ) { - continue; - } - if ( name !== "toJSON" ) { - return false; - } - } - - return true; -} -jQuery.extend({ - queue: function( elem, type, data ) { - var queue; - - if ( elem ) { - type = ( type || "fx" ) + "queue"; - queue = jQuery._data( elem, type ); - - // Speed up dequeue by getting out quickly if this is just a lookup - if ( data ) { - if ( !queue || jQuery.isArray(data) ) { - queue = jQuery._data( elem, type, jQuery.makeArray(data) ); - } else { - queue.push( data ); - } - } - return queue || []; - } - }, - - dequeue: function( elem, type ) { - type = type || "fx"; - - var queue = jQuery.queue( elem, type ), - startLength = queue.length, - fn = queue.shift(), - hooks = jQuery._queueHooks( elem, type ), - next = function() { - jQuery.dequeue( elem, type ); - }; - - // If the fx queue is dequeued, always remove the progress sentinel - if ( fn === "inprogress" ) { - fn = queue.shift(); - startLength--; - } - - if ( fn ) { - - // Add a progress sentinel to prevent the fx queue from being - // automatically dequeued - if ( type === "fx" ) { - queue.unshift( "inprogress" ); - } - - // clear up the last queue stop function - delete hooks.stop; - fn.call( elem, next, hooks ); - } - - if ( !startLength && hooks ) { - hooks.empty.fire(); - } - }, - - // not intended for public consumption - generates a queueHooks object, or returns the current one - _queueHooks: function( elem, type ) { - var key = type + "queueHooks"; - return jQuery._data( elem, key ) || jQuery._data( elem, key, { - empty: jQuery.Callbacks("once memory").add(function() { - jQuery._removeData( elem, type + "queue" ); - jQuery._removeData( elem, key ); - }) - }); - } -}); - -jQuery.fn.extend({ - queue: function( type, data ) { - var setter = 2; - - if ( typeof type !== "string" ) { - data = type; - type = "fx"; - setter--; - } - - if ( arguments.length < setter ) { - return jQuery.queue( this[0], type ); - } - - return data === undefined ? - this : - this.each(function() { - var queue = jQuery.queue( this, type, data ); - - // ensure a hooks for this queue - jQuery._queueHooks( this, type ); - - if ( type === "fx" && queue[0] !== "inprogress" ) { - jQuery.dequeue( this, type ); - } - }); - }, - dequeue: function( type ) { - return this.each(function() { - jQuery.dequeue( this, type ); - }); - }, - // Based off of the plugin by Clint Helfers, with permission. - // http://blindsignals.com/index.php/2009/07/jquery-delay/ - delay: function( time, type ) { - time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; - type = type || "fx"; - - return this.queue( type, function( next, hooks ) { - var timeout = setTimeout( next, time ); - hooks.stop = function() { - clearTimeout( timeout ); - }; - }); - }, - clearQueue: function( type ) { - return this.queue( type || "fx", [] ); - }, - // Get a promise resolved when queues of a certain type - // are emptied (fx is the type by default) - promise: function( type, obj ) { - var tmp, - count = 1, - defer = jQuery.Deferred(), - elements = this, - i = this.length, - resolve = function() { - if ( !( --count ) ) { - defer.resolveWith( elements, [ elements ] ); - } - }; - - if ( typeof type !== "string" ) { - obj = type; - type = undefined; - } - type = type || "fx"; - - while( i-- ) { - tmp = jQuery._data( elements[ i ], type + "queueHooks" ); - if ( tmp && tmp.empty ) { - count++; - tmp.empty.add( resolve ); - } - } - resolve(); - return defer.promise( obj ); - } -}); -var nodeHook, boolHook, - rclass = /[\t\r\n\f]/g, - rreturn = /\r/g, - rfocusable = /^(?:input|select|textarea|button|object)$/i, - rclickable = /^(?:a|area)$/i, - ruseDefault = /^(?:checked|selected)$/i, - getSetAttribute = jQuery.support.getSetAttribute, - getSetInput = jQuery.support.input; - -jQuery.fn.extend({ - attr: function( name, value ) { - return jQuery.access( this, jQuery.attr, name, value, arguments.length > 1 ); - }, - - removeAttr: function( name ) { - return this.each(function() { - jQuery.removeAttr( this, name ); - }); - }, - - prop: function( name, value ) { - return jQuery.access( this, jQuery.prop, name, value, arguments.length > 1 ); - }, - - removeProp: function( name ) { - name = jQuery.propFix[ name ] || name; - return this.each(function() { - // try/catch handles cases where IE balks (such as removing a property on window) - try { - this[ name ] = undefined; - delete this[ name ]; - } catch( e ) {} - }); - }, - - addClass: function( value ) { - var classes, elem, cur, clazz, j, - i = 0, - len = this.length, - proceed = typeof value === "string" && value; - - if ( jQuery.isFunction( value ) ) { - return this.each(function( j ) { - jQuery( this ).addClass( value.call( this, j, this.className ) ); - }); - } - - if ( proceed ) { - // The disjunction here is for better compressibility (see removeClass) - classes = ( value || "" ).match( core_rnotwhite ) || []; - - for ( ; i < len; i++ ) { - elem = this[ i ]; - cur = elem.nodeType === 1 && ( elem.className ? - ( " " + elem.className + " " ).replace( rclass, " " ) : - " " - ); - - if ( cur ) { - j = 0; - while ( (clazz = classes[j++]) ) { - if ( cur.indexOf( " " + clazz + " " ) < 0 ) { - cur += clazz + " "; - } - } - elem.className = jQuery.trim( cur ); - - } - } - } - - return this; - }, - - removeClass: function( value ) { - var classes, elem, cur, clazz, j, - i = 0, - len = this.length, - proceed = arguments.length === 0 || typeof value === "string" && value; - - if ( jQuery.isFunction( value ) ) { - return this.each(function( j ) { - jQuery( this ).removeClass( value.call( this, j, this.className ) ); - }); - } - if ( proceed ) { - classes = ( value || "" ).match( core_rnotwhite ) || []; - - for ( ; i < len; i++ ) { - elem = this[ i ]; - // This expression is here for better compressibility (see addClass) - cur = elem.nodeType === 1 && ( elem.className ? - ( " " + elem.className + " " ).replace( rclass, " " ) : - "" - ); - - if ( cur ) { - j = 0; - while ( (clazz = classes[j++]) ) { - // Remove *all* instances - while ( cur.indexOf( " " + clazz + " " ) >= 0 ) { - cur = cur.replace( " " + clazz + " ", " " ); - } - } - elem.className = value ? jQuery.trim( cur ) : ""; - } - } - } - - return this; - }, - - toggleClass: function( value, stateVal ) { - var type = typeof value; - - if ( typeof stateVal === "boolean" && type === "string" ) { - return stateVal ? this.addClass( value ) : this.removeClass( value ); - } - - if ( jQuery.isFunction( value ) ) { - return this.each(function( i ) { - jQuery( this ).toggleClass( value.call(this, i, this.className, stateVal), stateVal ); - }); - } - - return this.each(function() { - if ( type === "string" ) { - // toggle individual class names - var className, - i = 0, - self = jQuery( this ), - classNames = value.match( core_rnotwhite ) || []; - - while ( (className = classNames[ i++ ]) ) { - // check each className given, space separated list - if ( self.hasClass( className ) ) { - self.removeClass( className ); - } else { - self.addClass( className ); - } - } - - // Toggle whole class name - } else if ( type === core_strundefined || type === "boolean" ) { - if ( this.className ) { - // store className if set - jQuery._data( this, "__className__", this.className ); - } - - // If the element has a class name or if we're passed "false", - // then remove the whole classname (if there was one, the above saved it). - // Otherwise bring back whatever was previously saved (if anything), - // falling back to the empty string if nothing was stored. - this.className = this.className || value === false ? "" : jQuery._data( this, "__className__" ) || ""; - } - }); - }, - - hasClass: function( selector ) { - var className = " " + selector + " ", - i = 0, - l = this.length; - for ( ; i < l; i++ ) { - if ( this[i].nodeType === 1 && (" " + this[i].className + " ").replace(rclass, " ").indexOf( className ) >= 0 ) { - return true; - } - } - - return false; - }, - - val: function( value ) { - var ret, hooks, isFunction, - elem = this[0]; - - if ( !arguments.length ) { - if ( elem ) { - hooks = jQuery.valHooks[ elem.type ] || jQuery.valHooks[ elem.nodeName.toLowerCase() ]; - - if ( hooks && "get" in hooks && (ret = hooks.get( elem, "value" )) !== undefined ) { - return ret; - } - - ret = elem.value; - - return typeof ret === "string" ? - // handle most common string cases - ret.replace(rreturn, "") : - // handle cases where value is null/undef or number - ret == null ? "" : ret; - } - - return; - } - - isFunction = jQuery.isFunction( value ); - - return this.each(function( i ) { - var val; - - if ( this.nodeType !== 1 ) { - return; - } - - if ( isFunction ) { - val = value.call( this, i, jQuery( this ).val() ); - } else { - val = value; - } - - // Treat null/undefined as ""; convert numbers to string - if ( val == null ) { - val = ""; - } else if ( typeof val === "number" ) { - val += ""; - } else if ( jQuery.isArray( val ) ) { - val = jQuery.map(val, function ( value ) { - return value == null ? "" : value + ""; - }); - } - - hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; - - // If set returns undefined, fall back to normal setting - if ( !hooks || !("set" in hooks) || hooks.set( this, val, "value" ) === undefined ) { - this.value = val; - } - }); - } -}); - -jQuery.extend({ - valHooks: { - option: { - get: function( elem ) { - // Use proper attribute retrieval(#6932, #12072) - var val = jQuery.find.attr( elem, "value" ); - return val != null ? - val : - elem.text; - } - }, - select: { - get: function( elem ) { - var value, option, - options = elem.options, - index = elem.selectedIndex, - one = elem.type === "select-one" || index < 0, - values = one ? null : [], - max = one ? index + 1 : options.length, - i = index < 0 ? - max : - one ? index : 0; - - // Loop through all the selected options - for ( ; i < max; i++ ) { - option = options[ i ]; - - // oldIE doesn't update selected after form reset (#2551) - if ( ( option.selected || i === index ) && - // Don't return options that are disabled or in a disabled optgroup - ( jQuery.support.optDisabled ? !option.disabled : option.getAttribute("disabled") === null ) && - ( !option.parentNode.disabled || !jQuery.nodeName( option.parentNode, "optgroup" ) ) ) { - - // Get the specific value for the option - value = jQuery( option ).val(); - - // We don't need an array for one selects - if ( one ) { - return value; - } - - // Multi-Selects return an array - values.push( value ); - } - } - - return values; - }, - - set: function( elem, value ) { - var optionSet, option, - options = elem.options, - values = jQuery.makeArray( value ), - i = options.length; - - while ( i-- ) { - option = options[ i ]; - if ( (option.selected = jQuery.inArray( jQuery(option).val(), values ) >= 0) ) { - optionSet = true; - } - } - - // force browsers to behave consistently when non-matching value is set - if ( !optionSet ) { - elem.selectedIndex = -1; - } - return values; - } - } - }, - - attr: function( elem, name, value ) { - var hooks, ret, - nType = elem.nodeType; - - // don't get/set attributes on text, comment and attribute nodes - if ( !elem || nType === 3 || nType === 8 || nType === 2 ) { - return; - } - - // Fallback to prop when attributes are not supported - if ( typeof elem.getAttribute === core_strundefined ) { - return jQuery.prop( elem, name, value ); - } - - // All attributes are lowercase - // Grab necessary hook if one is defined - if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { - name = name.toLowerCase(); - hooks = jQuery.attrHooks[ name ] || - ( jQuery.expr.match.bool.test( name ) ? boolHook : nodeHook ); - } - - if ( value !== undefined ) { - - if ( value === null ) { - jQuery.removeAttr( elem, name ); - - } else if ( hooks && "set" in hooks && (ret = hooks.set( elem, value, name )) !== undefined ) { - return ret; - - } else { - elem.setAttribute( name, value + "" ); - return value; - } - - } else if ( hooks && "get" in hooks && (ret = hooks.get( elem, name )) !== null ) { - return ret; - - } else { - ret = jQuery.find.attr( elem, name ); - - // Non-existent attributes return null, we normalize to undefined - return ret == null ? - undefined : - ret; - } - }, - - removeAttr: function( elem, value ) { - var name, propName, - i = 0, - attrNames = value && value.match( core_rnotwhite ); - - if ( attrNames && elem.nodeType === 1 ) { - while ( (name = attrNames[i++]) ) { - propName = jQuery.propFix[ name ] || name; - - // Boolean attributes get special treatment (#10870) - if ( jQuery.expr.match.bool.test( name ) ) { - // Set corresponding property to false - if ( getSetInput && getSetAttribute || !ruseDefault.test( name ) ) { - elem[ propName ] = false; - // Support: IE<9 - // Also clear defaultChecked/defaultSelected (if appropriate) - } else { - elem[ jQuery.camelCase( "default-" + name ) ] = - elem[ propName ] = false; - } - - // See #9699 for explanation of this approach (setting first, then removal) - } else { - jQuery.attr( elem, name, "" ); - } - - elem.removeAttribute( getSetAttribute ? name : propName ); - } - } - }, - - attrHooks: { - type: { - set: function( elem, value ) { - if ( !jQuery.support.radioValue && value === "radio" && jQuery.nodeName(elem, "input") ) { - // Setting the type on a radio button after the value resets the value in IE6-9 - // Reset value to default in case type is set after value during creation - var val = elem.value; - elem.setAttribute( "type", value ); - if ( val ) { - elem.value = val; - } - return value; - } - } - } - }, - - propFix: { - "for": "htmlFor", - "class": "className" - }, - - prop: function( elem, name, value ) { - var ret, hooks, notxml, - nType = elem.nodeType; - - // don't get/set properties on text, comment and attribute nodes - if ( !elem || nType === 3 || nType === 8 || nType === 2 ) { - return; - } - - notxml = nType !== 1 || !jQuery.isXMLDoc( elem ); - - if ( notxml ) { - // Fix name and attach hooks - name = jQuery.propFix[ name ] || name; - hooks = jQuery.propHooks[ name ]; - } - - if ( value !== undefined ) { - return hooks && "set" in hooks && (ret = hooks.set( elem, value, name )) !== undefined ? - ret : - ( elem[ name ] = value ); - - } else { - return hooks && "get" in hooks && (ret = hooks.get( elem, name )) !== null ? - ret : - elem[ name ]; - } - }, - - propHooks: { - tabIndex: { - get: function( elem ) { - // elem.tabIndex doesn't always return the correct value when it hasn't been explicitly set - // http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ - // Use proper attribute retrieval(#12072) - var tabindex = jQuery.find.attr( elem, "tabindex" ); - - return tabindex ? - parseInt( tabindex, 10 ) : - rfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ? - 0 : - -1; - } - } - } -}); - -// Hooks for boolean attributes -boolHook = { - set: function( elem, value, name ) { - if ( value === false ) { - // Remove boolean attributes when set to false - jQuery.removeAttr( elem, name ); - } else if ( getSetInput && getSetAttribute || !ruseDefault.test( name ) ) { - // IE<8 needs the *property* name - elem.setAttribute( !getSetAttribute && jQuery.propFix[ name ] || name, name ); - - // Use defaultChecked and defaultSelected for oldIE - } else { - elem[ jQuery.camelCase( "default-" + name ) ] = elem[ name ] = true; - } - - return name; - } -}; -jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( i, name ) { - var getter = jQuery.expr.attrHandle[ name ] || jQuery.find.attr; - - jQuery.expr.attrHandle[ name ] = getSetInput && getSetAttribute || !ruseDefault.test( name ) ? - function( elem, name, isXML ) { - var fn = jQuery.expr.attrHandle[ name ], - ret = isXML ? - undefined : - /* jshint eqeqeq: false */ - (jQuery.expr.attrHandle[ name ] = undefined) != - getter( elem, name, isXML ) ? - - name.toLowerCase() : - null; - jQuery.expr.attrHandle[ name ] = fn; - return ret; - } : - function( elem, name, isXML ) { - return isXML ? - undefined : - elem[ jQuery.camelCase( "default-" + name ) ] ? - name.toLowerCase() : - null; - }; -}); - -// fix oldIE attroperties -if ( !getSetInput || !getSetAttribute ) { - jQuery.attrHooks.value = { - set: function( elem, value, name ) { - if ( jQuery.nodeName( elem, "input" ) ) { - // Does not return so that setAttribute is also used - elem.defaultValue = value; - } else { - // Use nodeHook if defined (#1954); otherwise setAttribute is fine - return nodeHook && nodeHook.set( elem, value, name ); - } - } - }; -} - -// IE6/7 do not support getting/setting some attributes with get/setAttribute -if ( !getSetAttribute ) { - - // Use this for any attribute in IE6/7 - // This fixes almost every IE6/7 issue - nodeHook = { - set: function( elem, value, name ) { - // Set the existing or create a new attribute node - var ret = elem.getAttributeNode( name ); - if ( !ret ) { - elem.setAttributeNode( - (ret = elem.ownerDocument.createAttribute( name )) - ); - } - - ret.value = value += ""; - - // Break association with cloned elements by also using setAttribute (#9646) - return name === "value" || value === elem.getAttribute( name ) ? - value : - undefined; - } - }; - jQuery.expr.attrHandle.id = jQuery.expr.attrHandle.name = jQuery.expr.attrHandle.coords = - // Some attributes are constructed with empty-string values when not defined - function( elem, name, isXML ) { - var ret; - return isXML ? - undefined : - (ret = elem.getAttributeNode( name )) && ret.value !== "" ? - ret.value : - null; - }; - jQuery.valHooks.button = { - get: function( elem, name ) { - var ret = elem.getAttributeNode( name ); - return ret && ret.specified ? - ret.value : - undefined; - }, - set: nodeHook.set - }; - - // Set contenteditable to false on removals(#10429) - // Setting to empty string throws an error as an invalid value - jQuery.attrHooks.contenteditable = { - set: function( elem, value, name ) { - nodeHook.set( elem, value === "" ? false : value, name ); - } - }; - - // Set width and height to auto instead of 0 on empty string( Bug #8150 ) - // This is for removals - jQuery.each([ "width", "height" ], function( i, name ) { - jQuery.attrHooks[ name ] = { - set: function( elem, value ) { - if ( value === "" ) { - elem.setAttribute( name, "auto" ); - return value; - } - } - }; - }); -} - - -// Some attributes require a special call on IE -// http://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx -if ( !jQuery.support.hrefNormalized ) { - // href/src property should get the full normalized URL (#10299/#12915) - jQuery.each([ "href", "src" ], function( i, name ) { - jQuery.propHooks[ name ] = { - get: function( elem ) { - return elem.getAttribute( name, 4 ); - } - }; - }); -} - -if ( !jQuery.support.style ) { - jQuery.attrHooks.style = { - get: function( elem ) { - // Return undefined in the case of empty string - // Note: IE uppercases css property names, but if we were to .toLowerCase() - // .cssText, that would destroy case senstitivity in URL's, like in "background" - return elem.style.cssText || undefined; - }, - set: function( elem, value ) { - return ( elem.style.cssText = value + "" ); - } - }; -} - -// Safari mis-reports the default selected property of an option -// Accessing the parent's selectedIndex property fixes it -if ( !jQuery.support.optSelected ) { - jQuery.propHooks.selected = { - get: function( elem ) { - var parent = elem.parentNode; - - if ( parent ) { - parent.selectedIndex; - - // Make sure that it also works with optgroups, see #5701 - if ( parent.parentNode ) { - parent.parentNode.selectedIndex; - } - } - return null; - } - }; -} - -jQuery.each([ - "tabIndex", - "readOnly", - "maxLength", - "cellSpacing", - "cellPadding", - "rowSpan", - "colSpan", - "useMap", - "frameBorder", - "contentEditable" -], function() { - jQuery.propFix[ this.toLowerCase() ] = this; -}); - -// IE6/7 call enctype encoding -if ( !jQuery.support.enctype ) { - jQuery.propFix.enctype = "encoding"; -} - -// Radios and checkboxes getter/setter -jQuery.each([ "radio", "checkbox" ], function() { - jQuery.valHooks[ this ] = { - set: function( elem, value ) { - if ( jQuery.isArray( value ) ) { - return ( elem.checked = jQuery.inArray( jQuery(elem).val(), value ) >= 0 ); - } - } - }; - if ( !jQuery.support.checkOn ) { - jQuery.valHooks[ this ].get = function( elem ) { - // Support: Webkit - // "" is returned instead of "on" if a value isn't specified - return elem.getAttribute("value") === null ? "on" : elem.value; - }; - } -}); -var rformElems = /^(?:input|select|textarea)$/i, - rkeyEvent = /^key/, - rmouseEvent = /^(?:mouse|contextmenu)|click/, - rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, - rtypenamespace = /^([^.]*)(?:\.(.+)|)$/; - -function returnTrue() { - return true; -} - -function returnFalse() { - return false; -} - -function safeActiveElement() { - try { - return document.activeElement; - } catch ( err ) { } -} - -/* - * Helper functions for managing events -- not part of the public interface. - * Props to Dean Edwards' addEvent library for many of the ideas. - */ -jQuery.event = { - - global: {}, - - add: function( elem, types, handler, data, selector ) { - var tmp, events, t, handleObjIn, - special, eventHandle, handleObj, - handlers, type, namespaces, origType, - elemData = jQuery._data( elem ); - - // Don't attach events to noData or text/comment nodes (but allow plain objects) - if ( !elemData ) { - return; - } - - // Caller can pass in an object of custom data in lieu of the handler - if ( handler.handler ) { - handleObjIn = handler; - handler = handleObjIn.handler; - selector = handleObjIn.selector; - } - - // Make sure that the handler has a unique ID, used to find/remove it later - if ( !handler.guid ) { - handler.guid = jQuery.guid++; - } - - // Init the element's event structure and main handler, if this is the first - if ( !(events = elemData.events) ) { - events = elemData.events = {}; - } - if ( !(eventHandle = elemData.handle) ) { - eventHandle = elemData.handle = function( e ) { - // Discard the second event of a jQuery.event.trigger() and - // when an event is called after a page has unloaded - return typeof jQuery !== core_strundefined && (!e || jQuery.event.triggered !== e.type) ? - jQuery.event.dispatch.apply( eventHandle.elem, arguments ) : - undefined; - }; - // Add elem as a property of the handle fn to prevent a memory leak with IE non-native events - eventHandle.elem = elem; - } - - // Handle multiple events separated by a space - types = ( types || "" ).match( core_rnotwhite ) || [""]; - t = types.length; - while ( t-- ) { - tmp = rtypenamespace.exec( types[t] ) || []; - type = origType = tmp[1]; - namespaces = ( tmp[2] || "" ).split( "." ).sort(); - - // There *must* be a type, no attaching namespace-only handlers - if ( !type ) { - continue; - } - - // If event changes its type, use the special event handlers for the changed type - special = jQuery.event.special[ type ] || {}; - - // If selector defined, determine special event api type, otherwise given type - type = ( selector ? special.delegateType : special.bindType ) || type; - - // Update special based on newly reset type - special = jQuery.event.special[ type ] || {}; - - // handleObj is passed to all event handlers - handleObj = jQuery.extend({ - type: type, - origType: origType, - data: data, - handler: handler, - guid: handler.guid, - selector: selector, - needsContext: selector && jQuery.expr.match.needsContext.test( selector ), - namespace: namespaces.join(".") - }, handleObjIn ); - - // Init the event handler queue if we're the first - if ( !(handlers = events[ type ]) ) { - handlers = events[ type ] = []; - handlers.delegateCount = 0; - - // Only use addEventListener/attachEvent if the special events handler returns false - if ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) { - // Bind the global event handler to the element - if ( elem.addEventListener ) { - elem.addEventListener( type, eventHandle, false ); - - } else if ( elem.attachEvent ) { - elem.attachEvent( "on" + type, eventHandle ); - } - } - } - - if ( special.add ) { - special.add.call( elem, handleObj ); - - if ( !handleObj.handler.guid ) { - handleObj.handler.guid = handler.guid; - } - } - - // Add to the element's handler list, delegates in front - if ( selector ) { - handlers.splice( handlers.delegateCount++, 0, handleObj ); - } else { - handlers.push( handleObj ); - } - - // Keep track of which events have ever been used, for event optimization - jQuery.event.global[ type ] = true; - } - - // Nullify elem to prevent memory leaks in IE - elem = null; - }, - - // Detach an event or set of events from an element - remove: function( elem, types, handler, selector, mappedTypes ) { - var j, handleObj, tmp, - origCount, t, events, - special, handlers, type, - namespaces, origType, - elemData = jQuery.hasData( elem ) && jQuery._data( elem ); - - if ( !elemData || !(events = elemData.events) ) { - return; - } - - // Once for each type.namespace in types; type may be omitted - types = ( types || "" ).match( core_rnotwhite ) || [""]; - t = types.length; - while ( t-- ) { - tmp = rtypenamespace.exec( types[t] ) || []; - type = origType = tmp[1]; - namespaces = ( tmp[2] || "" ).split( "." ).sort(); - - // Unbind all events (on this namespace, if provided) for the element - if ( !type ) { - for ( type in events ) { - jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); - } - continue; - } - - special = jQuery.event.special[ type ] || {}; - type = ( selector ? special.delegateType : special.bindType ) || type; - handlers = events[ type ] || []; - tmp = tmp[2] && new RegExp( "(^|\\.)" + namespaces.join("\\.(?:.*\\.|)") + "(\\.|$)" ); - - // Remove matching events - origCount = j = handlers.length; - while ( j-- ) { - handleObj = handlers[ j ]; - - if ( ( mappedTypes || origType === handleObj.origType ) && - ( !handler || handler.guid === handleObj.guid ) && - ( !tmp || tmp.test( handleObj.namespace ) ) && - ( !selector || selector === handleObj.selector || selector === "**" && handleObj.selector ) ) { - handlers.splice( j, 1 ); - - if ( handleObj.selector ) { - handlers.delegateCount--; - } - if ( special.remove ) { - special.remove.call( elem, handleObj ); - } - } - } - - // Remove generic event handler if we removed something and no more handlers exist - // (avoids potential for endless recursion during removal of special event handlers) - if ( origCount && !handlers.length ) { - if ( !special.teardown || special.teardown.call( elem, namespaces, elemData.handle ) === false ) { - jQuery.removeEvent( elem, type, elemData.handle ); - } - - delete events[ type ]; - } - } - - // Remove the expando if it's no longer used - if ( jQuery.isEmptyObject( events ) ) { - delete elemData.handle; - - // removeData also checks for emptiness and clears the expando if empty - // so use it instead of delete - jQuery._removeData( elem, "events" ); - } - }, - - trigger: function( event, data, elem, onlyHandlers ) { - var handle, ontype, cur, - bubbleType, special, tmp, i, - eventPath = [ elem || document ], - type = core_hasOwn.call( event, "type" ) ? event.type : event, - namespaces = core_hasOwn.call( event, "namespace" ) ? event.namespace.split(".") : []; - - cur = tmp = elem = elem || document; - - // Don't do events on text and comment nodes - if ( elem.nodeType === 3 || elem.nodeType === 8 ) { - return; - } - - // focus/blur morphs to focusin/out; ensure we're not firing them right now - if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { - return; - } - - if ( type.indexOf(".") >= 0 ) { - // Namespaced trigger; create a regexp to match event type in handle() - namespaces = type.split("."); - type = namespaces.shift(); - namespaces.sort(); - } - ontype = type.indexOf(":") < 0 && "on" + type; - - // Caller can pass in a jQuery.Event object, Object, or just an event type string - event = event[ jQuery.expando ] ? - event : - new jQuery.Event( type, typeof event === "object" && event ); - - // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) - event.isTrigger = onlyHandlers ? 2 : 3; - event.namespace = namespaces.join("."); - event.namespace_re = event.namespace ? - new RegExp( "(^|\\.)" + namespaces.join("\\.(?:.*\\.|)") + "(\\.|$)" ) : - null; - - // Clean up the event in case it is being reused - event.result = undefined; - if ( !event.target ) { - event.target = elem; - } - - // Clone any incoming data and prepend the event, creating the handler arg list - data = data == null ? - [ event ] : - jQuery.makeArray( data, [ event ] ); - - // Allow special events to draw outside the lines - special = jQuery.event.special[ type ] || {}; - if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { - return; - } - - // Determine event propagation path in advance, per W3C events spec (#9951) - // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) - if ( !onlyHandlers && !special.noBubble && !jQuery.isWindow( elem ) ) { - - bubbleType = special.delegateType || type; - if ( !rfocusMorph.test( bubbleType + type ) ) { - cur = cur.parentNode; - } - for ( ; cur; cur = cur.parentNode ) { - eventPath.push( cur ); - tmp = cur; - } - - // Only add window if we got to document (e.g., not plain obj or detached DOM) - if ( tmp === (elem.ownerDocument || document) ) { - eventPath.push( tmp.defaultView || tmp.parentWindow || window ); - } - } - - // Fire handlers on the event path - i = 0; - while ( (cur = eventPath[i++]) && !event.isPropagationStopped() ) { - - event.type = i > 1 ? - bubbleType : - special.bindType || type; - - // jQuery handler - handle = ( jQuery._data( cur, "events" ) || {} )[ event.type ] && jQuery._data( cur, "handle" ); - if ( handle ) { - handle.apply( cur, data ); - } - - // Native handler - handle = ontype && cur[ ontype ]; - if ( handle && jQuery.acceptData( cur ) && handle.apply && handle.apply( cur, data ) === false ) { - event.preventDefault(); - } - } - event.type = type; - - // If nobody prevented the default action, do it now - if ( !onlyHandlers && !event.isDefaultPrevented() ) { - - if ( (!special._default || special._default.apply( eventPath.pop(), data ) === false) && - jQuery.acceptData( elem ) ) { - - // Call a native DOM method on the target with the same name name as the event. - // Can't use an .isFunction() check here because IE6/7 fails that test. - // Don't do default actions on window, that's where global variables be (#6170) - if ( ontype && elem[ type ] && !jQuery.isWindow( elem ) ) { - - // Don't re-trigger an onFOO event when we call its FOO() method - tmp = elem[ ontype ]; - - if ( tmp ) { - elem[ ontype ] = null; - } - - // Prevent re-triggering of the same event, since we already bubbled it above - jQuery.event.triggered = type; - try { - elem[ type ](); - } catch ( e ) { - // IE<9 dies on focus/blur to hidden element (#1486,#12518) - // only reproducible on winXP IE8 native, not IE9 in IE8 mode - } - jQuery.event.triggered = undefined; - - if ( tmp ) { - elem[ ontype ] = tmp; - } - } - } - } - - return event.result; - }, - - dispatch: function( event ) { - - // Make a writable jQuery.Event from the native event object - event = jQuery.event.fix( event ); - - var i, ret, handleObj, matched, j, - handlerQueue = [], - args = core_slice.call( arguments ), - handlers = ( jQuery._data( this, "events" ) || {} )[ event.type ] || [], - special = jQuery.event.special[ event.type ] || {}; - - // Use the fix-ed jQuery.Event rather than the (read-only) native event - args[0] = event; - event.delegateTarget = this; - - // Call the preDispatch hook for the mapped type, and let it bail if desired - if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { - return; - } - - // Determine handlers - handlerQueue = jQuery.event.handlers.call( this, event, handlers ); - - // Run delegates first; they may want to stop propagation beneath us - i = 0; - while ( (matched = handlerQueue[ i++ ]) && !event.isPropagationStopped() ) { - event.currentTarget = matched.elem; - - j = 0; - while ( (handleObj = matched.handlers[ j++ ]) && !event.isImmediatePropagationStopped() ) { - - // Triggered event must either 1) have no namespace, or - // 2) have namespace(s) a subset or equal to those in the bound event (both can have no namespace). - if ( !event.namespace_re || event.namespace_re.test( handleObj.namespace ) ) { - - event.handleObj = handleObj; - event.data = handleObj.data; - - ret = ( (jQuery.event.special[ handleObj.origType ] || {}).handle || handleObj.handler ) - .apply( matched.elem, args ); - - if ( ret !== undefined ) { - if ( (event.result = ret) === false ) { - event.preventDefault(); - event.stopPropagation(); - } - } - } - } - } - - // Call the postDispatch hook for the mapped type - if ( special.postDispatch ) { - special.postDispatch.call( this, event ); - } - - return event.result; - }, - - handlers: function( event, handlers ) { - var sel, handleObj, matches, i, - handlerQueue = [], - delegateCount = handlers.delegateCount, - cur = event.target; - - // Find delegate handlers - // Black-hole SVG instance trees (#13180) - // Avoid non-left-click bubbling in Firefox (#3861) - if ( delegateCount && cur.nodeType && (!event.button || event.type !== "click") ) { - - /* jshint eqeqeq: false */ - for ( ; cur != this; cur = cur.parentNode || this ) { - /* jshint eqeqeq: true */ - - // Don't check non-elements (#13208) - // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) - if ( cur.nodeType === 1 && (cur.disabled !== true || event.type !== "click") ) { - matches = []; - for ( i = 0; i < delegateCount; i++ ) { - handleObj = handlers[ i ]; - - // Don't conflict with Object.prototype properties (#13203) - sel = handleObj.selector + " "; - - if ( matches[ sel ] === undefined ) { - matches[ sel ] = handleObj.needsContext ? - jQuery( sel, this ).index( cur ) >= 0 : - jQuery.find( sel, this, null, [ cur ] ).length; - } - if ( matches[ sel ] ) { - matches.push( handleObj ); - } - } - if ( matches.length ) { - handlerQueue.push({ elem: cur, handlers: matches }); - } - } - } - } - - // Add the remaining (directly-bound) handlers - if ( delegateCount < handlers.length ) { - handlerQueue.push({ elem: this, handlers: handlers.slice( delegateCount ) }); - } - - return handlerQueue; - }, - - fix: function( event ) { - if ( event[ jQuery.expando ] ) { - return event; - } - - // Create a writable copy of the event object and normalize some properties - var i, prop, copy, - type = event.type, - originalEvent = event, - fixHook = this.fixHooks[ type ]; - - if ( !fixHook ) { - this.fixHooks[ type ] = fixHook = - rmouseEvent.test( type ) ? this.mouseHooks : - rkeyEvent.test( type ) ? this.keyHooks : - {}; - } - copy = fixHook.props ? this.props.concat( fixHook.props ) : this.props; - - event = new jQuery.Event( originalEvent ); - - i = copy.length; - while ( i-- ) { - prop = copy[ i ]; - event[ prop ] = originalEvent[ prop ]; - } - - // Support: IE<9 - // Fix target property (#1925) - if ( !event.target ) { - event.target = originalEvent.srcElement || document; - } - - // Support: Chrome 23+, Safari? - // Target should not be a text node (#504, #13143) - if ( event.target.nodeType === 3 ) { - event.target = event.target.parentNode; - } - - // Support: IE<9 - // For mouse/key events, metaKey==false if it's undefined (#3368, #11328) - event.metaKey = !!event.metaKey; - - return fixHook.filter ? fixHook.filter( event, originalEvent ) : event; - }, - - // Includes some event props shared by KeyEvent and MouseEvent - props: "altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "), - - fixHooks: {}, - - keyHooks: { - props: "char charCode key keyCode".split(" "), - filter: function( event, original ) { - - // Add which for key events - if ( event.which == null ) { - event.which = original.charCode != null ? original.charCode : original.keyCode; - } - - return event; - } - }, - - mouseHooks: { - props: "button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement".split(" "), - filter: function( event, original ) { - var body, eventDoc, doc, - button = original.button, - fromElement = original.fromElement; - - // Calculate pageX/Y if missing and clientX/Y available - if ( event.pageX == null && original.clientX != null ) { - eventDoc = event.target.ownerDocument || document; - doc = eventDoc.documentElement; - body = eventDoc.body; - - event.pageX = original.clientX + ( doc && doc.scrollLeft || body && body.scrollLeft || 0 ) - ( doc && doc.clientLeft || body && body.clientLeft || 0 ); - event.pageY = original.clientY + ( doc && doc.scrollTop || body && body.scrollTop || 0 ) - ( doc && doc.clientTop || body && body.clientTop || 0 ); - } - - // Add relatedTarget, if necessary - if ( !event.relatedTarget && fromElement ) { - event.relatedTarget = fromElement === event.target ? original.toElement : fromElement; - } - - // Add which for click: 1 === left; 2 === middle; 3 === right - // Note: button is not normalized, so don't use it - if ( !event.which && button !== undefined ) { - event.which = ( button & 1 ? 1 : ( button & 2 ? 3 : ( button & 4 ? 2 : 0 ) ) ); - } - - return event; - } - }, - - special: { - load: { - // Prevent triggered image.load events from bubbling to window.load - noBubble: true - }, - focus: { - // Fire native event if possible so blur/focus sequence is correct - trigger: function() { - if ( this !== safeActiveElement() && this.focus ) { - try { - this.focus(); - return false; - } catch ( e ) { - // Support: IE<9 - // If we error on focus to hidden element (#1486, #12518), - // let .trigger() run the handlers - } - } - }, - delegateType: "focusin" - }, - blur: { - trigger: function() { - if ( this === safeActiveElement() && this.blur ) { - this.blur(); - return false; - } - }, - delegateType: "focusout" - }, - click: { - // For checkbox, fire native event so checked state will be right - trigger: function() { - if ( jQuery.nodeName( this, "input" ) && this.type === "checkbox" && this.click ) { - this.click(); - return false; - } - }, - - // For cross-browser consistency, don't fire native .click() on links - _default: function( event ) { - return jQuery.nodeName( event.target, "a" ); - } - }, - - beforeunload: { - postDispatch: function( event ) { - - // Even when returnValue equals to undefined Firefox will still show alert - if ( event.result !== undefined ) { - event.originalEvent.returnValue = event.result; - } - } - } - }, - - simulate: function( type, elem, event, bubble ) { - // Piggyback on a donor event to simulate a different one. - // Fake originalEvent to avoid donor's stopPropagation, but if the - // simulated event prevents default then we do the same on the donor. - var e = jQuery.extend( - new jQuery.Event(), - event, - { - type: type, - isSimulated: true, - originalEvent: {} - } - ); - if ( bubble ) { - jQuery.event.trigger( e, null, elem ); - } else { - jQuery.event.dispatch.call( elem, e ); - } - if ( e.isDefaultPrevented() ) { - event.preventDefault(); - } - } -}; - -jQuery.removeEvent = document.removeEventListener ? - function( elem, type, handle ) { - if ( elem.removeEventListener ) { - elem.removeEventListener( type, handle, false ); - } - } : - function( elem, type, handle ) { - var name = "on" + type; - - if ( elem.detachEvent ) { - - // #8545, #7054, preventing memory leaks for custom events in IE6-8 - // detachEvent needed property on element, by name of that event, to properly expose it to GC - if ( typeof elem[ name ] === core_strundefined ) { - elem[ name ] = null; - } - - elem.detachEvent( name, handle ); - } - }; - -jQuery.Event = function( src, props ) { - // Allow instantiation without the 'new' keyword - if ( !(this instanceof jQuery.Event) ) { - return new jQuery.Event( src, props ); - } - - // Event object - if ( src && src.type ) { - this.originalEvent = src; - this.type = src.type; - - // Events bubbling up the document may have been marked as prevented - // by a handler lower down the tree; reflect the correct value. - this.isDefaultPrevented = ( src.defaultPrevented || src.returnValue === false || - src.getPreventDefault && src.getPreventDefault() ) ? returnTrue : returnFalse; - - // Event type - } else { - this.type = src; - } - - // Put explicitly provided properties onto the event object - if ( props ) { - jQuery.extend( this, props ); - } - - // Create a timestamp if incoming event doesn't have one - this.timeStamp = src && src.timeStamp || jQuery.now(); - - // Mark it as fixed - this[ jQuery.expando ] = true; -}; - -// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding -// http://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html -jQuery.Event.prototype = { - isDefaultPrevented: returnFalse, - isPropagationStopped: returnFalse, - isImmediatePropagationStopped: returnFalse, - - preventDefault: function() { - var e = this.originalEvent; - - this.isDefaultPrevented = returnTrue; - if ( !e ) { - return; - } - - // If preventDefault exists, run it on the original event - if ( e.preventDefault ) { - e.preventDefault(); - - // Support: IE - // Otherwise set the returnValue property of the original event to false - } else { - e.returnValue = false; - } - }, - stopPropagation: function() { - var e = this.originalEvent; - - this.isPropagationStopped = returnTrue; - if ( !e ) { - return; - } - // If stopPropagation exists, run it on the original event - if ( e.stopPropagation ) { - e.stopPropagation(); - } - - // Support: IE - // Set the cancelBubble property of the original event to true - e.cancelBubble = true; - }, - stopImmediatePropagation: function() { - this.isImmediatePropagationStopped = returnTrue; - this.stopPropagation(); - } -}; - -// Create mouseenter/leave events using mouseover/out and event-time checks -jQuery.each({ - mouseenter: "mouseover", - mouseleave: "mouseout" -}, function( orig, fix ) { - jQuery.event.special[ orig ] = { - delegateType: fix, - bindType: fix, - - handle: function( event ) { - var ret, - target = this, - related = event.relatedTarget, - handleObj = event.handleObj; - - // For mousenter/leave call the handler if related is outside the target. - // NB: No relatedTarget if the mouse left/entered the browser window - if ( !related || (related !== target && !jQuery.contains( target, related )) ) { - event.type = handleObj.origType; - ret = handleObj.handler.apply( this, arguments ); - event.type = fix; - } - return ret; - } - }; -}); - -// IE submit delegation -if ( !jQuery.support.submitBubbles ) { - - jQuery.event.special.submit = { - setup: function() { - // Only need this for delegated form submit events - if ( jQuery.nodeName( this, "form" ) ) { - return false; - } - - // Lazy-add a submit handler when a descendant form may potentially be submitted - jQuery.event.add( this, "click._submit keypress._submit", function( e ) { - // Node name check avoids a VML-related crash in IE (#9807) - var elem = e.target, - form = jQuery.nodeName( elem, "input" ) || jQuery.nodeName( elem, "button" ) ? elem.form : undefined; - if ( form && !jQuery._data( form, "submitBubbles" ) ) { - jQuery.event.add( form, "submit._submit", function( event ) { - event._submit_bubble = true; - }); - jQuery._data( form, "submitBubbles", true ); - } - }); - // return undefined since we don't need an event listener - }, - - postDispatch: function( event ) { - // If form was submitted by the user, bubble the event up the tree - if ( event._submit_bubble ) { - delete event._submit_bubble; - if ( this.parentNode && !event.isTrigger ) { - jQuery.event.simulate( "submit", this.parentNode, event, true ); - } - } - }, - - teardown: function() { - // Only need this for delegated form submit events - if ( jQuery.nodeName( this, "form" ) ) { - return false; - } - - // Remove delegated handlers; cleanData eventually reaps submit handlers attached above - jQuery.event.remove( this, "._submit" ); - } - }; -} - -// IE change delegation and checkbox/radio fix -if ( !jQuery.support.changeBubbles ) { - - jQuery.event.special.change = { - - setup: function() { - - if ( rformElems.test( this.nodeName ) ) { - // IE doesn't fire change on a check/radio until blur; trigger it on click - // after a propertychange. Eat the blur-change in special.change.handle. - // This still fires onchange a second time for check/radio after blur. - if ( this.type === "checkbox" || this.type === "radio" ) { - jQuery.event.add( this, "propertychange._change", function( event ) { - if ( event.originalEvent.propertyName === "checked" ) { - this._just_changed = true; - } - }); - jQuery.event.add( this, "click._change", function( event ) { - if ( this._just_changed && !event.isTrigger ) { - this._just_changed = false; - } - // Allow triggered, simulated change events (#11500) - jQuery.event.simulate( "change", this, event, true ); - }); - } - return false; - } - // Delegated event; lazy-add a change handler on descendant inputs - jQuery.event.add( this, "beforeactivate._change", function( e ) { - var elem = e.target; - - if ( rformElems.test( elem.nodeName ) && !jQuery._data( elem, "changeBubbles" ) ) { - jQuery.event.add( elem, "change._change", function( event ) { - if ( this.parentNode && !event.isSimulated && !event.isTrigger ) { - jQuery.event.simulate( "change", this.parentNode, event, true ); - } - }); - jQuery._data( elem, "changeBubbles", true ); - } - }); - }, - - handle: function( event ) { - var elem = event.target; - - // Swallow native change events from checkbox/radio, we already triggered them above - if ( this !== elem || event.isSimulated || event.isTrigger || (elem.type !== "radio" && elem.type !== "checkbox") ) { - return event.handleObj.handler.apply( this, arguments ); - } - }, - - teardown: function() { - jQuery.event.remove( this, "._change" ); - - return !rformElems.test( this.nodeName ); - } - }; -} - -// Create "bubbling" focus and blur events -if ( !jQuery.support.focusinBubbles ) { - jQuery.each({ focus: "focusin", blur: "focusout" }, function( orig, fix ) { - - // Attach a single capturing handler while someone wants focusin/focusout - var attaches = 0, - handler = function( event ) { - jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ), true ); - }; - - jQuery.event.special[ fix ] = { - setup: function() { - if ( attaches++ === 0 ) { - document.addEventListener( orig, handler, true ); - } - }, - teardown: function() { - if ( --attaches === 0 ) { - document.removeEventListener( orig, handler, true ); - } - } - }; - }); -} - -jQuery.fn.extend({ - - on: function( types, selector, data, fn, /*INTERNAL*/ one ) { - var type, origFn; - - // Types can be a map of types/handlers - if ( typeof types === "object" ) { - // ( types-Object, selector, data ) - if ( typeof selector !== "string" ) { - // ( types-Object, data ) - data = data || selector; - selector = undefined; - } - for ( type in types ) { - this.on( type, selector, data, types[ type ], one ); - } - return this; - } - - if ( data == null && fn == null ) { - // ( types, fn ) - fn = selector; - data = selector = undefined; - } else if ( fn == null ) { - if ( typeof selector === "string" ) { - // ( types, selector, fn ) - fn = data; - data = undefined; - } else { - // ( types, data, fn ) - fn = data; - data = selector; - selector = undefined; - } - } - if ( fn === false ) { - fn = returnFalse; - } else if ( !fn ) { - return this; - } - - if ( one === 1 ) { - origFn = fn; - fn = function( event ) { - // Can use an empty set, since event contains the info - jQuery().off( event ); - return origFn.apply( this, arguments ); - }; - // Use same guid so caller can remove using origFn - fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); - } - return this.each( function() { - jQuery.event.add( this, types, fn, data, selector ); - }); - }, - one: function( types, selector, data, fn ) { - return this.on( types, selector, data, fn, 1 ); - }, - off: function( types, selector, fn ) { - var handleObj, type; - if ( types && types.preventDefault && types.handleObj ) { - // ( event ) dispatched jQuery.Event - handleObj = types.handleObj; - jQuery( types.delegateTarget ).off( - handleObj.namespace ? handleObj.origType + "." + handleObj.namespace : handleObj.origType, - handleObj.selector, - handleObj.handler - ); - return this; - } - if ( typeof types === "object" ) { - // ( types-object [, selector] ) - for ( type in types ) { - this.off( type, selector, types[ type ] ); - } - return this; - } - if ( selector === false || typeof selector === "function" ) { - // ( types [, fn] ) - fn = selector; - selector = undefined; - } - if ( fn === false ) { - fn = returnFalse; - } - return this.each(function() { - jQuery.event.remove( this, types, fn, selector ); - }); - }, - - trigger: function( type, data ) { - return this.each(function() { - jQuery.event.trigger( type, data, this ); - }); - }, - triggerHandler: function( type, data ) { - var elem = this[0]; - if ( elem ) { - return jQuery.event.trigger( type, data, elem, true ); - } - } -}); -var isSimple = /^.[^:#\[\.,]*$/, - rparentsprev = /^(?:parents|prev(?:Until|All))/, - rneedsContext = jQuery.expr.match.needsContext, - // methods guaranteed to produce a unique set when starting from a unique set - guaranteedUnique = { - children: true, - contents: true, - next: true, - prev: true - }; - -jQuery.fn.extend({ - find: function( selector ) { - var i, - ret = [], - self = this, - len = self.length; - - if ( typeof selector !== "string" ) { - return this.pushStack( jQuery( selector ).filter(function() { - for ( i = 0; i < len; i++ ) { - if ( jQuery.contains( self[ i ], this ) ) { - return true; - } - } - }) ); - } - - for ( i = 0; i < len; i++ ) { - jQuery.find( selector, self[ i ], ret ); - } - - // Needed because $( selector, context ) becomes $( context ).find( selector ) - ret = this.pushStack( len > 1 ? jQuery.unique( ret ) : ret ); - ret.selector = this.selector ? this.selector + " " + selector : selector; - return ret; - }, - - has: function( target ) { - var i, - targets = jQuery( target, this ), - len = targets.length; - - return this.filter(function() { - for ( i = 0; i < len; i++ ) { - if ( jQuery.contains( this, targets[i] ) ) { - return true; - } - } - }); - }, - - not: function( selector ) { - return this.pushStack( winnow(this, selector || [], true) ); - }, - - filter: function( selector ) { - return this.pushStack( winnow(this, selector || [], false) ); - }, - - is: function( selector ) { - return !!winnow( - this, - - // If this is a positional/relative selector, check membership in the returned set - // so $("p:first").is("p:last") won't return true for a doc with two "p". - typeof selector === "string" && rneedsContext.test( selector ) ? - jQuery( selector ) : - selector || [], - false - ).length; - }, - - closest: function( selectors, context ) { - var cur, - i = 0, - l = this.length, - ret = [], - pos = rneedsContext.test( selectors ) || typeof selectors !== "string" ? - jQuery( selectors, context || this.context ) : - 0; - - for ( ; i < l; i++ ) { - for ( cur = this[i]; cur && cur !== context; cur = cur.parentNode ) { - // Always skip document fragments - if ( cur.nodeType < 11 && (pos ? - pos.index(cur) > -1 : - - // Don't pass non-elements to Sizzle - cur.nodeType === 1 && - jQuery.find.matchesSelector(cur, selectors)) ) { - - cur = ret.push( cur ); - break; - } - } - } - - return this.pushStack( ret.length > 1 ? jQuery.unique( ret ) : ret ); - }, - - // Determine the position of an element within - // the matched set of elements - index: function( elem ) { - - // No argument, return index in parent - if ( !elem ) { - return ( this[0] && this[0].parentNode ) ? this.first().prevAll().length : -1; - } - - // index in selector - if ( typeof elem === "string" ) { - return jQuery.inArray( this[0], jQuery( elem ) ); - } - - // Locate the position of the desired element - return jQuery.inArray( - // If it receives a jQuery object, the first element is used - elem.jquery ? elem[0] : elem, this ); - }, - - add: function( selector, context ) { - var set = typeof selector === "string" ? - jQuery( selector, context ) : - jQuery.makeArray( selector && selector.nodeType ? [ selector ] : selector ), - all = jQuery.merge( this.get(), set ); - - return this.pushStack( jQuery.unique(all) ); - }, - - addBack: function( selector ) { - return this.add( selector == null ? - this.prevObject : this.prevObject.filter(selector) - ); - } -}); - -function sibling( cur, dir ) { - do { - cur = cur[ dir ]; - } while ( cur && cur.nodeType !== 1 ); - - return cur; -} - -jQuery.each({ - parent: function( elem ) { - var parent = elem.parentNode; - return parent && parent.nodeType !== 11 ? parent : null; - }, - parents: function( elem ) { - return jQuery.dir( elem, "parentNode" ); - }, - parentsUntil: function( elem, i, until ) { - return jQuery.dir( elem, "parentNode", until ); - }, - next: function( elem ) { - return sibling( elem, "nextSibling" ); - }, - prev: function( elem ) { - return sibling( elem, "previousSibling" ); - }, - nextAll: function( elem ) { - return jQuery.dir( elem, "nextSibling" ); - }, - prevAll: function( elem ) { - return jQuery.dir( elem, "previousSibling" ); - }, - nextUntil: function( elem, i, until ) { - return jQuery.dir( elem, "nextSibling", until ); - }, - prevUntil: function( elem, i, until ) { - return jQuery.dir( elem, "previousSibling", until ); - }, - siblings: function( elem ) { - return jQuery.sibling( ( elem.parentNode || {} ).firstChild, elem ); - }, - children: function( elem ) { - return jQuery.sibling( elem.firstChild ); - }, - contents: function( elem ) { - return jQuery.nodeName( elem, "iframe" ) ? - elem.contentDocument || elem.contentWindow.document : - jQuery.merge( [], elem.childNodes ); - } -}, function( name, fn ) { - jQuery.fn[ name ] = function( until, selector ) { - var ret = jQuery.map( this, fn, until ); - - if ( name.slice( -5 ) !== "Until" ) { - selector = until; - } - - if ( selector && typeof selector === "string" ) { - ret = jQuery.filter( selector, ret ); - } - - if ( this.length > 1 ) { - // Remove duplicates - if ( !guaranteedUnique[ name ] ) { - ret = jQuery.unique( ret ); - } - - // Reverse order for parents* and prev-derivatives - if ( rparentsprev.test( name ) ) { - ret = ret.reverse(); - } - } - - return this.pushStack( ret ); - }; -}); - -jQuery.extend({ - filter: function( expr, elems, not ) { - var elem = elems[ 0 ]; - - if ( not ) { - expr = ":not(" + expr + ")"; - } - - return elems.length === 1 && elem.nodeType === 1 ? - jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : [] : - jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { - return elem.nodeType === 1; - })); - }, - - dir: function( elem, dir, until ) { - var matched = [], - cur = elem[ dir ]; - - while ( cur && cur.nodeType !== 9 && (until === undefined || cur.nodeType !== 1 || !jQuery( cur ).is( until )) ) { - if ( cur.nodeType === 1 ) { - matched.push( cur ); - } - cur = cur[dir]; - } - return matched; - }, - - sibling: function( n, elem ) { - var r = []; - - for ( ; n; n = n.nextSibling ) { - if ( n.nodeType === 1 && n !== elem ) { - r.push( n ); - } - } - - return r; - } -}); - -// Implement the identical functionality for filter and not -function winnow( elements, qualifier, not ) { - if ( jQuery.isFunction( qualifier ) ) { - return jQuery.grep( elements, function( elem, i ) { - /* jshint -W018 */ - return !!qualifier.call( elem, i, elem ) !== not; - }); - - } - - if ( qualifier.nodeType ) { - return jQuery.grep( elements, function( elem ) { - return ( elem === qualifier ) !== not; - }); - - } - - if ( typeof qualifier === "string" ) { - if ( isSimple.test( qualifier ) ) { - return jQuery.filter( qualifier, elements, not ); - } - - qualifier = jQuery.filter( qualifier, elements ); - } - - return jQuery.grep( elements, function( elem ) { - return ( jQuery.inArray( elem, qualifier ) >= 0 ) !== not; - }); -} -function createSafeFragment( document ) { - var list = nodeNames.split( "|" ), - safeFrag = document.createDocumentFragment(); - - if ( safeFrag.createElement ) { - while ( list.length ) { - safeFrag.createElement( - list.pop() - ); - } - } - return safeFrag; -} - -var nodeNames = "abbr|article|aside|audio|bdi|canvas|data|datalist|details|figcaption|figure|footer|" + - "header|hgroup|mark|meter|nav|output|progress|section|summary|time|video", - rinlinejQuery = / jQuery\d+="(?:null|\d+)"/g, - rnoshimcache = new RegExp("<(?:" + nodeNames + ")[\\s/>]", "i"), - rleadingWhitespace = /^\s+/, - rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/gi, - rtagName = /<([\w:]+)/, - rtbody = /\s*$/g, - - // We have to close these tags to support XHTML (#13200) - wrapMap = { - option: [ 1, "" ], - legend: [ 1, "
", "
" ], - area: [ 1, "", "" ], - param: [ 1, "", "" ], - thead: [ 1, "", "
" ], - tr: [ 2, "", "
" ], - col: [ 2, "", "
" ], - td: [ 3, "", "
" ], - - // IE6-8 can't serialize link, script, style, or any html5 (NoScope) tags, - // unless wrapped in a div with non-breaking characters in front of it. - _default: jQuery.support.htmlSerialize ? [ 0, "", "" ] : [ 1, "X
", "
" ] - }, - safeFragment = createSafeFragment( document ), - fragmentDiv = safeFragment.appendChild( document.createElement("div") ); - -wrapMap.optgroup = wrapMap.option; -wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; -wrapMap.th = wrapMap.td; - -jQuery.fn.extend({ - text: function( value ) { - return jQuery.access( this, function( value ) { - return value === undefined ? - jQuery.text( this ) : - this.empty().append( ( this[0] && this[0].ownerDocument || document ).createTextNode( value ) ); - }, null, value, arguments.length ); - }, - - append: function() { - return this.domManip( arguments, function( elem ) { - if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { - var target = manipulationTarget( this, elem ); - target.appendChild( elem ); - } - }); - }, - - prepend: function() { - return this.domManip( arguments, function( elem ) { - if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { - var target = manipulationTarget( this, elem ); - target.insertBefore( elem, target.firstChild ); - } - }); - }, - - before: function() { - return this.domManip( arguments, function( elem ) { - if ( this.parentNode ) { - this.parentNode.insertBefore( elem, this ); - } - }); - }, - - after: function() { - return this.domManip( arguments, function( elem ) { - if ( this.parentNode ) { - this.parentNode.insertBefore( elem, this.nextSibling ); - } - }); - }, - - // keepData is for internal use only--do not document - remove: function( selector, keepData ) { - var elem, - elems = selector ? jQuery.filter( selector, this ) : this, - i = 0; - - for ( ; (elem = elems[i]) != null; i++ ) { - - if ( !keepData && elem.nodeType === 1 ) { - jQuery.cleanData( getAll( elem ) ); - } - - if ( elem.parentNode ) { - if ( keepData && jQuery.contains( elem.ownerDocument, elem ) ) { - setGlobalEval( getAll( elem, "script" ) ); - } - elem.parentNode.removeChild( elem ); - } - } - - return this; - }, - - empty: function() { - var elem, - i = 0; - - for ( ; (elem = this[i]) != null; i++ ) { - // Remove element nodes and prevent memory leaks - if ( elem.nodeType === 1 ) { - jQuery.cleanData( getAll( elem, false ) ); - } - - // Remove any remaining nodes - while ( elem.firstChild ) { - elem.removeChild( elem.firstChild ); - } - - // If this is a select, ensure that it displays empty (#12336) - // Support: IE<9 - if ( elem.options && jQuery.nodeName( elem, "select" ) ) { - elem.options.length = 0; - } - } - - return this; - }, - - clone: function( dataAndEvents, deepDataAndEvents ) { - dataAndEvents = dataAndEvents == null ? false : dataAndEvents; - deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; - - return this.map( function () { - return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); - }); - }, - - html: function( value ) { - return jQuery.access( this, function( value ) { - var elem = this[0] || {}, - i = 0, - l = this.length; - - if ( value === undefined ) { - return elem.nodeType === 1 ? - elem.innerHTML.replace( rinlinejQuery, "" ) : - undefined; - } - - // See if we can take a shortcut and just use innerHTML - if ( typeof value === "string" && !rnoInnerhtml.test( value ) && - ( jQuery.support.htmlSerialize || !rnoshimcache.test( value ) ) && - ( jQuery.support.leadingWhitespace || !rleadingWhitespace.test( value ) ) && - !wrapMap[ ( rtagName.exec( value ) || ["", ""] )[1].toLowerCase() ] ) { - - value = value.replace( rxhtmlTag, "<$1>" ); - - try { - for (; i < l; i++ ) { - // Remove element nodes and prevent memory leaks - elem = this[i] || {}; - if ( elem.nodeType === 1 ) { - jQuery.cleanData( getAll( elem, false ) ); - elem.innerHTML = value; - } - } - - elem = 0; - - // If using innerHTML throws an exception, use the fallback method - } catch(e) {} - } - - if ( elem ) { - this.empty().append( value ); - } - }, null, value, arguments.length ); - }, - - replaceWith: function() { - var - // Snapshot the DOM in case .domManip sweeps something relevant into its fragment - args = jQuery.map( this, function( elem ) { - return [ elem.nextSibling, elem.parentNode ]; - }), - i = 0; - - // Make the changes, replacing each context element with the new content - this.domManip( arguments, function( elem ) { - var next = args[ i++ ], - parent = args[ i++ ]; - - if ( parent ) { - // Don't use the snapshot next if it has moved (#13810) - if ( next && next.parentNode !== parent ) { - next = this.nextSibling; - } - jQuery( this ).remove(); - parent.insertBefore( elem, next ); - } - // Allow new content to include elements from the context set - }, true ); - - // Force removal if there was no new content (e.g., from empty arguments) - return i ? this : this.remove(); - }, - - detach: function( selector ) { - return this.remove( selector, true ); - }, - - domManip: function( args, callback, allowIntersection ) { - - // Flatten any nested arrays - args = core_concat.apply( [], args ); - - var first, node, hasScripts, - scripts, doc, fragment, - i = 0, - l = this.length, - set = this, - iNoClone = l - 1, - value = args[0], - isFunction = jQuery.isFunction( value ); - - // We can't cloneNode fragments that contain checked, in WebKit - if ( isFunction || !( l <= 1 || typeof value !== "string" || jQuery.support.checkClone || !rchecked.test( value ) ) ) { - return this.each(function( index ) { - var self = set.eq( index ); - if ( isFunction ) { - args[0] = value.call( this, index, self.html() ); - } - self.domManip( args, callback, allowIntersection ); - }); - } - - if ( l ) { - fragment = jQuery.buildFragment( args, this[ 0 ].ownerDocument, false, !allowIntersection && this ); - first = fragment.firstChild; - - if ( fragment.childNodes.length === 1 ) { - fragment = first; - } - - if ( first ) { - scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); - hasScripts = scripts.length; - - // Use the original fragment for the last item instead of the first because it can end up - // being emptied incorrectly in certain situations (#8070). - for ( ; i < l; i++ ) { - node = fragment; - - if ( i !== iNoClone ) { - node = jQuery.clone( node, true, true ); - - // Keep references to cloned scripts for later restoration - if ( hasScripts ) { - jQuery.merge( scripts, getAll( node, "script" ) ); - } - } - - callback.call( this[i], node, i ); - } - - if ( hasScripts ) { - doc = scripts[ scripts.length - 1 ].ownerDocument; - - // Reenable scripts - jQuery.map( scripts, restoreScript ); - - // Evaluate executable scripts on first document insertion - for ( i = 0; i < hasScripts; i++ ) { - node = scripts[ i ]; - if ( rscriptType.test( node.type || "" ) && - !jQuery._data( node, "globalEval" ) && jQuery.contains( doc, node ) ) { - - if ( node.src ) { - // Hope ajax is available... - jQuery._evalUrl( node.src ); - } else { - jQuery.globalEval( ( node.text || node.textContent || node.innerHTML || "" ).replace( rcleanScript, "" ) ); - } - } - } - } - - // Fix #11809: Avoid leaking memory - fragment = first = null; - } - } - - return this; - } -}); - -// Support: IE<8 -// Manipulating tables requires a tbody -function manipulationTarget( elem, content ) { - return jQuery.nodeName( elem, "table" ) && - jQuery.nodeName( content.nodeType === 1 ? content : content.firstChild, "tr" ) ? - - elem.getElementsByTagName("tbody")[0] || - elem.appendChild( elem.ownerDocument.createElement("tbody") ) : - elem; -} - -// Replace/restore the type attribute of script elements for safe DOM manipulation -function disableScript( elem ) { - elem.type = (jQuery.find.attr( elem, "type" ) !== null) + "/" + elem.type; - return elem; -} -function restoreScript( elem ) { - var match = rscriptTypeMasked.exec( elem.type ); - if ( match ) { - elem.type = match[1]; - } else { - elem.removeAttribute("type"); - } - return elem; -} - -// Mark scripts as having already been evaluated -function setGlobalEval( elems, refElements ) { - var elem, - i = 0; - for ( ; (elem = elems[i]) != null; i++ ) { - jQuery._data( elem, "globalEval", !refElements || jQuery._data( refElements[i], "globalEval" ) ); - } -} - -function cloneCopyEvent( src, dest ) { - - if ( dest.nodeType !== 1 || !jQuery.hasData( src ) ) { - return; - } - - var type, i, l, - oldData = jQuery._data( src ), - curData = jQuery._data( dest, oldData ), - events = oldData.events; - - if ( events ) { - delete curData.handle; - curData.events = {}; - - for ( type in events ) { - for ( i = 0, l = events[ type ].length; i < l; i++ ) { - jQuery.event.add( dest, type, events[ type ][ i ] ); - } - } - } - - // make the cloned public data object a copy from the original - if ( curData.data ) { - curData.data = jQuery.extend( {}, curData.data ); - } -} - -function fixCloneNodeIssues( src, dest ) { - var nodeName, e, data; - - // We do not need to do anything for non-Elements - if ( dest.nodeType !== 1 ) { - return; - } - - nodeName = dest.nodeName.toLowerCase(); - - // IE6-8 copies events bound via attachEvent when using cloneNode. - if ( !jQuery.support.noCloneEvent && dest[ jQuery.expando ] ) { - data = jQuery._data( dest ); - - for ( e in data.events ) { - jQuery.removeEvent( dest, e, data.handle ); - } - - // Event data gets referenced instead of copied if the expando gets copied too - dest.removeAttribute( jQuery.expando ); - } - - // IE blanks contents when cloning scripts, and tries to evaluate newly-set text - if ( nodeName === "script" && dest.text !== src.text ) { - disableScript( dest ).text = src.text; - restoreScript( dest ); - - // IE6-10 improperly clones children of object elements using classid. - // IE10 throws NoModificationAllowedError if parent is null, #12132. - } else if ( nodeName === "object" ) { - if ( dest.parentNode ) { - dest.outerHTML = src.outerHTML; - } - - // This path appears unavoidable for IE9. When cloning an object - // element in IE9, the outerHTML strategy above is not sufficient. - // If the src has innerHTML and the destination does not, - // copy the src.innerHTML into the dest.innerHTML. #10324 - if ( jQuery.support.html5Clone && ( src.innerHTML && !jQuery.trim(dest.innerHTML) ) ) { - dest.innerHTML = src.innerHTML; - } - - } else if ( nodeName === "input" && manipulation_rcheckableType.test( src.type ) ) { - // IE6-8 fails to persist the checked state of a cloned checkbox - // or radio button. Worse, IE6-7 fail to give the cloned element - // a checked appearance if the defaultChecked value isn't also set - - dest.defaultChecked = dest.checked = src.checked; - - // IE6-7 get confused and end up setting the value of a cloned - // checkbox/radio button to an empty string instead of "on" - if ( dest.value !== src.value ) { - dest.value = src.value; - } - - // IE6-8 fails to return the selected option to the default selected - // state when cloning options - } else if ( nodeName === "option" ) { - dest.defaultSelected = dest.selected = src.defaultSelected; - - // IE6-8 fails to set the defaultValue to the correct value when - // cloning other types of input fields - } else if ( nodeName === "input" || nodeName === "textarea" ) { - dest.defaultValue = src.defaultValue; - } -} - -jQuery.each({ - appendTo: "append", - prependTo: "prepend", - insertBefore: "before", - insertAfter: "after", - replaceAll: "replaceWith" -}, function( name, original ) { - jQuery.fn[ name ] = function( selector ) { - var elems, - i = 0, - ret = [], - insert = jQuery( selector ), - last = insert.length - 1; - - for ( ; i <= last; i++ ) { - elems = i === last ? this : this.clone(true); - jQuery( insert[i] )[ original ]( elems ); - - // Modern browsers can apply jQuery collections as arrays, but oldIE needs a .get() - core_push.apply( ret, elems.get() ); - } - - return this.pushStack( ret ); - }; -}); - -function getAll( context, tag ) { - var elems, elem, - i = 0, - found = typeof context.getElementsByTagName !== core_strundefined ? context.getElementsByTagName( tag || "*" ) : - typeof context.querySelectorAll !== core_strundefined ? context.querySelectorAll( tag || "*" ) : - undefined; - - if ( !found ) { - for ( found = [], elems = context.childNodes || context; (elem = elems[i]) != null; i++ ) { - if ( !tag || jQuery.nodeName( elem, tag ) ) { - found.push( elem ); - } else { - jQuery.merge( found, getAll( elem, tag ) ); - } - } - } - - return tag === undefined || tag && jQuery.nodeName( context, tag ) ? - jQuery.merge( [ context ], found ) : - found; -} - -// Used in buildFragment, fixes the defaultChecked property -function fixDefaultChecked( elem ) { - if ( manipulation_rcheckableType.test( elem.type ) ) { - elem.defaultChecked = elem.checked; - } -} - -jQuery.extend({ - clone: function( elem, dataAndEvents, deepDataAndEvents ) { - var destElements, node, clone, i, srcElements, - inPage = jQuery.contains( elem.ownerDocument, elem ); - - if ( jQuery.support.html5Clone || jQuery.isXMLDoc(elem) || !rnoshimcache.test( "<" + elem.nodeName + ">" ) ) { - clone = elem.cloneNode( true ); - - // IE<=8 does not properly clone detached, unknown element nodes - } else { - fragmentDiv.innerHTML = elem.outerHTML; - fragmentDiv.removeChild( clone = fragmentDiv.firstChild ); - } - - if ( (!jQuery.support.noCloneEvent || !jQuery.support.noCloneChecked) && - (elem.nodeType === 1 || elem.nodeType === 11) && !jQuery.isXMLDoc(elem) ) { - - // We eschew Sizzle here for performance reasons: http://jsperf.com/getall-vs-sizzle/2 - destElements = getAll( clone ); - srcElements = getAll( elem ); - - // Fix all IE cloning issues - for ( i = 0; (node = srcElements[i]) != null; ++i ) { - // Ensure that the destination node is not null; Fixes #9587 - if ( destElements[i] ) { - fixCloneNodeIssues( node, destElements[i] ); - } - } - } - - // Copy the events from the original to the clone - if ( dataAndEvents ) { - if ( deepDataAndEvents ) { - srcElements = srcElements || getAll( elem ); - destElements = destElements || getAll( clone ); - - for ( i = 0; (node = srcElements[i]) != null; i++ ) { - cloneCopyEvent( node, destElements[i] ); - } - } else { - cloneCopyEvent( elem, clone ); - } - } - - // Preserve script evaluation history - destElements = getAll( clone, "script" ); - if ( destElements.length > 0 ) { - setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); - } - - destElements = srcElements = node = null; - - // Return the cloned set - return clone; - }, - - buildFragment: function( elems, context, scripts, selection ) { - var j, elem, contains, - tmp, tag, tbody, wrap, - l = elems.length, - - // Ensure a safe fragment - safe = createSafeFragment( context ), - - nodes = [], - i = 0; - - for ( ; i < l; i++ ) { - elem = elems[ i ]; - - if ( elem || elem === 0 ) { - - // Add nodes directly - if ( jQuery.type( elem ) === "object" ) { - jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); - - // Convert non-html into a text node - } else if ( !rhtml.test( elem ) ) { - nodes.push( context.createTextNode( elem ) ); - - // Convert html into DOM nodes - } else { - tmp = tmp || safe.appendChild( context.createElement("div") ); - - // Deserialize a standard representation - tag = ( rtagName.exec( elem ) || ["", ""] )[1].toLowerCase(); - wrap = wrapMap[ tag ] || wrapMap._default; - - tmp.innerHTML = wrap[1] + elem.replace( rxhtmlTag, "<$1>" ) + wrap[2]; - - // Descend through wrappers to the right content - j = wrap[0]; - while ( j-- ) { - tmp = tmp.lastChild; - } - - // Manually add leading whitespace removed by IE - if ( !jQuery.support.leadingWhitespace && rleadingWhitespace.test( elem ) ) { - nodes.push( context.createTextNode( rleadingWhitespace.exec( elem )[0] ) ); - } - - // Remove IE's autoinserted from table fragments - if ( !jQuery.support.tbody ) { - - // String was a , *may* have spurious - elem = tag === "table" && !rtbody.test( elem ) ? - tmp.firstChild : - - // String was a bare or - wrap[1] === "
" && !rtbody.test( elem ) ? - tmp : - 0; - - j = elem && elem.childNodes.length; - while ( j-- ) { - if ( jQuery.nodeName( (tbody = elem.childNodes[j]), "tbody" ) && !tbody.childNodes.length ) { - elem.removeChild( tbody ); - } - } - } - - jQuery.merge( nodes, tmp.childNodes ); - - // Fix #12392 for WebKit and IE > 9 - tmp.textContent = ""; - - // Fix #12392 for oldIE - while ( tmp.firstChild ) { - tmp.removeChild( tmp.firstChild ); - } - - // Remember the top-level container for proper cleanup - tmp = safe.lastChild; - } - } - } - - // Fix #11356: Clear elements from fragment - if ( tmp ) { - safe.removeChild( tmp ); - } - - // Reset defaultChecked for any radios and checkboxes - // about to be appended to the DOM in IE 6/7 (#8060) - if ( !jQuery.support.appendChecked ) { - jQuery.grep( getAll( nodes, "input" ), fixDefaultChecked ); - } - - i = 0; - while ( (elem = nodes[ i++ ]) ) { - - // #4087 - If origin and destination elements are the same, and this is - // that element, do not do anything - if ( selection && jQuery.inArray( elem, selection ) !== -1 ) { - continue; - } - - contains = jQuery.contains( elem.ownerDocument, elem ); - - // Append to fragment - tmp = getAll( safe.appendChild( elem ), "script" ); - - // Preserve script evaluation history - if ( contains ) { - setGlobalEval( tmp ); - } - - // Capture executables - if ( scripts ) { - j = 0; - while ( (elem = tmp[ j++ ]) ) { - if ( rscriptType.test( elem.type || "" ) ) { - scripts.push( elem ); - } - } - } - } - - tmp = null; - - return safe; - }, - - cleanData: function( elems, /* internal */ acceptData ) { - var elem, type, id, data, - i = 0, - internalKey = jQuery.expando, - cache = jQuery.cache, - deleteExpando = jQuery.support.deleteExpando, - special = jQuery.event.special; - - for ( ; (elem = elems[i]) != null; i++ ) { - - if ( acceptData || jQuery.acceptData( elem ) ) { - - id = elem[ internalKey ]; - data = id && cache[ id ]; - - if ( data ) { - if ( data.events ) { - for ( type in data.events ) { - if ( special[ type ] ) { - jQuery.event.remove( elem, type ); - - // This is a shortcut to avoid jQuery.event.remove's overhead - } else { - jQuery.removeEvent( elem, type, data.handle ); - } - } - } - - // Remove cache only if it was not already removed by jQuery.event.remove - if ( cache[ id ] ) { - - delete cache[ id ]; - - // IE does not allow us to delete expando properties from nodes, - // nor does it have a removeAttribute function on Document nodes; - // we must handle all of these cases - if ( deleteExpando ) { - delete elem[ internalKey ]; - - } else if ( typeof elem.removeAttribute !== core_strundefined ) { - elem.removeAttribute( internalKey ); - - } else { - elem[ internalKey ] = null; - } - - core_deletedIds.push( id ); - } - } - } - } - }, - - _evalUrl: function( url ) { - return jQuery.ajax({ - url: url, - type: "GET", - dataType: "script", - async: false, - global: false, - "throws": true - }); - } -}); -jQuery.fn.extend({ - wrapAll: function( html ) { - if ( jQuery.isFunction( html ) ) { - return this.each(function(i) { - jQuery(this).wrapAll( html.call(this, i) ); - }); - } - - if ( this[0] ) { - // The elements to wrap the target around - var wrap = jQuery( html, this[0].ownerDocument ).eq(0).clone(true); - - if ( this[0].parentNode ) { - wrap.insertBefore( this[0] ); - } - - wrap.map(function() { - var elem = this; - - while ( elem.firstChild && elem.firstChild.nodeType === 1 ) { - elem = elem.firstChild; - } - - return elem; - }).append( this ); - } - - return this; - }, - - wrapInner: function( html ) { - if ( jQuery.isFunction( html ) ) { - return this.each(function(i) { - jQuery(this).wrapInner( html.call(this, i) ); - }); - } - - return this.each(function() { - var self = jQuery( this ), - contents = self.contents(); - - if ( contents.length ) { - contents.wrapAll( html ); - - } else { - self.append( html ); - } - }); - }, - - wrap: function( html ) { - var isFunction = jQuery.isFunction( html ); - - return this.each(function(i) { - jQuery( this ).wrapAll( isFunction ? html.call(this, i) : html ); - }); - }, - - unwrap: function() { - return this.parent().each(function() { - if ( !jQuery.nodeName( this, "body" ) ) { - jQuery( this ).replaceWith( this.childNodes ); - } - }).end(); - } -}); -var iframe, getStyles, curCSS, - ralpha = /alpha\([^)]*\)/i, - ropacity = /opacity\s*=\s*([^)]*)/, - rposition = /^(top|right|bottom|left)$/, - // swappable if display is none or starts with table except "table", "table-cell", or "table-caption" - // see here for display values: https://developer.mozilla.org/en-US/docs/CSS/display - rdisplayswap = /^(none|table(?!-c[ea]).+)/, - rmargin = /^margin/, - rnumsplit = new RegExp( "^(" + core_pnum + ")(.*)$", "i" ), - rnumnonpx = new RegExp( "^(" + core_pnum + ")(?!px)[a-z%]+$", "i" ), - rrelNum = new RegExp( "^([+-])=(" + core_pnum + ")", "i" ), - elemdisplay = { BODY: "block" }, - - cssShow = { position: "absolute", visibility: "hidden", display: "block" }, - cssNormalTransform = { - letterSpacing: 0, - fontWeight: 400 - }, - - cssExpand = [ "Top", "Right", "Bottom", "Left" ], - cssPrefixes = [ "Webkit", "O", "Moz", "ms" ]; - -// return a css property mapped to a potentially vendor prefixed property -function vendorPropName( style, name ) { - - // shortcut for names that are not vendor prefixed - if ( name in style ) { - return name; - } - - // check for vendor prefixed names - var capName = name.charAt(0).toUpperCase() + name.slice(1), - origName = name, - i = cssPrefixes.length; - - while ( i-- ) { - name = cssPrefixes[ i ] + capName; - if ( name in style ) { - return name; - } - } - - return origName; -} - -function isHidden( elem, el ) { - // isHidden might be called from jQuery#filter function; - // in that case, element will be second argument - elem = el || elem; - return jQuery.css( elem, "display" ) === "none" || !jQuery.contains( elem.ownerDocument, elem ); -} - -function showHide( elements, show ) { - var display, elem, hidden, - values = [], - index = 0, - length = elements.length; - - for ( ; index < length; index++ ) { - elem = elements[ index ]; - if ( !elem.style ) { - continue; - } - - values[ index ] = jQuery._data( elem, "olddisplay" ); - display = elem.style.display; - if ( show ) { - // Reset the inline display of this element to learn if it is - // being hidden by cascaded rules or not - if ( !values[ index ] && display === "none" ) { - elem.style.display = ""; - } - - // Set elements which have been overridden with display: none - // in a stylesheet to whatever the default browser style is - // for such an element - if ( elem.style.display === "" && isHidden( elem ) ) { - values[ index ] = jQuery._data( elem, "olddisplay", css_defaultDisplay(elem.nodeName) ); - } - } else { - - if ( !values[ index ] ) { - hidden = isHidden( elem ); - - if ( display && display !== "none" || !hidden ) { - jQuery._data( elem, "olddisplay", hidden ? display : jQuery.css( elem, "display" ) ); - } - } - } - } - - // Set the display of most of the elements in a second loop - // to avoid the constant reflow - for ( index = 0; index < length; index++ ) { - elem = elements[ index ]; - if ( !elem.style ) { - continue; - } - if ( !show || elem.style.display === "none" || elem.style.display === "" ) { - elem.style.display = show ? values[ index ] || "" : "none"; - } - } - - return elements; -} - -jQuery.fn.extend({ - css: function( name, value ) { - return jQuery.access( this, function( elem, name, value ) { - var len, styles, - map = {}, - i = 0; - - if ( jQuery.isArray( name ) ) { - styles = getStyles( elem ); - len = name.length; - - for ( ; i < len; i++ ) { - map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); - } - - return map; - } - - return value !== undefined ? - jQuery.style( elem, name, value ) : - jQuery.css( elem, name ); - }, name, value, arguments.length > 1 ); - }, - show: function() { - return showHide( this, true ); - }, - hide: function() { - return showHide( this ); - }, - toggle: function( state ) { - if ( typeof state === "boolean" ) { - return state ? this.show() : this.hide(); - } - - return this.each(function() { - if ( isHidden( this ) ) { - jQuery( this ).show(); - } else { - jQuery( this ).hide(); - } - }); - } -}); - -jQuery.extend({ - // Add in style property hooks for overriding the default - // behavior of getting and setting a style property - cssHooks: { - opacity: { - get: function( elem, computed ) { - if ( computed ) { - // We should always get a number back from opacity - var ret = curCSS( elem, "opacity" ); - return ret === "" ? "1" : ret; - } - } - } - }, - - // Don't automatically add "px" to these possibly-unitless properties - cssNumber: { - "columnCount": true, - "fillOpacity": true, - "fontWeight": true, - "lineHeight": true, - "opacity": true, - "order": true, - "orphans": true, - "widows": true, - "zIndex": true, - "zoom": true - }, - - // Add in properties whose names you wish to fix before - // setting or getting the value - cssProps: { - // normalize float css property - "float": jQuery.support.cssFloat ? "cssFloat" : "styleFloat" - }, - - // Get and set the style property on a DOM Node - style: function( elem, name, value, extra ) { - // Don't set styles on text and comment nodes - if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { - return; - } - - // Make sure that we're working with the right name - var ret, type, hooks, - origName = jQuery.camelCase( name ), - style = elem.style; - - name = jQuery.cssProps[ origName ] || ( jQuery.cssProps[ origName ] = vendorPropName( style, origName ) ); - - // gets hook for the prefixed version - // followed by the unprefixed version - hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; - - // Check if we're setting a value - if ( value !== undefined ) { - type = typeof value; - - // convert relative number strings (+= or -=) to relative numbers. #7345 - if ( type === "string" && (ret = rrelNum.exec( value )) ) { - value = ( ret[1] + 1 ) * ret[2] + parseFloat( jQuery.css( elem, name ) ); - // Fixes bug #9237 - type = "number"; - } - - // Make sure that NaN and null values aren't set. See: #7116 - if ( value == null || type === "number" && isNaN( value ) ) { - return; - } - - // If a number was passed in, add 'px' to the (except for certain CSS properties) - if ( type === "number" && !jQuery.cssNumber[ origName ] ) { - value += "px"; - } - - // Fixes #8908, it can be done more correctly by specifing setters in cssHooks, - // but it would mean to define eight (for every problematic property) identical functions - if ( !jQuery.support.clearCloneStyle && value === "" && name.indexOf("background") === 0 ) { - style[ name ] = "inherit"; - } - - // If a hook was provided, use that value, otherwise just set the specified value - if ( !hooks || !("set" in hooks) || (value = hooks.set( elem, value, extra )) !== undefined ) { - - // Wrapped to prevent IE from throwing errors when 'invalid' values are provided - // Fixes bug #5509 - try { - style[ name ] = value; - } catch(e) {} - } - - } else { - // If a hook was provided get the non-computed value from there - if ( hooks && "get" in hooks && (ret = hooks.get( elem, false, extra )) !== undefined ) { - return ret; - } - - // Otherwise just get the value from the style object - return style[ name ]; - } - }, - - css: function( elem, name, extra, styles ) { - var num, val, hooks, - origName = jQuery.camelCase( name ); - - // Make sure that we're working with the right name - name = jQuery.cssProps[ origName ] || ( jQuery.cssProps[ origName ] = vendorPropName( elem.style, origName ) ); - - // gets hook for the prefixed version - // followed by the unprefixed version - hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; - - // If a hook was provided get the computed value from there - if ( hooks && "get" in hooks ) { - val = hooks.get( elem, true, extra ); - } - - // Otherwise, if a way to get the computed value exists, use that - if ( val === undefined ) { - val = curCSS( elem, name, styles ); - } - - //convert "normal" to computed value - if ( val === "normal" && name in cssNormalTransform ) { - val = cssNormalTransform[ name ]; - } - - // Return, converting to number if forced or a qualifier was provided and val looks numeric - if ( extra === "" || extra ) { - num = parseFloat( val ); - return extra === true || jQuery.isNumeric( num ) ? num || 0 : val; - } - return val; - } -}); - -// NOTE: we've included the "window" in window.getComputedStyle -// because jsdom on node.js will break without it. -if ( window.getComputedStyle ) { - getStyles = function( elem ) { - return window.getComputedStyle( elem, null ); - }; - - curCSS = function( elem, name, _computed ) { - var width, minWidth, maxWidth, - computed = _computed || getStyles( elem ), - - // getPropertyValue is only needed for .css('filter') in IE9, see #12537 - ret = computed ? computed.getPropertyValue( name ) || computed[ name ] : undefined, - style = elem.style; - - if ( computed ) { - - if ( ret === "" && !jQuery.contains( elem.ownerDocument, elem ) ) { - ret = jQuery.style( elem, name ); - } - - // A tribute to the "awesome hack by Dean Edwards" - // Chrome < 17 and Safari 5.0 uses "computed value" instead of "used value" for margin-right - // Safari 5.1.7 (at least) returns percentage for a larger set of values, but width seems to be reliably pixels - // this is against the CSSOM draft spec: http://dev.w3.org/csswg/cssom/#resolved-values - if ( rnumnonpx.test( ret ) && rmargin.test( name ) ) { - - // Remember the original values - width = style.width; - minWidth = style.minWidth; - maxWidth = style.maxWidth; - - // Put in the new values to get a computed value out - style.minWidth = style.maxWidth = style.width = ret; - ret = computed.width; - - // Revert the changed values - style.width = width; - style.minWidth = minWidth; - style.maxWidth = maxWidth; - } - } - - return ret; - }; -} else if ( document.documentElement.currentStyle ) { - getStyles = function( elem ) { - return elem.currentStyle; - }; - - curCSS = function( elem, name, _computed ) { - var left, rs, rsLeft, - computed = _computed || getStyles( elem ), - ret = computed ? computed[ name ] : undefined, - style = elem.style; - - // Avoid setting ret to empty string here - // so we don't default to auto - if ( ret == null && style && style[ name ] ) { - ret = style[ name ]; - } - - // From the awesome hack by Dean Edwards - // http://erik.eae.net/archives/2007/07/27/18.54.15/#comment-102291 - - // If we're not dealing with a regular pixel number - // but a number that has a weird ending, we need to convert it to pixels - // but not position css attributes, as those are proportional to the parent element instead - // and we can't measure the parent instead because it might trigger a "stacking dolls" problem - if ( rnumnonpx.test( ret ) && !rposition.test( name ) ) { - - // Remember the original values - left = style.left; - rs = elem.runtimeStyle; - rsLeft = rs && rs.left; - - // Put in the new values to get a computed value out - if ( rsLeft ) { - rs.left = elem.currentStyle.left; - } - style.left = name === "fontSize" ? "1em" : ret; - ret = style.pixelLeft + "px"; - - // Revert the changed values - style.left = left; - if ( rsLeft ) { - rs.left = rsLeft; - } - } - - return ret === "" ? "auto" : ret; - }; -} - -function setPositiveNumber( elem, value, subtract ) { - var matches = rnumsplit.exec( value ); - return matches ? - // Guard against undefined "subtract", e.g., when used as in cssHooks - Math.max( 0, matches[ 1 ] - ( subtract || 0 ) ) + ( matches[ 2 ] || "px" ) : - value; -} - -function augmentWidthOrHeight( elem, name, extra, isBorderBox, styles ) { - var i = extra === ( isBorderBox ? "border" : "content" ) ? - // If we already have the right measurement, avoid augmentation - 4 : - // Otherwise initialize for horizontal or vertical properties - name === "width" ? 1 : 0, - - val = 0; - - for ( ; i < 4; i += 2 ) { - // both box models exclude margin, so add it if we want it - if ( extra === "margin" ) { - val += jQuery.css( elem, extra + cssExpand[ i ], true, styles ); - } - - if ( isBorderBox ) { - // border-box includes padding, so remove it if we want content - if ( extra === "content" ) { - val -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); - } - - // at this point, extra isn't border nor margin, so remove border - if ( extra !== "margin" ) { - val -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); - } - } else { - // at this point, extra isn't content, so add padding - val += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); - - // at this point, extra isn't content nor padding, so add border - if ( extra !== "padding" ) { - val += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); - } - } - } - - return val; -} - -function getWidthOrHeight( elem, name, extra ) { - - // Start with offset property, which is equivalent to the border-box value - var valueIsBorderBox = true, - val = name === "width" ? elem.offsetWidth : elem.offsetHeight, - styles = getStyles( elem ), - isBorderBox = jQuery.support.boxSizing && jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; - - // some non-html elements return undefined for offsetWidth, so check for null/undefined - // svg - https://bugzilla.mozilla.org/show_bug.cgi?id=649285 - // MathML - https://bugzilla.mozilla.org/show_bug.cgi?id=491668 - if ( val <= 0 || val == null ) { - // Fall back to computed then uncomputed css if necessary - val = curCSS( elem, name, styles ); - if ( val < 0 || val == null ) { - val = elem.style[ name ]; - } - - // Computed unit is not pixels. Stop here and return. - if ( rnumnonpx.test(val) ) { - return val; - } - - // we need the check for style in case a browser which returns unreliable values - // for getComputedStyle silently falls back to the reliable elem.style - valueIsBorderBox = isBorderBox && ( jQuery.support.boxSizingReliable || val === elem.style[ name ] ); - - // Normalize "", auto, and prepare for extra - val = parseFloat( val ) || 0; - } - - // use the active box-sizing model to add/subtract irrelevant styles - return ( val + - augmentWidthOrHeight( - elem, - name, - extra || ( isBorderBox ? "border" : "content" ), - valueIsBorderBox, - styles - ) - ) + "px"; -} - -// Try to determine the default display value of an element -function css_defaultDisplay( nodeName ) { - var doc = document, - display = elemdisplay[ nodeName ]; - - if ( !display ) { - display = actualDisplay( nodeName, doc ); - - // If the simple way fails, read from inside an iframe - if ( display === "none" || !display ) { - // Use the already-created iframe if possible - iframe = ( iframe || - jQuery("