Lines Matching refs:ia
36 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8 ,9}; in test() local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test()
39 assert(base(r) == ia + 5); in test()
40 for (int* i = ia; i < base(r); ++i) in test()
42 for (int* i = base(r); i < ia+sa; ++i) in test()
45 r = std::partition(Iter(ia), Iter(ia), is_odd()); in test()
46 assert(base(r) == ia); in test()
49 ia[i] = 2*i; in test()
50 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
51 assert(base(r) == ia); in test()
54 ia[i] = 2*i+1; in test()
55 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
56 assert(base(r) == ia+sa); in test()
59 ia[i] = 2*i+1; in test()
60 ia[sa-1] = 10; in test()
61 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
62 assert(base(r) == ia+sa-1); in test()
63 for (int* i = ia; i < base(r); ++i) in test()
65 for (int* i = base(r); i < ia+sa; ++i) in test()
69 ia[i] = 2*i+1; in test()
70 ia[0] = 10; in test()
71 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
72 assert(base(r) == ia+sa-1); in test()
73 for (int* i = ia; i < base(r); ++i) in test()
75 for (int* i = base(r); i < ia+sa; ++i) in test()
79 ia[i] = 2*i; in test()
80 ia[sa-1] = 11; in test()
81 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
82 assert(base(r) == ia+1); in test()
83 for (int* i = ia; i < base(r); ++i) in test()
85 for (int* i = base(r); i < ia+sa; ++i) in test()
89 ia[i] = 2*i; in test()
90 ia[0] = 11; in test()
91 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
92 assert(base(r) == ia+1); in test()
93 for (int* i = ia; i < base(r); ++i) in test()
95 for (int* i = base(r); i < ia+sa; ++i) in test()