TMC3v0

git-svn-id: http://wg11.sc29.org/svn/repos/MPEG-I/Part5-PointCloudCompression/TM/TMC3/trunk@1221 94298a81-5874-47c9-aab8-bfb24faeed7f

CMakeLists.txt

+cmake_minimum_required(VERSION 3.0)
+project (TMC3 CXX)
+
+include( CheckCXXCompilerFlag )
+CHECK_CXX_COMPILER_FLAG( "-std=c++11" COMPILER_SUPPORTS_CXX11 )
+CHECK_CXX_COMPILER_FLAG( "-std=c++0x" COMPILER_SUPPORTS_CXX0X )
+
+if (COMPILER_SUPPORTS_CXX11)
+ set( CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11" )
+elseif (COMPILER_SUPPORTS_CXX0X)
+ set( CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++0x" )
+else ()
+ MESSAGE(STATUS "The compiler ${CMAKE_CXX_COMPILER} has no C++11 support. Please use a different C++ compiler.")
+endif ()
+
+add_subdirectory(dependencies)
+add_subdirectory(tmc3)

README.md

+# TMC3 
+
+## Building
+
+### OSX
+- mkdir build
+- cd build
+- cmake .. -G Xcode 
+- open the generated xcode project and build it
+
+### Linux
+- mkdir build
+- cd build
+- cmake .. 
+- make
+
+### Windows
+- md build
+- cd build
+- cmake .. -G "Visual Studio 15 2017 Win64"
+- open the generated visual studio solution and build it

dependencies/CMakeLists.txt

+add_subdirectory (tbb)
+add_subdirectory (arithmetic-coding)
\ No newline at end of file

dependencies/arithmetic-coding/CMakeLists.txt

+add_subdirectory (src)
\ No newline at end of file

dependencies/arithmetic-coding/inc/ArithmeticCodec.h

+/*
+Copyright (c) 2004 Amir Said (said@ieee.org) & William A. Pearlman (pearlw@ecse.rpi.edu)
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, 
+are permitted provided that the following conditions are met:
+
+-   Redistributions of source code must retain the above copyright notice, this list 
+    of conditions and the following disclaimer. 
+
+-   Redistributions in binary form must reproduce the above copyright notice, this list of 
+    conditions and the following disclaimer in the documentation and/or other materials 
+    provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY 
+EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL 
+THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 
+OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER 
+IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING 
+IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY 
+OF SUCH DAMAGE.
+*/
+
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+//                                                                           -
+//                       ****************************                        -
+//                        ARITHMETIC CODING EXAMPLES                         -
+//                       ****************************                        -
+//                                                                           -
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+//                                                                           -
+// Fast arithmetic coding implementation                                     -
+// -> 32-bit variables, 32-bit product, periodic updates, table decoding     -
+//                                                                           -
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+//                                                                           -
+// Version 1.00  -  April 25, 2004                                           -
+//                                                                           -
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+//                                                                           -
+//                                  WARNING                                  -
+//                                 =========                                 -
+//                                                                           -
+// The only purpose of this program is to demonstrate the basic principles   -
+// of arithmetic coding. It is provided as is, without any express or        -
+// implied warranty, without even the warranty of fitness for any particular -
+// purpose, or that the implementations are correct.                         -
+//                                                                           -
+// Permission to copy and redistribute this code is hereby granted, provided -
+// that this warning and copyright notices are not removed or altered.       -
+//                                                                           -
+// Copyright (c) 2004 by Amir Said (said@ieee.org) &                         -
+//                       William A. Pearlman (pearlw@ecse.rpi.edu)           -
+//                                                                           -
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+//                                                                           -
+// A description of the arithmetic coding method used here is available in   -
+//                                                                           -
+// Lossless Compression Handbook, ed. K. Sayood                              -
+// Chapter 5: Arithmetic Coding (A. Said), pp. 101-152, Academic Press, 2003 -
+//                                                                           -
+// A. Said, Introduction to Arithetic Coding Theory and Practice             -
+// HP Labs report HPL-2004-76  -  http://www.hpl.hp.com/techreports/         -
+//                                                                           -
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+
+// - - Definitions - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+
+#ifndef O3DGC_ARITHMETIC_CODEC
+#define O3DGC_ARITHMETIC_CODEC
+
+#include <stdio.h>
+
+namespace o3dgc {
+
+inline unsigned long IntToUInt(long value)
+{
+    return (value < 0) ? static_cast<unsigned long>(-1 - (2 * value)) : static_cast<unsigned long>(2 * value);
+}
+inline long UIntToInt(unsigned long uiValue)
+{
+    return (uiValue & 1) ? -(static_cast<long>((uiValue + 1) >> 1)) : (static_cast<long>(uiValue >> 1));
+}
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+// - - Class definitions - - - - - - - - - - - - - - - - - - - - - - - - - - -
+class Static_Bit_Model // static model for binary data
+    {
+public:
+    Static_Bit_Model(void);
+
+    void set_probability_0(double); // set probability of symbol '0'
+
+private: //  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .
+    unsigned bit_0_prob;
+    friend class Arithmetic_Codec;
+};
+
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+
+class Static_Data_Model // static model for general data
+    {
+public:
+    Static_Data_Model(void);
+    ~Static_Data_Model(void);
+
+    unsigned model_symbols(void) { return data_symbols; }
+
+    void set_distribution(unsigned number_of_symbols,
+        const double probability[] = 0); // 0 means uniform
+
+private: //  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .
+    unsigned *distribution, *decoder_table;
+    unsigned data_symbols, last_symbol, table_size, table_shift;
+    friend class Arithmetic_Codec;
+};
+
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+
+class Adaptive_Bit_Model // adaptive model for binary data
+    {
+public:
+    Adaptive_Bit_Model(void);
+
+    void reset(void); // reset to equiprobable model
+
+private: //  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .
+    void update(void);
+    unsigned update_cycle, bits_until_update;
+    unsigned bit_0_prob, bit_0_count, bit_count;
+    friend class Arithmetic_Codec;
+};
+
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+
+class Adaptive_Data_Model // adaptive model for binary data
+    {
+public:
+    Adaptive_Data_Model(void);
+    Adaptive_Data_Model(unsigned number_of_symbols);
+    ~Adaptive_Data_Model(void);
+
+    unsigned model_symbols(void) { return data_symbols; }
+
+    void reset(void); // reset to equiprobable model
+    void set_alphabet(unsigned number_of_symbols);
+
+private: //  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .
+    void update(bool);
+    unsigned *distribution, *symbol_count, *decoder_table;
+    unsigned total_count, update_cycle, symbols_until_update;
+    unsigned data_symbols, last_symbol, table_size, table_shift;
+    friend class Arithmetic_Codec;
+};
+
+// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+// - - Encoder and decoder class - - - - - - - - - - - - - - - - - - - - - - -
+
+// Class with both the arithmetic encoder and decoder.  All compressed data is
+// saved to a memory buffer
+
+class Arithmetic_Codec {
+public:
+    Arithmetic_Codec(void);
+    ~Arithmetic_Codec(void);
+    Arithmetic_Codec(unsigned max_code_bytes,
+        unsigned char* user_buffer = 0); // 0 = assign new
+
+    unsigned char* buffer(void) { return code_buffer; }
+
+    void set_buffer(unsigned max_code_bytes,
+        unsigned char* user_buffer = 0); // 0 = assign new
+
+    void start_encoder(void);
+    void start_decoder(void);
+    void read_from_file(FILE* code_file); // read code data, start decoder
+
+    unsigned stop_encoder(void); // returns number of bytes used
+    unsigned write_to_file(FILE* code_file); // stop encoder, write code data
+    void stop_decoder(void);
+
+    void put_bit(unsigned bit);
+    unsigned get_bit(void);
+
+    void put_bits(unsigned data, unsigned number_of_bits);
+    unsigned get_bits(unsigned number_of_bits);
+
+    void encode(unsigned bit,
+        Static_Bit_Model&);
+    unsigned decode(Static_Bit_Model&);
+
+    void encode(unsigned data,
+        Static_Data_Model&);
+    unsigned decode(Static_Data_Model&);
+
+    void encode(unsigned bit,
+        Adaptive_Bit_Model&);
+    unsigned decode(Adaptive_Bit_Model&);
+
+    void encode(unsigned data,
+        Adaptive_Data_Model&);
+    unsigned decode(Adaptive_Data_Model&);
+
+    //   This section was added by K. Mammou
+    void ExpGolombEncode(unsigned int symbol,
+        int k,
+        Static_Bit_Model& bModel0,
+        Adaptive_Bit_Model& bModel1)
+    {
+        while (1) {
+            if (symbol >= static_cast<unsigned int>(1 << k)) {
+                encode(1, bModel1);
+                symbol = symbol - (1 << k);
+                k++;
+            }
+            else {
+                encode(0, bModel1); // now terminated zero of unary part
+                while (k--) // next binary part
+                {
+                    encode(static_cast<signed short>((symbol >> k) & 1), bModel0);
+                }
+                break;
+            }
+        }
+    }
+
+    unsigned ExpGolombDecode(int k,
+        Static_Bit_Model& bModel0,
+        Adaptive_Bit_Model& bModel1)
+    {
+        unsigned int l;
+        int symbol = 0;
+        int binary_symbol = 0;
+        do {
+            l = decode(bModel1);
+            if (l == 1) {
+                symbol += (1 << k);
+                k++;
+            }
+        } while (l != 0);
+        while (k--) //next binary part
+            if (decode(bModel0) == 1) {
+                binary_symbol |= (1 << k);
+            }
+        return static_cast<unsigned int>(symbol + binary_symbol);
+    }
+    //----------------------------------------------------------
+
+private: //  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .  .
+    void propagate_carry(void);
+    void renorm_enc_interval(void);
+    void renorm_dec_interval(void);
+    unsigned char *code_buffer, *new_buffer, *ac_pointer;
+    unsigned base, value, length; // arithmetic coding state
+    unsigned buffer_size, mode; // mode: 0 = undef, 1 = encoder, 2 = decoder
+};
+inline long DecodeIntACEGC(Arithmetic_Codec& acd,
+    Adaptive_Data_Model& mModelValues,
+    Static_Bit_Model& bModel0,
+    Adaptive_Bit_Model& bModel1,
+    const unsigned long exp_k,
+    const unsigned long M)
+{
+    unsigned long uiValue = acd.decode(mModelValues);
+    if (uiValue == M) {
+        uiValue += acd.ExpGolombDecode(exp_k, bModel0, bModel1);
+    }
+    return UIntToInt(uiValue);
+}
+inline unsigned long DecodeUIntACEGC(Arithmetic_Codec& acd,
+    Adaptive_Data_Model& mModelValues,
+    Static_Bit_Model& bModel0,
+    Adaptive_Bit_Model& bModel1,
+    const unsigned long exp_k,
+    const unsigned long M)
+{
+    unsigned long uiValue = acd.decode(mModelValues);
+    if (uiValue == M) {
+        uiValue += acd.ExpGolombDecode(exp_k, bModel0, bModel1);
+    }
+    return uiValue;
+}
+
+inline void EncodeIntACEGC(long predResidual,
+    Arithmetic_Codec& ace,
+    Adaptive_Data_Model& mModelValues,
+    Static_Bit_Model& bModel0,
+    Adaptive_Bit_Model& bModel1,
+    const unsigned long M)
+{
+    unsigned long uiValue = IntToUInt(predResidual);
+    if (uiValue < M) {
+        ace.encode(uiValue, mModelValues);
+    }
+    else {
+        ace.encode(M, mModelValues);
+        ace.ExpGolombEncode(uiValue - M, 0, bModel0, bModel1);
+    }
+}
+inline void EncodeUIntACEGC(long predResidual,
+    Arithmetic_Codec& ace,
+    Adaptive_Data_Model& mModelValues,
+    Static_Bit_Model& bModel0,
+    Adaptive_Bit_Model& bModel1,
+    const unsigned long M)
+{
+    unsigned long uiValue = static_cast<unsigned long>(predResidual);
+    if (uiValue < M) {
+        ace.encode(uiValue, mModelValues);
+    }
+    else {
+        ace.encode(M, mModelValues);
+        ace.ExpGolombEncode(uiValue - M, 0, bModel0, bModel1);
+    }
+}
+}
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+#endif
+

dependencies/arithmetic-coding/src/CMakeLists.txt

+file(GLOB PROJECT_CPP_FILES_LOCAL "*.cpp")
+if (PROJECT_CPP_FILES STREQUAL "")
+    set(PROJECT_CPP_FILES ${PROJECT_CPP_FILES_LOCAL} CACHE STRING "C++ files" FORCE)
+else(PROJECT_CPP_FILES STREQUAL "")
+    set(PROJECT_CPP_FILES "${PROJECT_CPP_FILES};${PROJECT_CPP_FILES_LOCAL}" CACHE STRING "C++ files" FORCE)
+endif(PROJECT_CPP_FILES STREQUAL "")
+
+
+

dependencies/nanoflann/KDTreeVectorOfVectorsAdaptor.h

+/***********************************************************************
+ * Software License Agreement (BSD License)
+ *
+ * Copyright 2011-16 Jose Luis Blanco (joseluisblancoc@gmail.com).
+ *   All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *************************************************************************/
+
+#pragma once
+
+#include "nanoflann.hpp"
+
+#include <vector>
+
+// ===== This example shows how to use nanoflann with these types of containers: =======
+// typedef std::vector<std::vector<double> > my_vector_of_vectors_t;
+// typedef std::vector<Eigen::VectorXd> my_vector_of_vectors_t;   // This requires #include
+// <Eigen/Dense>
+// =====================================================================================
+
+/** A simple vector-of-vectors adaptor for nanoflann, without duplicating the storage.
+  *  The i'th vector represents a point in the state space.
+  *
+  *  \tparam DIM If set to >0, it specifies a compile-time fixed dimensionality for the points in
+ * the data set, allowing more compiler optimizations.
+  *  \tparam num_t The type of the point coordinates (typically, double or float).
+  *  \tparam Distance The distance metric to use: nanoflann::metric_L1, nanoflann::metric_L2,
+ * nanoflann::metric_L2_Simple, etc.
+  *  \tparam IndexType The type for indices in the KD-tree index (typically, size_t of int)
+  */
+template <class VectorOfVectorsType, typename num_t = double, int DIM = -1,
+          class Distance = nanoflann::metric_L2, typename IndexType = size_t>
+struct KDTreeVectorOfVectorsAdaptor {
+  typedef KDTreeVectorOfVectorsAdaptor<VectorOfVectorsType, num_t, DIM, Distance> self_t;
+  typedef typename Distance::template traits<num_t, self_t>::distance_t metric_t;
+  typedef nanoflann::KDTreeSingleIndexAdaptor<metric_t, self_t, DIM, IndexType> index_t;
+
+  index_t *index;  //! The kd-tree index for the user to call its methods as usual with any other
+                   //! FLANN index.
+
+  /// Constructor: takes a const ref to the vector of vectors object with the data points
+  KDTreeVectorOfVectorsAdaptor(const int dimensionality, const VectorOfVectorsType &mat,
+                               const int leaf_max_size = 10)
+      : m_data(mat) {
+    //		assert(mat.size()!=0 && mat[0].size()!=0);
+    //		const size_t dims = mat[0].size();
+    //		if (DIM>0 && static_cast<int>(dims)!=DIM)
+    //			throw std::runtime_error("Data set dimensionality does not match the 'DIM'
+    // template
+    // argument");
+    // size_t dims = dimensionality;
+    index = new index_t(dimensionality, *this /* adaptor */,
+                        nanoflann::KDTreeSingleIndexAdaptorParams(leaf_max_size));
+    index->buildIndex();
+  }
+
+  ~KDTreeVectorOfVectorsAdaptor() { delete index; }
+
+  const VectorOfVectorsType &m_data;
+
+  /** Query for the \a num_closest closest points to a given point (entered as
+   * query_point[0:dim-1]).
+    *  Note that this is a short-cut method for index->findNeighbors().
+    *  The user can also call index->... methods as desired.
+    * \note nChecks_IGNORED is ignored but kept for compatibility with the original FLANN interface.
+    */
+  inline void query(const num_t *query_point, const size_t num_closest, IndexType *out_indices,
+                    num_t *out_distances_sq, const int nChecks_IGNORED = 10) const {
+    nanoflann::KNNResultSet<num_t, IndexType> resultSet(num_closest);
+    resultSet.init(out_indices, out_distances_sq);
+    index->findNeighbors(resultSet, query_point, nanoflann::SearchParams());
+  }
+
+  /** @name Interface expected by KDTreeSingleIndexAdaptor
+    * @{ */
+
+  const self_t &derived() const { return *this; }
+  self_t &derived() { return *this; }
+
+  // Must return the number of data points
+  inline size_t kdtree_get_point_count() const { return m_data.getPointCount(); }
+
+  // Returns the distance between the vector "p1[0:size-1]" and the data point with index "idx_p2"
+  // stored in the class:
+  inline num_t kdtree_distance(const num_t *p1, const size_t idx_p2, size_t size) const {
+    num_t s = 0;
+    for (size_t i = 0; i < size; i++) {
+      const num_t d = p1[i] - m_data[idx_p2][i];
+      s += d * d;
+    }
+    return s;
+  }
+
+  // Returns the dim'th component of the idx'th point in the class:
+  inline num_t kdtree_get_pt(const size_t idx, int dim) const { return m_data[idx][dim]; }
+
+  // Optional bounding-box computation: return false to default to a standard bbox computation loop.
+  //   Return true if the BBOX was already computed by the class and returned in "bb" so it can be
+  //   avoided to redo it again.
+  //   Look at bb.size() to find out the expected dimensionality (e.g. 2 or 3 for point clouds)
+  template <class BBOX>
+  bool kdtree_get_bbox(BBOX & /*bb*/) const {
+    return false;
+  }
+
+  /** @} */
+
+};  // end of KDTreeVectorOfVectorsAdaptor

dependencies/tbb/.appveyor.yml

+version: 1.0.{build}
+os: Visual Studio 2017
+clone_folder: C:\projects\tbb
+test: off
+configuration:
+    - Debug
+    - Release
+branches:
+  only:
+    - master
+environment:
+  matrix:
+    - CMAKE_PLATFORM: "Visual Studio 15 2017"
+    - CMAKE_PLATFORM: "Visual Studio 15 2017 Win64"
+install:
+  - cinstall: python
+build_script:
+  - echo Running cmake...
+  - cd c:\projects\tbb
+  - cmake -G "%CMAKE_PLATFORM%" -DCMAKE_SUPPRESS_REGENERATION=1 -DTBB_CI_BUILD=ON
+  - set MSBuildLogger="C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll"
+  - cmake --build . --config %Configuration% -- /v:m /logger:%MSBuildLogger%
+  - ctest -C %Configuration% --output-on-failure --timeout 500

dependencies/tbb/.gitattributes

+# Set the default behavior, in case people don't have core.autocrlf set.
+* text=auto
+
+# Explicitly declare text files you want to always be normalized and converted
+# to native line endings on checkout.
+*.c text
+*.h text
+*.cpp text
+*.def text
+*.rc text
+*.i text
+*.sh text
+*.csh text
+*.mk text
+*.java text
+*.csv text
+*.lst text
+*.asm text
+*.cfg text
+*.css text
+*.inc text
+*.js text
+*.rb text
+*.strings text
+*.txt text
+*export.lst text
+*.xml text
+*.py text
+*.md text
+*.classpath text
+*.cproject text
+*.project text
+*.properties text
+*.java text
+*.gradle text
+
+# Declare files that will always have CRLF line endings on checkout.
+*.sln text eol=crlf
+*.bat text eol=crlf
+
+# Denote all files that are truly binary and should not be modified.
+*.png binary
+*.jpg binary
+*.ico binary
+*.spir binary

dependencies/tbb/.gitignore

+# Ignore the debug and release directories created with Makefile builds #
+#########################################################################
+build/*_debug/
+build/*_release/
+
+# Compiled source #
+###################
+*.com
+*.class
+*.dll
+*.lib
+*.pdb
+*.exe
+*.o