2 * Copyright (C) 2004-2005 by Digital Mars, www.digitalmars.com
3 * Written by Walter Bright
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.
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
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
24 module rt.typeinfo.ti_Adouble;
26 private import typeinfo.ti_double;
30 class TypeInfo_Ad : TypeInfo
32 string toString() { return "double[]"; }
34 hash_t getHash(in void* p)
35 { double[] s = *cast(double[]*)p;
36 size_t len = s.length;
43 hash += (cast(uint *)str)[0];
44 hash += (cast(uint *)str)[1];
52 equals_t equals(in void* p1, in void* p2)
54 double[] s1 = *cast(double[]*)p1;
55 double[] s2 = *cast(double[]*)p2;
56 size_t len = s1.length;
60 for (size_t u = 0; u < len; u++)
62 int c = TypeInfo_d._equals(s1[u], s2[u]);
69 int compare(in void* p1, in void* p2)
71 double[] s1 = *cast(double[]*)p1;
72 double[] s2 = *cast(double[]*)p2;
73 size_t len = s1.length;
77 for (size_t u = 0; u < len; u++)
79 int c = TypeInfo_d._compare(s1[u], s2[u]);
83 if (s1.length < s2.length)
85 else if (s1.length > s2.length)
92 return (double[]).sizeof;
102 return typeid(double);
108 class TypeInfo_Ap : TypeInfo_Ad
110 string toString() { return "idouble[]"; }
114 return typeid(idouble);