Changelog for package tf2

0.25.13 (2025-05-14)

• Overflow Issue in durationFromSec() Function when Handling Extremely Large or Small Values (#785) (#787)
• Backport: Do not clobber callback handles when cancelling pending transformable requests (#781)
• Contributors: Timo Röhling, mergify[bot]

0.25.12 (2025-01-17)

• Fixing Scalar Header Guards (#755)
• Contributors: Lucas Wendland

0.25.11 (2025-01-14)

0.25.10 (2024-12-19)

• Humble "Backport" of #720 (#722)
• Removed unused var in tf2 (#735) (#737) (cherry picked from commit e791b58f8826a31d8ea11f45b7bf3026f26eab8a) Co-authored-by: Alejandro Hernández Cordero <<ahcorde@gmail.com>>
• Contributors: Lucas Wendland, mergify[bot]

0.25.9 (2024-11-20)

0.25.8 (2024-08-29)

• Enable Twist interpolator (backport #646) (#684)

  * Enable Twist interpolator (#646) Co-authored-by: Tully Foote <<tullyfoote@intrinsic.ai>> (cherry picked from commit 62322b8fa74c90d144dfe32294f6670bf6cfe786) # Conflicts: # tf2/include/tf2/buffer_core.h # tf2_ros/test/test_buffer.cpp Co-authored-by: Alejandro Hernández Cordero <<ahcorde@gmail.com>>

• Contributors: mergify[bot]

0.25.7 (2024-05-29)

• [TimeCache] Improve performance for insertData() and pruneList() (backport #680) (#693)

  • Nacho/minor fixes tf2 cache (#658)
  • Remove unused parameter

  * Make use of API function to improve redability `cpp TimePoint TimeCache::getLatestTimestamp() { return storage\_.front().stamp\_; }[ And std::list<T>::front() is(gcclib): ]{.title-ref}cpp reference front() _GLIBCXX_NOEXCEPT { return *begin(); }[ * Same argument as 321bd225afb5c ]{.title-ref}cpp TimePoint TimeCache::getLatestTimestamp() { // empty list case // ... return storage\_.front().stamp\_; }[ and std::list<T>::front(): ]{.title-ref}cpp reference front() _GLIBCXX_NOEXCEPT { return *begin(); }[ * Improve readbility by relying on STL functions By now reading to this block I can tell that we are preventing to inserting a new element in the list, that has a timestamp that is actually older than the max_storage_time_ we allow for * Remove hardcoded algorithmg for STL one The intent of the code is now more clear, instead of relying on raw loops, we "find if" there is any element in the list that has a stamp older than the incoming one. With this we find the position in the list where we should insert the current timestamp: `storage_it]{.title-ref}

  • Remove to better express what this pointer is represetngin

  * Replace raw loop for STL algorithm Remove if any element is older thant the max_storage_time_ allowed, relative to the latest(sooner) time seems clear npw

  * [TimeCache] Improve performance for insertData() and pruneList() (#680) Co-authored-by: Chris Lalancette <<clalancette@gmail.com>>

  * Don't break ABI ---------Co-authored-by: Ignacio Vizzo <<ignacio@dexory.com>> Co-authored-by: Eric Cousineau <<eric.cousineau@tri.global>> Co-authored-by: Chris Lalancette <<clalancette@gmail.com>> Co-authored-by: Alejandro Hernández Cordero <<ahcorde@gmail.com>>

• Add cache_benchmark (backport #679) (#691) Co-authored-by: Eric Cousineau <<eric.cousineau@tri.global>> Co-authored-by: Alejandro Hernández Cordero <<ahcorde@gmail.com>>

File truncated at 100 lines see the full file