©️ Updated copyright notice

bench/performance_test.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/ptable/common.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/ptable/insert.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/ptable/point.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/ptable/scan.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/trees/common.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/trees/tree_balance.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *
@@ -187,4 +187,4 @@ void prepare(const pptr<TreeType> &tree, const pptr<TreeType::LeafNode> &leaf2)
       treeRef.insert(j, tup);
     }
   }
-}
\ No newline at end of file
+}

bench/trees/tree_erase.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/trees/tree_get.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *
@@ -117,4 +117,4 @@ static void BM_TreeGet(benchmark::State &state) {
 }
 
 BENCHMARK(BM_TreeGet);
-BENCHMARK_MAIN();
\ No newline at end of file
+BENCHMARK_MAIN();

bench/trees/tree_insert.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/trees/tree_merge.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/trees/tree_scan.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *
@@ -103,4 +103,4 @@ void prepare(pmem::obj::pool<root>& pop, pobj_alloc_class_desc alloc_class) {
       insert(a[i]);
     }
   });
-}
\ No newline at end of file
+}

bench/trees/tree_split.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

bench/trees/tree_traverse.cpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *
@@ -144,4 +144,4 @@ void prepare(pmem::obj::pool<root> &pop, pobj_alloc_class_desc alloc_class) {
       }
     }
   });
-}
\ No newline at end of file
+}

src/pbptrees/BitHPBPTree.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

src/pbptrees/BitPBPTree.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

src/pbptrees/FPTree.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

src/pbptrees/HPBPTree.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

src/pbptrees/PBPTree.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *

src/pbptrees/UnsortedPBPTree.hpp

 /*
- * Copyright (C) 2017-2019 DBIS Group - TU Ilmenau, All Rights Reserved.
+ * Copyright (C) 2017-2020 DBIS Group - TU Ilmenau, All Rights Reserved.
  *
  * This file is part of our NVM-based Data Structures repository.
  *