summaryrefslogtreecommitdiff
path: root/src/bindings/cxx/eina_cxx/eina_inarray.hh
blob: 5a2c7f4540ca101fef8a92262bb8f079e9437eaf (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
#ifndef EINA_INARRAY_HH_
#define EINA_INARRAY_HH_

#include <Eina.h>
#include <eina_type_traits.hh>
#include <eina_range_types.hh>

#include <iterator>
#include <cstring>
#include <cassert>

/**
 * @addtogroup Eina_Cxx_Containers_Group
 *
 * @{
 */

namespace efl { namespace eina {

/**
 * @defgroup Eina_Cxx_Inline_Array_Group Inline Array
 * @ingroup Eina_Cxx_Containers_Group
 *
 * Inline array is a container that stores the data itself not pointers to data,
 * this means there is no memory fragmentation, also for small data types(such
 * as char, short, int, etc.) it's more memory efficient.
 *
 * @{
 */

/**
 * @internal
 * Access traits for eina::inarray.
 */
struct _inarray_access_traits {

  template <typename T>
  struct const_iterator
  {
    typedef T const* type; /**< Type for constant iterator. */
  };
  template <typename T>
  struct iterator
  {
    typedef T* type; /**< Type for iterator. */
  };
  template <typename T>
  struct const_native_handle
  {
    typedef Eina_Inarray const* type; /**< Type for constant native @c Eina_Inarray handle. */
  };
  template <typename T>
  struct native_handle
  {
    typedef Eina_Inarray* type; /**< Type for native @c Eina_Inarray handle. */
  };

  /**
   * @brief Get a non-constant native @c Eina_Inarray handle from a constant one.
   */
  template <typename T>
  static Eina_Inarray* native_handle_from_const(Eina_Inarray const* array)
  {
    return const_cast<Eina_Inarray*>(array);
  }

/**
 * @brief Get a reference to the last element of the given @c Eina_Inarray.
 */
template <typename T>
static T& back(Eina_Inarray* raw)
{
  assert(!_inarray_access_traits::empty<T>(raw));
  return *static_cast<T*>( ::eina_inarray_nth(raw, _inarray_access_traits::size<T>(raw)-1u));
}
/**
 * @brief Get a constant reference to the last element of the given @c Eina_Inarray.
 *
 * Version of @ref back(Eina_Inarray* raw) for const-qualified pointer
 * to @c Eina_Inarray. Get a constant reference to the last element
 * instead.
 */
template <typename T>
static T const& back(Eina_Inarray const* raw)
{
  return _inarray_access_traits::back<T>(const_cast<Eina_Inarray*>(raw));
}

/**
 * @brief Get a reference to the first element of the given @c Eina_Inarray.
 */
template <typename T>
static T& front(Eina_Inarray* raw)
{
  assert(!empty<T>(raw));
  return *static_cast<T*>( ::eina_inarray_nth(raw, 0u));
}

/**
 * @brief Get a constant reference to the first element of the given @c Eina_Inarray.
 *
 * Version of @ref front(Eina_Inarray* raw) for const-qualified
 * pointer to @c Eina_Inarray. Get a constant reference to the first
 * element instead.
 */
template <typename T>
static T const& front(Eina_Inarray const* raw)
{
  return _inarray_access_traits::front<T>(const_cast<Eina_Inarray*>(raw));
}

/**
 * @brief Get an iterator to the begin of the memory block of the given @c Eina_Inarray.
 */
template <typename T>
static T* begin(Eina_Inarray* raw)
{
  return !raw->members ? 0 : static_cast<T*>( ::eina_inarray_nth(raw, 0u));
}

/**
 * @brief Get an iterator to the end of the memory block of the given @c Eina_Inarray.
 */
template <typename T>
static T* end(Eina_Inarray* raw)
{
  return !raw->members ? 0
    : static_cast<T*>( ::eina_inarray_nth(raw, _inarray_access_traits::size<T>(raw) -1)) + 1;
}

/**
 * @brief Get a constant iterator to the begin of the memory block of the given @c Eina_Inarray.
 *
 * Version of @ref begin(Eina_Inarray* raw) for const-qualified
 * @c Eina_Inarray handles. Returns a constant iterator instead.
 */
template <typename T>
static T const* begin(Eina_Inarray const* raw)
{
  return _inarray_access_traits::begin<T>(const_cast<Eina_Inarray*>(raw));
}


/**
 * @brief Get a constant iterator to the end of the memory block of the given @c Eina_Inarray.
 *
 * Version of @ref end(Eina_Inarray* raw) const-qualified
 * @c Eina_Inarray. Returns a constant iterator instead.
 */
template <typename T>
static T const* end(Eina_Inarray const* raw)
{
  return _inarray_access_traits::end<T>(const_cast<Eina_Inarray*>(raw));
}

/**
 * @brief Get a constant reverse iterator pointing to the reverse begin of the given Eina_Inarray.
 *
 * Version of @ref rbegin(Eina_Inarray* raw) for const-qualified
 * Eina_Inarray handles. Returns a constant reverse iterator instead.
 */
template <typename T>
static std::reverse_iterator<T const*> rbegin(Eina_Inarray const* raw)
{
  return std::reverse_iterator<T const*>(_inarray_access_traits::end<T>(raw));
}

/**
 * @brief Get a constant reverse iterator pointing to the reverse end of the given Eina_Inarray.
 *
 * Version of @ref rend(Eina_Inarray* raw) to const-qualified
 * Eina_Inarray handles. Returns a constant reverse iterator instead.
 */
template <typename T>
static std::reverse_iterator<T const*> rend(Eina_Inarray const* raw)
{
  return std::reverse_iterator<T const*>(_inarray_access_traits::begin<T>(raw));
}

/**
 * @brief Get a reverse iterator pointing to the reverse begin of the given @c Eina_Inarray.
 */
template <typename T>
static std::reverse_iterator<T*> rbegin(Eina_Inarray* raw)
{
  return std::reverse_iterator<T*>(_inarray_access_traits::end<T>(raw));
}

/**
 * @brief Get a reverse iterator pointing to the reverse end of the given @c Eina_Inarray.
 */
template <typename T>
static std::reverse_iterator<T*> rend(Eina_Inarray* raw)
{
  return std::reverse_iterator<T*>(_inarray_access_traits::begin<T>(raw));
}

/**
 * @brief Get a constant iterator to the begin of the memory block of the given @c Eina_Inarray.
 *
 * Works like @ref begin(Eina_Inarray const* raw) but is granted to
 * return a constant iterator even for handles that are not
 * const-qualified.
 */
template <typename T>
static T const* cbegin(Eina_Inarray const* raw)
{
  return _inarray_access_traits::begin<T>(raw);
}

/**
 * @brief Get a constant iterator to the end of the memory block of the given @c Eina_Inarray.
 *
 * Works like @ref end(Eina_Inarray const* raw) but is granted to
 * return a constant iterator even for handles that are not
 * const-qualified.
 */
template <typename T>
static T const* cend(Eina_Inarray const* raw)
{
  return _inarray_access_traits::end<T>(raw);
}

/**
 * @brief Get a constant reverse iterator to the end of the memory block of the given @c Eina_Inarray.
 *
 * Works like @ref rbegin(Eina_Inarray const* raw) but is granted to
 * return a constant reverse iterator even for handles that are not
 * const-qualified.
 */
template <typename T>
static std::reverse_iterator<T const*> crbegin(Eina_Inarray const* raw)
{
  return _inarray_access_traits::rbegin<T const*>(raw);
}

/**
 * @brief Get a constant reverse iterator to the begin of the memory block of the given @c Eina_Inarray.
 *
 * Works like @ref rend(Eina_Inarray const* raw) but is granted to
 * return a constant reverse iterator even for handles that are not
 * const-qualified.
 */
template <typename T>
static std::reverse_iterator<T const*> crend(Eina_Inarray const* raw)
{
  return _inarray_access_traits::rend<T const*>(raw);
}

/**
 * @brief Check if the given Eina array is empty.
 * @return @c true if the given array is empty, @c false otherwise.
 *
 * This functions returns @c true if the given @c Eina_Inarray contains
 * no elements, otherwise it returns @c false.
 */
template <typename T>
static inline bool empty(Eina_Inarray const* raw)
{
  return _inarray_access_traits::size<T>(raw) == 0;
}

/**
 * @brief Get the size of the given @c Eina_Inarray.
 * @return Number of elements in the given array.
 *
 * This function returns the current number of elements inside of @p raw.
 */
template <typename T>
static inline std::size_t size(Eina_Inarray const* raw)
{
  return ::eina_inarray_count(raw);
}

/**
 * @brief Get a constant reference to the element at the given position.
 * @param raw Constant pointer to an @c Eina_Inarray.
 * @param i Position of the element.
 * @return Constant reference to the element.
 *
 * Version of @ref index() for const-qualified @c Eina_Inarray. Returns
 * a constant reference instead.
 */
template <typename T>
static T const& index(Eina_Inarray const* raw, std::size_t i)
{
  return *(_inarray_access_traits::begin<T>(raw) + i);
}

/**
 * @brief Get a reference to the element at the given position.
 * @param raw Pointer to a @c Eina_Inarray.
 * @param i Position of the element.
 * @return Reference to the element.
 *
 * This member function returns a reference to the element at position
 * @p i inside @p raw.
 */
template <typename T>
static T& index(Eina_Inarray* raw, std::size_t i)
{
  return *(_inarray_access_traits::begin<T>(raw) + i);
}


};

template <typename T>
class inarray;

/**
 * @ingroup Eina_Cxx_Range_Group
 *
 * Range class for @ref inarray.
 */
template <typename T>
struct range_inarray : _range_template<T, _inarray_access_traits>
{
  typedef _range_template<T, _inarray_access_traits> _base_type; /**< Type for the base class. */
  typedef typename std::remove_const<T>::type value_type; /**< The type of each element. */

  /**
   * @brief Creates a range from a native Eina inline array handle.
   */
  range_inarray(Eina_Inarray* array)
    : _base_type(array)
  {}

  /**
   * @brief Creates a range from a @c inarray object.
   */
  range_inarray(inarray<T>& array)
    : _base_type(array.native_handle())
  {}

  /**
   * @brief Get the element at the given position in the array.
   * @param index Position of the element.
   * @return Reference to the element at the given position.
   */
  value_type& operator[](std::size_t index) const
  {
    return _inarray_access_traits::index<T>(this->native_handle(), index);
  }
};

/**
 * Common inarray interface for every value type.
 */
struct _inarray_common_base
{
  typedef std::size_t size_type; /**< Type for size information used in the array. */
  typedef Eina_Inarray* native_handle_type; /** Type for the native @c Eina_Inarray handle. */
  typedef Eina_Inarray const* const_native_handle_type; /** Type for constant native @c Eina_Inarray handle. */

  /**
   * @brief Creates a new array object from a handle to a native @c Eina_Inarray.
   * @param array Handler to a native @c Eina_Inarray
   *
   * This constructor wraps a pre-allocated @c Eina_Inarray providing an
   * OO interface to it.
   *
   * @warning It is important to note that the created array object
   * gains ownership of the handle, deallocating it at destruction time.
   */
  explicit _inarray_common_base(native_handle_type array)
    : _array(array) {}

  /**
   * @brief Allocates a array with the given size for each element.
   * @param member_size Size of each element in the array.
   *
   * This constructor creates an inline array object with the given
   * size (in bytes) for each element. All allocated memory will be
   * released at destruction.
   */
  explicit _inarray_common_base(size_type member_size)
    : _array( ::eina_inarray_new(member_size, 0) )
  {
  }

  /**
   * @brief Release the inline array memory.
   *
   * This destructor release the internal native @c Eina_Inarray handle,
   * freeing allocated memory.
   */
  ~_inarray_common_base()
  {
    ::eina_inarray_free(_array);
  }

  /**
   * @brief Get the current size of the array.
   * @return Number of elements in the array.
   *
   * This member function returns the current number of elements inside
   * the inline array.
   */
  size_type size() const
  {
    return _inarray_access_traits::size<void>(_array);
  }

  /**
   * @brief Check if the array is empty.
   * @return @c true if the array is empty, @c false otherwise.
   *
   * This member function returns @c true if the array does not contain
   * any elements, otherwise it returns @c false.
   */
  bool empty() const
  {
    return _inarray_access_traits::empty<void>(_array);
  }

  /**
   * @brief Get the handle for the wrapped Eina_Inarray.
   * @return Internal handle for the native Eina inline array.
   *
   * This member function returns the native @c Eina_Inarray handle that
   * is wrapped inside this object.
   *
   * @warning It is important to take care when using it, since the
   * handle will be automatically release upon object destruction.
   */
  native_handle_type native_handle() { return _array; }

  /**
   * @brief Get a constant handle for the wrapped Eina_Inarray.
   * @return Constant handle for the native Eina inline array.
   *
   * Version of @ref native_handle() for const-qualified objects.
   * Return a constant handle instead.
   */
  const_native_handle_type native_handle() const { return _array; }

  /**
   * @internal
   * Member variable that holds the native @c Eina_Inarray handle.
   */
  native_handle_type _array;
private:
  /** Disabled copy constructor. */
  _inarray_common_base(_inarray_common_base const& other);
  /** Disabled assignment operator. */
  _inarray_common_base& operator=(_inarray_common_base const& other);
};

/**
 * Optimized specialization of the base inline array for POD types.
 */
template <typename T>
class _pod_inarray : _inarray_common_base
{
  typedef _inarray_common_base _base_type; /**< Type for the base class. */
public:
  typedef T value_type; /**< The type of each element. */
  typedef T& reference; /**< Type for a reference to an element. */
  typedef T const& const_reference; /**< Type for a constant reference to an element. */
  typedef T* pointer; /**< Type for a pointer to an element. */
  typedef T const* const_pointer; /**< Type for a constant pointer for an element. */

  /**
   * Type for a iterator for this container.
   * Defined as a @ref pointer for performance reasons.
   */
  typedef pointer iterator;

  /**
   * Type for a constant iterator for this container.
   * Defined as a  @ref const_pointer for performance reasons.
   */
  typedef const_pointer const_iterator;
  typedef std::size_t size_type; /**< Type for size information used in the array. */
  typedef std::ptrdiff_t difference_type; /**< Type to represent the distance between two iterators. */
  typedef _base_type::native_handle_type native_handle_type; /** Type for the native @c Eina_Inarray handle. */
  typedef _base_type::const_native_handle_type const_native_handle_type; /** Type for constant native @c Eina_Inarray handle. */

  typedef std::reverse_iterator<iterator> reverse_iterator; /**< Type for reverse iterator of the array. */
  typedef std::reverse_iterator<const_iterator> const_reverse_iterator; /** Type for constant reverse iterator of the array. */

  using _base_type::size; /**< Type for size information used in the array. */

  /**
   * @brief Check if the array is empty.
   * @return @c true if the array is empty, @c false otherwise.
   *
   * This member function returns @c true if the array does not contain
   * any elements, otherwise it returns @c false.
   */
   using _base_type::empty;
  using _base_type::native_handle; /** Type for the native @c Eina_Inarray handle. */


  /**
   * @brief Create a new object from a handle to a native @c Eina_Inarray.
   * @param array Handler to a native @c Eina_Inarray.
   *
   * This constructor wraps a pre-allocated @c Eina_Inarray providing an
   * OOP interface to it.
   *
   * @warning It is important to note that the created object gains
   * ownership of the handle, deallocating it at destruction time.
   */
  _pod_inarray(native_handle_type array)
    : _base_type(array) {}

  /**
   * @brief Default constructor. Create an empty array.
   *
   * This constructor creates an array object with no elements. Elements
   * are declarated as having the same size of the given template
   * typename argument.
   */
  _pod_inarray() : _base_type(sizeof(T))
  {
  }

  /**
   * @brief Construct an array object with @p n copies of @p t.
   * @param n Number of elements.
   * @param t Value to be copied to each element.
   *
   * This constructor creates an inline array with @p n elements, each
   * one as a copy of @p t.
   */
  _pod_inarray(size_type n, value_type const& t) : _base_type(sizeof(T))
  {
    while(n--)
      push_back(t);
  }

  /**
   * @brief Create a inline array with elements from the given range.
   * @param i Iterator to the initial position. The element pointed by this iterator will be copied.
   * @param j Iterator to the final position. The element pointed by this iterator will NOT be copied.
   *
   * This constructor creates a inline array with copies of the elements
   * between @p i and @p j in the same order.
   *
   * @note The ending element (pointed by @p j) is not copied.
   */
  template <typename InputIterator>
  _pod_inarray(InputIterator i, InputIterator const& j
         , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
    : _base_type(sizeof(T))
  {
    while(i != j)
      {
        push_back(*i);
        ++i;
      }
  }

  /**
   * @brief Copy constructor. Creates a copy of the given inline array.
   * @param other Another inline array of the same type.
   *
   * This constructor creates an inline array containing a copy of each
   * element inside @p other in the same order.
   */
  _pod_inarray(_pod_inarray<T>const& other)
    : _base_type(sizeof(T))
  {
    insert(end(), other.begin(), other.end());
  }

  /**
   * Do nothing, the native @c Eina_Inarray is already released in the
   * base class destructor.
   */
  ~_pod_inarray()
  {
  }

  /**
   * @brief Replace the current content with the cotent of another array.
   * @param other Another inline array of the same type.
   *
   * This assignment operator replaces the content of the array by a
   * copy of the content of @p other. The array size is adjusted
   * accordingly and the newly copied elements keep their original order.
   */
  _pod_inarray<T>& operator=(_pod_inarray<T>const& other)
  {
    clear();
    insert(end(), other.begin(), other.end());
    return *this;
  }

  /**
   * @brief Remove all the elements of the array.
   */
  void clear()
  {
    ::eina_inarray_flush(_array);
  }

  /**
   * @brief Add a copy of the given element at the end of the array.
   * @param value Element to be added at the end of the array.
   *
   * This member function allocates a new element at the end of the
   * inline array, the content of @p value is copied to the new element.
   */
  void push_back(T const& value)
  {
    size_type s = size();
    static_cast<void>(s);
    eina_inarray_push(_array, &value);
    assert(size() != s);
    assert(size() == s + 1u);
  }

  /**
   * @brief Remove the last element of the array.
   */
  void pop_back()
  {
    eina_inarray_pop(_array);
  }

  /**
   * @brief Insert a new element at the given position.
   * @param i Iterator pointing to the position where the new element will be inserted.
   * @param t Value to be copied to the new element.
   * @return Iterator pointing to the new element inserted.
   *
   * This member function inserts a copy of the element @p t at the
   * position @p i. The new element comes right before the element
   * originally pointed by @p i.
   *
   * At the end, a valid iterator pointing to the element just inserted
   * is returned.
   */
  iterator insert(iterator i, value_type const& t)
  {
    if(i != end())
    {
      T* q = static_cast<iterator>
        ( ::eina_inarray_alloc_at(_array, i - begin(), 1u));
      std::memcpy(q, &t, sizeof(t));
      return q;
    }
    else
    {
      push_back(t);
      return end()-1;
    }
  }

  /**
   * @brief Insert @p n copies of @p t at the given position.
   * @param i Iterator pointing to the position where the new elements will be inserted.
   * @param n Number of elements to be inserted.
   * @param t Value to be copied to each new inserted element.
   * @return Iterator pointing to the first inserted element.
   *
   * This member function inserts @p n new elements at position @p i
   * in the array, each one as a copy of @p t. The new elements come
   * right before the element originally pointed by @p i.
   *
   * At the end, a valid iterator pointing to the first element inserted
   * is returned.
   */
  iterator insert(iterator i, size_t n, value_type const& t)
  {
    T* q;
    if(i != end())
    {
      q = static_cast<iterator>
        ( ::eina_inarray_alloc_at(_array, i - &_array->members, n));
    }
    else
    {
      q = eina_inarray_grow(_array, n);
    }
    for(T* p = q; n; --n, ++p)
      std::memcpy(p, &t, sizeof(t));
    return q;
  }

  /**
   * @brief Insert the elements between the given range at the given position.
   * @param p Iterator pointing to the position where the new elements will be inserted.
   * @param i Iterator to the initial position. The element pointed by this iterator will be copied.
   * @param j Iterator to the final position. The element pointed by this iterator will NOT be copied.
   * @return Iterator pointing to the first inserted element.
   *
   * This member function inserts a copy of the elements between @p i
   * and @p j at the position @p p. The new elements come right before
   * the element originally pointed by @p p. Note that the element
   * pointed by @p j is not copied.
   *
   * At the end, a valid iterator pointing to the first element inserted
   * is returned.
   */
  template <typename InputIterator>
  iterator insert(iterator p, InputIterator i, InputIterator j
                  , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
  {
    size_type n = 0;
    while(i != j)
      {
        p = insert(p, *i);
        ++p;
        ++i;
        ++n;
      }
    return p - n;
  }

  /**
   * @brief Remove the element at the given position.
   * @param q Iterator pointing to the element to be removed.
   * @return Iterator pointing to the element after the removed one.
   *
   * This member function removes the element pointed by the iterator
   * @p q, reducing the array size by one. At the end, a valid iterator
   * pointing to the element right after the removed one is returned.
   */
  iterator erase(iterator q)
  {
    ::eina_inarray_remove_at(_array, q - begin());
    return q;
  }

  /**
   * @brief Remove the elements between the given range.
   * @param i Iterator pointing to the starting position to be removed.
   * @param j Iterator pointing to the ending position to be removed.
   *          The element pointed by this iterator is not removed.
   * @return Iterator pointing to the new position of the first
   *         non-removed element after the removed ones (i.e. the one
   *         originally pointed by @p j).
   *
   * This member function removes the elements between the iterators
   * @p i and @p j, including the element pointed by @p i but not the
   * element pointed by @j.
   */
  iterator erase(iterator i, iterator j)
  {
    while(i != j)
      {
        erase(--j);
      }
    return i;
  }

  /**
   * @brief Replace the content of the array by the elements in the given range.
   * @param i Iterator pointing to the beginning of the elements to be copied.
   * @param j Iterator pointing to the end of the elements to be copied.
   *          Note that the element pointed by j will NOT be copied.
   *
   * This member function replaces the current elements by copies of the
   * elements between the iterators @p i and @p j, including the element
   * pointed by @p i but not the one pointed by @p j. The size of the
   * array is adjusted accordingly and the newly copied elements remain
   * in their original order.
   */
  template <typename InputIterator>
  void assign(InputIterator i, InputIterator j
              , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0);

  /**
   * @brief Replace the content of the array by @p n copies @p t.
   * @param n Number of elements.
   * @param t Value to be copied to each element.
   */
  void assign(size_type n, value_type const& t);

  /**
   * @brief Get a reference to the element at the given position.
   * @param i Position of the element.
   * @return Reference to the element at the ith position.
   */
  value_type& operator[](size_type i)
  {
    return *(begin() + i);
  }

  /**
   * @brief Get a constant reference to the element at the given position.
   * @param i Position of the element.
   * @return Constant reference to the element at the ith position.
   *
   * Version of @ref operator[](size_type i) for const-qualified inline
   * array objects. Returns a constant reference instead.
   */
  value_type const& operator[](size_type i) const
  {
    return const_cast<inarray<T>&>(*this)[i];
  }

  /**
   * @brief Get a reference to the last element.
   * @return Reference to the last element in the array.
   */
  value_type& back()
  {
    return _inarray_access_traits::back<value_type>(_array);
  }

  /**
   * @brief Get a constant reference to the last element.
   * @return Constant reference to the last element in the array.
   *
   * Version of @ref back() for const-qualified inline array objects.
   * Returns a constant reference instead.
   */
  value_type const& back() const
  {
    return _inarray_access_traits::back<value_type>(_array);
  }

  /**
   * @brief Get a reference to the first element.
   * @return Reference to the first element of the array.
   */
  value_type& front()
  {
    return _inarray_access_traits::front<value_type>(_array);
  }

  /**
   * @brief Get a constant reference to the first element.
   * @return Constant reference to the first element of the array.
   *
   * Version of @ref front() for const-qualified inline array objects.
   * Returns a constant reference instead.
   */
  value_type const& front() const
  {
    return _inarray_access_traits::front<value_type>(_array);
  }

  /**
   * @brief Get an iterator pointing to the first element of the array.
   * @return Iterator to the initial position of the array.
   *
   * This member function returns an iterator pointing to the first
   * element of the array. If the array is empty the returned iterator
   * is the same as the one returned by @ref end().
   */
  iterator begin()
  {
    return _inarray_access_traits::begin<value_type>(_array);
  }

  /**
   * @brief Get an iterator to the position following the last element of the array.
   * @return Iterator to the final position of the array.
   *
   * This member function returns an iterator to the position following
   * the last element in the array. If the array is empty the returned
   * iterator is the same as the one returned by @ref begin().
   *
   * @note Note that attempting to access this position causes undefined
   * behavior.
   */
  iterator end()
  {
    return _inarray_access_traits::end<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator pointing to the first element of the array.
   * @return Constant iterator to the initial position of the array.
   *
   * Version of @ref begin() for const-qualified inline array objects.
   * Returns a constant iterator instead.
   */
  const_iterator begin() const
  {
    return _inarray_access_traits::begin<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator to the position following the last element of the array.
   * @return Constant iterator to the final position of the array.
   *
   * Version of @ref end() for const-qualified inline array objects.
   * Returns a constant iterator instead.
   */
  const_iterator end() const
  {
    return _inarray_access_traits::end<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse begin of the array.
   * @return Constant reverse iterator pointing to the reverse begin of the array.
   *
   * Version of @ref rbegin() for const-qualified inline array objects.
   * Returns a constant reverse iterator instead.
   */
  const_reverse_iterator rbegin() const
  {
    return _inarray_access_traits::rbegin<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse end of the array.
   * @return Constant reverse iterator pointing to the reverse end of the array.
   *
   * Version of @ref rend() for const-qualified inline array objects.
   * Returns a constant reverse iterator instead.
   */
  const_reverse_iterator rend() const
  {
    return _inarray_access_traits::rend<value_type>(_array);
  }

  /**
   * @brief Get a reverse iterator pointing to the reverse begin of the array.
   * @return Reverse iterator pointing to the reverse begin of the array.
   *
   * This member function returns a reverse iterator pointing to the
   * last element of the array. If the array is empty the returned
   * reverse iterator is the same as the one returned by @ref rend().
   */
  reverse_iterator rbegin()
  {
    return _inarray_access_traits::rbegin<value_type>(_array);
  }

  /**
   * @brief Get a reverse iterator pointing to the reverse end of the array.
   * @return Reverse iterator pointing to the reverse end of the array.
   *
   * This member function returns a reverse iterator pointing to the
   * position before the first element of the array. If the array is
   * empty the returned iterator is the same as the one returned by
   * @ref rbegin().
   *
   * @note Note that attempting to access this position causes undefined
   * behavior.
   */
  reverse_iterator rend()
  {
    return _inarray_access_traits::rend<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator pointing to the first element of the array.
   * @return Constant iterator to the initial position of the array.
   *
   * This member function works like @ref begin() const but is granted
   * to return a constant iterator even for arrays that are not
   * const-qualified.
   */
  const_iterator cbegin() const
  {
    return _inarray_access_traits::cbegin<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator to the position following the last element of the array.
   * @return Constant iterator to the final position of the array.
   *
   * This member function works like @ref end() const  but is granted to
   * return a constant iterator even for arrays that are not
   * const-qualified.
   */
  const_iterator cend() const
  {
    return _inarray_access_traits::cend<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse begin of the array.
   * @return Constant reverse iterator pointing to the reverse begin of the array.
   *
   * This member function works like @ref rbegin() const but is granted
   * to return a constant reverse iterator even for arrays that are not
   * const-qualified.
   */
  const_reverse_iterator crbegin() const
  {
    return _inarray_access_traits::crbegin<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse end of the array.
   * @return Constant reverse iterator pointing to the reverse end of the array.
   *
   * This member function works like @ref rend() const but is granted to
   * return a constant reverse iterator even for arrays that are not
   * const-qualified.
   */
  const_reverse_iterator crend() const
  {
    return _inarray_access_traits::crend<value_type>(_array);
  }

  /**
   * @brief Swap content between two inline arrays.
   * @param other Other inline array of the same type.
   */
  void swap(_pod_inarray<T>& other)
  {
    std::swap(_array, other._array);
  }

  /**
   * @brief Get the maximum number of elements a inline array can hold.
   * @return Maximum number of elements a inline array can hold.
   */
  size_type max_size() const { return -1; }

  /**
   * @brief Get a handle for the wrapped Eina_Inarray.
   * @return Handle for the native Eina inline array.
   *
   * This member function returns the native Eina_Inarray handle that is
   * wrapped inside this object.
   *
   * @warning It is important to take care when using it, since the
   * handle will be automatically release upon object destruction.
   */
  native_handle_type native_handle()
  {
    return this->_array;
  }

  /**
   * @brief Get a constant handle for the wrapped Eina_Inarray.
   * @return Constant handle for the native Eina inline array.
   *
   * Version of @ref native_handle() for const-qualified objects.Returns
   * a constant handle instead.
   *
   * @see native_handle()
   */
  const_native_handle_type native_handle() const
  {
    return this->_array;
  }
};

template <typename T>
class _nonpod_inarray : _inarray_common_base
{
  typedef _inarray_common_base _base_type; /**< Type for the base class. */
public:
  typedef T value_type; /**< The type of each element. */
  typedef T& reference; /**< Type for a reference to an element. */
  typedef T const& const_reference; /**< Type for a constant reference to an element. */
  typedef T* pointer; /**< Type for a pointer to an element. */
  typedef T const* const_pointer; /**< Type for a constant pointer for an element. */

  /**
   * Type for a iterator to this kind of inline array.
   * Defined as a  @ref pointer for performance reasons.
   */
  typedef pointer iterator;

  /**
   * Type for a constant iterator for this kind of inline array.
   * Defined as a  @ref const_pointer for performance reasons.
   */
  typedef const_pointer const_iterator;
  typedef std::size_t size_type; /**< Type for size information used in the array. */
  typedef std::ptrdiff_t difference_type; /**< Type to represent the distance between two iterators. */

  typedef std::reverse_iterator<iterator> reverse_iterator; /** Type for the native @c Eina_Inarray handle. */
  typedef std::reverse_iterator<const_iterator> const_reverse_iterator; /** Type for constant native @c Eina_Inarray handle. */

  using _base_type::size;
  using _base_type::empty;

  /**
   * @brief Create a new object from a handle to a native Eina_Inarray.
   * @param array Handle to a native Eina_Inarray.
   *
   * This constructor wraps a pre-allocated Eina_Inarray providing an
   * OOP interface to it.
   *
   * @warning It is important to note that the created object gains
   * ownership of the handle, deallocating it at destruction time.
   */
  _nonpod_inarray(Eina_Inarray* array)
    : _base_type(array) {}

  /**
   * @brief Default constructor. Create an empty array.
   *
   * This constructor creates an array object with no elements. Elements
   * are declarated as having the same size of the given template
   * typename argument.
   */
  _nonpod_inarray() : _base_type(sizeof(T))
  {
  }

  /**
   * @brief Construct an array object with @p n copies of @p t.
   * @param n Number of elements.
   * @param t Value to be copied to each element.
   *
   * This constructor creates an inline array with @p n elements, each
   * one as a copy of @p t.
   */
  _nonpod_inarray(size_type n, value_type const& t) : _base_type(sizeof(T))
  {
    while(n--)
      push_back(t);
  }

  /**
   * @brief Create a inline array coping the elements from the given range.
   * @param i Iterator to the initial position. The element pointed by this iterator will be copied.
   * @param j Iterator to the final position. The element pointed by this iterator will NOT be copied.
   *
   * This constructor creates a inline array with copies of the elements
   * between @p i and @p j in the same order. Note that the ending
   * element (pointed by @p j) is excluded.
   */
  template <typename InputIterator>
  _nonpod_inarray(InputIterator i, InputIterator const& j
         , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
    : _base_type(sizeof(T))
  {
    while(i != j)
      {
        push_back(*i);
        ++i;
      }
  }

  /**
   * @brief Copy constructor. Creates a copy of the given inline array.
   * @param other Another inline array of the same type.
   *
   * This constructor creates an inline array containing a copy of each
   * element inside @p other in the same order.
   */
  _nonpod_inarray(_nonpod_inarray<T>const& other)
    : _base_type(sizeof(T))
  {
    insert(end(), other.begin(), other.end());
  }

  /**
   * @brief Destructor of array for non-POD elements.
   *
   * Calls the destructor of each allocated element, before the base
   * class destructor releases their memory.
   */
  ~_nonpod_inarray()
  {
    for(T* first = static_cast<T*>(_array->members)
          , *last = first + _array->len; first != last; ++first)
      first->~T();
  }

  /**
   * @brief Replace current content with the cotent of another array.
   * @param other Another inline array of the same type.
   *
   * This assignment operator replaces the content of the array by a
   * copy of the content of the given array @p other. The array size is
   * adjusted accordingly and the newly copied elements keep their
   * original order.
   */
  _nonpod_inarray<T>& operator=(_nonpod_inarray<T>const& other)
  {
    clear();
    insert(end(), other.begin(), other.end());
    return *this;
  }

  /**
   * @brief Remove all the elements of the array.
   */
  void clear()
  {
    for(T* first = static_cast<T*>(_array->members)
          , *last = first + _array->len; first != last; ++first)
      first->~T();
    ::eina_inarray_flush(_array);
  }

  /**
   * @brief Add a copy of the given element at the end of the array.
   * @param value Element to be added at the end of the array.
   *
   * This member function allocates a new element at the end of the
   * inline array, the content of @p value is copied to the new element.
   */
  void push_back(T const& value)
  {
    insert(end(), 1u, value);
  }

  /**
   * @brief Remove the last element of the array.
   */
  void pop_back()
  {
    T* elem = static_cast<T*>(_array->members) + _array->len - 1;
    elem->~T();
    eina_inarray_pop(_array);
  }

  /**
   * @brief Insert a new element at the given position.
   * @param i Iterator pointing to the position where the new element will be inserted.
   * @param t Value to be copied to the new element.
   * @return Iterator pointing to the new element inserted.
   *
   * This member function inserts a copy of the element @p t at the
   * position @p i. The new element comes right before the element
   * originally pointed by @p i.
   *
   * At the end, a valid iterator pointing to the element just inserted
   * is returned.
   */
  iterator insert(iterator i, value_type const& t)
  {
    return insert(i, 1u, t);
  }

  /**
   * @brief Insert @p n copies of @p t at the given position.
   * @param i Iterator pointing to the position where the new elements will be inserted.
   * @param n Number of elements to be inserted.
   * @param t Value to be copied to each new inserted element.
   * @return Iterator pointing to the first inserted element.
   *
   * This member function inserts @p n new elements at position @p i
   * in the array, each one as a copy of @p t. The new elements come
   * right before the element originally pointed by @p i.
   *
   * At the end, a valid iterator pointing to the first element inserted
   * is returned.
   */
  iterator insert(iterator i, size_t n, value_type const& t)
  {
    if(_array->max - _array->len >= n)
      {
        iterator end_ = static_cast<T*>(_array->members)
          + _array->len
          , last = end_ + n;
        _array->len += n;
        std::reverse_iterator<iterator>
          dest(last), src(end_), src_end(i);
        for(;src != src_end; ++src)
          {
            if(dest.base() <= end_)
                *dest++ = *src;
            else
              new (&*dest++) T(*src);
          }
        iterator j = i;
        for(size_type k = 0;k != n;++k)
          {
            if(j < end_)
                *j = t;
            else
              new (&*j++) T(t);
          }
      }
    else
      {
        size_type index = i - static_cast<iterator>(_array->members);

        Eina_Inarray* old_array = eina_inarray_new(_array->member_size, 0);
        *old_array = *_array;
        _array->len = _array->max = 0;
        _array->members = 0;
        eina_inarray_resize(_array, old_array->len+n);
        _array->len = old_array->len+n;

        iterator old_first = static_cast<iterator>(old_array->members)
          , first = begin()
          , last = first + _array->len;
        i = index + begin();

        while(first != i)
          {
            new (&*first++) T(*old_first);
            old_first++->~T();
          }
        for(size_type j = 0;j != n;++j)
          new (&*first++) T(t);
        std::size_t diff = last - first;
        static_cast<void>(diff);
        assert(diff == _array->len - index - n);
        static_cast<void>(diff);
        while(first != last)
          {
            new (&*first++) T(*old_first);
            old_first++->~T();
          }
      }
    return i;
  }

  /**
   * @brief Insert the elements between the given range at the given position.
   * @param p Iterator pointing to the position where the new elements will be inserted.
   * @param i Iterator to the initial position. The element pointed by this iterator will be copied.
   * @param j Iterator to the final position. The element pointed by this iterator will NOT be copied.
   * @return Iterator pointing to the first inserted element.
   *
   * This member function inserts a copy of the elements between @p i
   * and @p j at the position @p p. The new elements come right before
   * the element originally pointed by @p p. Note that the element
   * pointed by @p j is not copied.
   */
  template <typename InputIterator>
  iterator insert(iterator p, InputIterator i, InputIterator j
                  , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
  {
    size_type n = 0;
    while(i != j)
      {
        p = insert(p, *i);
        ++p;
        ++i;
        ++n;
      }
    return p - n;
  }

  /**
   * @brief Remove the element at the given position.
   * @param q Iterator pointing to the element to be removed.
   * @return Iterator pointing to the element after the removed one.
   *
   * This member function removes the element pointed by the iterator
   * @p q, reducing the array size by one. At the end, a valid iterator
   * pointing to the element right after the removed one is returned.
   */
  iterator erase(iterator q)
  {
    return erase(q, q+1);
  }

  /**
   * @brief Remove the elements between the given range.
   * @param i Iterator pointing to the starting position to be removed.
   * @param j Iterator pointing to the ending position to be removed.
   *          The element pointed by this iterator is not removed.
   * @return Iterator pointing to the new position of the first
   *         non-removed element after the removed ones (i.e. the one
   *         originally pointed by j).
   *
   * This member function removes the elements between the iterators
   * @p i and @p j, including the element pointed by @p i but not the
   * element pointed by @j.
   */
  iterator erase(iterator i, iterator j)
  {
    iterator last = end();
    iterator k = i, l = j;
    while(l != last)
      *k++ = *l++;
    while(k != last)
      k++->~T();
    _array->len -= j - i;

    return i;
  }

  /**
   * @brief Replace the content of the array by the elements in the given range.
   * @param i Iterator pointing to the beginning of the elements to be copied.
   * @param j Iterator pointing to the end of the elements to be copied.
   *          Note that the element pointed by j will NOT be copied.
   *
   * This member function replaces the current elements by copies of the
   * elements between the iterators @p i and @p j, including the element
   * pointed by @p i but not the one pointed by @p j. The size of the
   * array is adjusted accordingly and the newly copied elements remain
   * in their original order.
   */
  template <typename InputIterator>
  void assign(InputIterator i, InputIterator j
              , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0);

  /**
   * @brief Replace the content of the array by @p n copies @p t.
   * @param n Number of elements.
   * @param t Value to be copied to each element.
   */
  void assign(size_type n, value_type const& t);

  /**
   * @brief Get a reference to the element at the given position.
   * @param i Position of the element.
   * @return Reference to the element at the ith position.
   */
  value_type& operator[](size_type i)
  {
    return *(begin() + i);
  }


  /**
   * @brief Get a constant reference to the element at the given position.
   * @param i Position of the element.
   * @return Constant reference to the element at the ith position.
   *
   * Version of @ref operator[](size_type i) for const-qualified inline
   * array objects. Return a constant reference instead.
   */
  value_type const& operator[](size_type i) const
  {
    return const_cast<inarray<T>&>(*this)[i];
  }

  /**
   * @brief Get a reference to the last element.
   * @return Reference to the last element in the array.
   */
  value_type& back()
  {
    return _inarray_access_traits::back<value_type>(_array);
  }

  /**
   * @brief Get a constant reference to the last element.
   * @return Constant reference to the last element in the array.
   *
   * Version of @ref back() for const-qualified inline array objects.
   * Return a constant reference instead.
   */
  value_type const& back() const
  {
    return _inarray_access_traits::back<value_type>(_array);
  }

  /**
   * @brief Get a reference to the first element.
   * @return Reference to the first element of the array.
   */
  value_type& front()
  {
    return _inarray_access_traits::front<value_type>(_array);
  }

  /**
   * @brief Get a constant reference to the first element.
   * @return Constant reference to the first element of the array.
   *
   * Version of @ref front() for const-qualified inline array objects.
   * Return a constant reference instead.
   */
  value_type const& front() const
  {
    return _inarray_access_traits::front<value_type>(_array);
  }

  /**
   * @brief Get an iterator pointing to the first element of the array.
   * @return Iterator to the initial position of the array.
   *
   * This member function returns an iterator pointing to the first
   * element of the array. If the array is empty the returned iterator
   * is the same as the one returned by @ref end().
   */
  iterator begin()
  {
    return _inarray_access_traits::begin<value_type>(_array);
  }

  /**
   * @brief Get an iterator to the position following the last element of the array.
   * @return Iterator to the final position of the array.
   *
   * This member function returns an iterator to the position following
   * the last element in the array. If the array is empty the returned
   * iterator is the same as the one returned by @ref begin().
   * Note that attempting to access this position causes undefined
   * behavior.
   */
  iterator end()
  {
    return _inarray_access_traits::end<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator pointing to the first element of the array.
   * @return Constant iterator to the initial position of the array.
   *
   * Version of @ref begin() for const-qualified inline array objects.
   * Returns a constant iterator instead.
   */
  const_iterator begin() const
  {
    return _inarray_access_traits::begin<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator to the position following the last element of the array.
   * @return Constant iterator to the final position of the array.
   *
   * Version of @ref end() for const-qualified inline array objects.
   * Returns a constant iterator instead.
   */
  const_iterator end() const
  {
    return _inarray_access_traits::end<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse begin of the array.
   * @return Constant reverse iterator pointing to the reverse begin of the array.
   *
   * Version of @ref rbegin() for const-qualified inline array objects.
   * Returns a constant reverse iterator instead.
   */
  const_reverse_iterator rbegin() const
  {
    return _inarray_access_traits::rbegin<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse end of the array.
   * @return Constant reverse iterator pointing to the reverse end of the array.
   *
   * Version of @ref rend() for const-qualified inline array objects.
   * Returns a constant reverse iterator instead.
   */
  const_reverse_iterator rend() const
  {
    return _inarray_access_traits::rend<value_type>(_array);
  }

  /**
   * @brief Get a reverse iterator pointing to the reverse begin of the array.
   * @return Reverse iterator pointing to the reverse begin of the array.
   *
   * This member function returns a reverse iterator pointing to the
   * last element of the array. If the array is empty the returned
   * reverse iterator is the same as the one returned by @ref rend().
   */
  reverse_iterator rbegin()
  {
    return _inarray_access_traits::rbegin<value_type>(_array);
  }

  /**
   * @brief Get a reverse iterator pointing to the reverse end of the array.
   * @return Reverse iterator pointing to the reverse end of the array.
   *
   * This member function returns a reverse iterator pointing to the
   * position before the first element of the array. If the array is
   * empty the returned iterator is the same as the one returned by
   * @ref rbegin().
   *
   * @note Note that attempting to access this position causes undefined
   * behavior.
   */
  reverse_iterator rend()
  {
    return _inarray_access_traits::rend<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator pointing to the first element of the array.
   * @return Constant iterator to the initial position of the array.
   *
   * This member function works like the constant overload of @ref begin()
   * but is granted to return a constant iterator even for arrays that
   * are not const-qualified.
   */
  const_iterator cbegin() const
  {
    return _inarray_access_traits::cbegin<value_type>(_array);
  }

  /**
   * @brief Get a constant iterator to the position following the last element of the array.
   * @return Constant iterator to the final position of the array.
   *
   * This member function works like the constant overload of @ref end()
   * but is granted to return a constant iterator even for arrays that
   * are not const-qualified.
   */
  const_iterator cend() const
  {
    return _inarray_access_traits::cend<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse begin of the array.
   * @return Constant reverse iterator pointing to the reverse begin of the array.
   *
   * This member function works like the constant overload of @ref rbegin()
   * but is granted to return a constant reverse iterator even for
   * arrays that are not const-qualified.
   */
  const_reverse_iterator crbegin() const
  {
    return _inarray_access_traits::crbegin<value_type>(_array);
  }

  /**
   * @brief Get a constant reverse iterator pointing to the reverse end of the array.
   * @return Constant reverse iterator pointing to the reverse end of the array.
   *
   * This member function works like the constant overload of @ref rend()
   * but is granted to return a constant reverse iterator even for
   * arrays that are not const-qualified.
   */
  const_reverse_iterator crend() const
  {
    return _inarray_access_traits::crend<value_type>(_array);
  }

  /**
   * @brief Swap content between two inline arrays.
   * @param other Other inline array of the same type.
   */
  void swap(_nonpod_inarray<T>& other)
  {
    std::swap(_array, other._array);
  }

  /**
   * @brief Get the maximum number of elements a inline array can hold.
   * @return Maximum number of elements a inline array can hold.
   */
  size_type max_size() const { return -1; }

  /**
   * @brief Get the handle for the wrapped Eina_Inarray.
   * @return Internal handle for the native Eina inline array.
   *
   * This member function returns the native Eina_Inarray handle that is
   * wrapped inside this object. It is important to take care when using
   * it, since the handle will be automatically release upon object
   * destruction.
   */
  Eina_Inarray* native_handle()
  {
    return this->_array;
  }

  /**
   * @brief Get the handle for the wrapped Eina_Inarray.
   * @return Internal handle for the native Eina inline array.
   *
   * This member function returns the native Eina_Inarray handle that is
   * wrapped inside this object. It is important to take care when using
   * it, since the handle will be automatically release upon object
   * destruction.
   */
  Eina_Inarray const* native_handle() const
  {
    return this->_array;
  }
};


/**
 * Inline array class. It provides an OOP interface to the
 * @c Eina_Inarray functions, and automatically take care of allocating
 * and deallocating resources using the RAII programming idiom.
 *
 * It also provides additional member functions to facilitate the access
 * to the array content, much like a STL vector.
 */
template <typename T>
class inarray : public eina::if_<eina::is_pod<T>, _pod_inarray<T>
                                 , _nonpod_inarray<T> >::type
{
  typedef typename eina::if_<eina::is_pod<T>, _pod_inarray<T>
                             , _nonpod_inarray<T> >::type _base_type; /**< Type for the base class. */
public:

  /**
   * @brief Create a new object from a handle to a native Eina_Inarray.
   * @param array Handle to a native Eina_Inarray.
   *
   * This constructor wraps a pre-allocated Eina_Inarray providing an
   * OOP interface to it.
   *
   * @warning It is important to note that the created object gains
   * ownership of the handle, deallocating it at destruction time.
   */
  inarray(Eina_Inarray* array)
    : _base_type(array) {}

  /**
   * @brief Default constructor. Creates an empty array.
   */
  inarray() : _base_type() {}

  /**
   * @brief Construct an array object with @p n copies of @p t.
   * @param n Number of elements.
   * @param t Value to be copied to each element.
   *
   * This constructor creates an inline array with @p n elements, each
   * one as a copy of @p t.
   */
  inarray(typename _base_type::size_type n, typename _base_type::value_type const& t)
    : _base_type(n, t) {}

  /**
   * @brief Create a inline array with elements from the given range.
   * @param i Iterator to the initial position. The element pointed by this iterator will be copied.
   * @param j Iterator to the final position. The element pointed by this iterator will NOT be copied.
   *
   * This constructor creates a inline array with copies of the elements
   * between @p i and @p j in the same order.
   *
   * @note The ending element (pointed by @p j) is not copied.
   */
  template <typename InputIterator>
  inarray(InputIterator i, InputIterator const& j
          , typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
    : _base_type(i, j)
  {}

};

/**
 * @brief Check if two inline arrays are equal.
 * @param lhs Inline array at the left side of the expression.
 * @param rhs Inline array at the right side of the expression.
 * @return @c true if the arrays are equals, @c false otherwise.
 *
 * This operator checks if the given inline arrays are equal. To be
 * considered equal both arrays need to have the same number of
 * elements, and each element in one array must be equal to the element
 * at the same position in the other array.
 */
template <typename T>
bool operator==(inarray<T> const& lhs, inarray<T> const& rhs)
{
  return lhs.size() == rhs.size() &&
    std::equal(lhs.begin(), lhs.end(), rhs.begin());
}

/**
 * @brief Check if two inline arrays are different.
 * @param lhs Inline array at the left side of the expression.
 * @param rhs Inline array at the right side of the expression.
 * @return @c true if the arrays are not equal , @c false otherwise.
 *
 * This operator returns the opposite of @ref operator==(inarray<T> const& lhs, inarray<T> const& rhs).
 */
template <typename T>
bool operator!=(inarray<T> const& lhs, inarray<T> const& rhs)
{
  return !(lhs == rhs);
}

/**
 * @brief Swap content between two inline arrays.
 * @param other Other inline array of the same type.
 */
template <typename T>
void swap(inarray<T>& lhs, inarray<T>& rhs)
{
  lhs.swap(rhs);
}

/**
 * @}
 */

} }

/**
 * @}
 */

#endif