레퍼런스 원어 해석 연습5 NVIDIA Parallel developer.nvidia.com/blog/thinking-parallel-part-i-collision-detection-gpu/ Thinking Parallel, Part I: Collision Detection on the GPU | NVIDIA Developer Blog This series of posts aims to highlight some of the main differences between conventional programming and parallel programming on the algorithmic level, using broad-phase collision detection as an… developer.nvidia.com 파트 1,2,3,4 나누어서 할 예정.. 2021. 4. 28. [C++] std::weak_ptr reference 출처: https://en.cppreference.com/w/cpp/memory/weak_ptr 오역이 있을 수 있으니 잘못된 부분이 있다면 꼭 알려주세요! 원어 std::weak_ptr is a smart pointer that holds a non-owning ("weak") reference to an object that is managed by std::shared_ptr. It must be converted to std::shared_ptr in order to access the referenced object. std::weak_ptr models temporary ownership: when an object needs to be accessed only if it exists, and.. 2020. 3. 22. [C++] std::shared_ptr reference 출처: https://en.cppreference.com/w/cpp/memory/shared_ptr 오역이 있을 수 있으니 잘못된 부분이 있다면 꼭 알려주세요! 원어 std::shared_ptr is a smart pointer that retains shared ownership of an object through a pointer. Several shared_ptr objects may own the same object. The object is destroyed and its memory deallocated when either of the following happens: the last remaining shared_ptr owning the object is destroyed; the l.. 2020. 3. 21. [C++] std::unordered_map reference 출처: https://en.cppreference.com/w/cpp/container/unordered_map 오역이 있을 수 있으니 잘못된 부분이 있다면 꼭 알려주세요! 원어 Unordered map is an associative container that contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constant-time complexity. Internally, the elements are not sorted in any particular order, but organized into buckets. Which bucket an element is placed .. 2020. 3. 18. [C++] std::map reference 출처: https://en.cppreference.com/w/cpp/container/map 오역이 있을 수 있으니 잘못된 부분이 있다면 꼭 알려주세요! 원어 std::map is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Maps are usually implemented as red-black trees. Everywhere the standard library uses the.. 2020. 3. 17. 이전 1 다음
