Merge pull request #1255 from lukaszstolarczuk/fix-hashmap-link

fix OneTBB docs' links in the containers comments

Author: igchor

include/libpmemobj++/container/concurrent_hash_map.hpp

@@ -1,5 +1,5 @@
 // SPDX-License-Identifier: BSD-3-Clause
-/* Copyright 2019-2021, Intel Corporation */
+/* Copyright 2019-2022, Intel Corporation */
 
 /**
  * @file
@@ -1573,7 +1573,7 @@ operator!=(const hash_map_iterator<Container, M> &i,
 
 /**
  * Persistent memory aware implementation of Intel TBB
- * [concurrent_hash_map](https://spec.oneapi.io/versions/0.5.0/oneTBB/containers/concurrent_hash_map_cls.html)
+ * [concurrent_hash_map](https://spec.oneapi.io/versions/latest/elements/oneTBB/source/containers/concurrent_hash_map_cls.html)
  *
  * The implementation is based on a concurrent hash table algorithm
  * (https://arxiv.org/ftp/arxiv/papers/1509/1509.02235.pdf) where elements

include/libpmemobj++/experimental/concurrent_map.hpp

@@ -1,5 +1,5 @@
 // SPDX-License-Identifier: BSD-3-Clause
-/* Copyright 2019-2021, Intel Corporation */
+/* Copyright 2019-2022, Intel Corporation */
 
 /**
  * @file
@@ -22,9 +22,8 @@ namespace experimental
 
 /**
  * Persistent memory aware implementation of Intel TBB
- * [concurrent_map
- * with](https://spec.oneapi.io/versions/0.5.0/oneTBB/containers/concurrent_map_cls.html)
- * API partially compatible to std::map.
+ * [concurrent_map](https://spec.oneapi.io/versions/latest/elements/oneTBB/source/containers/concurrent_map_cls.html)
+ * with API partially compatible with std::map.
  *
  * A sorted associative container that contains key-value pairs with unique
  * keys. Keys are sorted by using the comparison function Compare. Search,