[shark] 01/14: Add debmake debianization.
Ghislain Vaillant
ghisvail-guest at moszumanska.debian.org
Thu Nov 26 15:38:23 UTC 2015
This is an automated email from the git hooks/post-receive script.
ghisvail-guest pushed a commit to branch debian/sid
in repository shark.
commit d7222ed05e79ef5e23e3139da7ae1df65b4b83dd
Author: Ghislain Antony Vaillant <ghisvail at gmail.com>
Date: Mon Nov 23 13:20:29 2015 +0000
Add debmake debianization.
---
debian/README.Debian | 8 +
debian/changelog | 6 +
debian/compat | 1 +
debian/control | 43 +
debian/copyright | 2278 +++++++++++++++++++++++++++++++++++++++++++
debian/libshark-dev.install | 1 +
debian/libshark-doc.install | 1 +
debian/libshark0.install | 1 +
debian/rules | 16 +
debian/source/format | 1 +
10 files changed, 2356 insertions(+)
diff --git a/debian/README.Debian b/debian/README.Debian
new file mode 100644
index 0000000..f63290c
--- /dev/null
+++ b/debian/README.Debian
@@ -0,0 +1,8 @@
+shark for Debian
+
+Please edit this to provide information specific to
+this shark Debian package.
+
+ (Automatically generated by debmake Version 4.2.2)
+
+ -- Ghislain Antony Vaillant <ghisvail at gmail.com> Fri, 20 Nov 2015 17:18:10 +0000
diff --git a/debian/changelog b/debian/changelog
new file mode 100644
index 0000000..735e163
--- /dev/null
+++ b/debian/changelog
@@ -0,0 +1,6 @@
+shark (3.0.0+ds1-1) UNRELEASED; urgency=low
+
+ * Initial release. Closes: #nnnn
+ <nnnn is the bug number of your ITP>
+
+ -- Ghislain Antony Vaillant <ghisvail at gmail.com> Fri, 20 Nov 2015 17:18:10 +0000
diff --git a/debian/compat b/debian/compat
new file mode 100644
index 0000000..ec63514
--- /dev/null
+++ b/debian/compat
@@ -0,0 +1 @@
+9
diff --git a/debian/control b/debian/control
new file mode 100644
index 0000000..d93527e
--- /dev/null
+++ b/debian/control
@@ -0,0 +1,43 @@
+Source: shark
+Section: unknown
+Priority: extra
+Maintainer: Ghislain Antony Vaillant <ghisvail at gmail.com>
+Build-Depends: cmake, debhelper (>=9)
+Standards-Version: 3.9.6
+Homepage: <insert the upstream URL, if relevant>
+
+Package: libshark-dev
+Section: libdevel
+Architecture: any
+Multi-Arch: same
+Depends: libshark0 (= ${binary:Version}), ${misc:Depends}
+Description: auto-generated package by debmake: dev
+ This package contains the development files.
+ .
+ This Debian binary package was auto-generated by the
+ debmake(1) command provided by the debmake package.
+
+Package: libshark-doc
+Section: doc
+Architecture: all
+Multi-Arch: foreign
+Depends: ${misc:Depends}
+Description: auto-generated package by debmake: doc
+ This package contains the documentation files.
+
+Package: libshark0
+Section: libs
+Architecture: any
+Multi-Arch: same
+Pre-Depends: ${misc:Pre-Depends}
+Depends: ${misc:Depends}, ${shlibs:Depends}
+Description: auto-generated package by debmake: lib
+ This package contains the shared library.
+
+Package: libshark0-dbg
+Section: debug
+Architecture: any
+Multi-Arch: same
+Depends: libshark0 (= ${binary:Version}), ${misc:Depends}
+Description: auto-generated package by debmake: dbg
+ This package contains the debugging symbols.
diff --git a/debian/copyright b/debian/copyright
new file mode 100644
index 0000000..d32619c
--- /dev/null
+++ b/debian/copyright
@@ -0,0 +1,2278 @@
+Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
+Upstream-Name: shark
+Source: <url://example.com>
+
+Files: Test/Algorithms/JaakkolaHeuristic.cpp
+ Test/Algorithms/KMeans.cpp
+ Test/Algorithms/Trainers/Budgeted/AbstractBudgetMaintenanceStrategy_Test.cpp
+ Test/Algorithms/Trainers/Budgeted/KernelBudgetedSGDTrainer_Test.cpp
+ Test/Algorithms/Trainers/Budgeted/MergeBudgetMaintenanceStrategy_Test.cpp
+ Test/Algorithms/Trainers/Budgeted/RemoveBudgetMaintenanceStrategy_Test.cpp
+ Test/Algorithms/Trainers/CSvmTrainer.cpp
+ Test/Algorithms/Trainers/EpsilonSvmTrainer.cpp
+ Test/Algorithms/Trainers/LinearSvmTrainer.cpp
+ Test/Algorithms/Trainers/McSvmTrainer.cpp
+ Test/Algorithms/Trainers/NBClassifierTrainerTests.cpp
+ Test/Algorithms/Trainers/OneClassSvmTrainer.cpp
+ Test/Algorithms/Trainers/PCA.cpp
+ Test/Algorithms/Trainers/RegularizationNetworkTrainer.cpp
+ Test/Algorithms/nearestneighbors.cpp
+ Test/Data/LabelOrder_Test.cpp
+ Test/LinAlg/PartlyPrecomputedMatrix.cpp
+ Test/Models/CARTClassifier.cpp
+ Test/Models/Kernels/CSvmDerivative.cpp
+ Test/Models/Kernels/KernelExpansion.cpp
+ Test/Models/Kernels/KernelHelpers.cpp
+ Test/Models/Kernels/KernelNearestNeighborClassifier.cpp
+ Test/Models/Kernels/KernelNearestNeighborRegression.cpp
+ Test/Models/NBClassifierTests.cpp
+ Test/Models/NearestNeighborRegression.cpp
+ Test/Models/OneVersusOneClassifier.cpp
+ Test/Models/RFClassifier.cpp
+ Test/Models/SoftNearestNeighborClassifier.cpp
+ Test/ObjectiveFunctions/AUC.cpp
+ Test/ObjectiveFunctions/AbsoluteLoss.cpp
+ Test/ObjectiveFunctions/CrossValidation.cpp
+ Test/ObjectiveFunctions/KernelBasisDistance.cpp
+ Test/ObjectiveFunctions/KernelTargetAlignment.cpp
+ Test/ObjectiveFunctions/LooError.cpp
+ Test/ObjectiveFunctions/LooErrorCSvm.cpp
+ Test/ObjectiveFunctions/NegativeGaussianProcessEvidence.cpp
+ Test/ObjectiveFunctions/RadiusMarginQuotient.cpp
+ Test/ObjectiveFunctions/SvmLogisticInterpretation.cpp
+ doc/tools/tut2rst.cpp
+ doc/tutToRst/tut2rst.cpp
+ examples/Data/Datasets.tpp
+ examples/Data/Import.tpp
+ examples/Data/Normalization.tpp
+ examples/Data/Subsets.tpp
+ examples/EA/MOO/MOCMAExperiment.tpp
+ examples/EA/SOO/Archive.tpp
+ examples/EA/SOO/CMAExperiment.tpp
+ examples/EA/SOO/CMAPlot.tpp
+ examples/ExampleProject/HelloWorld.cpp
+ examples/Statistics/Statistics.tpp
+ examples/Supervised/CARTTutorial.tpp
+ examples/Supervised/KNNCrossValidationTutorial.tpp
+ examples/Supervised/KNNTutorial.tpp
+ examples/Supervised/KernelRegression.tpp
+ examples/Supervised/LDATutorial.tpp
+ examples/Supervised/LassoRegression.tpp
+ examples/Supervised/OneVersusOne.tpp
+ examples/Supervised/RFTutorial.tpp
+ examples/Supervised/kNN.tpp
+ examples/Supervised/linearRegressionTutorial.tpp
+ examples/Unsupervised/HierarchicalClustering.tpp
+ examples/Unsupervised/KMeansTutorial.tpp
+ examples/Unsupervised/OneClassSvm.tpp
+ examples/Unsupervised/PCATutorial.tpp
+ include/shark/Algorithms/AbstractMultiObjectiveOptimizer.h
+ include/shark/Algorithms/AbstractOptimizer.h
+ include/shark/Algorithms/AbstractSingleObjectiveOptimizer.h
+ include/shark/Algorithms/DirectSearch/CMA.h
+ include/shark/Algorithms/DirectSearch/CMA/Chromosome.h
+ include/shark/Algorithms/DirectSearch/ElitistCMA.h
+ include/shark/Algorithms/DirectSearch/FitnessExtractor.h
+ include/shark/Algorithms/DirectSearch/GridSearch.h
+ include/shark/Algorithms/DirectSearch/HypervolumeApproximator.h
+ include/shark/Algorithms/DirectSearch/HypervolumeCalculator.h
+ include/shark/Algorithms/DirectSearch/Indicators/AdditiveEpsilonIndicator.h
+ include/shark/Algorithms/DirectSearch/Indicators/HypervolumeIndicator.h
+ include/shark/Algorithms/DirectSearch/Indicators/InvertedGenerationalDistance.h
+ include/shark/Algorithms/DirectSearch/Indicators/LeastContributorApproximator.h
+ include/shark/Algorithms/DirectSearch/Indicators/MultiplicativeEpsilonIndicator.h
+ include/shark/Algorithms/DirectSearch/Individual.h
+ include/shark/Algorithms/DirectSearch/LMCMA.h
+ include/shark/Algorithms/DirectSearch/MOCMA.h
+ include/shark/Algorithms/DirectSearch/Operators/Mutation/BitflipMutator.h
+ include/shark/Algorithms/DirectSearch/Operators/Mutation/PolynomialMutation.h
+ include/shark/Algorithms/DirectSearch/Operators/PopulationBasedStepSizeAdaptation.h
+ include/shark/Algorithms/DirectSearch/Operators/Recombination/OnePointCrossover.h
+ include/shark/Algorithms/DirectSearch/Operators/Recombination/SimulatedBinaryCrossover.h
+ include/shark/Algorithms/DirectSearch/Operators/Recombination/UniformCrossover.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/EPTournamentSelection.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/ElitistSelection.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/IndicatorBasedSelection.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/LinearRanking.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/RouletteWheelSelection.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/TournamentSelection.h
+ include/shark/Algorithms/DirectSearch/Operators/Selection/UniformRanking.h
+ include/shark/Algorithms/DirectSearch/Operators/TwoPointStepSizeAdaptation.h
+ include/shark/Algorithms/DirectSearch/ParetoDominanceComparator.h
+ include/shark/Algorithms/DirectSearch/RealCodedNSGAII.h
+ include/shark/Algorithms/DirectSearch/SMS-EMOA.h
+ include/shark/Algorithms/DirectSearch/SimplexDownhill.h
+ include/shark/Algorithms/DirectSearch/SteadyStateMOCMA.h
+ include/shark/Algorithms/DirectSearch/VDCMA.h
+ include/shark/Algorithms/GradientDescent/AbstractLineSearchOptimizer.h
+ include/shark/Algorithms/GradientDescent/BFGS.h
+ include/shark/Algorithms/GradientDescent/CG.h
+ include/shark/Algorithms/GradientDescent/LBFGS.h
+ include/shark/Algorithms/GradientDescent/LineSearch.h
+ include/shark/Algorithms/GradientDescent/Rprop.h
+ include/shark/Algorithms/GradientDescent/SteepestDescent.h
+ include/shark/Algorithms/GradientDescent/TrustRegionNewton.h
+ include/shark/Algorithms/JaakkolaHeuristic.h
+ include/shark/Algorithms/KMeans.h
+ include/shark/Algorithms/NearestNeighbors/AbstractNearestNeighbors.h
+ include/shark/Algorithms/NearestNeighbors/SimpleNearestNeighbors.h
+ include/shark/Algorithms/NearestNeighbors/TreeNearestNeighbors.h
+ include/shark/Algorithms/Pegasos.h
+ include/shark/Algorithms/QP/BoxConstrainedProblems.h
+ include/shark/Algorithms/QP/Impl/AnalyticProblems.h
+ include/shark/Algorithms/QP/QpBoxLinear.h
+ include/shark/Algorithms/QP/QpMcBoxDecomp.h
+ include/shark/Algorithms/QP/QpMcDecomp.h
+ include/shark/Algorithms/QP/QpMcLinear.h
+ include/shark/Algorithms/QP/QpMcSimplexDecomp.h
+ include/shark/Algorithms/QP/QpSolver.h
+ include/shark/Algorithms/QP/QpSparseArray.h
+ include/shark/Algorithms/QP/SvmProblems.h
+ include/shark/Algorithms/StoppingCriteria/AbstractStoppingCriterion.h
+ include/shark/Algorithms/StoppingCriteria/GeneralizationLoss.h
+ include/shark/Algorithms/StoppingCriteria/GeneralizationQuotient.h
+ include/shark/Algorithms/StoppingCriteria/MaxIterations.h
+ include/shark/Algorithms/StoppingCriteria/TrainingError.h
+ include/shark/Algorithms/StoppingCriteria/TrainingProgress.h
+ include/shark/Algorithms/StoppingCriteria/ValidatedStoppingCriterion.h
+ include/shark/Algorithms/Trainers/AbstractSvmTrainer.h
+ include/shark/Algorithms/Trainers/AbstractTrainer.h
+ include/shark/Algorithms/Trainers/AbstractWeightedTrainer.h
+ include/shark/Algorithms/Trainers/Budgeted/AbstractBudgetMaintenanceStrategy.h
+ include/shark/Algorithms/Trainers/Budgeted/KernelBudgetedSGDTrainer.h
+ include/shark/Algorithms/Trainers/Budgeted/MergeBudgetMaintenanceStrategy.h
+ include/shark/Algorithms/Trainers/Budgeted/ProjectBudgetMaintenanceStrategy.h
+ include/shark/Algorithms/Trainers/Budgeted/RemoveBudgetMaintenanceStrategy.h
+ include/shark/Algorithms/Trainers/CARTTrainer.h
+ include/shark/Algorithms/Trainers/CSvmTrainer.h
+ include/shark/Algorithms/Trainers/Distribution/DistTrainerContainer.h
+ include/shark/Algorithms/Trainers/Distribution/GenericDistTrainer.h
+ include/shark/Algorithms/Trainers/Distribution/NormalTrainer.h
+ include/shark/Algorithms/Trainers/EpsilonSvmTrainer.h
+ include/shark/Algorithms/Trainers/FisherLDA.h
+ include/shark/Algorithms/Trainers/KernelMeanClassifier.h
+ include/shark/Algorithms/Trainers/KernelSGDTrainer.h
+ include/shark/Algorithms/Trainers/LDA.h
+ include/shark/Algorithms/Trainers/LassoRegression.h
+ include/shark/Algorithms/Trainers/LinearRegression.h
+ include/shark/Algorithms/Trainers/McReinforcedSvmTrainer.h
+ include/shark/Algorithms/Trainers/McSvmADMTrainer.h
+ include/shark/Algorithms/Trainers/McSvmATMTrainer.h
+ include/shark/Algorithms/Trainers/McSvmATSTrainer.h
+ include/shark/Algorithms/Trainers/McSvmCSTrainer.h
+ include/shark/Algorithms/Trainers/McSvmLLWTrainer.h
+ include/shark/Algorithms/Trainers/McSvmMMRTrainer.h
+ include/shark/Algorithms/Trainers/McSvmOVATrainer.h
+ include/shark/Algorithms/Trainers/McSvmWWTrainer.h
+ include/shark/Algorithms/Trainers/MissingFeatureSvmTrainer.h
+ include/shark/Algorithms/Trainers/NBClassifierTrainer.h
+ include/shark/Algorithms/Trainers/NormalizeComponentsUnitInterval.h
+ include/shark/Algorithms/Trainers/NormalizeComponentsUnitVariance.h
+ include/shark/Algorithms/Trainers/NormalizeComponentsWhitening.h
+ include/shark/Algorithms/Trainers/NormalizeComponentsZCA.h
+ include/shark/Algorithms/Trainers/NormalizeKernelUnitVariance.h
+ include/shark/Algorithms/Trainers/OneClassSvmTrainer.h
+ include/shark/Algorithms/Trainers/OptimizationTrainer.h
+ include/shark/Algorithms/Trainers/PCA.h
+ include/shark/Algorithms/Trainers/Perceptron.h
+ include/shark/Algorithms/Trainers/RFTrainer.h
+ include/shark/Algorithms/Trainers/RegularizationNetworkTrainer.h
+ include/shark/Algorithms/Trainers/SigmoidFit.h
+ include/shark/Core/DLLSupport.h
+ include/shark/Core/Exception.h
+ include/shark/Core/Flags.h
+ include/shark/Core/INameable.h
+ include/shark/Core/IParameterizable.h
+ include/shark/Core/ISerializable.h
+ include/shark/Core/Math.h
+ include/shark/Core/OpenMP.h
+ include/shark/Core/ResultSets.h
+ include/shark/Core/State.h
+ include/shark/Core/Timer.h
+ include/shark/Core/Traits/ProxyReferenceTraits.h
+ include/shark/Core/utility/CanBeCalled.h
+ include/shark/Core/utility/Iterators.h
+ include/shark/Core/utility/KeyValuePair.h
+ include/shark/Core/utility/Range.h
+ include/shark/Core/utility/ScopedHandle.h
+ include/shark/Core/utility/ZipPair.h
+ include/shark/Core/utility/functional.h
+ include/shark/Data/BatchInterface.h
+ include/shark/Data/BatchInterfaceAdaptStruct.h
+ include/shark/Data/CVDatasetTools.h
+ include/shark/Data/Csv.h
+ include/shark/Data/DataDistribution.h
+ include/shark/Data/DataView.h
+ include/shark/Data/Dataset.h
+ include/shark/Data/ExportKernelMatrix.h
+ include/shark/Data/HDF5.h
+ include/shark/Data/Impl/BoostFusion151DefineStructInl.hpp
+ include/shark/Data/Impl/BoostFusionCopy.hpp
+ include/shark/Data/LabelOrder.h
+ include/shark/Data/Libsvm.h
+ include/shark/Data/Pgm.h
+ include/shark/Data/SparseData.h
+ include/shark/Data/Statistics.h
+ include/shark/Data/WeightedDataset.h
+ include/shark/LinAlg/BLAS/blas.h
+ include/shark/LinAlg/BLAS/detail/traits.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/dot.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/gemm.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/gemv.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/potrf.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/tpmv.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/trmm.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/trmv.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/trsm.hpp
+ include/shark/LinAlg/BLAS/kernels/atlas/trsv.hpp
+ include/shark/LinAlg/BLAS/kernels/default/dot.hpp
+ include/shark/LinAlg/BLAS/kernels/default/gemm.hpp
+ include/shark/LinAlg/BLAS/kernels/default/gemv.hpp
+ include/shark/LinAlg/BLAS/kernels/default/potrf.hpp
+ include/shark/LinAlg/BLAS/kernels/default/syev.hpp
+ include/shark/LinAlg/BLAS/kernels/default/tpmv.hpp
+ include/shark/LinAlg/BLAS/kernels/default/trmm.hpp
+ include/shark/LinAlg/BLAS/kernels/default/trmv.hpp
+ include/shark/LinAlg/BLAS/kernels/default/trsm.hpp
+ include/shark/LinAlg/BLAS/kernels/default/trsv.hpp
+ include/shark/LinAlg/BLAS/kernels/dot.hpp
+ include/shark/LinAlg/BLAS/kernels/gemm.hpp
+ include/shark/LinAlg/BLAS/kernels/gemv.hpp
+ include/shark/LinAlg/BLAS/kernels/gotoblas/gemm.h
+ include/shark/LinAlg/BLAS/kernels/gotoblas/gemv.h
+ include/shark/LinAlg/BLAS/kernels/gotoblas/syrk.h
+ include/shark/LinAlg/BLAS/kernels/gotoblas/trsm.h
+ include/shark/LinAlg/BLAS/kernels/gotoblas/trsv.h
+ include/shark/LinAlg/BLAS/kernels/lapack/syev.hpp
+ include/shark/LinAlg/BLAS/kernels/potrf.hpp
+ include/shark/LinAlg/BLAS/kernels/syev.hpp
+ include/shark/LinAlg/BLAS/kernels/tpmv.hpp
+ include/shark/LinAlg/BLAS/kernels/traits.hpp
+ include/shark/LinAlg/BLAS/kernels/trmm.hpp
+ include/shark/LinAlg/BLAS/kernels/trmv.hpp
+ include/shark/LinAlg/BLAS/kernels/trsm.hpp
+ include/shark/LinAlg/BLAS/kernels/trsv.hpp
+ include/shark/LinAlg/BLAS/matrix_proxy.hpp
+ include/shark/LinAlg/BLAS/vector_proxy.hpp
+ include/shark/LinAlg/Base.h
+ include/shark/LinAlg/BlockMatrix2x2.h
+ include/shark/LinAlg/CachedMatrix.h
+ include/shark/LinAlg/Cholesky.h
+ include/shark/LinAlg/ExampleModifiedKernelMatrix.h
+ include/shark/LinAlg/GaussianKernelMatrix.h
+ include/shark/LinAlg/Impl/Initialize.h
+ include/shark/LinAlg/Initialize.h
+ include/shark/LinAlg/KernelMatrix.h
+ include/shark/LinAlg/LRUCache.h
+ include/shark/LinAlg/Metrics.h
+ include/shark/LinAlg/ModifiedKernelMatrix.h
+ include/shark/LinAlg/PartlyPrecomputedMatrix.h
+ include/shark/LinAlg/PrecomputedMatrix.h
+ include/shark/LinAlg/RQ.h
+ include/shark/LinAlg/RegularizedKernelMatrix.h
+ include/shark/LinAlg/Tools.h
+ include/shark/LinAlg/eigenvalues.h
+ include/shark/LinAlg/rotations.h
+ include/shark/LinAlg/solveSystem.h
+ include/shark/LinAlg/solveTriangular.h
+ include/shark/LinAlg/svd.h
+ include/shark/Models/AbstractModel.h
+ include/shark/Models/Autoencoder.h
+ include/shark/Models/CMAC.h
+ include/shark/Models/Clustering/AbstractClustering.h
+ include/shark/Models/Clustering/Centroids.h
+ include/shark/Models/Clustering/ClusteringModel.h
+ include/shark/Models/Clustering/HardClusteringModel.h
+ include/shark/Models/Clustering/HierarchicalClustering.h
+ include/shark/Models/Clustering/SoftClusteringModel.h
+ include/shark/Models/ConcatenatedModel.h
+ include/shark/Models/Converter.h
+ include/shark/Models/ConvexCombination.h
+ include/shark/Models/FFNet.h
+ include/shark/Models/GaussianNoiseModel.h
+ include/shark/Models/Impl/Neurons.h
+ include/shark/Models/ImpulseNoiseModel.h
+ include/shark/Models/Kernels/AbstractKernelFunction.h
+ include/shark/Models/Kernels/AbstractMetric.h
+ include/shark/Models/Kernels/ArdKernel.h
+ include/shark/Models/Kernels/CSvmDerivative.h
+ include/shark/Models/Kernels/DiscreteKernel.h
+ include/shark/Models/Kernels/EvalSkipMissingFeatures.h
+ include/shark/Models/Kernels/GaussianRbfKernel.h
+ include/shark/Models/Kernels/Impl/MklKernelBase.h
+ include/shark/Models/Kernels/KernelExpansion.h
+ include/shark/Models/Kernels/LinearKernel.h
+ include/shark/Models/Kernels/MissingFeaturesKernelExpansion.h
+ include/shark/Models/Kernels/MklKernel.h
+ include/shark/Models/Kernels/ModelKernel.h
+ include/shark/Models/Kernels/MonomialKernel.h
+ include/shark/Models/Kernels/MultiTaskKernel.h
+ include/shark/Models/Kernels/NormalizedKernel.h
+ include/shark/Models/Kernels/PolynomialKernel.h
+ include/shark/Models/Kernels/ProductKernel.h
+ include/shark/Models/Kernels/ScaledKernel.h
+ include/shark/Models/Kernels/SubrangeKernel.h
+ include/shark/Models/Kernels/WeightedSumKernel.h
+ include/shark/Models/LinearModel.h
+ include/shark/Models/MeanModel.h
+ include/shark/Models/NBClassifier.h
+ include/shark/Models/NearestNeighborClassifier.h
+ include/shark/Models/NearestNeighborRegression.h
+ include/shark/Models/Neurons.h
+ include/shark/Models/Normalizer.h
+ include/shark/Models/OneVersusOneClassifier.h
+ include/shark/Models/OnlineRNNet.h
+ include/shark/Models/RBFLayer.h
+ include/shark/Models/RNNet.h
+ include/shark/Models/SoftNearestNeighborClassifier.h
+ include/shark/Models/Softmax.h
+ include/shark/Models/TiedAutoencoder.h
+ include/shark/Models/Trees/BinaryTree.h
+ include/shark/Models/Trees/CARTClassifier.h
+ include/shark/Models/Trees/KDTree.h
+ include/shark/Models/Trees/KHCTree.h
+ include/shark/Models/Trees/LCTree.h
+ include/shark/Models/Trees/RFClassifier.h
+ include/shark/ObjectiveFunctions/AbstractConstraintHandler.h
+ include/shark/ObjectiveFunctions/AbstractCost.h
+ include/shark/ObjectiveFunctions/Benchmarks/Benchmarks.h
+ include/shark/ObjectiveFunctions/Benchmarks/CIGTAB1.h
+ include/shark/ObjectiveFunctions/Benchmarks/CIGTAB2.h
+ include/shark/ObjectiveFunctions/Benchmarks/CigarDiscus.h
+ include/shark/ObjectiveFunctions/Benchmarks/ConstrainedSphere.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ1.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ2.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ3.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ4.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ5.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ6.h
+ include/shark/ObjectiveFunctions/Benchmarks/DTLZ7.h
+ include/shark/ObjectiveFunctions/Benchmarks/DiffPowers.h
+ include/shark/ObjectiveFunctions/Benchmarks/Discus.h
+ include/shark/ObjectiveFunctions/Benchmarks/ELLI1.h
+ include/shark/ObjectiveFunctions/Benchmarks/ELLI2.h
+ include/shark/ObjectiveFunctions/Benchmarks/Ellipsoid.h
+ include/shark/ObjectiveFunctions/Benchmarks/Fonseca.h
+ include/shark/ObjectiveFunctions/Benchmarks/Himmelblau.h
+ include/shark/ObjectiveFunctions/Benchmarks/IHR1.h
+ include/shark/ObjectiveFunctions/Benchmarks/IHR2.h
+ include/shark/ObjectiveFunctions/Benchmarks/IHR3.h
+ include/shark/ObjectiveFunctions/Benchmarks/IHR4.h
+ include/shark/ObjectiveFunctions/Benchmarks/IHR6.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ1.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ2.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ3.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ4.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ5.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ6.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ7.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ8.h
+ include/shark/ObjectiveFunctions/Benchmarks/LZ9.h
+ include/shark/ObjectiveFunctions/Benchmarks/Rosenbrock.h
+ include/shark/ObjectiveFunctions/Benchmarks/RotatedErrorFunction.h
+ include/shark/ObjectiveFunctions/Benchmarks/Schwefel.h
+ include/shark/ObjectiveFunctions/Benchmarks/Sphere.h
+ include/shark/ObjectiveFunctions/Benchmarks/ZDT1.h
+ include/shark/ObjectiveFunctions/Benchmarks/ZDT2.h
+ include/shark/ObjectiveFunctions/Benchmarks/ZDT3.h
+ include/shark/ObjectiveFunctions/Benchmarks/ZDT4.h
+ include/shark/ObjectiveFunctions/Benchmarks/ZDT6.h
+ include/shark/ObjectiveFunctions/BoxConstraintHandler.h
+ include/shark/ObjectiveFunctions/CombinedObjectiveFunction.h
+ include/shark/ObjectiveFunctions/ErrorFunction.h
+ include/shark/ObjectiveFunctions/Impl/FunctionWrapperBase.h
+ include/shark/ObjectiveFunctions/KernelBasisDistance.h
+ include/shark/ObjectiveFunctions/KernelTargetAlignment.h
+ include/shark/ObjectiveFunctions/LooError.h
+ include/shark/ObjectiveFunctions/LooErrorCSvm.h
+ include/shark/ObjectiveFunctions/Loss/AbsoluteLoss.h
+ include/shark/ObjectiveFunctions/Loss/AbstractLoss.h
+ include/shark/ObjectiveFunctions/Loss/CrossEntropy.h
+ include/shark/ObjectiveFunctions/Loss/CrossEntropyIndependent.h
+ include/shark/ObjectiveFunctions/Loss/DiscreteLoss.h
+ include/shark/ObjectiveFunctions/Loss/EpsilonHingeLoss.h
+ include/shark/ObjectiveFunctions/Loss/HingeLoss.h
+ include/shark/ObjectiveFunctions/Loss/HuberLoss.h
+ include/shark/ObjectiveFunctions/Loss/SquaredEpsilonHingeLoss.h
+ include/shark/ObjectiveFunctions/Loss/SquaredHingeLoss.h
+ include/shark/ObjectiveFunctions/Loss/SquaredLoss.h
+ include/shark/ObjectiveFunctions/Loss/TukeyBiweightLoss.h
+ include/shark/ObjectiveFunctions/Loss/ZeroOneLoss.h
+ include/shark/ObjectiveFunctions/NegativeAUC.h
+ include/shark/ObjectiveFunctions/NegativeLogLikelihood.h
+ include/shark/ObjectiveFunctions/NoisyErrorFunction.h
+ include/shark/ObjectiveFunctions/ROC.h
+ include/shark/ObjectiveFunctions/RadiusMarginQuotient.h
+ include/shark/ObjectiveFunctions/Regularizer.h
+ include/shark/ObjectiveFunctions/SparseAutoencoderError.h
+ include/shark/ObjectiveFunctions/SvmLogisticInterpretation.h
+ include/shark/Rng/AbstractDistribution.h
+ include/shark/Rng/Bernoulli.h
+ include/shark/Rng/Binomial.h
+ include/shark/Rng/Cauchy.h
+ include/shark/Rng/DiffGeometric.h
+ include/shark/Rng/Dirichlet.h
+ include/shark/Rng/DiscreteUniform.h
+ include/shark/Rng/Entropy.h
+ include/shark/Rng/Erlang.h
+ include/shark/Rng/Gamma.h
+ include/shark/Rng/Geometric.h
+ include/shark/Rng/GlobalRng.h
+ include/shark/Rng/HyperGeometric.h
+ include/shark/Rng/KullbackLeiberDivergence.h
+ include/shark/Rng/LogNormal.h
+ include/shark/Rng/NegExponential.h
+ include/shark/Rng/Normal.h
+ include/shark/Rng/Poisson.h
+ include/shark/Rng/Rng.h
+ include/shark/Rng/TruncatedExponential.h
+ include/shark/Rng/Uniform.h
+ include/shark/Rng/Weibull.h
+ include/shark/Statistics/Distributions/MultiNomialDistribution.h
+ include/shark/Statistics/Distributions/MultiVariateNormalDistribution.h
+ include/shark/Statistics/Statistics.h
+ include/shark/Unsupervised/RBM/BinaryRBM.h
+ include/shark/Unsupervised/RBM/BipolarRBM.h
+ include/shark/Unsupervised/RBM/ConvolutionalBinaryRBM.h
+ include/shark/Unsupervised/RBM/ConvolutionalRBM.h
+ include/shark/Unsupervised/RBM/Energy.h
+ include/shark/Unsupervised/RBM/GaussianBinaryRBM.h
+ include/shark/Unsupervised/RBM/GradientApproximations/ContrastiveDivergence.h
+ include/shark/Unsupervised/RBM/GradientApproximations/ExactGradient.h
+ include/shark/Unsupervised/RBM/GradientApproximations/Impl/DataEvaluator.h
+ include/shark/Unsupervised/RBM/GradientApproximations/MultiChainApproximator.h
+ include/shark/Unsupervised/RBM/GradientApproximations/SingleChainApproximator.h
+ include/shark/Unsupervised/RBM/Impl/analytics.h
+ include/shark/Unsupervised/RBM/Neuronlayers/BinaryLayer.h
+ include/shark/Unsupervised/RBM/Neuronlayers/GaussianLayer.h
+ include/shark/Unsupervised/RBM/Neuronlayers/TruncatedExponentialLayer.h
+ include/shark/Unsupervised/RBM/RBM.h
+ include/shark/Unsupervised/RBM/Sampling/EnergyStoringTemperedMarkovChain.h
+ include/shark/Unsupervised/RBM/Sampling/GibbsOperator.h
+ include/shark/Unsupervised/RBM/Sampling/Impl/SampleTypes.h
+ include/shark/Unsupervised/RBM/Sampling/MarkovChain.h
+ include/shark/Unsupervised/RBM/Sampling/TemperedMarkovChain.h
+ include/shark/Unsupervised/RBM/StateSpaces/RealSpace.h
+ include/shark/Unsupervised/RBM/StateSpaces/TwoStateSpace.h
+ include/shark/Unsupervised/RBM/Tags.h
+ include/shark/Unsupervised/RBM/TruncExpBinaryRBM.h
+ include/shark/Unsupervised/RBM/analytics.h
+ src/Algorithms/DirectSearch/CMA.cpp
+ src/Algorithms/DirectSearch/CMSA.cpp
+ src/Algorithms/DirectSearch/ElitistCMA.cpp
+ src/Algorithms/FisherLDA.cpp
+ src/Algorithms/GradientDescent/AbstractLineSearchOptimizer.cpp
+ src/Algorithms/GradientDescent/BFGS.cpp
+ src/Algorithms/GradientDescent/CG.cpp
+ src/Algorithms/GradientDescent/LBFGS.cpp
+ src/Algorithms/GradientDescent/Rprop.cpp
+ src/Algorithms/GradientDescent/TrustRegionNewton.cpp
+ src/Algorithms/KMeans.cpp
+ src/Algorithms/LDA.cpp
+ src/Algorithms/LinearRegression.cpp
+ src/Algorithms/PCA.cpp
+ src/Algorithms/RFTrainer.cpp
+ src/Algorithms/SigmoidFit.cpp
+ src/Core/Version.cpp
+ src/Data/Csv.cpp
+ src/Data/SparseData.cpp
+ src/Models/CMAC.cpp
+ src/Models/Centroids.cpp
+ src/Models/Converter.cpp
+ src/Models/LinearNorm.cpp
+ src/Models/RBFLayer.cpp
+ src/Models/RNNet.cpp
+ src/Models/RecurrentStructure.cpp
+ src/Models/SigmoidModel.cpp
+ src/Models/Softmax.cpp
+ src/ObjectiveFunctions/DiscreteLoss.cpp
+ src/ObjectiveFunctions/KernelBasisDistance.cpp
+ src/ObjectiveFunctions/ROC.cpp
+Copyright: 1995-2015 Shark Development Team
+ 1998-2008 Institut für Neuroinformatik \date -
+License: LGPL-3.0+
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: .gitignore
+ CMakeLists.txt
+ CTestConfig.cmake
+ README.txt
+ SharkConfig.cmake.in
+ SharkConfigVersion.cmake.in
+ Test/Algorithms/DirectSearch/CMA.cpp
+ Test/Algorithms/DirectSearch/CMSA.cpp
+ Test/Algorithms/DirectSearch/ElitistCMA.cpp
+ Test/Algorithms/DirectSearch/FastNonDominatedSort.cpp
+ Test/Algorithms/DirectSearch/Indicators/HypervolumeIndicator.cpp
+ Test/Algorithms/DirectSearch/MOCMA.cpp
+ Test/Algorithms/DirectSearch/Operators/Mutation/BitflipMutation.cpp
+ Test/Algorithms/DirectSearch/Operators/PenalizingEvaluator.cpp
+ Test/Algorithms/DirectSearch/Operators/Selection/IndicatorBasedSelection.cpp
+ Test/Algorithms/DirectSearch/Operators/Selection/Selection.cpp
+ Test/Algorithms/DirectSearch/ParetoDominanceComparator.cpp
+ Test/Algorithms/DirectSearch/RealCodedNSGAII.cpp
+ Test/Algorithms/DirectSearch/SimplexDownhill.cpp
+ Test/Algorithms/DirectSearch/SteadyStateMOCMA.cpp
+ Test/Algorithms/DirectSearch/VDCMA.cpp
+ Test/Algorithms/GradientDescent/BFGS.cpp
+ Test/Algorithms/GradientDescent/CG.cpp
+ Test/Algorithms/GradientDescent/LBFGS.cpp
+ Test/Algorithms/GradientDescent/LineSearch.cpp
+ Test/Algorithms/GradientDescent/NoisyRprop.cpp
+ Test/Algorithms/GradientDescent/Rprop.cpp
+ Test/Algorithms/GradientDescent/SteepestDescent.cpp
+ Test/Algorithms/GradientDescent/TrustRegionNewton.cpp
+ Test/Algorithms/GridSearch.cpp
+ Test/Algorithms/Hypervolume.cpp
+ Test/Algorithms/LP/LinearProgram.cpp
+ Test/Algorithms/Trainers/FisherLDA.cpp
+ Test/Algorithms/Trainers/KernelMeanClassifier.cpp
+ Test/Algorithms/Trainers/KernelNormalization.cpp
+ Test/Algorithms/Trainers/LDA.cpp
+ Test/Algorithms/Trainers/LinearRegression.cpp
+ Test/Algorithms/Trainers/MissingFeatureSvmTrainerTests.cpp
+ Test/Algorithms/Trainers/Normalization.cpp
+ Test/Algorithms/Trainers/Perceptron.cpp
+ Test/Algorithms/Trainers/SigmoidFit.cpp
+ Test/Algorithms/testFunction.h
+ Test/CMakeLists.txt
+ Test/Core/Iterators.cpp
+ Test/Core/Math.cpp
+ Test/Core/ScopedHandleTests.cpp
+ Test/Data/Bootstrap.cpp
+ Test/Data/CVDatasetTools.cpp
+ Test/Data/Csv.cpp
+ Test/Data/DataView.cpp
+ Test/Data/Dataset.cpp
+ Test/Data/ExportKernelMatrix.cpp
+ Test/Data/HDF5Tests.cpp
+ Test/Data/SparseData.cpp
+ Test/Data/Statistics.cpp
+ Test/EALib/SchwefelEllipsoidCMA.cpp
+ Test/EALib/SchwefelEllipsoidCMSA.cpp
+ Test/EALib/SchwefelEllipsoidElitistCMA.cpp
+ Test/EALib/paraboloidCMA.cpp
+ Test/EALib/paraboloidCMSA.cpp
+ Test/EALib/paraboloidElitistCMA.cpp
+ Test/LinAlg/BLAS/axpy_prod.cpp
+ Test/LinAlg/BLAS/compressed_matrix.cpp
+ Test/LinAlg/BLAS/compressed_vector.cpp
+ Test/LinAlg/BLAS/iterators.cpp
+ Test/LinAlg/BLAS/matrix_assign.cpp
+ Test/LinAlg/BLAS/matrix_proxy.cpp
+ Test/LinAlg/BLAS/transformations.cpp
+ Test/LinAlg/BLAS/triangular_matrix.cpp
+ Test/LinAlg/BLAS/triangular_prod.cpp
+ Test/LinAlg/BLAS/vector_assign.cpp
+ Test/LinAlg/BLAS/vector_expression.cpp
+ Test/LinAlg/BLAS/vector_proxy.cpp
+ Test/LinAlg/DiagonalMatrix.cpp
+ Test/LinAlg/Initialize.cpp
+ Test/LinAlg/KernelMatrix.cpp
+ Test/LinAlg/LRUCache.cpp
+ Test/LinAlg/Metrics.cpp
+ Test/LinAlg/Proxy.cpp
+ Test/LinAlg/RQ.cpp
+ Test/LinAlg/choleskyDecomposition.cpp
+ Test/LinAlg/eigensymm.cpp
+ Test/LinAlg/permute.cpp
+ Test/LinAlg/repeat.cpp
+ Test/LinAlg/rotations.cpp
+ Test/LinAlg/solve.cpp
+ Test/LinAlg/sumRows.cpp
+ Test/LinAlg/svd.cpp
+ Test/Models/Autoencoder.cpp
+ Test/Models/CMAC.cpp
+ Test/Models/ConcatenatedModel.cpp
+ Test/Models/ConvexCombination.cpp
+ Test/Models/FFNet.cpp
+ Test/Models/Kernels/ArdKernel.cpp
+ Test/Models/Kernels/DiscreteKernel.cpp
+ Test/Models/Kernels/EvalSkipMissingFeaturesTests.cpp
+ Test/Models/Kernels/GaussianRbfKernel.cpp
+ Test/Models/Kernels/KernelDerivativeTestHelper.h
+ Test/Models/Kernels/LinearKernel.cpp
+ Test/Models/Kernels/MissingFeaturesKernelExpansionTests.cpp
+ Test/Models/Kernels/MklKernel.cpp
+ Test/Models/Kernels/ModelKernel.cpp
+ Test/Models/Kernels/MonomialKernel.cpp
+ Test/Models/Kernels/MultiTaskKernel.cpp
+ Test/Models/Kernels/NormalizedKernel.cpp
+ Test/Models/Kernels/PolynomialKernel.cpp
+ Test/Models/Kernels/ProductKernel.cpp
+ Test/Models/Kernels/ScaledKernel.cpp
+ Test/Models/Kernels/SubrangeKernel.cpp
+ Test/Models/Kernels/WeightedSumKernel.cpp
+ Test/Models/LinearModel.cpp
+ Test/Models/LinearNorm.cpp
+ Test/Models/MeanModel.cpp
+ Test/Models/OnlineRNNet.cpp
+ Test/Models/RBFLayer.cpp
+ Test/Models/RNNet.cpp
+ Test/Models/SigmoidModel.cpp
+ Test/Models/Softmax.cpp
+ Test/Models/TiedAutoencoder.cpp
+ Test/Models/derivativeTestHelper.h
+ Test/Network/HttpClient.cpp
+ Test/Network/HttpServer.cpp
+ Test/ObjectiveFunctions/Benchmarks.cpp
+ Test/ObjectiveFunctions/BoxConstraintHandler.cpp
+ Test/ObjectiveFunctions/CrossEntropy.cpp
+ Test/ObjectiveFunctions/EpsilonHingeLoss.cpp
+ Test/ObjectiveFunctions/ErrorFunction.cpp
+ Test/ObjectiveFunctions/HingeLoss.cpp
+ Test/ObjectiveFunctions/HuberLoss.cpp
+ Test/ObjectiveFunctions/NegativeLogLikelihood.cpp
+ Test/ObjectiveFunctions/NoisyErrorFunction.cpp
+ Test/ObjectiveFunctions/SparseAutoencoderError.cpp
+ Test/ObjectiveFunctions/SquaredEpsilonHingeLoss.cpp
+ Test/ObjectiveFunctions/SquaredHingeLoss.cpp
+ Test/ObjectiveFunctions/SquaredLoss.cpp
+ Test/ObjectiveFunctions/TestLoss.h
+ Test/ObjectiveFunctions/TestObjectiveFunction.h
+ Test/ObjectiveFunctions/TukeyBiweightLoss.cpp
+ Test/RBM/Analytics.cpp
+ Test/RBM/AverageEnergyGradient.cpp
+ Test/RBM/BinaryLayer.cpp
+ Test/RBM/BipolarLayer.cpp
+ Test/RBM/ContrastiveDivergence.cpp
+ Test/RBM/ContrastiveDivergenceTraining.cpp
+ Test/RBM/ConvolutionalCDTraining.cpp
+ Test/RBM/ConvolutionalEnergyGradient.cpp
+ Test/RBM/ConvolutionalPTTraining.cpp
+ Test/RBM/ConvolutionalRBMBasic.cpp
+ Test/RBM/Energy.cpp
+ Test/RBM/ExactGradient.cpp
+ Test/RBM/ExactGradientTraining.cpp
+ Test/RBM/GaussianLayer.cpp
+ Test/RBM/GibbsOperator.cpp
+ Test/RBM/MarkovChain.cpp
+ Test/RBM/PCDTraining.cpp
+ Test/RBM/ParallelTemperingTraining.cpp
+ Test/RBM/TemperedMarkovChain.cpp
+ Test/RBM/TruncatedExponentialLayer.cpp
+ Test/Rng/MultiNomial.cpp
+ Test/Rng/MultiVariateNormal.cpp
+ Test/Rng/Rng.cpp
+ Test/Utils.h
+ UseShark.cmake
+ cmake_uninstall.cmake.in
+ doc/CMakeLists.txt
+ doc/LinkChecker.cpp
+ doc/README.txt
+ doc/Shark.dox.in
+ doc/doxygen_pages/css/besser.css
+ doc/mlstyle.js
+ doc/sphinx_pages/Makefile
+ doc/sphinx_pages/cimath.sty
+ doc/sphinx_pages/conf.py.in
+ doc/sphinx_pages/index.rst
+ doc/sphinx_pages/ini_custom_themes/mt_ini_gryphon/static/mt_sphinx_deriv.css_t
+ doc/sphinx_pages/ini_custom_themes/mt_ini_gryphon/theme.conf
+ doc/sphinx_pages/rest_sources/about_shark/copyright.rst
+ doc/sphinx_pages/rest_sources/about_shark/news.rst
+ doc/sphinx_pages/rest_sources/about_shark/todo.rst
+ doc/sphinx_pages/rest_sources/downloads/downloads.rst
+ doc/sphinx_pages/rest_sources/faq/faq.rst
+ doc/sphinx_pages/rest_sources/getting_started/installation.rst
+ doc/sphinx_pages/rest_sources/getting_started/troubleshooting.rst
+ doc/sphinx_pages/rest_sources/getting_started/using_the_documentation.rst
+ doc/sphinx_pages/rest_sources/quickref/data_qr.rst
+ doc/sphinx_pages/rest_sources/quickref/quickref.rst
+ doc/sphinx_pages/rest_sources/showroom/showroom.rst
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/LASSO.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/MOOExperiment.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/autoencoders.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/binary_rbm.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/cart.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/cma.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/deep_denoising_autoencoder_network.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/denoising_autoencoders.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/extreme_learning_machine.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/ffnet.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/kernelBudgetedSGD.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/kmeans.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/kta.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/lda.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/linear-svm.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/linearRegression.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/lkc-mkl.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/mocma.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/nearestNeighbor.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/pca.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/quadratic_programs.rst
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/rbm_module.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/rf.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/sparse_ae.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/svm.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/svmLikelihoodModelSelection.tut
+ doc/sphinx_pages/rest_sources/tutorials/algorithms/svmModelSelection.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/data/dataset_subsets.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/data/datasets.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/data/import_data.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/data/labels.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/data/normalization.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/batches.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/designgoals.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/kernels.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/losses.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/models.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/objective_functions.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/optimizers.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/stopping_criteria.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/trainers.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/writing_kernels.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/library_design/writing_objective_functions.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/lin_alg/lapack.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/lin_alg/vector_matrix.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/misc/random_numbers.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/misc/serialization.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/misc/statistics.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/misc/statistics.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/misc/versatile_classification.tut
+ doc/sphinx_pages/rest_sources/tutorials/concepts/optimization/conventions_derivatives.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/optimization/directsearch.rst
+ doc/sphinx_pages/rest_sources/tutorials/concepts/optimization/optimizationtrainer.rst
+ doc/sphinx_pages/rest_sources/tutorials/first_steps/general_optimization_tasks.tut
+ doc/sphinx_pages/rest_sources/tutorials/first_steps/hello_shark.tut
+ doc/sphinx_pages/rest_sources/tutorials/first_steps/shark_layout.rst
+ doc/sphinx_pages/rest_sources/tutorials/first_steps/when_to_stop.tut
+ doc/sphinx_pages/rest_sources/tutorials/first_steps/your_programs.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/codingconvention.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/development_environment.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/effective_ublas.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/issuing_a_release.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/managing_the_documentation.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/the_build_system.rst
+ doc/sphinx_pages/rest_sources/tutorials/for_developers/writing_tutorials.rst
+ doc/sphinx_pages/rest_sources/tutorials/tutorials.rst
+ doc/sphinx_pages/static/mt_sphinx_shark.css
+ doc/sphinx_pages/templates/layout.html
+ doc/sphinx_pages/templates/mt_localtoc.html
+ doc/sphinx_pages/templates/mt_relations.html
+ doc/sphinx_pages/templates/mt_searchbox.html
+ doc/sphinx_pages/templates/mt_sourcelink.html
+ doc/tools/Makefile
+ doc/tutToRst/CMakeLists.txt
+ examples/CMakeLists.txt
+ examples/EA/MOO/AGE2Main.tpp
+ examples/EA/MOO/AdditiveEpsilonIndicatorMain.tpp
+ examples/EA/MOO/ApproximatedHypervolumeMain.tpp
+ examples/EA/MOO/BoundingBoxCalculatorMain.tpp
+ examples/EA/MOO/ExactHypervolumeMain.tpp
+ examples/EA/MOO/MOCMASimple.tpp
+ examples/EA/MOO/SteadyStateMOCMAMain.tpp
+ examples/EA/SOO/AckleyES.tpp
+ examples/EA/SOO/CMASimple.tpp
+ examples/EA/SOO/ElitistCMASimple.tpp
+ examples/EA/SOO/TSP.tpp
+ examples/ExampleProject/CMakeLists.txt
+ examples/Statistics/RandomNumbers.tpp
+ examples/Supervised/CSvmGridSearchTutorial.tpp
+ examples/Supervised/CSvmLinear.tpp
+ examples/Supervised/CSvmMaxLikelihoodMS.tpp
+ examples/Supervised/CSvmTutorial.tpp
+ examples/Supervised/CVFolds.tpp
+ examples/Supervised/DeepNetworkTraining.tpp
+ examples/Supervised/DeepNetworkTrainingRBM.tpp
+ examples/Supervised/FFNNBasicTutorial.tpp
+ examples/Supervised/FFNNMultiClassCrossEntropy.tpp
+ examples/Supervised/KTA-tutorial.tpp
+ examples/Supervised/KernelBudgetedSGDTutorial.tpp
+ examples/Supervised/KernelLogisticRegression.tpp
+ examples/Supervised/KernelSelection.tpp
+ examples/Supervised/Makefile
+ examples/Supervised/McSvm.tpp
+ examples/Supervised/McSvmLinear.tpp
+ examples/Supervised/MklKernelTutorial.tpp
+ examples/Supervised/MultiTaskSvm.tpp
+ examples/Supervised/StoppingCriteria.tpp
+ examples/Supervised/SubrangeKernelTutorial.tpp
+ examples/Supervised/VersatileClassificationTutorial-LDA.tpp
+ examples/Supervised/VersatileClassificationTutorial-NN.tpp
+ examples/Supervised/VersatileClassificationTutorial-Network.tpp
+ examples/Supervised/VersatileClassificationTutorial-RF.tpp
+ examples/Supervised/VersatileClassificationTutorial-SVM.tpp
+ examples/Supervised/data/C.csv
+ examples/Supervised/data/diabetes.csv
+ examples/Supervised/data/quickstartData.csv
+ examples/Supervised/data/regressionInputs.csv
+ examples/Supervised/data/regressionLabels.csv
+ examples/Supervised/elmTutorial.tpp
+ examples/Supervised/quickstartTutorial.tpp
+ examples/Supervised/regressionTutorial.tpp
+ examples/Unsupervised/AutoEncoderTutorial.tpp
+ examples/Unsupervised/BinaryRBM.tpp
+ examples/Unsupervised/DenoisingAutoencoderTutorial.tpp
+ examples/Unsupervised/MaxLogLikelihood.tpp
+ examples/Unsupervised/PCA.tpp
+ examples/Unsupervised/SparseAETutorial.tpp
+ examples/Unsupervised/data/faithful.csv
+ examples/createExampleSource.cmake
+ include/CMakeLists.txt
+ include/shark/Algorithms/DirectSearch/CMA/CMAIndividual.h
+ include/shark/Algorithms/DirectSearch/FastNonDominatedSort.h
+ include/shark/Algorithms/DirectSearch/Grid.h
+ include/shark/Algorithms/DirectSearch/Operators/Evaluation/PenalizingEvaluator.h
+ include/shark/Data/Impl/CVDatasetTools.inl
+ include/shark/Data/Impl/Statistics.inl
+ include/shark/LinAlg/BLAS/detail/functional.hpp
+ include/shark/LinAlg/BLAS/detail/iterator.hpp
+ include/shark/LinAlg/BLAS/expression_types.hpp
+ include/shark/LinAlg/BLAS/fwd.hpp
+ include/shark/LinAlg/BLAS/io.hpp
+ include/shark/LinAlg/BLAS/kernels/gotoblas/cblas_inc.h
+ include/shark/LinAlg/BLAS/kernels/matrix_assign.hpp
+ include/shark/LinAlg/BLAS/kernels/vector_assign.hpp
+ include/shark/LinAlg/BLAS/lu.hpp
+ include/shark/LinAlg/BLAS/matrix.hpp
+ include/shark/LinAlg/BLAS/matrix_expression.hpp
+ include/shark/LinAlg/BLAS/matrix_set.hpp
+ include/shark/LinAlg/BLAS/matrix_sparse.hpp
+ include/shark/LinAlg/BLAS/operation.hpp
+ include/shark/LinAlg/BLAS/permutation.hpp
+ include/shark/LinAlg/BLAS/triangular_matrix.hpp
+ include/shark/LinAlg/BLAS/vector.hpp
+ include/shark/LinAlg/BLAS/vector_expression.hpp
+ include/shark/LinAlg/BLAS/vector_sparse.hpp
+ include/shark/Models/Kernels/KernelHelpers.h
+ include/shark/Models/LinearClassifier.h
+ include/shark/Models/LinearNorm.h
+ include/shark/Models/SigmoidModel.h
+ include/shark/ObjectiveFunctions/AbstractObjectiveFunction.h
+ include/shark/ObjectiveFunctions/Benchmarks/Ackley.h
+ include/shark/ObjectiveFunctions/Benchmarks/Cigar.h
+ include/shark/ObjectiveFunctions/Benchmarks/GSP.h
+ include/shark/ObjectiveFunctions/CrossValidationError.h
+ include/shark/ObjectiveFunctions/EvaluationArchive.h
+ include/shark/ObjectiveFunctions/NegativeGaussianProcessEvidence.h
+ include/shark/Statistics/Tests/WilcoxonRankSumTest.h
+ include/shark/Unsupervised/RBM/Impl/AverageEnergyGradient.h
+ include/shark/Unsupervised/RBM/Impl/ConvolutionalEnergyGradient.h
+ include/shark/Unsupervised/RBM/Problems/BarsAndStripes.h
+ include/shark/Unsupervised/RBM/Problems/DistantModes.h
+ include/shark/Unsupervised/RBM/Problems/MNIST.h
+ include/shark/Unsupervised/RBM/Problems/Shifter.h
+ makeastyle
+ src/Algorithms/CARTTrainer.cpp
+ src/CMakeLists.txt
+Copyright: %} {%- if hasdoc('copyright') %}
+ Copyright 2007-2011 by the Sphinx team, see AUTHORS. :license: BSD, see LICENSE for details.
+ __NO_COPYRIGHT_NOR_LICENSE__
+License: __UNKNOWN__
+
+Files: doc/sphinx_pages/static/text_files/test.txt
+ include/shark/Algorithms/GradientDescent/Impl/dlinmin.inl
+ include/shark/Algorithms/GradientDescent/Impl/wolfecubic.inl
+ include/shark/LinAlg/Impl/pivotingRQ.inl
+ include/shark/LinAlg/Impl/solveSystem.inl
+ include/shark/LinAlg/Impl/solveTriangular.inl
+ include/shark/LinAlg/Impl/svd.inl
+ include/shark/Models/Impl/LinearModel.inl
+Copyright: 1998-2000 Institut für Neuroinformatik<BR> Ruhr-Universität Bochum<BR> D-44780 Bochum, Germany<BR> Phone: +49-234-32-25558<BR> Fax: +49-234-32-14209<BR> eMail: shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR> <BR>
+ 1998-2000 Institut für Neuroinformatik<BR> Ruhr-Universität Bochum<BR> searchDirection-44780 Bochum, Germany<BR> Phone: +49-234-32-25558<BR> Fax: +49-234-32-14209<BR> eMail: shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR> <BR>
+ 1998-2007 Institut für Neuroinformatik<BR> Ruhr-Universität Bochum<BR> D-44780 Bochum, Germany<BR> Phone: +49-234-32-25558<BR> Fax: +49-234-32-14209<BR> eMail: Shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR> <BR>
+ 1999-2011 Institut für Neuroinformatik<BR> Ruhr-Universität Bochum<BR> D-44780 Bochum, Germany<BR> Phone: +49-234-32-27974<BR> Fax: +49-234-32-14209<BR> eMail: Shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR>
+License: GPL-3.0+
+ <BR><HR>
+ This file is part of Shark. This library is free software;
+ you can redistribute it and/or modify it under the terms of the
+ GNU General Public License as published by the Free Software
+ Foundation; either version 3, or (at your option) any later version.
+ .
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+ .
+ You should have received a copy of the GNU General Public License
+ along with this library; if not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ Version 3 can be found in `/usr/share/common-licenses/GPL-3'.
+
+Files: include/shark/Data/Impl/Dataset.inl
+ include/shark/LinAlg/Impl/Cholesky.inl
+ include/shark/LinAlg/Impl/eigensymm.inl
+ include/shark/ObjectiveFunctions/Impl/ErrorFunction.inl
+ include/shark/ObjectiveFunctions/Impl/NoisyErrorFunction.inl
+ include/shark/ObjectiveFunctions/Impl/SparseAutoencoderError.inl
+ include/shark/Unsupervised/RBM/Neuronlayers/BipolarLayer.h
+Copyright: (L) 1999-2001: Institut für Neuroinformatik<BR> Ruhr-Universität Bochum<BR> D-44780 Bochum, Germany<BR> Phone: +49-234-32-25558<BR> Fax: +49-234-32-14209<BR> eMail: Shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR> <BR>
+ __NO_COPYRIGHT__
+License: GPL-3.0+
+ This file is part of Shark. This library is free software;
+ you can redistribute it and/or modify it under the terms of the
+ GNU General Public License as published by the Free Software
+ Foundation; either version 3, or (at your option) any later version.
+ .
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+ .
+ You should have received a copy of the GNU General Public License
+ along with this library; if not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ Version 3 can be found in `/usr/share/common-licenses/GPL-3'.
+
+Files: include/shark/ObjectiveFunctions/Benchmarks/GruauPole.h
+ include/shark/ObjectiveFunctions/Benchmarks/MarkovPole.h
+ include/shark/ObjectiveFunctions/Benchmarks/NonMarkovPole.h
+ include/shark/ObjectiveFunctions/Benchmarks/PoleSimulators/DoublePole.h
+ include/shark/ObjectiveFunctions/Benchmarks/PoleSimulators/SinglePole.h
+Copyright: 1995-2015 Shark Development Team
+License: LGPL-3.0+
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: doc/tools/correctTestSuiteNames.py
+ doc/tools/removeFileTag.py
+ doc/tools/replaceHeaders.py
+Copyright: 1995-2015 Shark Development Team
+License: LGPL-3.0+
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http:#www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/Algorithms/DirectSearch/CMSA.h
+ src/Models/OnlineRNNet.cpp
+Copyright: 1998-2008 Institut für Neuroinformatik
+License: LGPL-3.0+
+ \author -
+ \date -
+ .
+ .
+ \par Copyright 1995-2015 Shark Development Team
+ .
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/Core/utility/Impl/boost_iterator_facade_fixed.hpp
+Copyright: 2002 David Abrahams
+ 2002 Jeremy Siek
+ 2002 Thomas Witt
+License: BSL-1.0
+ Distributed under the Boost Software License, Version 1.0. (See
+
+Files: include/shark/Core/Shark.h.in
+Copyright: 2007-2011 Institut für Neuroinformatik<BR> Ruhr-Universität Bochum<BR> D-44780 Bochum, Germany<BR> Phone: +49-234-32-25558<BR> Fax: +49-234-32-14209<BR> eMail: Shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR>
+License: GPL-3.0+
+ <BR><HR>
+ This library is free software;
+ you can redistribute it and/or modify it under the terms of the
+ GNU General Public License as published by the Free Software
+ Foundation; either version 3, or (at your option) any later version.
+ .
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+ .
+ You should have received a copy of the GNU General Public License
+ along with this library; if not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ Version 3 can be found in `/usr/share/common-licenses/GPL-3'.
+
+Files: doc/header_template.txt
+Copyright: 1995-2015 Shark Development Team
+License: LGPL-3.0+
+ <BR><HR>
+ This file is part of Shark.
+ <%HOMEPAGE%/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/LinAlg/BLAS/kernels/lapack/fortran.hpp
+Copyright: 1995-2015 Shark Development Team
+License: LGPL-3.0+
+ This is based on boost::numeric::bindings, written by Toon Knapen and Kresimir Fresl
+ .
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/LinAlg/BLAS/kernels/atlas/cblas_inc.hpp
+Copyright: 1995-2015 Shark Development Team
+License: LGPL-3.0+
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ .
+ .
+ .
+ .
+ Copyright (c) Kresimir Fresl 2002
+ .
+ Distributed under the Boost Software License, Version 1.0.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/Algorithms/QP/QuadraticProgram.h
+Copyright: returning the matrix size.
+License: LGPL-3.0+
+ \par
+ This interface is required by the template class CachedMatrix,
+ which provides a cache mechanism for restricted matrix rows, as it
+ is used by various quadratic program solvers within the library.
+ The PrecomputedMatrix provides a sometimes faster but more memory
+ intensive alternative to CachedMatrix.
+ .
+ .
+ .
+ .
+ \author T. Glasmachers
+ \date 2007-2012
+ .
+ .
+ \par Copyright 1995-2015 Shark Development Team
+ .
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/LinAlg/BLAS/detail/returntype_deduction.hpp
+Copyright: 1995-2015 Shark Development Team
+License: LGPL-3.0+
+ <BR><HR>
+ This file is part of Shark.
+ <http://image.diku.dk/shark/>
+ .
+ Shark is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ Shark is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public License
+ along with Shark. If not, see <http://www.gnu.org/licenses/>.
+ .
+ .
+ .
+ .
+ Copyright (c) 2001-2003 Joel de Guzman
+ .
+ Use, modification and distribution is subject to the Boost Software
+ .
+ On Debian systems, the complete text of the GNU Lesser General Public License
+ Version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+Files: include/shark/Models/RecurrentStructure.h
+Copyright: 1999-2001 ! Institut für Neuroinformatik<BR> ! Ruhr-Universität Bochum<BR> ! D-44780 Bochum, Germany<BR> ! Phone: +49-234-32-27974<BR> ! Fax: +49-234-32-14209<BR> ! eMail: Shark-admin at neuroinformatik.ruhr-uni-bochum.de<BR> ! www: http://www.neuroinformatik.ruhr-uni-bochum.de<BR> ! ! ! ! <BR><HR>
+License: __UNKNOWN__
+ ! This file is part of Shark. This library is free software;
+ ! you can redistribute it and/or modify it under the terms of the
+ ! GNU General Public License as published by the Free Software
+ ! Foundation; either version 3, or (at your option) any later version.
+ !
+ ! This library is distributed in the hope that it will be useful,
+ ! but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ! MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ ! GNU General Public License for more details.
+ !
+ ! You should have received a copy of the GNU General Public License
+ ! along with this library; if not, see <http://www.gnu.org/licenses/>.
+
+Files: COPYING.LESSER
+Copyright: 2007 Free Software Foundation, Inc.
+License: __TOO_LONG_TYPE3__
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+ .
+ .
+ This version of the GNU Lesser General Public License incorporates
+ the terms and conditions of version 3 of the GNU General Public
+ License, supplemented by the additional permissions listed below.
+ .
+ 0. Additional Definitions.
+ .
+ As used herein, "this License" refers to version 3 of the GNU Lesser
+ General Public License, and the "GNU GPL" refers to version 3 of the GNU
+ General Public License.
+ .
+ "The Library" refers to a covered work governed by this License,
+ other than an Application or a Combined Work as defined below.
+ .
+ An "Application" is any work that makes use of an interface provided
+ by the Library, but which is not otherwise based on the Library.
+ Defining a subclass of a class defined by the Library is deemed a mode
+ of using an interface provided by the Library.
+ .
+ A "Combined Work" is a work produced by combining or linking an
+ Application with the Library. The particular version of the Library
+ with which the Combined Work was made is also called the "Linked
+ Version".
+ .
+ The "Minimal Corresponding Source" for a Combined Work means the
+ Corresponding Source for the Combined Work, excluding any source code
+ for portions of the Combined Work that, considered in isolation, are
+ based on the Application, and not on the Linked Version.
+ .
+ The "Corresponding Application Code" for a Combined Work means the
+ object code and/or source code for the Application, including any data
+ and utility programs needed for reproducing the Combined Work from the
+ Application, but excluding the System Libraries of the Combined Work.
+ .
+ 1. Exception to Section 3 of the GNU GPL.
+ .
+ You may convey a covered work under sections 3 and 4 of this License
+ without being bound by section 3 of the GNU GPL.
+ .
+ 2. Conveying Modified Versions.
+ .
+ If you modify a copy of the Library, and, in your modifications, a
+ facility refers to a function or data to be supplied by an Application
+ that uses the facility (other than as an argument passed when the
+ facility is invoked), then you may convey a copy of the modified
+ version:
+ .
+ a) under this License, provided that you make a good faith effort to
+ ensure that, in the event an Application does not supply the
+ function or data, the facility still operates, and performs
+ whatever part of its purpose remains meaningful, or
+ .
+ b) under the GNU GPL, with none of the additional permissions of
+ this License applicable to that copy.
+ .
+ 3. Object Code Incorporating Material from Library Header Files.
+ .
+ The object code form of an Application may incorporate material from
+ a header file that is part of the Library. You may convey such object
+ code under terms of your choice, provided that, if the incorporated
+ material is not limited to numerical parameters, data structure
+ layouts and accessors, or small macros, inline functions and templates
+ (ten or fewer lines in length), you do both of the following:
+ .
+ a) Give prominent notice with each copy of the object code that the
+ Library is used in it and that the Library and its use are
+ covered by this License.
+ .
+ b) Accompany the object code with a copy of the GNU GPL and this license
+ document.
+ .
+ 4. Combined Works.
+ .
+ You may convey a Combined Work under terms of your choice that,
+ taken together, effectively do not restrict modification of the
+ portions of the Library contained in the Combined Work and reverse
+ engineering for debugging such modifications, if you also do each of
+ the following:
+ .
+ a) Give prominent notice with each copy of the Combined Work that
+ the Library is used in it and that the Library and its use are
+ covered by this License.
+ .
+ b) Accompany the Combined Work with a copy of the GNU GPL and this license
+ document.
+ .
+ c) For a Combined Work that displays copyright notices during
+ execution, include the copyright notice for the Library among
+ these notices, as well as a reference directing the user to the
+ copies of the GNU GPL and this license document.
+ .
+ d) Do one of the following:
+ .
+ 0) Convey the Minimal Corresponding Source under the terms of this
+ License, and the Corresponding Application Code in a form
+ suitable for, and under terms that permit, the user to
+ recombine or relink the Application with a modified version of
+ the Linked Version to produce a modified Combined Work, in the
+ manner specified by section 6 of the GNU GPL for conveying
+ Corresponding Source.
+ .
+ 1) Use a suitable shared library mechanism for linking with the
+ Library. A suitable mechanism is one that (a) uses at run time
+ a copy of the Library already present on the user's computer
+ system, and (b) will operate properly with a modified version
+ of the Library that is interface-compatible with the Linked
+ Version.
+ .
+ e) Provide Installation Information, but only if you would otherwise
+ be required to provide such information under section 6 of the
+ GNU GPL, and only to the extent that such information is
+ necessary to install and execute a modified version of the
+ Combined Work produced by recombining or relinking the
+ Application with a modified version of the Linked Version. (If
+ you use option 4d0, the Installation Information must accompany
+ the Minimal Corresponding Source and Corresponding Application
+ Code. If you use option 4d1, you must provide the Installation
+ Information in the manner specified by section 6 of the GNU GPL
+ for conveying Corresponding Source.)
+ .
+ 5. Combined Libraries.
+ .
+ You may place library facilities that are a work based on the
+ Library side by side in a single library together with other library
+ facilities that are not Applications and are not covered by this
+ License, and convey such a combined library under terms of your
+ choice, if you do both of the following:
+ .
+ a) Accompany the combined library with a copy of the same work based
+ on the Library, uncombined with any other library facilities,
+ conveyed under the terms of this License.
+ .
+ b) Give prominent notice with the combined library that part of it
+ is a work based on the Library, and explaining where to find the
+ accompanying uncombined form of the same work.
+ .
+ 6. Revised Versions of the GNU Lesser General Public License.
+ .
+ The Free Software Foundation may publish revised and/or new versions
+ of the GNU Lesser General Public License from time to time. Such new
+ versions will be similar in spirit to the present version, but may
+ differ in detail to address new problems or concerns.
+ .
+ Each version is given a distinguishing version number. If the
+ Library as you received it specifies that a certain numbered version
+ of the GNU Lesser General Public License "or any later version"
+ applies to it, you have the option of following the terms and
+ conditions either of that published version or of any later version
+ published by the Free Software Foundation. If the Library as you
+ received it does not specify a version number of the GNU Lesser
+ General Public License, you may choose any version of the GNU Lesser
+ General Public License ever published by the Free Software Foundation.
+ .
+ If the Library as you received it specifies that a proxy can decide
+ whether future versions of the GNU Lesser General Public License shall
+ apply, that proxy's public statement of acceptance of any version is
+ permanent authorization for you to choose that version for the
+ Library.
+
+#----------------------------------------------------------------------------
+# xml and html files (skipped):
+# doc/DoxygenLayout.xml
+# doc/index.html
+# doc/doxygen_pages/templates/header.html
+# doc/doxygen_pages/templates/footer.html
+# doc/sphinx_pages/rest_sources/tutorials/images/mocma_dtlz2.svg
+# doc/sphinx_pages/rest_sources/tutorials/images/cma_himmelblau.svg
+# doc/sphinx_pages/rest_sources/tutorials/images/cma_on_sphere.svg
+# doc/sphinx_pages/rest_sources/tutorials/images/cma_himmelblau_detailed.svg
+# doc/sphinx_pages/rest_sources/tutorials/images/MOOExperiment.svg
+# doc/sphinx_pages/rest_sources/tutorials/images/rbm_graph.svg
+
+#----------------------------------------------------------------------------
+# binary files (skipped):
+# Test/test_data/testfile_for_import.h5
+# doc/sharkWin.png
+# doc/download.png
+# doc/sharkUnix.png
+# doc/shark.png
+# doc/sphinx_pages/rest_sources/tutorials/images/shark_directory_structure.png
+# doc/sphinx_pages/rest_sources/tutorials/images/features.png
+# doc/sphinx_pages/rest_sources/tutorials/images/faces.png
+# doc/sphinx_pages/rest_sources/tutorials/images/clustering.png
+# doc/sphinx_pages/rest_sources/tutorials/images/facesMean.png
+# doc/sphinx_pages/rest_sources/tutorials/images/featuresDenoisingTiedAutoencoder.png
+# doc/sphinx_pages/rest_sources/tutorials/images/oldFaithful.jpg
+# doc/sphinx_pages/rest_sources/tutorials/images/featuresTiedAutoencoder.png
+# doc/sphinx_pages/rest_sources/tutorials/images/face0.png
+# doc/sphinx_pages/rest_sources/tutorials/images/featuresDropoutTiedAutoencoder.png
+# doc/sphinx_pages/rest_sources/tutorials/images/featuresDropoutAutoencoder.png
+# doc/sphinx_pages/rest_sources/tutorials/images/oldFaithfulData.png
+# doc/sphinx_pages/rest_sources/tutorials/images/linearRegression.png
+# doc/sphinx_pages/rest_sources/tutorials/images/reconstruction0.png
+# doc/sphinx_pages/rest_sources/tutorials/images/featuresAutoencoder.png
+# doc/sphinx_pages/rest_sources/tutorials/images/linearRegressionData.png
+# doc/sphinx_pages/rest_sources/tutorials/images/featuresDenoisingAutoencoder.png
+# doc/sphinx_pages/rest_sources/about_shark/images/lgplv3-147x51.png
+# doc/sphinx_pages/rest_sources/about_shark/downloads/development_plan_shark_project_igel.pdf
+# doc/sphinx_pages/ini_custom_themes/mt_ini_gryphon/static/navigation.png
+# doc/sphinx_pages/ini_custom_themes/mt_ini_gryphon/static/contents.png
+# doc/sphinx_pages/static/SharkLogo.png
+# doc/sphinx_pages/static/sphinx_sprites_aqua_box_bg.png
+# doc/sphinx_pages/static/icon_eject.png
+# doc/sphinx_pages/static/icon_backward.png
+# doc/sphinx_pages/static/xhtml_validation.png
+# doc/sphinx_pages/static/icon_forward.png
+# doc/sphinx_pages/static/sphinx_sprites_aqua.png
+# doc/sphinx_pages/static/css_validation.png
+# doc/sphinx_pages/static/shark16.ico
+# examples/Supervised/data/mnist_subset.zip
+
+#----------------------------------------------------------------------------
+# huge files (skipped):
+# examples/Unsupervised/data/images.csv
+
+#----------------------------------------------------------------------------
+# Files marked as NO_LICENSE_TEXT_FOUND may be covered by the following
+# license/copyright files.
+
+#----------------------------------------------------------------------------
+# License file: COPYING
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+ .
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+ .
+ Preamble
+ .
+ The GNU General Public License is a free, copyleft license for
+ software and other kinds of works.
+ .
+ The licenses for most software and other practical works are designed
+ to take away your freedom to share and change the works. By contrast,
+ the GNU General Public License is intended to guarantee your freedom to
+ share and change all versions of a program--to make sure it remains free
+ software for all its users. We, the Free Software Foundation, use the
+ GNU General Public License for most of our software; it applies also to
+ any other work released this way by its authors. You can apply it to
+ your programs, too.
+ .
+ When we speak of free software, we are referring to freedom, not
+ price. Our General Public Licenses are designed to make sure that you
+ have the freedom to distribute copies of free software (and charge for
+ them if you wish), that you receive source code or can get it if you
+ want it, that you can change the software or use pieces of it in new
+ free programs, and that you know you can do these things.
+ .
+ To protect your rights, we need to prevent others from denying you
+ these rights or asking you to surrender the rights. Therefore, you have
+ certain responsibilities if you distribute copies of the software, or if
+ you modify it: responsibilities to respect the freedom of others.
+ .
+ For example, if you distribute copies of such a program, whether
+ gratis or for a fee, you must pass on to the recipients the same
+ freedoms that you received. You must make sure that they, too, receive
+ or can get the source code. And you must show them these terms so they
+ know their rights.
+ .
+ Developers that use the GNU GPL protect your rights with two steps:
+ (1) assert copyright on the software, and (2) offer you this License
+ giving you legal permission to copy, distribute and/or modify it.
+ .
+ For the developers' and authors' protection, the GPL clearly explains
+ that there is no warranty for this free software. For both users' and
+ authors' sake, the GPL requires that modified versions be marked as
+ changed, so that their problems will not be attributed erroneously to
+ authors of previous versions.
+ .
+ Some devices are designed to deny users access to install or run
+ modified versions of the software inside them, although the manufacturer
+ can do so. This is fundamentally incompatible with the aim of
+ protecting users' freedom to change the software. The systematic
+ pattern of such abuse occurs in the area of products for individuals to
+ use, which is precisely where it is most unacceptable. Therefore, we
+ have designed this version of the GPL to prohibit the practice for those
+ products. If such problems arise substantially in other domains, we
+ stand ready to extend this provision to those domains in future versions
+ of the GPL, as needed to protect the freedom of users.
+ .
+ Finally, every program is threatened constantly by software patents.
+ States should not allow patents to restrict development and use of
+ software on general-purpose computers, but in those that do, we wish to
+ avoid the special danger that patents applied to a free program could
+ make it effectively proprietary. To prevent this, the GPL assures that
+ patents cannot be used to render the program non-free.
+ .
+ The precise terms and conditions for copying, distribution and
+ modification follow.
+ .
+ TERMS AND CONDITIONS
+ .
+ 0. Definitions.
+ .
+ "This License" refers to version 3 of the GNU General Public License.
+ .
+ "Copyright" also means copyright-like laws that apply to other kinds of
+ works, such as semiconductor masks.
+ .
+ "The Program" refers to any copyrightable work licensed under this
+ License. Each licensee is addressed as "you". "Licensees" and
+ "recipients" may be individuals or organizations.
+ .
+ To "modify" a work means to copy from or adapt all or part of the work
+ in a fashion requiring copyright permission, other than the making of an
+ exact copy. The resulting work is called a "modified version" of the
+ earlier work or a work "based on" the earlier work.
+ .
+ A "covered work" means either the unmodified Program or a work based
+ on the Program.
+ .
+ To "propagate" a work means to do anything with it that, without
+ permission, would make you directly or secondarily liable for
+ infringement under applicable copyright law, except executing it on a
+ computer or modifying a private copy. Propagation includes copying,
+ distribution (with or without modification), making available to the
+ public, and in some countries other activities as well.
+ .
+ To "convey" a work means any kind of propagation that enables other
+ parties to make or receive copies. Mere interaction with a user through
+ a computer network, with no transfer of a copy, is not conveying.
+ .
+ An interactive user interface displays "Appropriate Legal Notices"
+ to the extent that it includes a convenient and prominently visible
+ feature that (1) displays an appropriate copyright notice, and (2)
+ tells the user that there is no warranty for the work (except to the
+ extent that warranties are provided), that licensees may convey the
+ work under this License, and how to view a copy of this License. If
+ the interface presents a list of user commands or options, such as a
+ menu, a prominent item in the list meets this criterion.
+ .
+ 1. Source Code.
+ .
+ The "source code" for a work means the preferred form of the work
+ for making modifications to it. "Object code" means any non-source
+ form of a work.
+ .
+ A "Standard Interface" means an interface that either is an official
+ standard defined by a recognized standards body, or, in the case of
+ interfaces specified for a particular programming language, one that
+ is widely used among developers working in that language.
+ .
+ The "System Libraries" of an executable work include anything, other
+ than the work as a whole, that (a) is included in the normal form of
+ packaging a Major Component, but which is not part of that Major
+ Component, and (b) serves only to enable use of the work with that
+ Major Component, or to implement a Standard Interface for which an
+ implementation is available to the public in source code form. A
+ "Major Component", in this context, means a major essential component
+ (kernel, window system, and so on) of the specific operating system
+ (if any) on which the executable work runs, or a compiler used to
+ produce the work, or an object code interpreter used to run it.
+ .
+ The "Corresponding Source" for a work in object code form means all
+ the source code needed to generate, install, and (for an executable
+ work) run the object code and to modify the work, including scripts to
+ control those activities. However, it does not include the work's
+ System Libraries, or general-purpose tools or generally available free
+ programs which are used unmodified in performing those activities but
+ which are not part of the work. For example, Corresponding Source
+ includes interface definition files associated with source files for
+ the work, and the source code for shared libraries and dynamically
+ linked subprograms that the work is specifically designed to require,
+ such as by intimate data communication or control flow between those
+ subprograms and other parts of the work.
+ .
+ The Corresponding Source need not include anything that users
+ can regenerate automatically from other parts of the Corresponding
+ Source.
+ .
+ The Corresponding Source for a work in source code form is that
+ same work.
+ .
+ 2. Basic Permissions.
+ .
+ All rights granted under this License are granted for the term of
+ copyright on the Program, and are irrevocable provided the stated
+ conditions are met. This License explicitly affirms your unlimited
+ permission to run the unmodified Program. The output from running a
+ covered work is covered by this License only if the output, given its
+ content, constitutes a covered work. This License acknowledges your
+ rights of fair use or other equivalent, as provided by copyright law.
+ .
+ You may make, run and propagate covered works that you do not
+ convey, without conditions so long as your license otherwise remains
+ in force. You may convey covered works to others for the sole purpose
+ of having them make modifications exclusively for you, or provide you
+ with facilities for running those works, provided that you comply with
+ the terms of this License in conveying all material for which you do
+ not control copyright. Those thus making or running the covered works
+ for you must do so exclusively on your behalf, under your direction
+ and control, on terms that prohibit them from making any copies of
+ your copyrighted material outside their relationship with you.
+ .
+ Conveying under any other circumstances is permitted solely under
+ the conditions stated below. Sublicensing is not allowed; section 10
+ makes it unnecessary.
+ .
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+ .
+ No covered work shall be deemed part of an effective technological
+ measure under any applicable law fulfilling obligations under article
+ 11 of the WIPO copyright treaty adopted on 20 December 1996, or
+ similar laws prohibiting or restricting circumvention of such
+ measures.
+ .
+ When you convey a covered work, you waive any legal power to forbid
+ circumvention of technological measures to the extent such circumvention
+ is effected by exercising rights under this License with respect to
+ the covered work, and you disclaim any intention to limit operation or
+ modification of the work as a means of enforcing, against the work's
+ users, your or third parties' legal rights to forbid circumvention of
+ technological measures.
+ .
+ 4. Conveying Verbatim Copies.
+ .
+ You may convey verbatim copies of the Program's source code as you
+ receive it, in any medium, provided that you conspicuously and
+ appropriately publish on each copy an appropriate copyright notice;
+ keep intact all notices stating that this License and any
+ non-permissive terms added in accord with section 7 apply to the code;
+ keep intact all notices of the absence of any warranty; and give all
+ recipients a copy of this License along with the Program.
+ .
+ You may charge any price or no price for each copy that you convey,
+ and you may offer support or warranty protection for a fee.
+ .
+ 5. Conveying Modified Source Versions.
+ .
+ You may convey a work based on the Program, or the modifications to
+ produce it from the Program, in the form of source code under the
+ terms of section 4, provided that you also meet all of these conditions:
+ .
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+ .
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+ .
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+ .
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+ .
+ A compilation of a covered work with other separate and independent
+ works, which are not by their nature extensions of the covered work,
+ and which are not combined with it such as to form a larger program,
+ in or on a volume of a storage or distribution medium, is called an
+ "aggregate" if the compilation and its resulting copyright are not
+ used to limit the access or legal rights of the compilation's users
+ beyond what the individual works permit. Inclusion of a covered work
+ in an aggregate does not cause this License to apply to the other
+ parts of the aggregate.
+ .
+ 6. Conveying Non-Source Forms.
+ .
+ You may convey a covered work in object code form under the terms
+ of sections 4 and 5, provided that you also convey the
+ machine-readable Corresponding Source under the terms of this License,
+ in one of these ways:
+ .
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+ .
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+ .
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+ .
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+ .
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+ .
+ A separable portion of the object code, whose source code is excluded
+ from the Corresponding Source as a System Library, need not be
+ included in conveying the object code work.
+ .
+ A "User Product" is either (1) a "consumer product", which means any
+ tangible personal property which is normally used for personal, family,
+ or household purposes, or (2) anything designed or sold for incorporation
+ into a dwelling. In determining whether a product is a consumer product,
+ doubtful cases shall be resolved in favor of coverage. For a particular
+ product received by a particular user, "normally used" refers to a
+ typical or common use of that class of product, regardless of the status
+ of the particular user or of the way in which the particular user
+ actually uses, or expects or is expected to use, the product. A product
+ is a consumer product regardless of whether the product has substantial
+ commercial, industrial or non-consumer uses, unless such uses represent
+ the only significant mode of use of the product.
+ .
+ "Installation Information" for a User Product means any methods,
+ procedures, authorization keys, or other information required to install
+ and execute modified versions of a covered work in that User Product from
+ a modified version of its Corresponding Source. The information must
+ suffice to ensure that the continued functioning of the modified object
+ code is in no case prevented or interfered with solely because
+ modification has been made.
+ .
+ If you convey an object code work under this section in, or with, or
+ specifically for use in, a User Product, and the conveying occurs as
+ part of a transaction in which the right of possession and use of the
+ User Product is transferred to the recipient in perpetuity or for a
+ fixed term (regardless of how the transaction is characterized), the
+ Corresponding Source conveyed under this section must be accompanied
+ by the Installation Information. But this requirement does not apply
+ if neither you nor any third party retains the ability to install
+ modified object code on the User Product (for example, the work has
+ been installed in ROM).
+ .
+ The requirement to provide Installation Information does not include a
+ requirement to continue to provide support service, warranty, or updates
+ for a work that has been modified or installed by the recipient, or for
+ the User Product in which it has been modified or installed. Access to a
+ network may be denied when the modification itself materially and
+ adversely affects the operation of the network or violates the rules and
+ protocols for communication across the network.
+ .
+ Corresponding Source conveyed, and Installation Information provided,
+ in accord with this section must be in a format that is publicly
+ documented (and with an implementation available to the public in
+ source code form), and must require no special password or key for
+ unpacking, reading or copying.
+ .
+ 7. Additional Terms.
+ .
+ "Additional permissions" are terms that supplement the terms of this
+ License by making exceptions from one or more of its conditions.
+ Additional permissions that are applicable to the entire Program shall
+ be treated as though they were included in this License, to the extent
+ that they are valid under applicable law. If additional permissions
+ apply only to part of the Program, that part may be used separately
+ under those permissions, but the entire Program remains governed by
+ this License without regard to the additional permissions.
+ .
+ When you convey a copy of a covered work, you may at your option
+ remove any additional permissions from that copy, or from any part of
+ it. (Additional permissions may be written to require their own
+ removal in certain cases when you modify the work.) You may place
+ additional permissions on material, added by you to a covered work,
+ for which you have or can give appropriate copyright permission.
+ .
+ Notwithstanding any other provision of this License, for material you
+ add to a covered work, you may (if authorized by the copyright holders of
+ that material) supplement the terms of this License with terms:
+ .
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+ .
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+ .
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+ .
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+ .
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+ .
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+ .
+ All other non-permissive additional terms are considered "further
+ restrictions" within the meaning of section 10. If the Program as you
+ received it, or any part of it, contains a notice stating that it is
+ governed by this License along with a term that is a further
+ restriction, you may remove that term. If a license document contains
+ a further restriction but permits relicensing or conveying under this
+ License, you may add to a covered work material governed by the terms
+ of that license document, provided that the further restriction does
+ not survive such relicensing or conveying.
+ .
+ If you add terms to a covered work in accord with this section, you
+ must place, in the relevant source files, a statement of the
+ additional terms that apply to those files, or a notice indicating
+ where to find the applicable terms.
+ .
+ Additional terms, permissive or non-permissive, may be stated in the
+ form of a separately written license, or stated as exceptions;
+ the above requirements apply either way.
+ .
+ 8. Termination.
+ .
+ You may not propagate or modify a covered work except as expressly
+ provided under this License. Any attempt otherwise to propagate or
+ modify it is void, and will automatically terminate your rights under
+ this License (including any patent licenses granted under the third
+ paragraph of section 11).
+ .
+ However, if you cease all violation of this License, then your
+ license from a particular copyright holder is reinstated (a)
+ provisionally, unless and until the copyright holder explicitly and
+ finally terminates your license, and (b) permanently, if the copyright
+ holder fails to notify you of the violation by some reasonable means
+ prior to 60 days after the cessation.
+ .
+ Moreover, your license from a particular copyright holder is
+ reinstated permanently if the copyright holder notifies you of the
+ violation by some reasonable means, this is the first time you have
+ received notice of violation of this License (for any work) from that
+ copyright holder, and you cure the violation prior to 30 days after
+ your receipt of the notice.
+ .
+ Termination of your rights under this section does not terminate the
+ licenses of parties who have received copies or rights from you under
+ this License. If your rights have been terminated and not permanently
+ reinstated, you do not qualify to receive new licenses for the same
+ material under section 10.
+ .
+ 9. Acceptance Not Required for Having Copies.
+ .
+ You are not required to accept this License in order to receive or
+ run a copy of the Program. Ancillary propagation of a covered work
+ occurring solely as a consequence of using peer-to-peer transmission
+ to receive a copy likewise does not require acceptance. However,
+ nothing other than this License grants you permission to propagate or
+ modify any covered work. These actions infringe copyright if you do
+ not accept this License. Therefore, by modifying or propagating a
+ covered work, you indicate your acceptance of this License to do so.
+ .
+ 10. Automatic Licensing of Downstream Recipients.
+ .
+ Each time you convey a covered work, the recipient automatically
+ receives a license from the original licensors, to run, modify and
+ propagate that work, subject to this License. You are not responsible
+ for enforcing compliance by third parties with this License.
+ .
+ An "entity transaction" is a transaction transferring control of an
+ organization, or substantially all assets of one, or subdividing an
+ organization, or merging organizations. If propagation of a covered
+ work results from an entity transaction, each party to that
+ transaction who receives a copy of the work also receives whatever
+ licenses to the work the party's predecessor in interest had or could
+ give under the previous paragraph, plus a right to possession of the
+ Corresponding Source of the work from the predecessor in interest, if
+ the predecessor has it or can get it with reasonable efforts.
+ .
+ You may not impose any further restrictions on the exercise of the
+ rights granted or affirmed under this License. For example, you may
+ not impose a license fee, royalty, or other charge for exercise of
+ rights granted under this License, and you may not initiate litigation
+ (including a cross-claim or counterclaim in a lawsuit) alleging that
+ any patent claim is infringed by making, using, selling, offering for
+ sale, or importing the Program or any portion of it.
+ .
+ 11. Patents.
+ .
+ A "contributor" is a copyright holder who authorizes use under this
+ License of the Program or a work on which the Program is based. The
+ work thus licensed is called the contributor's "contributor version".
+ .
+ A contributor's "essential patent claims" are all patent claims
+ owned or controlled by the contributor, whether already acquired or
+ hereafter acquired, that would be infringed by some manner, permitted
+ by this License, of making, using, or selling its contributor version,
+ but do not include claims that would be infringed only as a
+ consequence of further modification of the contributor version. For
+ purposes of this definition, "control" includes the right to grant
+ patent sublicenses in a manner consistent with the requirements of
+ this License.
+ .
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+ patent license under the contributor's essential patent claims, to
+ make, use, sell, offer for sale, import and otherwise run, modify and
+ propagate the contents of its contributor version.
+ .
+ In the following three paragraphs, a "patent license" is any express
+ agreement or commitment, however denominated, not to enforce a patent
+ (such as an express permission to practice a patent or covenant not to
+ sue for patent infringement). To "grant" such a patent license to a
+ party means to make such an agreement or commitment not to enforce a
+ patent against the party.
+ .
+ If you convey a covered work, knowingly relying on a patent license,
+ and the Corresponding Source of the work is not available for anyone
+ to copy, free of charge and under the terms of this License, through a
+ publicly available network server or other readily accessible means,
+ then you must either (1) cause the Corresponding Source to be so
+ available, or (2) arrange to deprive yourself of the benefit of the
+ patent license for this particular work, or (3) arrange, in a manner
+ consistent with the requirements of this License, to extend the patent
+ license to downstream recipients. "Knowingly relying" means you have
+ actual knowledge that, but for the patent license, your conveying the
+ covered work in a country, or your recipient's use of the covered work
+ in a country, would infringe one or more identifiable patents in that
+ country that you have reason to believe are valid.
+ .
+ If, pursuant to or in connection with a single transaction or
+ arrangement, you convey, or propagate by procuring conveyance of, a
+ covered work, and grant a patent license to some of the parties
+ receiving the covered work authorizing them to use, propagate, modify
+ or convey a specific copy of the covered work, then the patent license
+ you grant is automatically extended to all recipients of the covered
+ work and works based on it.
+ .
+ A patent license is "discriminatory" if it does not include within
+ the scope of its coverage, prohibits the exercise of, or is
+ conditioned on the non-exercise of one or more of the rights that are
+ specifically granted under this License. You may not convey a covered
+ work if you are a party to an arrangement with a third party that is
+ in the business of distributing software, under which you make payment
+ to the third party based on the extent of your activity of conveying
+ the work, and under which the third party grants, to any of the
+ parties who would receive the covered work from you, a discriminatory
+ patent license (a) in connection with copies of the covered work
+ conveyed by you (or copies made from those copies), or (b) primarily
+ for and in connection with specific products or compilations that
+ contain the covered work, unless you entered into that arrangement,
+ or that patent license was granted, prior to 28 March 2007.
+ .
+ Nothing in this License shall be construed as excluding or limiting
+ any implied license or other defenses to infringement that may
+ otherwise be available to you under applicable patent law.
+ .
+ 12. No Surrender of Others' Freedom.
+ .
+ If conditions are imposed on you (whether by court order, agreement or
+ otherwise) that contradict the conditions of this License, they do not
+ excuse you from the conditions of this License. If you cannot convey a
+ covered work so as to satisfy simultaneously your obligations under this
+ License and any other pertinent obligations, then as a consequence you may
+ not convey it at all. For example, if you agree to terms that obligate you
+ to collect a royalty for further conveying from those to whom you convey
+ the Program, the only way you could satisfy both those terms and this
+ License would be to refrain entirely from conveying the Program.
+ .
+ 13. Use with the GNU Affero General Public License.
+ .
+ Notwithstanding any other provision of this License, you have
+ permission to link or combine any covered work with a work licensed
+ under version 3 of the GNU Affero General Public License into a single
+ combined work, and to convey the resulting work. The terms of this
+ License will continue to apply to the part which is the covered work,
+ but the special requirements of the GNU Affero General Public License,
+ section 13, concerning interaction through a network will apply to the
+ combination as such.
+ .
+ 14. Revised Versions of this License.
+ .
+ The Free Software Foundation may publish revised and/or new versions of
+ the GNU General Public License from time to time. Such new versions will
+ be similar in spirit to the present version, but may differ in detail to
+ address new problems or concerns.
+ .
+ Each version is given a distinguishing version number. If the
+ Program specifies that a certain numbered version of the GNU General
+ Public License "or any later version" applies to it, you have the
+ option of following the terms and conditions either of that numbered
+ version or of any later version published by the Free Software
+ Foundation. If the Program does not specify a version number of the
+ GNU General Public License, you may choose any version ever published
+ by the Free Software Foundation.
+ .
+ If the Program specifies that a proxy can decide which future
+ versions of the GNU General Public License can be used, that proxy's
+ public statement of acceptance of a version permanently authorizes you
+ to choose that version for the Program.
+ .
+ Later license versions may give you additional or different
+ permissions. However, no additional obligations are imposed on any
+ author or copyright holder as a result of your choosing to follow a
+ later version.
+ .
+ 15. Disclaimer of Warranty.
+ .
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+ APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+ HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+ OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+ IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+ .
+ 16. Limitation of Liability.
+ .
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+ WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+ THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+ GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+ USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+ DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+ PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+ EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+ SUCH DAMAGES.
+ .
+ 17. Interpretation of Sections 15 and 16.
+ .
+ If the disclaimer of warranty and limitation of liability provided
+ above cannot be given local legal effect according to their terms,
+ reviewing courts shall apply local law that most closely approximates
+ an absolute waiver of all civil liability in connection with the
+ Program, unless a warranty or assumption of liability accompanies a
+ copy of the Program in return for a fee.
+ .
+ END OF TERMS AND CONDITIONS
+ .
+ How to Apply These Terms to Your New Programs
+ .
+ If you develop a new program, and you want it to be of the greatest
+ possible use to the public, the best way to achieve this is to make it
+ free software which everyone can redistribute and change under these terms.
+ .
+ To do so, attach the following notices to the program. It is safest
+ to attach them to the start of each source file to most effectively
+ state the exclusion of warranty; and each file should have at least
+ the "copyright" line and a pointer to where the full notice is found.
+ .
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+ .
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ .
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+ .
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+ .
+ Also add information on how to contact you by electronic and paper mail.
+ .
+ If the program does terminal interaction, make it output a short
+ notice like this when it starts in an interactive mode:
+ .
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+ .
+ The hypothetical commands `show w' and `show c' should show the appropriate
+ parts of the General Public License. Of course, your program's commands
+ might be different; for a GUI interface, you would use an "about box".
+ .
+ You should also get your employer (if you work as a programmer) or school,
+ if any, to sign a "copyright disclaimer" for the program, if necessary.
+ For more information on this, and how to apply and follow the GNU GPL, see
+ <http://www.gnu.org/licenses/>.
+ .
+ The GNU General Public License does not permit incorporating your program
+ into proprietary programs. If your program is a subroutine library, you
+ may consider it more useful to permit linking proprietary applications with
+ the library. If this is what you want to do, use the GNU Lesser General
+ Public License instead of this License. But first, please read
+ <http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
+#----------------------------------------------------------------------------
+# License file: COPYING.LESSER
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+ .
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+ .
+ .
+ This version of the GNU Lesser General Public License incorporates
+ the terms and conditions of version 3 of the GNU General Public
+ License, supplemented by the additional permissions listed below.
+ .
+ 0. Additional Definitions.
+ .
+ As used herein, "this License" refers to version 3 of the GNU Lesser
+ General Public License, and the "GNU GPL" refers to version 3 of the GNU
+ General Public License.
+ .
+ "The Library" refers to a covered work governed by this License,
+ other than an Application or a Combined Work as defined below.
+ .
+ An "Application" is any work that makes use of an interface provided
+ by the Library, but which is not otherwise based on the Library.
+ Defining a subclass of a class defined by the Library is deemed a mode
+ of using an interface provided by the Library.
+ .
+ A "Combined Work" is a work produced by combining or linking an
+ Application with the Library. The particular version of the Library
+ with which the Combined Work was made is also called the "Linked
+ Version".
+ .
+ The "Minimal Corresponding Source" for a Combined Work means the
+ Corresponding Source for the Combined Work, excluding any source code
+ for portions of the Combined Work that, considered in isolation, are
+ based on the Application, and not on the Linked Version.
+ .
+ The "Corresponding Application Code" for a Combined Work means the
+ object code and/or source code for the Application, including any data
+ and utility programs needed for reproducing the Combined Work from the
+ Application, but excluding the System Libraries of the Combined Work.
+ .
+ 1. Exception to Section 3 of the GNU GPL.
+ .
+ You may convey a covered work under sections 3 and 4 of this License
+ without being bound by section 3 of the GNU GPL.
+ .
+ 2. Conveying Modified Versions.
+ .
+ If you modify a copy of the Library, and, in your modifications, a
+ facility refers to a function or data to be supplied by an Application
+ that uses the facility (other than as an argument passed when the
+ facility is invoked), then you may convey a copy of the modified
+ version:
+ .
+ a) under this License, provided that you make a good faith effort to
+ ensure that, in the event an Application does not supply the
+ function or data, the facility still operates, and performs
+ whatever part of its purpose remains meaningful, or
+ .
+ b) under the GNU GPL, with none of the additional permissions of
+ this License applicable to that copy.
+ .
+ 3. Object Code Incorporating Material from Library Header Files.
+ .
+ The object code form of an Application may incorporate material from
+ a header file that is part of the Library. You may convey such object
+ code under terms of your choice, provided that, if the incorporated
+ material is not limited to numerical parameters, data structure
+ layouts and accessors, or small macros, inline functions and templates
+ (ten or fewer lines in length), you do both of the following:
+ .
+ a) Give prominent notice with each copy of the object code that the
+ Library is used in it and that the Library and its use are
+ covered by this License.
+ .
+ b) Accompany the object code with a copy of the GNU GPL and this license
+ document.
+ .
+ 4. Combined Works.
+ .
+ You may convey a Combined Work under terms of your choice that,
+ taken together, effectively do not restrict modification of the
+ portions of the Library contained in the Combined Work and reverse
+ engineering for debugging such modifications, if you also do each of
+ the following:
+ .
+ a) Give prominent notice with each copy of the Combined Work that
+ the Library is used in it and that the Library and its use are
+ covered by this License.
+ .
+ b) Accompany the Combined Work with a copy of the GNU GPL and this license
+ document.
+ .
+ c) For a Combined Work that displays copyright notices during
+ execution, include the copyright notice for the Library among
+ these notices, as well as a reference directing the user to the
+ copies of the GNU GPL and this license document.
+ .
+ d) Do one of the following:
+ .
+ 0) Convey the Minimal Corresponding Source under the terms of this
+ License, and the Corresponding Application Code in a form
+ suitable for, and under terms that permit, the user to
+ recombine or relink the Application with a modified version of
+ the Linked Version to produce a modified Combined Work, in the
+ manner specified by section 6 of the GNU GPL for conveying
+ Corresponding Source.
+ .
+ 1) Use a suitable shared library mechanism for linking with the
+ Library. A suitable mechanism is one that (a) uses at run time
+ a copy of the Library already present on the user's computer
+ system, and (b) will operate properly with a modified version
+ of the Library that is interface-compatible with the Linked
+ Version.
+ .
+ e) Provide Installation Information, but only if you would otherwise
+ be required to provide such information under section 6 of the
+ GNU GPL, and only to the extent that such information is
+ necessary to install and execute a modified version of the
+ Combined Work produced by recombining or relinking the
+ Application with a modified version of the Linked Version. (If
+ you use option 4d0, the Installation Information must accompany
+ the Minimal Corresponding Source and Corresponding Application
+ Code. If you use option 4d1, you must provide the Installation
+ Information in the manner specified by section 6 of the GNU GPL
+ for conveying Corresponding Source.)
+ .
+ 5. Combined Libraries.
+ .
+ You may place library facilities that are a work based on the
+ Library side by side in a single library together with other library
+ facilities that are not Applications and are not covered by this
+ License, and convey such a combined library under terms of your
+ choice, if you do both of the following:
+ .
+ a) Accompany the combined library with a copy of the same work based
+ on the Library, uncombined with any other library facilities,
+ conveyed under the terms of this License.
+ .
+ b) Give prominent notice with the combined library that part of it
+ is a work based on the Library, and explaining where to find the
+ accompanying uncombined form of the same work.
+ .
+ 6. Revised Versions of the GNU Lesser General Public License.
+ .
+ The Free Software Foundation may publish revised and/or new versions
+ of the GNU Lesser General Public License from time to time. Such new
+ versions will be similar in spirit to the present version, but may
+ differ in detail to address new problems or concerns.
+ .
+ Each version is given a distinguishing version number. If the
+ Library as you received it specifies that a certain numbered version
+ of the GNU Lesser General Public License "or any later version"
+ applies to it, you have the option of following the terms and
+ conditions either of that published version or of any later version
+ published by the Free Software Foundation. If the Library as you
+ received it does not specify a version number of the GNU Lesser
+ General Public License, you may choose any version of the GNU Lesser
+ General Public License ever published by the Free Software Foundation.
+ .
+ If the Library as you received it specifies that a proxy can decide
+ whether future versions of the GNU Lesser General Public License shall
+ apply, that proxy's public statement of acceptance of any version is
+ permanent authorization for you to choose that version for the
+ Library.
diff --git a/debian/libshark-dev.install b/debian/libshark-dev.install
new file mode 100644
index 0000000..4a97dfa
--- /dev/null
+++ b/debian/libshark-dev.install
@@ -0,0 +1 @@
+# You must remove unused comment lines for the released package.
diff --git a/debian/libshark-doc.install b/debian/libshark-doc.install
new file mode 100644
index 0000000..4a97dfa
--- /dev/null
+++ b/debian/libshark-doc.install
@@ -0,0 +1 @@
+# You must remove unused comment lines for the released package.
diff --git a/debian/libshark0.install b/debian/libshark0.install
new file mode 100644
index 0000000..4a97dfa
--- /dev/null
+++ b/debian/libshark0.install
@@ -0,0 +1 @@
+# You must remove unused comment lines for the released package.
diff --git a/debian/rules b/debian/rules
new file mode 100755
index 0000000..f917f36
--- /dev/null
+++ b/debian/rules
@@ -0,0 +1,16 @@
+#!/usr/bin/make -f
+# You must remove unused comment lines for the released package.
+#export DH_VERBOSE = 1
+#export DEB_BUILD_MAINT_OPTIONS = hardening=+all
+#export DEB_CFLAGS_MAINT_APPEND = -Wall -pedantic
+#export DEB_LDFLAGS_MAINT_APPEND = -Wl,--as-needed
+
+%:
+ dh $@
+
+#override_dh_auto_configure:
+# dh_auto_configure -- \
+# -DCMAKE_LIBRARY_ARCHITECTURE="$(DEB_TARGET_MULTIARCH)"
+
+override_dh_strip:
+ dh_strip --dbg-package=libshark0-dbg
diff --git a/debian/source/format b/debian/source/format
new file mode 100644
index 0000000..163aaf8
--- /dev/null
+++ b/debian/source/format
@@ -0,0 +1 @@
+3.0 (quilt)
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/shark.git
More information about the debian-science-commits
mailing list