英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

unordered    
无序的

无序的

unordered
无序的

unordered
无序

unordered
adj 1: not arranged in order [synonym: {disordered}, {unordered}]
[ant: {ordered}]
2: not arranged in order hierarchically [synonym: {ungraded},
{unordered}, {unranked}]

Unordered \Unordered\
See {ordered}.

76 Moby Thesaurus words for "unordered":
aimless, amorphic, amorphous, anarchic, baggy, blobby, blurred,
blurry, capricious, casual, chaotic, characterless, confused,
desultory, disarticulated, discontinuous, disjunct, disordered,
disorderly, dispersed, disproportionate, erratic, featureless,
fitful, formless, frivolous, fuzzy, gratuitous, haphazard, hazy,
hit-or-miss, immethodical, inchoate, incoherent, indecisive,
indefinite, indeterminate, indiscriminate, inform, irregular,
kaleidoscopic, lumpen, meaningless, misshapen, misty, nondescript,
nonsymmetrical, nonsystematic, nonuniform, obscure, orderless,
planless, promiscuous, random, senseless, shapeless, spasmodic,
sporadic, straggling, straggly, systemless, unarranged,
unclassified, unclear, undefined, undirected, ungraded, unjoined,
unmethodical, unorganized, unsorted, unsymmetrical, unsystematic,
ununiform, vague, wandering


请选择你想看的字典辞典：
单词字典翻译
Unordered查看　Unordered　在百度字典中的解释百度英翻中〔查看〕
Unordered查看　Unordered　在Google字典中的解释Google英翻中〔查看〕
Unordered查看　Unordered　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • std::unordered_map - cppreference. com
    std::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
  • std::unordered_set lt;Key,Hash,KeyEqual,Allocator gt;:: unordered_set - Reference
    unordered_set (std:: initializer_list < value_type > init, size_type bucket_count, const Allocator alloc ) : unordered_set (init, bucket_count, Hash (), key_equal (), alloc) {}
  • Standard library header lt;unordered_set gt; (C++11) - Reference
    namespace std {template < class Key, class Hash = hash < Key >, class Pred = equal_to < Key >, class Allocator = allocator < Key >> class unordered_multiset {public: types using key_type = Key; using value_type = Key; using hasher = Hash; using key_equal = Pred; using allocator_type = Allocator; using pointer = typename allocator_traits
  • std::unordered_multimap - cppreference. com
    std::unordered_multimap is an unordered associative container that supports equivalent keys (an unordered_multimap may contain multiple copies of each key value) and that associates values of another type with the keys The unordered_multimap class supports forward iterators
  • std::unordered_map lt;Key,T,Hash,KeyEqual,Allocator gt;:: erase - Reference
    #include <unordered_map> #include <iostream> int main {std:: unordered_map < int, std:: string > c = {{1, "one"}, {2, "two"}, {3, "three"}, {4, "four"}, {5, "five"}, {6, "six"}}; erase all odd numbers from c for (auto it = c begin (); it ! = c end ();) {if (it-> first % 2! = 0) it = c erase (it); else ++ it;} for (auto p : c) std:: cout
  • std::unordered_set lt;Key,Hash,KeyEqual,Allocator gt;:: contains - Reference
    #include <iostream> #include <unordered_set> int main {std:: unordered_set < int > example {1, 2, 3, 4}; for (int x : {2, 5}) if (example contains (x)) std:: cout << x <<": Found \\n "; else std:: cout << x <<": Not found \\n ";}
  • std::unordered_map lt;Key,T,Hash,KeyEqual,Allocator gt;:: emplace - Reference
    If value_type is not EmplaceConstructible into unordered_map from args, the behavior is undefined If after the operation the new number of elements is greater than old max_load_factor() * bucket_count() a rehashing takes place
  • std::unordered_set lt;Key,Hash,KeyEqual,Allocator gt;:: find - Reference
    Simple comparison demo: Found 2 Heterogeneous lookup for unordered containers (transparent hashing): std::size_t string_hash::operator()(const char*) const true std::size_t string_hash::operator()(const std::string ) const true std::size_t string_hash::operator()(std::string_view) const true





中文字典-英文字典  2005-2009