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
|
// file : common/composite-id/test.hxx
// copyright : Copyright (c) 2009-2015 Code Synthesis Tools CC
// license : GNU GPL v2; see accompanying LICENSE file
#ifndef TEST_HXX
#define TEST_HXX
#include <string>
#include <vector>
#include <odb/core.hxx>
#pragma db value
struct scomp
{
scomp () {}
scomp (std::string const& s1, std::string const& s2, std::string const& s3)
: str1 (s1), str2 (s2), str3 (s3)
{
}
std::string str1;
std::string str2;
std::string str3;
};
inline bool
operator== (const scomp& x, const scomp& y)
{
return x.str1 == y.str1 && x.str2 == y.str2 && x.str3 == y.str3;
}
inline bool
operator< (const scomp& x, const scomp& y)
{
return x.str1 < y.str1 ||
(x.str1 == y.str1 && x.str2 < y.str2) ||
(x.str1 == y.str1 && x.str2 == y.str2 && x.str3 < y.str3);
}
#pragma db value
struct ncomp
{
ncomp () {}
ncomp (unsigned short n1, unsigned short n2, unsigned short n3)
: num1 (n1), num2 (n2), num3 (n3)
{
}
unsigned short num1;
unsigned short num2;
unsigned short num3;
};
inline bool
operator== (const ncomp& x, const ncomp& y)
{
return x.num1 == y.num1 && x.num2 == y.num2 && x.num3 == y.num3;
}
inline bool
operator< (const ncomp& x, const ncomp& y)
{
return x.num1 < y.num1 ||
(x.num1 == y.num1 && x.num2 < y.num2) ||
(x.num1 == y.num1 && x.num2 == y.num2 && x.num3 < y.num3);
}
// Test object with composite id, container.
//
#pragma db namespace table("t1_")
namespace test1
{
#pragma db object
struct object
{
object () {}
object (scomp const& i, unsigned long n): id (i), num (n) {}
#pragma db id
scomp id;
unsigned long num;
std::vector<scomp> vec;
};
inline bool
operator== (const object& x, const object& y)
{
return x.id == y.id && x.num == y.num && x.vec == y.vec;
}
}
// Test to-one and to-many relationships with composite id as well as
// queries and views.
//
#pragma db namespace table("t2_")
namespace test2
{
#pragma db object
struct object1
{
object1 () {}
object1 (scomp const& i): id (i) {}
#pragma db id
scomp id;
};
#pragma db object
struct object2
{
object2 (): o1 (0) {}
object2 (ncomp const& i): id (i), o1 (0) {}
~object2 () {delete o1;}
#pragma db id
ncomp id;
object1* o1;
};
#pragma db object
struct object3
{
object3 () {}
object3 (ncomp const& i): id (i) {}
~object3 ()
{
for (std::vector<object1*>::iterator i (o1.begin ());
i != o1.end (); ++i)
delete *i;
}
#pragma db id
ncomp id;
std::vector<object1*> o1;
};
// Test second-level query pointer test as well as pointers in
// composite types.
//
#pragma db value
struct comp
{
comp (): o2 (0) {}
~comp () {delete o2;}
object2* o2;
};
#pragma db object
struct object4
{
object4 () {}
object4 (ncomp const& i): id (i) {}
#pragma db id
ncomp id;
comp c;
};
#pragma db view object(object2) object(object1)
struct view2
{
#pragma db column (object2::id.num3)
unsigned short num;
#pragma db column (object1::id.str3)
std::string str;
};
#pragma db view object(object3) object(object1)
struct view3
{
#pragma db column (object3::id.num3)
unsigned short num;
#pragma db column (object1::id.str3)
std::string str;
};
#pragma db view object(object4) object(object2) object(object1)
struct view4
{
#pragma db column (object4::id.num3)
unsigned short num4;
#pragma db column (object2::id.num3)
unsigned short num2;
#pragma db column (object1::id.str3)
std::string str;
};
}
// Test one-to-one(i) relationship with composite id.
//
#pragma db namespace table("t3_")
namespace test3
{
struct object2;
#pragma db object
struct object1
{
object1 () {}
object1 (scomp const& i): id (i) {}
#pragma db id
scomp id;
#pragma db inverse(o1)
object2* o2;
};
#pragma db object
struct object2
{
object2 (): o1 (0) {}
object2 (ncomp const& i): id (i), o1 (0) {}
~object2 () {delete o1;}
#pragma db id
ncomp id;
object1* o1;
};
#pragma db view object(object2) object(object1)
struct view
{
#pragma db column (object2::id.num3)
unsigned short num;
#pragma db column (object1::id.str3)
std::string str;
};
}
// Test many-to-one(i) relationship with composite id.
//
#pragma db namespace table("t4_")
namespace test4
{
struct object2;
#pragma db object
struct object1
{
object1 () {}
object1 (scomp const& i): id (i) {}
#pragma db id
scomp id;
#pragma db inverse(o1)
object2* o2;
};
#pragma db object
struct object2
{
object2 () {}
object2 (ncomp const& i): id (i) {}
~object2 ()
{
for (std::vector<object1*>::iterator i (o1.begin ());
i != o1.end (); ++i)
delete *i;
}
#pragma db id
ncomp id;
std::vector<object1*> o1;
};
#pragma db view object(object2) object(object1)
struct view
{
#pragma db column (object2::id.num3)
unsigned short num;
#pragma db column (object1::id.str3)
std::string str;
};
}
// Test one-to-many(i) relationship with composite id.
//
#pragma db namespace table("t5_")
namespace test5
{
struct object2;
#pragma db object
struct object1
{
object1 () {}
object1 (scomp const& i): id (i) {}
#pragma db id
scomp id;
object2* o2;
};
#pragma db object
struct object2
{
object2 () {}
object2 (ncomp const& i): id (i) {}
~object2 ()
{
for (std::vector<object1*>::iterator i (o1.begin ());
i != o1.end (); ++i)
delete *i;
}
#pragma db id
ncomp id;
#pragma db inverse(o2)
std::vector<object1*> o1;
};
#pragma db view object(object2) object(object1)
struct view
{
#pragma db column (object2::id.num3)
unsigned short num;
#pragma db column (object1::id.str3)
std::string str;
};
}
// Test many-to-many(i) relationship with composite id.
//
#pragma db namespace table("t6_")
namespace test6
{
struct object2;
#pragma db object
struct object1
{
object1 () {}
object1 (scomp const& i): id (i) {}
#pragma db id
scomp id;
std::vector<object2*> o2;
};
#pragma db object
struct object2
{
object2 () {}
object2 (ncomp const& i): id (i) {}
~object2 ()
{
for (std::vector<object1*>::iterator i (o1.begin ());
i != o1.end (); ++i)
delete *i;
}
#pragma db id
ncomp id;
#pragma db inverse(o2)
std::vector<object1*> o1;
};
#pragma db view object(object2) object(object1)
struct view
{
#pragma db column (object2::id.num3)
unsigned short num;
#pragma db column (object1::id.str3)
std::string str;
};
}
// Test object with composite id and version (optimistic concurrency).
//
#pragma db namespace table("t7_")
namespace test7
{
#pragma db object optimistic
struct object
{
object () {}
object (scomp const& i, unsigned long n): id (i), num (n) {}
#pragma db id
scomp id;
#pragma db version
unsigned long ver;
unsigned long num;
};
inline bool
operator== (const object& x, const object& y)
{
return x.id == y.id && x.ver == y.ver && x.num == y.num;
}
}
// Test composite NULL pointers.
//
#pragma db namespace table("t8_")
namespace test8
{
#pragma db object
struct object1
{
object1 () {}
object1 (scomp const& i, unsigned long n): id (i), num (n) {}
#pragma db id
scomp id;
unsigned long num;
};
inline bool
operator== (const object1& x, const object1& y)
{
return x.id == y.id && x.num == y.num;
}
#pragma db object
struct object2
{
object2 (): o1 (0) {}
~object2 () {delete o1;}
#pragma db id auto
unsigned long id;
object1* o1;
};
#pragma db object
struct object3
{
~object3 ()
{
for (std::vector<object1*>::iterator i (o1.begin ());
i != o1.end (); ++i)
delete *i;
}
#pragma db id auto
unsigned long id;
std::vector<object1*> o1;
};
}
// Test composite id definition inside object.
//
#pragma db namespace table("t9_")
namespace test9
{
#pragma db object
struct object
{
object (unsigned long n = 0, const std::string& s = "")
{
id_.num = n;
id_.str = s;
}
unsigned long num () const {return id_.num;}
const std::string& str () const {return id_.str;}
std::vector<int> v;
private:
friend class odb::access;
#pragma db value
struct comp
{
unsigned long num;
std::string str;
bool
operator< (const comp& x) const
{
return num < x.num || (num == x.num && str < x.str);
}
};
#pragma db id
comp id_;
};
inline bool
operator== (const object& x, const object& y)
{
return x.num () == y.num () && x.str () == y.str () && x.v == y.v;
}
}
#endif // TEST_HXX
|