Searched refs:unordered (Results 1 – 15 of 15) sorted by relevance
/external/qemu/fpu/ |
D | softfloat-native.h | 34 #define unordered(x, y) (isnan(x) || isnan(y)) macro 57 #define isgreater(x, y) ((!unordered(x, y)) && ((x) > (y))) 58 #define isgreaterequal(x, y) ((!unordered(x, y)) && ((x) >= (y))) 59 #define isless(x, y) ((!unordered(x, y)) && ((x) < (y))) 60 #define islessequal(x, y) ((!unordered(x, y)) && ((x) <= (y))) 61 #define isunordered(x,y) unordered(x, y)
|
/external/e2fsprogs/tests/f_h_badroot/ |
D | expect.1 | 20 Problem in HTREE directory inode 80065: node (0) has an unordered hash table
|
/external/e2fsprogs/po/ |
D | de.po | 1925 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1927 msgid "@p @h %d: node (%B) has an unordered hash table\n" 1928 msgstr "@p @h %d: node (%B) has an unordered hash table\n"
|
D | e2fsprogs.pot | 1853 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1854 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | ca.po | 1854 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1856 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | nl.po | 1920 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1922 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | sv.po | 1933 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1935 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | it.po | 2003 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 2005 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | pl.po | 1916 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1918 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | cs.po | 1918 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1920 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | tr.po | 1965 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1967 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
D | vi.po | 1917 #. @-expanded: problem in HTREE directory inode %d: node (%B) has an unordered hash table\n 1919 msgid "@p @h %d: node (%B) has an unordered hash table\n"
|
/external/dropbear/libtomcrypt/ |
D | crypt.tex | 4361 be carefully noted. The SET type is an unordered array of ASN.1 types sorted by the TAG (type iden… 4416 The routine will first encode the SET OF in an unordered fashion (in a temporary buffer) then sort …
|
/external/webkit/WebCore/ |
D | ChangeLog-2007-10-14 | 42769 …<rdar://problem/4966982> 64-bit: In a unordered list, TYPE=DISC and TYPE=CIRCLE attribute values a… 47628 marks the result as unordered; we can consider using merge sort to avoid this.
|
/external/webkit/JavaScriptCore/ |
D | ChangeLog-2009-06-16 | 843 this comparison would actually give you not-equal-or-unordered, which
|