OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:heuristic
(Results
1 - 25
of
528
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/sftp/
AttrTextHints.java
24
* The server has applied a
heuristic
or other mechanism and
36
* The server has applied a
heuristic
or other mechanism and
/external/llvm/include/llvm/CodeGen/PBQP/
HeuristicBase.h
1
//===-- HeuristcBase.h ---
Heuristic
base class for PBQP --------*- C++ -*-===//
17
/// \brief Abstract base class for
heuristic
implementations.
19
/// This class provides a handy base for
heuristic
implementations with common
22
/// To implement your own
heuristic
using this class as a base you'll have to
26
///
heuristic
reduction list.
27
/// <li> void heuristicReduce() : Perform a single
heuristic
reduction.
37
/// the solver which is using this
heuristic
.
48
/// These can be used to attach data relevant to your
heuristic
to each
61
// Return a reference to the derived
heuristic
.
73
/// @param solver The solver which is using this
heuristic
instance
[
all
...]
HeuristicSolver.h
1
//===-- HeuristicSolver.h -
Heuristic
PBQP Solver --------------*- C++ -*-===//
10
//
Heuristic
PBQP solver. This solver is able to perform optimal reductions for
11
// nodes of degree 0, 1 or 2. For nodes of degree >2 a plugable
heuristic
is
26
/// \brief
Heuristic
PBQP solver implementation.
117
/// \brief Construct a
heuristic
solver implementation to solve the given
127
/// \brief Get the
heuristic
data attached to the given node.
129
/// @return The
heuristic
data attached to the given node.
134
/// \brief Get the
heuristic
data attached to the given edge.
136
/// @return The
heuristic
data attached to the given node.
162
/// Does <i>not</i> notify the
heuristic
of the removal. That should b
[
all
...]
/external/chromium/chrome/browser/autofill/
autofill_field_unittest.cc
21
// Set the
heuristic
type and check it.
29
// Remove the server type to make sure the
heuristic
type is preserved.
62
//
Heuristic
type does not affect FieldSignature.
78
// Only
heuristic
type is set.
autofill_field.h
29
// Sets the
heuristic
type of this field, validating the input.
36
// This function automatically chooses between server and
heuristic
autofill
/external/chromium_org/components/autofill/core/browser/
autofill_field_unittest.cc
23
// Set the
heuristic
type and check it.
33
// Remove the server type to make sure the
heuristic
type is preserved.
67
//
Heuristic
type does not affect FieldSignature.
83
// Only
heuristic
type is set.
/external/chromium_org/chrome/browser/extensions/
extensions_quota_service.cc
56
return std::string(); // No
heuristic
implies no limit.
64
for (QuotaLimitHeuristics::iterator
heuristic
= heuristics.begin();
65
heuristic
!= heuristics.end(); ++
heuristic
) {
66
// Apply
heuristic
to each item (bucket).
67
if (!(*
heuristic
)->ApplyToArgs(args, event_time)) {
68
failed_heuristic = *
heuristic
;
extensions_quota_service.h
9
// watch an item (for a particular
heuristic
) before making a decision about
10
// quota violations'. A
heuristic
is two functions: one mapping input
83
// Each
heuristic
will be evaluated and ANDed together to get a final answer.
95
// A QuotaLimitHeuristic is two things: 1, A
heuristic
to map extension
97
//
heuristic
for determining if a new event involving a particular item
112
// A Bucket is how the
heuristic
portrays an individual item (since quota
186
// Returns an error formatted according to this
heuristic
.
193
// constitutes a quota violation according to this
heuristic
.
204
// The name of the
heuristic
for formatting error messages.
210
// A simple per-item
heuristic
to limit the number of events that can occur i
[
all
...]
/external/chromium/chrome/browser/extensions/
extensions_quota_service.h
9
// watch an item (for a particular
heuristic
) before making a decision about
10
// quota violations'. A
heuristic
is two functions: one mapping input
66
// Each
heuristic
will be evaluated and ANDed together to get a final answer.
77
// A QuotaLimitHeuristic is two things: 1, A
heuristic
to map extension
79
//
heuristic
for determining if a new event involving a particular item
94
// A Bucket is how the
heuristic
portrays an individual item (since quota
158
// constitutes a quota violation according to this
heuristic
.
172
// A simple per-item
heuristic
to limit the number of events that can occur in
181
// A per-item
heuristic
to limit the number of events that can occur in a
extensions_quota_service.cc
43
return true; // No
heuristic
implies no limit.
49
for (QuotaLimitHeuristics::iterator
heuristic
= heuristics.begin();
50
heuristic
!= heuristics.end(); ++
heuristic
) {
51
// Apply
heuristic
to each item (bucket).
52
global_decision = (*
heuristic
)->ApplyToArgs(args, event_time) &&
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h
1
//===-- Briggs.h --- Briggs
Heuristic
for PBQP ------------------*- C++ -*-===//
28
/// \brief PBQP
Heuristic
which applies an allocability test based on
31
/// This
heuristic
assumes that the elements of cost vectors in the PBQP
36
/// If one or more nodes can be proven allocable by this
heuristic
(by
110
/// \brief Construct an instance of the Briggs
heuristic
.
111
/// @param solver A reference to the solver which is using this
heuristic
.
125
/// selected for
heuristic
reduction instead.
134
/// \brief Add a node to the
heuristic
reduce list.
135
/// @param nItr Node iterator to add to the
heuristic
reduce list.
147
/// \brief Heuristically reduce one of the nodes in the
heuristic
[
all
...]
/frameworks/base/core/java/android/text/
BidiFormatter.java
85
* The default text direction
heuristic
.
189
* By default, uses the first-strong
heuristic
.
191
* @param
heuristic
the {@code TextDirectionHeuristic} to use.
194
public Builder setTextDirectionHeuristic(TextDirectionHeuristic
heuristic
) {
195
mTextDirectionHeuristic =
heuristic
;
262
* @param
heuristic
The default text direction
heuristic
.
264
private BidiFormatter(boolean isRtlContext, int flags, TextDirectionHeuristic
heuristic
) {
267
mDefaultTextDirectionHeuristic =
heuristic
;
292
* given explicitly by a
heuristic
to estimate the {@code str}'s directionality
[
all
...]
TextDirectionHeuristic.java
20
* Interface for objects that use a
heuristic
for guessing at the paragraph direction by examining text.
/frameworks/support/v4/java/android/support/v4/text/
BidiFormatter.java
81
* The default text direction
heuristic
.
185
* By default, uses the first-strong
heuristic
.
187
* @param
heuristic
the {@code TextDirectionHeuristic} to use.
190
public Builder setTextDirectionHeuristic(TextDirectionHeuristicCompat
heuristic
) {
191
mTextDirectionHeuristicCompat =
heuristic
;
258
* @param
heuristic
The default text direction
heuristic
.
260
private BidiFormatter(boolean isRtlContext, int flags, TextDirectionHeuristicCompat
heuristic
) {
263
mDefaultTextDirectionHeuristicCompat =
heuristic
;
288
* given explicitly by a
heuristic
to estimate the {@code str}'s directionality
[
all
...]
TextDirectionHeuristicCompat.java
20
* Interface for objects that use a
heuristic
for guessing at the paragraph direction by examining text.
/external/chromium_org/chrome/browser/storage_monitor/
media_storage_util.h
29
// Mac OS X behaves similarly, but this is not the only
heuristic
it uses.
31
// if additional OS X
heuristic
is implemented.
/external/chromium_org/cc/debug/
frame_rate_counter.h
31
// This is a
heuristic
that can be used to ignore frames in a reasonable way.
/external/chromium_org/third_party/cld/encodings/compact_lang_det/win/
cld_unicodetext.cc
59
// due to the
heuristic
in CLD, which ignores English as a top language
63
// is not affected by this
heuristic
.
/external/guava/guava-gwt/src/com/google/common/collect/
GwtSerializationDependencies.java
30
*
heuristic
for determining which classes might be serialized fails. That
31
*
heuristic
is, roughly speaking, to look at each parameter and return type of
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
types.h
64
// force_sequential, force_parallel,
heuristic
.
67
heuristic
,
enumerator in enum:__gnu_parallel::_AlgorithmStrategy
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
types.h
66
// force_sequential, force_parallel,
heuristic
.
69
heuristic
,
enumerator in enum:__gnu_parallel::_AlgorithmStrategy
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/
gmon.h
100
* This is a
heuristic
; we will fail with a warning when profiling programs
106
* text size, thus raising the number of arcs expected by the
heuristic
).
112
* hides the inadequacy of the ARCDENSITY
heuristic
, at least
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/
gmon.h
100
* This is a
heuristic
; we will fail with a warning when profiling programs
106
* text size, thus raising the number of arcs expected by the
heuristic
).
112
* hides the inadequacy of the ARCDENSITY
heuristic
, at least
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/
gmon.h
100
* This is a
heuristic
; we will fail with a warning when profiling programs
106
* text size, thus raising the number of arcs expected by the
heuristic
).
112
* hides the inadequacy of the ARCDENSITY
heuristic
, at least
/external/chromium_org/chrome/browser/chromeos/drive/
file_write_watcher.h
44
// resources. As a
heuristic
to capture the real end of write operations that
Completed in 2457 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>