| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return
48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
55 /// Split - Partition a set of changes \p S into one or two subsets.
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return
48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
55 /// Split - Partition a set of changes \p S into one or two subsets.
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return
48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
55 /// Split - Partition a set of changes \p S into one or two subsets.
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return
48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
55 /// Split - Partition a set of changes \p S into one or two subsets.
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return
48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
55 /// Split - Partition a set of changes \p S into one or two subsets.
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return
48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
55 /// Split - Partition a set of changes \p S into one or two subsets.
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/msp430/ |
| bad.l | 8 [^:]*:16: Warning: a NOP might be needed here because of successive changes in interrupt state
10 [^:]*:25: Warning: a NOP might be needed here because of successive changes in interrupt state
12 [^:]*:29: Warning: a NOP might be needed here because of successive changes in interrupt state
13 [^:]*:31: Warning: a NOP might be needed here because of successive changes in interrupt state
14 [^:]*:32: Warning: a NOP might be needed here because of successive changes in interrupt state
15 [^:]*:33: Warning: a NOP might be needed here because of successive changes in interrupt state
16 [^:]*:34: Warning: a NOP might be needed here because of successive changes in interrupt state
|
| /external/clang/test/SemaObjC/ |
| sign-conversion.m | 26 [x setUint:sint]; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
27 x.uint = sint; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
35 (void)((NSObject*)array[si]).hash; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
37 (void)[((NSObject*)array[si]) hash]; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
38 (void)array[si]; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
|
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| RecentFolderController.java | 25 * Controller that can provide recent folders and notify on changes to recent folders.
29 * Registers to receive changes to the recent folders, and obtains the current recent folders.
34 * Removes a listener from receiving recent folder changes.
40 * consider registering for account changes using
42 * current account, but also updates to the account, in case of settings changes.
|
| /external/hamcrest/ |
| README.version | 7 on v2.0.0.0 which are not on master but they do conflict with some changes in
8 master. Those changes appear to be relatively minor and while it is not clear
13 Local Changes:
|
| /external/autotest/frontend/migrations/ |
| 086_add_invalidates_test_idx_to_tko_tests.py | 18 """Pick up the changes.
29 """Drop the changes.
|
| /external/javassist/ |
| regenerate_from_source.sh | 5 # to git giving you a chance to review the changes. Remember that changes in
|
| /external/okhttp/okio/ |
| README.android | 8 All source changes (besides imports) marked with ANDROID-BEGIN and ANDROID-END.
10 These changes relate to okio dependencies not available on Android, such as:
|
| /external/scapy/ |
| .codecov.yml | 18 # Only consider changes to the whole project
21 changes: false
|
| /external/toybox/toys/other/ |
| partprobe.c | 1 /* partprobe.c - Tell the kernel about partition table changes
15 Tell the kernel about partition table changes
|
| /frameworks/base/core/java/android/text/ |
| package.html | 6 to handle arbitrary text spans for changes, or to handle drawing yourself
10 listen for changes. If creating your own widget, extend DynamicLayout, to manages
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 118 void UpdatedSearchState(const changeset_ty &Changes,
121 DDA.UpdatedSearchState(Changes, Sets, Required);
139 DAGDeltaAlgorithmImpl(DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,
144 /// GetTestResult - Get the test result for the active set \p Changes with
145 /// \p Required changes from the cache, executing the test if necessary.
147 /// \param Changes - The set of active changes being minimized, which should
149 /// \param Required - The set of changes which have previously been
152 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
155 /// Helper object for minimizing an active set of changes
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 64 const changeset_ty &Changes;
119 void UpdatedSearchState(const changeset_ty &Changes,
122 DDA.UpdatedSearchState(Changes, Sets, Required);
146 /// GetTestResult - Get the test result for the active set \arg Changes with
147 /// \arg Required changes from the cache, executing the test if necessary.
149 /// \param Changes - The set of active changes being minimized, which should
151 /// \param Required - The set of changes which have previously been
154 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
157 /// Helper object for minimizing an active set of changes
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 26 /// The DAG should be used to represent dependencies in the changes which are
33 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
51 /// Run - Minimize the DAG formed by the \p Changes vertices and the
53 /// changes and returning the smallest set which still satisfies the test
56 /// \param Changes The list of changes.
58 /// \param Dependencies The list of dependencies amongst changes. For each
59 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
63 changeset_ty Run(const changeset_ty &Changes,
66 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 26 /// The DAG should be used to represent dependencies in the changes which are
33 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
50 /// Run - Minimize the DAG formed by the \arg Changes vertices and the \arg
52 /// changes and returning the smallest set which still satisfies the test
55 /// \param Changes The list of changes.
57 /// \param Dependencies The list of dependencies amongst changes. For each
58 /// (x,y) in \arg Dependencies, both x and y must be in \arg Changes. The
61 changeset_ty Run(const changeset_ty &Changes,
64 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are
34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
53 /// Run - Minimize the DAG formed by the \p Changes vertices and the
55 /// changes and returning the smallest set which still satisfies the test
58 /// \param Changes The list of changes.
60 /// \param Dependencies The list of dependencies amongst changes. For each
61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
65 changeset_ty Run(const changeset_ty &Changes,
68 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are
34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
53 /// Run - Minimize the DAG formed by the \p Changes vertices and the
55 /// changes and returning the smallest set which still satisfies the test
58 /// \param Changes The list of changes.
60 /// \param Dependencies The list of dependencies amongst changes. For each
61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
65 changeset_ty Run(const changeset_ty &Changes,
68 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are
34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
53 /// Run - Minimize the DAG formed by the \p Changes vertices and the
55 /// changes and returning the smallest set which still satisfies the test
58 /// \param Changes The list of changes.
60 /// \param Dependencies The list of dependencies amongst changes. For each
61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
65 changeset_ty Run(const changeset_ty &Changes,
68 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are
34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
53 /// Run - Minimize the DAG formed by the \p Changes vertices and the
55 /// changes and returning the smallest set which still satisfies the test
58 /// \param Changes The list of changes.
60 /// \param Dependencies The list of dependencies amongst changes. For each
61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
65 changeset_ty Run(const changeset_ty &Changes,
68 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are
34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
53 /// Run - Minimize the DAG formed by the \p Changes vertices and the
55 /// changes and returning the smallest set which still satisfies the test
58 /// \param Changes The list of changes.
60 /// \param Dependencies The list of dependencies amongst changes. For each
61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
65 changeset_ty Run(const changeset_ty &Changes,
68 /// UpdatedSearchState - Callback used when the search state changes
[all...] |
