|
132
|
1 /*
|
|
|
2 * Copyright (C) 2004-2005 by Digital Mars, www.digitalmars.com
|
|
|
3 * Written by Walter Bright
|
|
|
4 *
|
|
|
5 * This software is provided 'as-is', without any express or implied
|
|
|
6 * warranty. In no event will the authors be held liable for any damages
|
|
|
7 * arising from the use of this software.
|
|
|
8 *
|
|
|
9 * Permission is granted to anyone to use this software for any purpose,
|
|
|
10 * including commercial applications, and to alter it and redistribute it
|
|
|
11 * freely, in both source and binary form, subject to the following
|
|
|
12 * restrictions:
|
|
|
13 *
|
|
|
14 * o The origin of this software must not be misrepresented; you must not
|
|
|
15 * claim that you wrote the original software. If you use this software
|
|
|
16 * in a product, an acknowledgment in the product documentation would be
|
|
|
17 * appreciated but is not required.
|
|
|
18 * o Altered source versions must be plainly marked as such, and must not
|
|
|
19 * be misrepresented as being the original software.
|
|
|
20 * o This notice may not be removed or altered from any source
|
|
|
21 * distribution.
|
|
|
22 */
|
|
|
23
|
|
|
24 module typeinfo.ti_Acdouble;
|
|
|
25
|
|
|
26 private import typeinfo.ti_cdouble;
|
|
|
27
|
|
|
28 // cdouble[]
|
|
|
29
|
|
|
30 class TypeInfo_Ar : TypeInfo
|
|
|
31 {
|
|
|
32 char[] toString() { return "cdouble[]"; }
|
|
|
33
|
|
|
34 hash_t getHash(void *p)
|
|
|
35 { cdouble[] s = *cast(cdouble[]*)p;
|
|
|
36 size_t len = s.length;
|
|
|
37 cdouble *str = s.ptr;
|
|
|
38 hash_t hash = 0;
|
|
|
39
|
|
|
40 while (len)
|
|
|
41 {
|
|
|
42 hash *= 9;
|
|
|
43 hash += (cast(uint *)str)[0];
|
|
|
44 hash += (cast(uint *)str)[1];
|
|
|
45 hash += (cast(uint *)str)[2];
|
|
|
46 hash += (cast(uint *)str)[3];
|
|
|
47 str++;
|
|
|
48 len--;
|
|
|
49 }
|
|
|
50
|
|
|
51 return hash;
|
|
|
52 }
|
|
|
53
|
|
|
54 int equals(void *p1, void *p2)
|
|
|
55 {
|
|
|
56 cdouble[] s1 = *cast(cdouble[]*)p1;
|
|
|
57 cdouble[] s2 = *cast(cdouble[]*)p2;
|
|
|
58 size_t len = s1.length;
|
|
|
59
|
|
|
60 if (len != s2.length)
|
|
|
61 return 0;
|
|
|
62 for (size_t u = 0; u < len; u++)
|
|
|
63 {
|
|
|
64 int c = TypeInfo_r._equals(s1[u], s2[u]);
|
|
|
65 if (c == 0)
|
|
|
66 return 0;
|
|
|
67 }
|
|
|
68 return 1;
|
|
|
69 }
|
|
|
70
|
|
|
71 int compare(void *p1, void *p2)
|
|
|
72 {
|
|
|
73 cdouble[] s1 = *cast(cdouble[]*)p1;
|
|
|
74 cdouble[] s2 = *cast(cdouble[]*)p2;
|
|
|
75 size_t len = s1.length;
|
|
|
76
|
|
|
77 if (s2.length < len)
|
|
|
78 len = s2.length;
|
|
|
79 for (size_t u = 0; u < len; u++)
|
|
|
80 {
|
|
|
81 int c = TypeInfo_r._compare(s1[u], s2[u]);
|
|
|
82 if (c)
|
|
|
83 return c;
|
|
|
84 }
|
|
|
85 if (s1.length < s2.length)
|
|
|
86 return -1;
|
|
|
87 else if (s1.length > s2.length)
|
|
|
88 return 1;
|
|
|
89 return 0;
|
|
|
90 }
|
|
|
91
|
|
|
92 size_t tsize()
|
|
|
93 {
|
|
|
94 return (cdouble[]).sizeof;
|
|
|
95 }
|
|
|
96
|
|
|
97 uint flags()
|
|
|
98 {
|
|
|
99 return 1;
|
|
|
100 }
|
|
|
101
|
|
|
102 TypeInfo next()
|
|
|
103 {
|
|
|
104 return typeid(cdouble);
|
|
|
105 }
|
|
|
106 }
|
