/* * Copyright © 2021 Behdad Esfahbod * * This is part of HarfBuzz, a text shaping library. * * Permission is hereby granted, without written agreement and without * license or royalty fees, to use, copy, modify, and distribute this * software and its documentation for any purpose, provided that the * above copyright notice and the following two paragraphs appear in * all copies of this software. * * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH * DAMAGE. * * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. * */ #include "hb.hh" #include "hb-vector.hh" #include "hb-set.hh" #include int main (int argc, char **argv) { /* Test copy constructor. */ { hb_vector_t v1 {1, 2}; hb_vector_t v2 {v1}; hb_vector_t V2 {v1}; assert (v1.length == 2); assert (v1[0] == 1); assert (v1[1] == 2); assert (v2.length == 2); assert (v2[0] == 1); assert (v2[1] == 2); } /* Test copy assignment. */ { hb_vector_t v1 {1, 2}; hb_vector_t v2 = v1; hb_vector_t V2 = v1; assert (v1.length == 2); assert (v1[0] == 1); assert (v1[1] == 2); assert (v2.length == 2); assert (v2[0] == 1); assert (v2[1] == 2); } /* Test move constructor. */ { hb_vector_t v {hb_vector_t {1, 2}}; hb_vector_t V {hb_vector_t {1, 2}}; assert (v.length == 2); assert (v[0] == 1); assert (v[1] == 2); } /* Test move assignment. */ { hb_vector_t v; hb_sorted_vector_t V; v = hb_vector_t {1, 2}; V = hb_sorted_vector_t {1, 2}; assert (v.length == 2); assert (v[0] == 1); assert (v[1] == 2); } /* Test initializing from iterable. */ { hb_set_t s; s.add (18); s.add (12); hb_vector_t v (s); hb_sorted_vector_t V (s); assert (v.length == 2); assert (V.length == 2); assert (v[0] == 12); assert (V[0] == 12); assert (v[1] == 18); assert (V[1] == 18); } /* Test initializing from iterator. */ { hb_set_t s; s.add (18); s.add (12); hb_vector_t v (hb_iter (s)); hb_vector_t V (hb_iter (s)); assert (v.length == 2); assert (V.length == 2); assert (v[0] == 12); assert (V[0] == 12); assert (v[1] == 18); assert (V[1] == 18); } /* Test initializing from initializer list and swapping. */ { hb_vector_t v1 {1, 2, 3}; hb_vector_t v2 {4, 5}; hb_swap (v1, v2); assert (v1.length == 2); assert (v1[0] == 4); assert (v2.length == 3); assert (v2[2] == 3); } /* Test initializing sorted-vector from initializer list and swapping. */ { hb_sorted_vector_t v1 {1, 2, 3}; hb_sorted_vector_t v2 {4, 5}; hb_swap (v1, v2); assert (v1.length == 2); assert (v1[0] == 4); assert (v2.length == 3); assert (v2[2] == 3); } #if 0 { hb_vector_t v; std::string s; for (unsigned i = 1; i < 100; i++) { s += "x"; v.push (s); } } #endif return 0; }