std::unorde...:bucket_size(3)
π NAME π
okay so bestie, this is the manual page for std::unordered_map::bucket_size β and the NAME section is literally just std::unordered_map::bucket_size twice in a trench coat. We're in the C++ Standard Libary manual, at the page std::unorde...:bucket_size(3). Iconic. π
β¨ Synopsis β¨
size_type bucket_size( size_type n ) const; (since C++11)
Returns the number of elements in the bucket with index n. That's the whole vibe. π
πΈ Parameters πΈ
nβ the index of the bucket you want to examine. That's it, bestie, just the index. π¦
π¦ Return value π¦
The number of elements in the bucket n. No cap. β¨
π₯ Complexity π₯
Linear in the size of the bucket n β that's the stated complexity, periodt. π
π See also π
bucket_countβ returns the number of buckets (public member function). Obsessed with her. π«Ά
This page came from http://cppreference.com, version date 2024.06.10, and it's tagged std::unorde...:bucket_size(3). Bye bestie, go count those buckets πβ¨π
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms