| /external/libcxx/test/std/localization/locale.stdcvt/ |
| D | codecvt_utf16_length.pass.cpp | 31 char n[4] = {char(0xD8), char(0xC0), char(0xDC), char(0x03)}; in main() local
33 int r = c.length(m, n, n+4, 2); in main()
36 n[0] = char(0x10); in main()
37 n[1] = char(0x05); in main()
38 r = c.length(m, n, n+2, 2); in main()
41 n[0] = char(0x04); in main()
42 n[1] = char(0x53); in main()
43 r = c.length(m, n, n+2, 2); in main()
46 n[0] = char(0x00); in main()
47 n[1] = char(0x56); in main()
[all …]
|
| D | codecvt_utf8_length.pass.cpp | 31 char n[4] = {char(0xF1), char(0x80), char(0x80), char(0x83)}; in main() local
33 int r = c.length(m, n, n+4, 1); in main()
36 n[0] = char(0xE1); in main()
37 n[1] = char(0x80); in main()
38 n[2] = char(0x85); in main()
39 r = c.length(m, n, n+3, 2); in main()
42 n[0] = char(0xD1); in main()
43 n[1] = char(0x93); in main()
44 r = c.length(m, n, n+2, 3); in main()
47 n[0] = char(0x56); in main()
[all …]
|
| D | codecvt_utf8_utf16_length.pass.cpp | 31 char n[4] = {char(0xF1), char(0x80), char(0x80), char(0x83)}; in main() local
33 int r = c.length(m, n, n+4, 2); in main()
36 n[0] = char(0xE1); in main()
37 n[1] = char(0x80); in main()
38 n[2] = char(0x85); in main()
39 r = c.length(m, n, n+3, 2); in main()
42 n[0] = char(0xD1); in main()
43 n[1] = char(0x93); in main()
44 r = c.length(m, n, n+2, 2); in main()
47 n[0] = char(0x56); in main()
[all …]
|
| D | codecvt_utf16_out.pass.cpp | 50 char n[4] = {0}; in test() local
54 std::codecvt_base::result r = c.out(m, &w, &w + 1, wp, n, n + 4, np); in test()
57 assert(np == n + 4); in test()
58 assert(n[0] == char(0xD8)); in test()
59 assert(n[1] == char(0xC0)); in test()
60 assert(n[2] == char(0xDC)); in test()
61 assert(n[3] == char(0x03)); in test()
64 r = c.out(m, &w, &w + 1, wp, n, n + 4, np); in test()
67 assert(np == n + 2); in test()
68 assert(n[0] == char(0x10)); in test()
[all …]
|
| D | codecvt_utf8_out.pass.cpp | 47 char n[4] = {0}; in test() local
51 std::codecvt_base::result r = c.out(m, &w, &w + 1, wp, n, n + 4, np); in test()
54 assert(np == n + 3); in test()
55 assert(n[0] == char(0xE1)); in test()
56 assert(n[1] == char(0x80)); in test()
57 assert(n[2] == char(0x85)); in test()
58 assert(n[3] == char(0)); in test()
61 r = c.out(m, &w, &w + 1, wp, n, n + 4, np); in test()
64 assert(np == n + 2); in test()
65 assert(n[0] == char(0xD1)); in test()
[all …]
|
| /external/u-boot/include/linux/ |
| D | log2.h | 27 int __ilog2_u32(u32 n) in __ilog2_u32() argument
29 return fls(n) - 1; in __ilog2_u32()
35 int __ilog2_u64(u64 n) in __ilog2_u64() argument
37 return fls64(n) - 1; in __ilog2_u64()
50 bool is_power_of_2(unsigned long n) in is_power_of_2() argument
52 return (n != 0 && ((n & (n - 1)) == 0)); in is_power_of_2()
60 unsigned long __roundup_pow_of_two(unsigned long n) in __roundup_pow_of_two() argument
62 return 1UL << fls_long(n - 1); in __roundup_pow_of_two()
70 unsigned long __rounddown_pow_of_two(unsigned long n) in __rounddown_pow_of_two() argument
72 return 1UL << (fls_long(n) - 1); in __rounddown_pow_of_two()
[all …]
|
| /external/tensorflow/tensorflow/contrib/autograph/examples/notebooks/ |
| D | algorithms.ipynb | 10 "## AutoGraph: examples of simple algorithms\n",
11 "\n",
12 …tebook shows how you can use AutoGraph to compile simple algorithms and run them in TensorFlow.\n",
13 "\n",
42 "### Fibonacci numbers\n",
43 "\n",
78 "0 : 1\n",
79 "1 : 2\n",
80 "2 : 3\n",
81 "3 : 5\n",
[all …]
|
| /external/flac/libFLAC/ |
| D | window.c | 49 FLAC__int32 n; in FLAC__window_bartlett() local
52 for (n = 0; n <= N/2; n++) in FLAC__window_bartlett()
53 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett()
54 for (; n <= N; n++) in FLAC__window_bartlett()
55 window[n] = 2.0f - 2.0f * n / (float)N; in FLAC__window_bartlett()
58 for (n = 0; n <= L/2-1; n++) in FLAC__window_bartlett()
59 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett()
60 for (; n <= N; n++) in FLAC__window_bartlett()
61 window[n] = 2.0f - 2.0f * n / (float)N; in FLAC__window_bartlett()
68 FLAC__int32 n; in FLAC__window_bartlett_hann() local
[all …]
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/ |
| D | HashCodeVisitor.java | 51 public Integer visit(final AnnotationDeclaration n, final Void arg) { in visit() argument
52 …n.getMembers().accept(this, arg)) * 31 + (n.getModifiers().hashCode()) * 31 + (n.getName().accept(… in visit()
56 public Integer visit(final AnnotationMemberDeclaration n, final Void arg) { in visit() argument
57 …n.getDefaultValue().isPresent() ? n.getDefaultValue().get().accept(this, arg) : 0) * 31 + (n.getMo… in visit()
61 public Integer visit(final ArrayAccessExpr n, final Void arg) { in visit() argument
62 …return (n.getIndex().accept(this, arg)) * 31 + (n.getName().accept(this, arg)) * 31 + (n.getCommen… in visit()
66 public Integer visit(final ArrayCreationExpr n, final Void arg) { in visit() argument
67 …n.getElementType().accept(this, arg)) * 31 + (n.getInitializer().isPresent() ? n.getInitializer().… in visit()
71 public Integer visit(final ArrayCreationLevel n, final Void arg) { in visit() argument
72 …n.getAnnotations().accept(this, arg)) * 31 + (n.getDimension().isPresent() ? n.getDimension().get(… in visit()
[all …]
|
| D | NoCommentHashCodeVisitor.java | 43 public Integer visit(final AnnotationDeclaration n, final Void arg) { in visit() argument
44 …return (n.getMembers().accept(this, arg)) * 31 + (n.getModifiers().hashCode()) * 31 + (n.getName()… in visit()
48 public Integer visit(final AnnotationMemberDeclaration n, final Void arg) { in visit() argument
49 …n.getDefaultValue().isPresent() ? n.getDefaultValue().get().accept(this, arg) : 0) * 31 + (n.getMo… in visit()
53 public Integer visit(final ArrayAccessExpr n, final Void arg) { in visit() argument
54 return (n.getIndex().accept(this, arg)) * 31 + (n.getName().accept(this, arg)); in visit()
58 public Integer visit(final ArrayCreationExpr n, final Void arg) { in visit() argument
59 …return (n.getElementType().accept(this, arg)) * 31 + (n.getInitializer().isPresent() ? n.getInitia… in visit()
63 public Integer visit(final ArrayCreationLevel n, final Void arg) { in visit() argument
64 …return (n.getAnnotations().accept(this, arg)) * 31 + (n.getDimension().isPresent() ? n.getDimensio… in visit()
[all …]
|
| D | ModifierVisitor.java | 54 public Visitable visit(final AnnotationDeclaration n, final A arg) { in visit() argument
55 NodeList<BodyDeclaration<?>> members = modifyList(n.getMembers(), arg); in visit()
56 SimpleName name = (SimpleName) n.getName().accept(this, arg); in visit()
57 NodeList<AnnotationExpr> annotations = modifyList(n.getAnnotations(), arg); in visit()
58 Comment comment = n.getComment().map(s -> (Comment) s.accept(this, arg)).orElse(null); in visit()
61 n.setMembers(members); in visit()
62 n.setName(name); in visit()
63 n.setAnnotations(annotations); in visit()
64 n.setComment(comment); in visit()
65 return n; in visit()
[all …]
|
| D | ObjectIdentityHashCodeVisitor.java | 47 public Integer visit(final AnnotationDeclaration n, final Void arg) { in visit() argument
48 return n.hashCode(); in visit()
52 public Integer visit(final AnnotationMemberDeclaration n, final Void arg) { in visit() argument
53 return n.hashCode(); in visit()
57 public Integer visit(final ArrayAccessExpr n, final Void arg) { in visit() argument
58 return n.hashCode(); in visit()
62 public Integer visit(final ArrayCreationExpr n, final Void arg) { in visit() argument
63 return n.hashCode(); in visit()
67 public Integer visit(final ArrayCreationLevel n, final Void arg) { in visit() argument
68 return n.hashCode(); in visit()
[all …]
|
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/bdd/visitors/ |
| D | PositionTestVisitor.java | 45 public void visit(final AnnotationDeclaration n, final Object arg) { in visit() argument
46 doTest(n); in visit()
47 doTest(n.getName()); in visit()
48 super.visit(n, arg); in visit()
52 public void visit(final AnnotationMemberDeclaration n, final Object arg) { in visit() argument
53 doTest(n); in visit()
54 super.visit(n, arg); in visit()
58 public void visit(final ArrayAccessExpr n, final Object arg) { in visit() argument
59 doTest(n); in visit()
60 super.visit(n, arg); in visit()
[all …]
|
| /external/libunwind/tests/ |
| D | Lrs-race.c | 50 int n; in foo_0() local
52 if ((n = unw_backtrace (buf, 20)) < 3) in foo_0()
60 int n; in foo_1() local
62 if ((n = unw_backtrace (buf, 20)) < 3) in foo_1()
70 int n; in foo_2() local
72 if ((n = unw_backtrace (buf, 20)) < 3) in foo_2()
80 int n; in foo_3() local
82 if ((n = unw_backtrace (buf, 20)) < 3) in foo_3()
90 int n; in foo_4() local
92 if ((n = unw_backtrace (buf, 20)) < 3) in foo_4()
[all …]
|
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/bdd/steps/ |
| D | ExistenceOfParentNodeVerifier.java | 49 private static void assertParentIsSet(HasParentNode<?> n) { in assertParentIsSet() argument
50 … assertThat(n + " has no parent set!", n.getParentNode().orElse(null), is(notNullValue())); in assertParentIsSet()
54 public void visit(AnnotationDeclaration n, Void arg) { in visit() argument
55 assertParentIsSet(n); in visit()
56 super.visit(n, arg); in visit()
60 public void visit(AnnotationMemberDeclaration n, Void arg) { in visit() argument
61 assertParentIsSet(n); in visit()
62 super.visit(n, arg); in visit()
66 public void visit(ArrayAccessExpr n, Void arg) { in visit() argument
67 assertParentIsSet(n); in visit()
[all …]
|
| /external/libcxx/src/ |
| D | hash.cpp | 179 __next_prime(size_t n) in __next_prime() argument
184 if (n <= small_primes[N-1]) in __next_prime()
185 return *std::lower_bound(small_primes, small_primes + N, n); in __next_prime()
188 __check_for_overflow(n); in __next_prime()
193 size_t k0 = n / L; in __next_prime()
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
196 n = L * k0 + indices[in]; in __next_prime()
209 const std::size_t q = n / p; in __next_prime()
211 return n; in __next_prime()
212 if (n == q * p) in __next_prime()
[all …]
|
| /external/tensorflow/tensorflow/examples/tutorials/deepdream/ |
| D | deepdream.ipynb | 20 ">[Loading and displaying the model graph](#loading)\n",
21 "\n",
22 ">[Naive feature visualization](#naive)\n",
23 "\n",
24 ">[Multiscale image generation](#multiscale)\n",
25 "\n",
26 ">[Laplacian Pyramid Gradient Normalization](#laplacian)\n",
27 "\n",
28 ">[Playing with feature visualzations](#playing)\n",
29 "\n",
[all …]
|
| /external/bcc/src/cc/frontends/b/ |
| D | type_check.cc | 29 StatusTuple TypeCheck::visit_block_stmt_node(BlockStmtNode *n) { in visit_block_stmt_node() argument
31 if (n->scope_) in visit_block_stmt_node()
32 scopes_->push_var(n->scope_); in visit_block_stmt_node()
33 if (!n->stmts_.empty()) { in visit_block_stmt_node()
34 for (auto it = n->stmts_.begin(); it != n->stmts_.end(); ++it) in visit_block_stmt_node()
38 if (n->scope_) in visit_block_stmt_node()
43 StatusTuple TypeCheck::visit_if_stmt_node(IfStmtNode *n) { in visit_if_stmt_node() argument
44 TRY2(n->cond_->accept(this)); in visit_if_stmt_node()
47 TRY2(n->true_block_->accept(this)); in visit_if_stmt_node()
48 if (n->false_block_) { in visit_if_stmt_node()
[all …]
|
| /external/f2fs-tools/tools/sg_write_buffer/ |
| D | sg_lib.c | 68 int n; in pr2ws() local
71 n = vfprintf(sg_warnings_strm ? sg_warnings_strm : stderr, fmt, args); in pr2ws()
73 return n; in pr2ws()
94 int n; in scnpr() local
99 n = vsnprintf(cp, cp_max_len, fmt, args); in scnpr()
101 return (n < cp_max_len) ? n : (cp_max_len - 1); in scnpr()
525 int proto_id, num, k, n, normal_len, tpid_format; in sg_decode_transportid_str() local
538 for (k = 0, n = 0; bplen > 0; ++k, bp += bump, bplen -= bump) { in sg_decode_transportid_str()
542 n += scnpr(b + n, blen - n, "%sTransport Id short or not " in sg_decode_transportid_str()
545 n += scnpr(b + n, blen - n, "%sTransport Id of initiator:\n", in sg_decode_transportid_str()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/visitor/ |
| D | VoidVisitorAdapter.java | 81 @Override public void visit(final AnnotationDeclaration n, final A arg) { in visit() argument
82 visitComment(n.getComment(), arg); in visit()
83 if (n.getJavaDoc() != null) { in visit()
84 n.getJavaDoc().accept(this, arg); in visit()
86 if (n.getAnnotations() != null) { in visit()
87 for (final AnnotationExpr a : n.getAnnotations()) { in visit()
91 if (n.getMembers() != null) { in visit()
92 for (final BodyDeclaration member : n.getMembers()) { in visit()
98 @Override public void visit(final AnnotationMemberDeclaration n, final A arg) { in visit() argument
99 visitComment(n.getComment(), arg); in visit()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/ |
| D | VoidVisitorAdapter.java | 92 @Override public void visit(final AnnotationDeclaration n, final A arg) { in visit() argument
93 visitComment(n.getComment(), arg); in visit()
94 visitAnnotations(n, arg); in visit()
95 n.getNameExpr().accept(this, arg); in visit()
96 if (n.getMembers() != null) { in visit()
97 for (final BodyDeclaration<?> member : n.getMembers()) { in visit()
103 @Override public void visit(final AnnotationMemberDeclaration n, final A arg) { in visit() argument
104 visitComment(n.getComment(), arg); in visit()
105 visitAnnotations(n, arg); in visit()
106 n.getType().accept(this, arg); in visit()
[all …]
|
| /external/flatbuffers/go/ |
| D | encode.go | 32 func GetUint8(buf []byte) (n uint8) {
33 n = uint8(buf[0])
38 func GetUint16(buf []byte) (n uint16) {
40 n |= uint16(buf[0])
41 n |= uint16(buf[1]) << 8
46 func GetUint32(buf []byte) (n uint32) {
48 n |= uint32(buf[0])
49 n |= uint32(buf[1]) << 8
50 n |= uint32(buf[2]) << 16
51 n |= uint32(buf[3]) << 24
[all …]
|
| /external/cldr/tools/c/genldml/resources/ |
| D | root.txt | 13 "<?xml version=\"1.0\" encoding=\"UTF-8\" ?>\n"
14 // "<!DOCTYPE ldml SYSTEM \"file://c:/work/devicu/locale/ldml.dtd\" \n"
15 // "[\n"
16 … // " <!ENTITY % icu SYSTEM \"file://c:/work/devicu/locale/ldmlICU.dtd\"> \n"
17 // "%icu;\n"
18 // "]\n"
19 // ">\n"
20 … "<!DOCTYPE ldml SYSTEM \" http://oss.software.ibm.com/cvs/icu/~checkout~/locale/ldml.dtd\" \n"
21 "[\n"
22 … <!ENTITY % icu SYSTEM \" http://oss.software.ibm.com/cvs/icu/~checkout~/locale/ldmlICU.dtd\"> \n"
[all …]
|
| /external/clang/test/SemaCXX/ |
| D | switch-implicit-fallthrough.cpp | 4 int fallthrough(int n) { in fallthrough() argument
5 switch (n / 10) { in fallthrough()
6 if (n - 1) { in fallthrough()
7 n = 100; in fallthrough()
8 } else if (n - 2) { in fallthrough()
9 n = 101; in fallthrough()
10 } else if (n - 3) { in fallthrough()
11 n = 102; in fallthrough()
18 n += 100 ; in fallthrough()
20 if (n > 0) in fallthrough()
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | dlist.c | 620 const Node *n = dlist->Head; in is_bitmap_list() local
621 if (n[0].opcode == OPCODE_BITMAP) { in is_bitmap_list()
622 n += InstSize[OPCODE_BITMAP]; in is_bitmap_list()
623 if (n[0].opcode == OPCODE_END_OF_LIST) in is_bitmap_list()
636 const Node *n = dlist->Head; in is_empty_list() local
637 return n[0].opcode == OPCODE_END_OF_LIST; in is_empty_list()
727 const Node *n; in build_bitmap_atlas() local
745 n = list->Head; in build_bitmap_atlas()
746 assert(n[0].opcode == OPCODE_BITMAP); in build_bitmap_atlas()
747 bitmap_width = n[1].i; in build_bitmap_atlas()
[all …]
|