head 1.2; access; symbols perseant-exfatfs-base-20250801:1.2 perseant-exfatfs-base-20240630:1.2 perseant-exfatfs:1.2.0.4 perseant-exfatfs-base:1.2 netbsd-8-3-RELEASE:1.1.1.4 netbsd-9-4-RELEASE:1.1.1.4 netbsd-9-3-RELEASE:1.1.1.4 cjep_sun2x:1.2.0.2 cjep_sun2x-base:1.2 cjep_staticlib_x-base1:1.2 netbsd-9-2-RELEASE:1.1.1.4 cjep_staticlib_x:1.1.1.4.0.34 cjep_staticlib_x-base:1.1.1.4 netbsd-9-1-RELEASE:1.1.1.4 phil-wifi-20200421:1.1.1.4 phil-wifi-20200411:1.1.1.4 is-mlppp:1.1.1.4.0.32 is-mlppp-base:1.1.1.4 phil-wifi-20200406:1.1.1.4 netbsd-8-2-RELEASE:1.1.1.4 netbsd-9-0-RELEASE:1.1.1.4 netbsd-9-0-RC2:1.1.1.4 netbsd-9-0-RC1:1.1.1.4 phil-wifi-20191119:1.1.1.4 netbsd-9:1.1.1.4.0.30 netbsd-9-base:1.1.1.4 phil-wifi-20190609:1.1.1.4 netbsd-8-1-RELEASE:1.1.1.4 netbsd-8-1-RC1:1.1.1.4 pgoyette-compat-merge-20190127:1.1.1.4 pgoyette-compat-20190127:1.1.1.4 pgoyette-compat-20190118:1.1.1.4 pgoyette-compat-1226:1.1.1.4 pgoyette-compat-1126:1.1.1.4 pgoyette-compat-1020:1.1.1.4 pgoyette-compat-0930:1.1.1.4 pgoyette-compat-0906:1.1.1.4 netbsd-7-2-RELEASE:1.1.1.4 pgoyette-compat-0728:1.1.1.4 netbsd-8-0-RELEASE:1.1.1.4 phil-wifi:1.1.1.4.0.28 phil-wifi-base:1.1.1.4 pgoyette-compat-0625:1.1.1.4 netbsd-8-0-RC2:1.1.1.4 pgoyette-compat-0521:1.1.1.4 pgoyette-compat-0502:1.1.1.4 pgoyette-compat-0422:1.1.1.4 netbsd-8-0-RC1:1.1.1.4 pgoyette-compat-0415:1.1.1.4 pgoyette-compat-0407:1.1.1.4 pgoyette-compat-0330:1.1.1.4 pgoyette-compat-0322:1.1.1.4 pgoyette-compat-0315:1.1.1.4 netbsd-7-1-2-RELEASE:1.1.1.4 pgoyette-compat:1.1.1.4.0.26 pgoyette-compat-base:1.1.1.4 netbsd-7-1-1-RELEASE:1.1.1.4 matt-nb8-mediatek:1.1.1.4.0.24 matt-nb8-mediatek-base:1.1.1.4 perseant-stdc-iso10646:1.1.1.4.0.22 perseant-stdc-iso10646-base:1.1.1.4 netbsd-8:1.1.1.4.0.20 netbsd-8-base:1.1.1.4 prg-localcount2-base3:1.1.1.4 prg-localcount2-base2:1.1.1.4 prg-localcount2-base1:1.1.1.4 prg-localcount2:1.1.1.4.0.18 prg-localcount2-base:1.1.1.4 pgoyette-localcount-20170426:1.1.1.4 bouyer-socketcan-base1:1.1.1.4 pgoyette-localcount-20170320:1.1.1.4 netbsd-7-1:1.1.1.4.0.16 netbsd-7-1-RELEASE:1.1.1.4 netbsd-7-1-RC2:1.1.1.4 netbsd-7-nhusb-base-20170116:1.1.1.4 bouyer-socketcan:1.1.1.4.0.14 bouyer-socketcan-base:1.1.1.4 pgoyette-localcount-20170107:1.1.1.4 netbsd-7-1-RC1:1.1.1.4 pgoyette-localcount-20161104:1.1.1.4 netbsd-7-0-2-RELEASE:1.1.1.4 localcount-20160914:1.1.1.4 netbsd-7-nhusb:1.1.1.4.0.12 netbsd-7-nhusb-base:1.1.1.4 pgoyette-localcount-20160806:1.1.1.4 pgoyette-localcount-20160726:1.1.1.4 pgoyette-localcount:1.1.1.4.0.10 pgoyette-localcount-base:1.1.1.4 netbsd-7-0-1-RELEASE:1.1.1.4 netbsd-7-0:1.1.1.4.0.8 netbsd-7-0-RELEASE:1.1.1.4 netbsd-7-0-RC3:1.1.1.4 netbsd-7-0-RC2:1.1.1.4 netbsd-7-0-RC1:1.1.1.4 netbsd-7:1.1.1.4.0.6 netbsd-7-base:1.1.1.4 libcxx-215289:1.1.1.4 libcxx-209785:1.1.1.4 yamt-pagecache:1.1.1.4.0.4 libcxx-208870:1.1.1.4 yamt-pagecache-base9:1.1.1.4 tls-earlyentropy:1.1.1.4.0.2 tls-earlyentropy-base:1.1.1.4 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.4 riastradh-drm2-base3:1.1.1.4 libcxx-198773:1.1.1.4 libcxx-198452:1.1.1.4 libcxx-195694:1.1.1.3 libcxx-194207:1.1.1.3 libcxx-188475:1.1.1.3 riastradh-drm2-base2:1.1.1.2 riastradh-drm2-base1:1.1.1.2 riastradh-drm2:1.1.1.2.0.2 riastradh-drm2-base:1.1.1.2 libcxx-185674:1.1.1.2 tls-maxphys-base:1.1.1.4 tls-maxphys:1.1.1.1.0.2 libcxx-182162:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.2 date 2021.05.30.03.26.47; author joerg; state dead; branches; next 1.1; commitid Z2BWNc6JrDmRz7VC; 1.1 date 2013.05.17.23.02.30; author joerg; state Exp; branches 1.1.1.1; next ; commitid 5RZzZYRawlqwq2Qw; 1.1.1.1 date 2013.05.17.23.02.30; author joerg; state Exp; branches 1.1.1.1.2.1; next 1.1.1.2; commitid 5RZzZYRawlqwq2Qw; 1.1.1.2 date 2013.07.04.22.20.55; author joerg; state Exp; branches; next 1.1.1.3; commitid WlNO2WjvXD3uEcWw; 1.1.1.3 date 2013.08.15.22.38.27; author joerg; state Exp; branches; next 1.1.1.4; commitid XzkpFPFnGVFXoB1x; 1.1.1.4 date 2014.01.04.21.32.05; author joerg; state Exp; branches 1.1.1.4.4.1 1.1.1.4.34.1; next ; commitid gAL45VqEe0AdtQjx; 1.1.1.1.2.1 date 2013.05.17.23.02.30; author tls; state dead; branches; next 1.1.1.1.2.2; commitid OnlO1cBgtQRcIHUw; 1.1.1.1.2.2 date 2013.06.23.06.26.48; author tls; state Exp; branches; next 1.1.1.1.2.3; commitid OnlO1cBgtQRcIHUw; 1.1.1.1.2.3 date 2014.08.19.23.46.52; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.4.4.1 date 2014.01.04.21.32.05; author yamt; state dead; branches; next 1.1.1.4.4.2; commitid 5gylMoBTXvvB7yBx; 1.1.1.4.4.2 date 2014.05.22.15.46.17; author yamt; state Exp; branches; next ; commitid 5gylMoBTXvvB7yBx; 1.1.1.4.34.1 date 2021.05.31.22.10.26; author cjep; state dead; branches; next ; commitid eWz9SBW0XqKjJlVC; desc @@ 1.2 log @Remove old version of libc++, migrated to external/apache2/dist/libcxx to match the rest of the mono-repo imports. @ text @//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // class multimap // iterator find(const key_type& k); // const_iterator find(const key_type& k) const; #include #include int main() { typedef std::pair V; typedef std::multimap M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } @ 1.1 log @Initial revision @ text @@ 1.1.1.1 log @Import libc++ from http://llvm.org/svn/llvm-project, r182162. @ text @@ 1.1.1.2 log @Update libc++ snapshot to r185674. This removes an incorrect freelocale of the C locale on NetBSD. It adds support for non-pointer based allocators, integer sequences and more. @ text @a19 2 #include "../../../min_allocator.h" a22 1 { a79 62 } #if __cplusplus >= 201103L { typedef std::multimap, min_allocator>> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } #endif @ 1.1.1.3 log @Import libc++ r188413. More support for current C++ development and various bugfixes. @ text @a20 1 #include "private_constructor.hpp" a144 63 #if _LIBCPP_STD_VER > 11 { typedef std::pair V; typedef std::multimap> M; typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef PrivateConstructor PC; typedef std::multimap> M; typedef M::iterator R; M m; m.insert ( std::make_pair ( PC::make(5), 1 )); m.insert ( std::make_pair ( PC::make(5), 2 )); m.insert ( std::make_pair ( PC::make(5), 3 )); m.insert ( std::make_pair ( PC::make(7), 1 )); m.insert ( std::make_pair ( PC::make(7), 2 )); m.insert ( std::make_pair ( PC::make(7), 3 )); m.insert ( std::make_pair ( PC::make(9), 1 )); m.insert ( std::make_pair ( PC::make(9), 2 )); m.insert ( std::make_pair ( PC::make(9), 3 )); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } #endif @ 1.1.1.4 log @Import r198452 of libc++. Primarily avoids C style casts and adds a number of cleanups. @ text @d20 1 a20 1 #include "min_allocator.h" @ 1.1.1.4.34.1 log @sync with head @ text @@ 1.1.1.4.4.1 log @file find.pass.cpp was added on branch yamt-pagecache on 2014-05-22 15:46:17 +0000 @ text @d1 209 @ 1.1.1.4.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 209 //===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // class multimap // iterator find(const key_type& k); // const_iterator find(const key_type& k) const; #include #include #include "min_allocator.h" #include "private_constructor.hpp" int main() { typedef std::pair V; { typedef std::multimap M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } #if __cplusplus >= 201103L { typedef std::multimap, min_allocator>> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } #endif #if _LIBCPP_STD_VER > 11 { typedef std::pair V; typedef std::multimap> M; typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef PrivateConstructor PC; typedef std::multimap> M; typedef M::iterator R; M m; m.insert ( std::make_pair ( PC::make(5), 1 )); m.insert ( std::make_pair ( PC::make(5), 2 )); m.insert ( std::make_pair ( PC::make(5), 3 )); m.insert ( std::make_pair ( PC::make(7), 1 )); m.insert ( std::make_pair ( PC::make(7), 2 )); m.insert ( std::make_pair ( PC::make(7), 3 )); m.insert ( std::make_pair ( PC::make(9), 1 )); m.insert ( std::make_pair ( PC::make(9), 2 )); m.insert ( std::make_pair ( PC::make(9), 3 )); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } #endif } @ 1.1.1.1.2.1 log @file find.pass.cpp was added on branch tls-maxphys on 2013-06-23 06:26:48 +0000 @ text @d1 80 @ 1.1.1.1.2.2 log @resync from head @ text @a0 80 //===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // class multimap // iterator find(const key_type& k); // const_iterator find(const key_type& k) const; #include #include int main() { typedef std::pair V; typedef std::multimap M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } @ 1.1.1.1.2.3 log @Rebase to HEAD as of a few days ago. @ text @a19 3 #include "min_allocator.h" #include "private_constructor.hpp" a22 1 { a79 125 } #if __cplusplus >= 201103L { typedef std::multimap, min_allocator>> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } #endif #if _LIBCPP_STD_VER > 11 { typedef std::pair V; typedef std::multimap> M; typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef PrivateConstructor PC; typedef std::multimap> M; typedef M::iterator R; M m; m.insert ( std::make_pair ( PC::make(5), 1 )); m.insert ( std::make_pair ( PC::make(5), 2 )); m.insert ( std::make_pair ( PC::make(5), 3 )); m.insert ( std::make_pair ( PC::make(7), 1 )); m.insert ( std::make_pair ( PC::make(7), 2 )); m.insert ( std::make_pair ( PC::make(7), 3 )); m.insert ( std::make_pair ( PC::make(9), 1 )); m.insert ( std::make_pair ( PC::make(9), 2 )); m.insert ( std::make_pair ( PC::make(9), 3 )); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } #endif @