| /external/e2fsprogs/po/ |
| Rules-quot | 3 DISTFILES.common.extra1 = quot.sed boldquot.sed en@quot.header en@boldquot.header insert-header.sin Rules-quot
5 .SUFFIXES: .insert-header .po-update-en
15 .insert-header.po-update-en:
23 if $(MSGINIT) -i $(DOMAIN).pot --no-translator -l $$ll -o - 2>/dev/null | sed -f $$tmpdir/$$lang.insert-header | $(MSGCONV) -t UTF-8 | $(MSGFILTER) sed -f `echo $$lang | sed -e 's/.*@//'`.sed 2>/dev/null > $$tmpdir/$$lang.new.po; then \
39 en@quot.insert-header: insert-header.sin
40 sed -e '/^#/d' -e 's/HEADER/en@quot.header/g' $(srcdir)/insert-header.sin > en@quot.insert-header
42 en@boldquot.insert-header: insert-header.si
[all...] |
| /external/elfutils/po/ |
| Rules-quot | 3 DISTFILES.common.extra1 = quot.sed boldquot.sed en@quot.header en@boldquot.header insert-header.sin Rules-quot
5 .SUFFIXES: .insert-header .po-update-en
15 .insert-header.po-update-en:
23 if $(MSGINIT) -i $(DOMAIN).pot --no-translator -l $$ll -o - 2>/dev/null | sed -f $$tmpdir/$$lang.insert-header | $(MSGCONV) -t UTF-8 | $(MSGFILTER) sed -f `echo $$lang | sed -e 's/.*@//'`.sed 2>/dev/null > $$tmpdir/$$lang.new.po; then \
39 en@quot.insert-header: insert-header.sin
40 sed -e '/^#/d' -e 's/HEADER/en@quot.header/g' $(srcdir)/insert-header.sin > en@quot.insert-header
42 en@boldquot.insert-header: insert-header.si
[all...] |
| /external/libexif/po/ |
| Rules-quot | 3 DISTFILES.common.extra1 = quot.sed boldquot.sed en@quot.header en@boldquot.header insert-header.sin Rules-quot
5 .SUFFIXES: .insert-header .po-update-en
15 .insert-header.po-update-en:
23 if $(MSGINIT) -i $(DOMAIN).pot --no-translator -l $$ll -o - 2>/dev/null | sed -f $$tmpdir/$$lang.insert-header | $(MSGCONV) -t UTF-8 | $(MSGFILTER) sed -f `echo $$lang | sed -e 's/.*@//'`.sed 2>/dev/null > $$tmpdir/$$lang.new.po; then \
39 en@quot.insert-header: insert-header.sin
40 sed -e '/^#/d' -e 's/HEADER/en@quot.header/g' $(srcdir)/insert-header.sin > en@quot.insert-header
42 en@boldquot.insert-header: insert-header.si
[all...] |
| /ndk/sources/host-tools/make-3.81/po/ |
| Rules-quot | 3 DISTFILES.common.extra1 = quot.sed boldquot.sed en@quot.header en@boldquot.header insert-header.sin Rules-quot
5 .SUFFIXES: .insert-header .po-update-en
15 .insert-header.po-update-en:
23 if $(MSGINIT) -i $(DOMAIN).pot --no-translator -l $$ll -o - 2>/dev/null | sed -f $$tmpdir/$$lang.insert-header | $(MSGCONV) -t UTF-8 | $(MSGFILTER) sed -f `echo $$lang | sed -e 's/.*@//'`.sed 2>/dev/null > $$tmpdir/$$lang.new.po; then \
39 en@quot.insert-header: insert-header.sin
40 sed -e '/^#/d' -e 's/HEADER/en@quot.header/g' $(srcdir)/insert-header.sin > en@quot.insert-header
42 en@boldquot.insert-header: insert-header.si
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| insert_const_lvalue.pass.cpp | 16 // iterator insert(const value_type& x);
30 R r = c.insert(P(3.5));
34 r = c.insert(P(3.5));
38 r = c.insert(P(4.5));
42 r = c.insert(P(5.5));
53 R r = c.insert(P(3.5));
57 r = c.insert(P(3.5));
61 r = c.insert(P(4.5));
65 r = c.insert(P(5.5));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| insert_const_lvalue.pass.cpp | 16 // iterator insert(const value_type& x);
30 R r = c.insert(P(3.5));
34 r = c.insert(P(3.5));
38 r = c.insert(P(4.5));
42 r = c.insert(P(5.5));
53 R r = c.insert(P(3.5));
57 r = c.insert(P(3.5));
61 r = c.insert(P(4.5));
65 r = c.insert(P(5.5));
|
| /prebuilts/misc/common/swig/include/2.0.11/ocaml/ |
| ocaml.i | 11 /* Insert common stuff */
12 %insert(runtime) "swigrun.swg"
15 %insert(runtime) "ocamldec.swg"
18 %insert(init) "swiginit.swg"
19 %insert(init) "typeregister.swg"
21 %insert(mlitail) %{
25 %insert(mltail) %{
35 %insert(runtime) "ocaml.swg"
38 %insert(classtemplate) "class.swg"
|
| /external/chromium-trace/catapult/tracing/tracing/base/ |
| interval_tree_test.html | 24 tree.v0 = tree.insert({start: 2, end: 6});
25 tree.v1 = tree.insert({start: 1, end: 3});
26 tree.v2 = tree.insert({start: 5, end: 7});
27 tree.v3 = tree.insert({start: 1, end: 5});
28 tree.v4 = tree.insert({start: 3, end: 5});
29 tree.v5 = tree.insert({start: 3, end: 5});
30 tree.v6 = tree.insert({start: 3, end: 6});
31 tree.v7 = tree.insert({start: 1, end: 1});
32 tree.v8 = tree.insert({start: 4, end: 8});
33 tree.v9 = tree.insert({start: 0, end: 2})
[all...] |
| /frameworks/base/core/java/android/content/ |
| ContentInsertHandler.java | 27 * Interface to insert data to ContentResolver
32 * insert data from InputStream to ContentResolver
38 public void insert(ContentResolver contentResolver, InputStream in) method in interface:ContentInsertHandler
42 * insert data from String to ContentResolver
47 public void insert(ContentResolver contentResolver, String in) method in interface:ContentInsertHandler
|
| /ndk/sources/host-tools/gdb-pretty-printers/stlport/gppfs-0.2/test/ |
| test.cpp | 57 multimap1.insert (std::pair<int,int> (1, -1));
58 multimap1.insert (std::pair<int,int> (1, -2));
59 multimap1.insert (std::pair<int,int> (21, -21));
60 multimap1.insert (std::pair<int,int> (21, -22));
61 multimap1.insert (std::pair<int,int> (42, -42));
62 multimap1.insert (std::pair<int,int> (42, -43));
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
70 multiset1.insert( 100)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/ |
| sequence.hpp | 26 // insert helpers -------------------------------------------------//
29 inline void insert( function in namespace:boost::algorithm::detail
35 Input.insert( At, Begin, End );
39 inline void insert( function in namespace:boost::algorithm::detail
42 const InsertT& Insert )
44 ::boost::algorithm::detail::insert( Input, At, ::boost::begin(Insert), ::boost::end(Insert) );
65 // Assumption: insert and erase are expensive
87 // Replace sequence is longer, insert i
[all...] |
| /prebuilts/gdb/darwin-x86/share/pretty-printers/stlport/test/ |
| test.cpp | 57 multimap1.insert (std::pair<int,int> (1, -1));
58 multimap1.insert (std::pair<int,int> (1, -2));
59 multimap1.insert (std::pair<int,int> (21, -21));
60 multimap1.insert (std::pair<int,int> (21, -22));
61 multimap1.insert (std::pair<int,int> (42, -42));
62 multimap1.insert (std::pair<int,int> (42, -43));
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
70 multiset1.insert( 100)
[all...] |
| /prebuilts/gdb/linux-x86/share/pretty-printers/stlport/test/ |
| test.cpp | 57 multimap1.insert (std::pair<int,int> (1, -1));
58 multimap1.insert (std::pair<int,int> (1, -2));
59 multimap1.insert (std::pair<int,int> (21, -21));
60 multimap1.insert (std::pair<int,int> (21, -22));
61 multimap1.insert (std::pair<int,int> (42, -42));
62 multimap1.insert (std::pair<int,int> (42, -43));
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
70 multiset1.insert( 100)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/test/ |
| test.cpp | 57 multimap1.insert (std::pair<int,int> (1, -1));
58 multimap1.insert (std::pair<int,int> (1, -2));
59 multimap1.insert (std::pair<int,int> (21, -21));
60 multimap1.insert (std::pair<int,int> (21, -22));
61 multimap1.insert (std::pair<int,int> (42, -42));
62 multimap1.insert (std::pair<int,int> (42, -43));
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
70 multiset1.insert( 100)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/stlport/test/ |
| test.cpp | 57 multimap1.insert (std::pair<int,int> (1, -1));
58 multimap1.insert (std::pair<int,int> (1, -2));
59 multimap1.insert (std::pair<int,int> (21, -21));
60 multimap1.insert (std::pair<int,int> (21, -22));
61 multimap1.insert (std::pair<int,int> (42, -42));
62 multimap1.insert (std::pair<int,int> (42, -43));
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
70 multiset1.insert( 100)
[all...] |
| /external/autotest/client/cros/cellular/wardmodem/ |
| common.py | 12 sys.path.insert(0, client_dir)
17 # Also insert the top level directory of current project so that imported
19 sys.path.insert(0, os.path.join(package_root_dir))
|
| /external/autotest/client/cros/cellular/wardmodem/state_machines/ |
| common.py | 11 sys.path.insert(0, client_dir)
16 # Also insert the top level directory of current project so that we can import
18 sys.path.insert(0, os.path.join(package_root_dir))
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/pyasn1/test/codec/ |
| suite.py | 3 path.insert(1, path[0]+sep+'codec'+sep+'ber')
5 path.insert(1, path[0]+sep+'codec'+sep+'cer')
7 path.insert(1, path[0]+sep+'codec'+sep+'der')
|
| /external/webrtc/webrtc/modules/audio_processing/vad/ |
| vad_circular_buffer_unittest.cc | 29 circular_buffer->Insert(n);
35 static void Insert(double value,
39 circular_buffer->Insert(value);
43 Insert(0.0, num_zeros, circular_buffer);
60 circular_buffer->Insert(n);
83 Insert(push_val, k, circular_buffer.get());
84 circular_buffer->Insert(0);
103 Insert(push_val, num_non_zero_elements, circular_buffer.get());
107 circular_buffer->Insert(0);
116 Insert(push_val, num_insertion, circular_buffer.get())
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| bisect.py | 4 """Insert item x in list a, and keep it sorted assuming a is sorted.
6 If x is already in a, insert it to the right of the rightmost x.
20 a.insert(lo, x)
25 """Return the index where to insert item x in list a, assuming a is sorted.
28 a[i:] have e > x. So if x already appears in the list, a.insert(x) will
29 insert just after the rightmost x already there.
48 """Insert item x in list a, and keep it sorted assuming a is sorted.
50 If x is already in a, insert it to the left of the leftmost x.
64 a.insert(lo, x)
68 """Return the index where to insert item x in list a, assuming a is sorted
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| bisect.py | 4 """Insert item x in list a, and keep it sorted assuming a is sorted.
6 If x is already in a, insert it to the right of the rightmost x.
20 a.insert(lo, x)
25 """Return the index where to insert item x in list a, assuming a is sorted.
28 a[i:] have e > x. So if x already appears in the list, a.insert(x) will
29 insert just after the rightmost x already there.
48 """Insert item x in list a, and keep it sorted assuming a is sorted.
50 If x is already in a, insert it to the left of the leftmost x.
64 a.insert(lo, x)
68 """Return the index where to insert item x in list a, assuming a is sorted
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| bisect.py | 4 """Insert item x in list a, and keep it sorted assuming a is sorted.
6 If x is already in a, insert it to the right of the rightmost x.
20 a.insert(lo, x)
25 """Return the index where to insert item x in list a, assuming a is sorted.
28 a[i:] have e > x. So if x already appears in the list, a.insert(x) will
29 insert just after the rightmost x already there.
48 """Insert item x in list a, and keep it sorted assuming a is sorted.
50 If x is already in a, insert it to the left of the leftmost x.
64 a.insert(lo, x)
68 """Return the index where to insert item x in list a, assuming a is sorted
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| bisect.py | 4 """Insert item x in list a, and keep it sorted assuming a is sorted.
6 If x is already in a, insert it to the right of the rightmost x.
20 a.insert(lo, x)
25 """Return the index where to insert item x in list a, assuming a is sorted.
28 a[i:] have e > x. So if x already appears in the list, a.insert(x) will
29 insert just after the rightmost x already there.
48 """Insert item x in list a, and keep it sorted assuming a is sorted.
50 If x is already in a, insert it to the left of the leftmost x.
64 a.insert(lo, x)
68 """Return the index where to insert item x in list a, assuming a is sorted
[all...] |
| /system/update_engine/payload_generator/ |
| tarjan_unittest.cc | 49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties()));
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties()));
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties()));
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties()));
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties()));
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties()));
56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties()));
57 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties()));
58 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties()))
[all...] |
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug027.go | 30 func (v *Vector) Insert(e Element) {
49 v.Insert(i4)
50 v.Insert(i3)
51 v.Insert(i2)
52 v.Insert(i1)
53 v.Insert(i0)
|
