1 /*-
2 * Copyright (c) 2004 - 2011 CTPP Team
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * 4. Neither the name of the CTPP Team nor the names of its contributors
13 * may be used to endorse or promote products derived from this software
14 * without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 *
28 * CTPP2BitIndex.cpp
29 *
30 * $CTPP$
31 */
32 #include <stdio.h>
33 #include <CTPP2BitIndex.hpp>
34
35 #ifdef HAVE_SYSEXITS_H
36 #include <sysexits.h>
37 #endif
38
39 using namespace CTPP;
40
41 #define C_BITS_NUM 13
42
main(void)43 int main(void)
44 {
45 BitIndex oBitIndex(C_BITS_NUM);
46
47 for (UINT_32 iI = 0; iI < C_BITS_NUM; ++iI)
48 {
49 oBitIndex.SetBit(iI, iI % 2);
50 fprintf(stderr, "%c", (iI % 2) ? '1' : '0');
51 }
52 fprintf(stderr, "\n");
53
54 for (UINT_32 iI = 0; iI < C_BITS_NUM; ++iI)
55 {
56 fprintf(stderr, "%c", oBitIndex.GetBit(iI) ? '1' : '0');
57 }
58 fprintf(stderr, "\n");
59
60 oBitIndex.SetBit(0, 1);
61 oBitIndex.SetBit(1, 1);
62 oBitIndex.SetBit(2, 1);
63
64 oBitIndex.SetBit(3, 0);
65 oBitIndex.SetBit(4, 0);
66 oBitIndex.SetBit(5, 0);
67
68 oBitIndex.SetBit(6, 1);
69 oBitIndex.SetBit(7, 1);
70 oBitIndex.SetBit(8, 1);
71
72 for (UINT_32 iI = 0; iI < C_BITS_NUM; ++iI)
73 {
74 fprintf(stderr, "%c", oBitIndex.GetBit(iI) ? '1' : '0');
75 }
76 fprintf(stderr, "\nExpand index:\n");
77
78 for (UINT_32 iI = C_BITS_NUM; iI < C_BITS_NUM * 2; ++iI)
79 {
80 oBitIndex.SetBit(iI, 0);
81 fprintf(stderr, "Bit %d, used bytes: %d\n", iI, oBitIndex.GetUsedSize());
82 }
83 fprintf(stderr, "\n");
84
85 for (UINT_32 iI = C_BITS_NUM; iI < C_BITS_NUM * 2; ++iI)
86 {
87 oBitIndex.SetBit(iI, iI % 2);
88 fprintf(stderr, "%c", (iI % 2) ? '1' : '0');
89 }
90 fprintf(stderr, "\n");
91
92 for (UINT_32 iI = 0; iI < C_BITS_NUM * 2; ++iI)
93 {
94 fprintf(stderr, "%c", oBitIndex.GetBit(iI) ? '1' : '0');
95 }
96 fprintf(stderr, "\n");
97
98 // make valgrind happy
99 fclose(stdin);
100 fclose(stdout);
101 fclose(stderr);
102
103 return EX_OK;
104 }
105 // End.
106
107