OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NodeSet
(Results
1 - 16
of
16
) sorted by null
/external/apache-xml/src/main/java/org/apache/xpath/
NodeSet.java
19
* $Id:
NodeSet
.java 468655 2006-10-28 07:12:06Z minchau $
36
* <p>The
NodeSet
class can act as either a NodeVector,
52
* <p>Thought: Should
NodeSet
really implement NodeList and NodeIterator,
59
public class
NodeSet
66
public
NodeSet
()
77
public
NodeSet
(int blocksize)
84
* Create a
NodeSet
, and copy the members of the
89
public
NodeSet
(NodeList nodelist)
98
* Create a
NodeSet
, and copy the members of the
99
* given
NodeSet
into it
[
all
...]
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
500
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
522
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
529
NodeSet
::iterator NItr =
559
typedef std::set<NodeId>
NodeSet
;
560
NodeSet
OptimallyReducibleNodes;
561
NodeSet
ConservativelyAllocatableNodes;
562
NodeSet
NotProvablyAllocatableNodes;
/external/v8/src/compiler/
node.h
311
typedef ZoneSet<Node*>
NodeSet
;
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
435
NodeSet
::iterator NItr = OptimallyReducibleNodes.begin();
457
NodeSet
::iterator NItr = ConservativelyAllocatableNodes.begin();
464
NodeSet
::iterator NItr =
496
typedef std::set<NodeId>
NodeSet
;
497
NodeSet
OptimallyReducibleNodes;
498
NodeSet
ConservativelyAllocatableNodes;
499
NodeSet
NotProvablyAllocatableNodes;
/external/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp
53
typedef std::set<GepNode*>
NodeSet
;
281
in_set(const
NodeSet
&S) : NS(S) {}
286
const
NodeSet
&NS;
427
void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM,
NodeSet
&Nodes) {
447
typedef std::set<
NodeSet
> NodeSymRel;
451
const
NodeSet
*node_class(GepNode *N, NodeSymRel &Rel) {
517
typedef std::map<unsigned,
NodeSet
> NodeSetMap;
532
NodeSet
&S = I->second;
533
for (
NodeSet
::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
542
NodeSet
C
[
all
...]
RDFGraph.h
474
typedef std::set<NodeId>
NodeSet
;
/external/llvm/lib/CodeGen/
MachinePipeliner.cpp
144
class
NodeSet
;
222
typedef SmallVector<
NodeSet
, 8> NodeSetType;
362
void addConnectedNodes(SUnit *SU,
NodeSet
&NewSet,
418
/// A
NodeSet
contains a set of SUnit DAG nodes with additional information
420
class
NodeSet
{
432
NodeSet
() : Nodes(), HasRecurrence(false) {}
434
NodeSet
(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) {}
462
int compareRecMII(
NodeSet
&RHS) { return RecMII - RHS.RecMII; }
490
bool operator>(const
NodeSet
&RHS) const {
501
bool operator==(const
NodeSet
&RHS) const
[
all
...]
/prebuilts/tools/common/m2/repository/xalan/xalan/2.6.0/
xalan-2.6.0.jar
/prebuilts/tools/common/m2/repository/xalan/xalan/2.7.1/
xalan-2.7.1.jar
Completed in 558 milliseconds