Home
last modified time | relevance | path

Searched refs:Insertion (Results 1 – 25 of 38) sorted by relevance

12

/external/annotation-tools/annotation-file-utilities/src/annotator/specification/
DIndexFileSpecification.java43 import annotator.find.Insertion;
54 private final Multimap<Insertion, Annotation> insertionSources =
55 LinkedHashMultimap.<Insertion, Annotation>create();
56 private final List<Insertion> insertions = new ArrayList<Insertion>();
74 public List<Insertion> parse() throws FileIOException { in parse()
91 Insertion.setAlwaysQualify(ambiguous); in parse()
112 public Multimap<Insertion, Annotation> insertionSources() { in insertionSources()
116 private void addInsertionSource(Insertion ins, Annotation anno) { in addInsertionSource()
300 private List<Insertion> parseElement(CriterionList clist, AElement element) { in parseElement()
301 return parseElement(clist, element, new ArrayList<Insertion>(), false); in parseElement()
[all …]
DSpecification.java6 import annotator.find.Insertion;
21 List<Insertion> parse() throws FileIOException; in parse()
/external/annotation-tools/annotation-file-utilities/src/annotator/find/
DInsertions.java74 public class Insertions implements Iterable<Insertion> {
75 private static int kindLevel(Insertion i) { in kindLevel()
92 private static final Comparator<Insertion> byASTRecord =
93 new Comparator<Insertion>() {
95 public int compare(Insertion o1, Insertion o2) {
118 private Map<String, Map<String, Set<Insertion>>> store;
129 store = new HashMap<String, Map<String, Set<Insertion>>>(); in Insertions()
135 String qualifiedClassName, Set<Insertion> result) { in forClass()
137 Map<String, Set<Insertion>> map = store.get(pair.fst); in forClass()
139 Set<Insertion> set = new TreeSet<Insertion>(byASTRecord); in forClass()
[all …]
DTreeFinder.java88 public class TreeFinder extends TreeScanner<Void, List<Insertion>> {
255 extends TreeScanner<Pair<ASTRecord, Integer>, Insertion> {
321 public Pair<ASTRecord, Integer> visitVariable(VariableTree node, Insertion ins) { in visitVariable()
340 public Pair<ASTRecord, Integer> visitMethod(MethodTree node, Insertion ins) { in visitMethod()
367 public Pair<ASTRecord, Integer> visitIdentifier(IdentifierTree node, Insertion ins) { in visitIdentifier()
420 public Pair<ASTRecord, Integer> visitMemberSelect(MemberSelectTree node, Insertion ins) { in visitMemberSelect()
428 public Pair<ASTRecord, Integer> visitTypeParameter(TypeParameterTree node, Insertion ins) { in visitTypeParameter()
434 public Pair<ASTRecord, Integer> visitWildcard(WildcardTree node, Insertion ins) { in visitWildcard()
440 public Pair<ASTRecord, Integer> visitPrimitiveType(PrimitiveTypeTree node, Insertion ins) { in visitPrimitiveType()
446 …public Pair<ASTRecord, Integer> visitParameterizedType(ParameterizedTypeTree node, Insertion ins) { in visitParameterizedType()
[all …]
DTypedInsertion.java30 public abstract class TypedInsertion extends Insertion {
45 protected List<Insertion> innerTypeInsertions;
48 List<Insertion> innerTypeInsertions) { in TypedInsertion()
53 List<Insertion> innerTypeInsertions) { in TypedInsertion()
87 public List<Insertion> getInnerTypeInsertions() { in getInnerTypeInsertions()
DConstructorInsertion.java11 private Set<Insertion> declarationInsertions = new LinkedHashSet<Insertion>();
26 List<Insertion> innerTypeInsertions) { in ConstructorInsertion()
51 for (Insertion i : declarationInsertions) { in getText()
79 public void addDeclarationInsertion(Insertion ins) { in addDeclarationInsertion()
DInsertion.java23 public abstract class Insertion { class
64 public Insertion(Criteria criteria, boolean separateLine) { in Insertion() method in Insertion
388 public static void decorateType(List<Insertion> innerTypeInsertions, final Type outerType) { in decorateType()
392 public static void decorateType(List<Insertion> innerTypeInsertions, in decorateType()
394 for (Insertion innerInsertion : innerTypeInsertions) { in decorateType()
401 if (innerInsertion.getKind() != Insertion.Kind.ANNOTATION) { in decorateType()
DCloseParenthesisInsertion.java8 public class CloseParenthesisInsertion extends Insertion {
DCastInsertion.java20 public class CastInsertion extends Insertion {
DAnnotationInsertion.java8 public class AnnotationInsertion extends Insertion {
DReceiverInsertion.java45 …public ReceiverInsertion(DeclaredType type, Criteria criteria, List<Insertion> innerTypeInsertions… in ReceiverInsertion()
DNewInsertion.java39 List<Insertion> innerTypeInsertions) { in NewInsertion()
/external/annotation-tools/annotation-file-utilities/src/annotator/
DMain.java56 import annotator.find.Insertion;
317 ASTRecord rec, ADeclaration decl, Type type, Insertion ins) { in findInnerTypeElement()
361 JCTree.JCCompilationUnit tree, ASTRecord rec, Insertion ins, in convertInsertion()
362 AScene scene, Multimap<Insertion, Annotation> insertionSources) { in convertInsertion() argument
450 } else if (ins.getKind() == Insertion.Kind.CAST) { in convertInsertion()
466 for (Insertion inner : ti.getInnerTypeInsertions()) { in convertInsertion()
552 Map<String, Multimap<Insertion, Annotation>> insertionIndex =
553 new HashMap<String, Multimap<Insertion, Annotation>>();
554 Map<Insertion, String> insertionOrigins = new HashMap<Insertion, String>();
565 List<Insertion> parsedSpec = spec.parse();
[all …]
/external/annotation-tools/annotation-file-utilities/
Ddesign.tex78 \texttt{IndexFileSpecification},\ which extracts \texttt{Insertion}s
85 \texttt{Insertion} interfaces. (A \texttt{Criterion} is a reified
88 and an \texttt{Insertion} includes matching criteria, output parameters,
96 the indicated \texttt{Insertion}s from the scene.
102 \item For each extracted \texttt{Insertion} that is relevant to the
106 \texttt{Criterion} for the \texttt{Insertion}:
109 \item Add a mapping from the position to the \texttt{Insertion} to the
158 (possibly) \texttt{Insertion} hierarchies, as the insertion location
171 \item{Tree transformation.} Eliminate the \texttt{Insertion} hierarchy;
216 \texttt{Insertion}s on the fly---or perhaps even to go ahead and insert
/external/llvm/lib/MC/
DMCCodeView.cpp79 auto Insertion = in addToStringTable() local
82 S = Insertion.first->first(); in addToStringTable()
83 if (Insertion.second) { in addToStringTable()
/external/swiftshader/third_party/llvm-subzero/include/llvm/Support/
DSourceMgr.h202 SMFixIt(SMLoc Loc, const Twine &Insertion) in SMFixIt() argument
203 : Range(Loc, Loc), Text(Insertion.str()) { in SMFixIt()
/external/llvm/include/llvm/Support/
DSourceMgr.h207 SMFixIt(SMLoc Loc, const Twine &Insertion) in SMFixIt() argument
208 : Range(Loc, Loc), Text(Insertion.str()) { in SMFixIt()
/external/python/cpython2/Doc/library/
Dqueue.rst35 limit on the number of items that can be placed in the queue. Insertion will
42 limit on the number of items that can be placed in the queue. Insertion will
51 limit on the number of items that can be placed in the queue. Insertion will
/external/python/cpython3/Doc/library/
Dqueue.rst35 limit on the number of items that can be placed in the queue. Insertion will
43 limit on the number of items that can be placed in the queue. Insertion will
51 limit on the number of items that can be placed in the queue. Insertion will
/external/eigen/doc/
DSparseQuickReference.dox44 <td> Element-wise Insertion</td>
68 <td>A complete example is available at \link TutorialSparseFilling Triplet Insertion \endlink.</td>
71 <td> Constant or Random Insertion</td>
/external/llvm/lib/Bitcode/Writer/
DValueEnumerator.cpp635 auto Insertion = MetadataMap.insert(std::make_pair(MD, MDIndex(F))); in enumerateMetadataImpl() local
636 MDIndex &Entry = Insertion.first->second; in enumerateMetadataImpl()
637 if (!Insertion.second) { in enumerateMetadataImpl()
640 dropFunctionFromMetadata(*Insertion.first); in enumerateMetadataImpl()
/external/clang/lib/Parse/
DParseTemplate.cpp720 FixItHint Insertion; in DiagnoseMisplacedEllipsis() local
722 Insertion = FixItHint::CreateInsertion(CorrectLoc, "..."); in DiagnoseMisplacedEllipsis()
724 << FixItHint::CreateRemoval(EllipsisLoc) << Insertion in DiagnoseMisplacedEllipsis()
DParseDeclCXX.cpp2179 FixItHint Insertion; in MaybeParseAndDiagnoseDeclSpecAfterCXX11VirtSpecifierSeq() local
2184 Insertion = FixItHint::CreateInsertion(VS.getFirstLocation(), Name.c_str()); in MaybeParseAndDiagnoseDeclSpecAfterCXX11VirtSpecifierSeq()
2192 << Insertion; in MaybeParseAndDiagnoseDeclSpecAfterCXX11VirtSpecifierSeq()
2208 FixItHint Insertion = FixItHint::CreateInsertion(VS.getFirstLocation(), Name); in MaybeParseAndDiagnoseDeclSpecAfterCXX11VirtSpecifierSeq() local
2216 << Insertion; in MaybeParseAndDiagnoseDeclSpecAfterCXX11VirtSpecifierSeq()
/external/llvm/test/CodeGen/SystemZ/
Dinsert-06.ll5 ; Insertion of an i32 can be done using LR.
/external/vixl/test/aarch32/config/
Dtemplate-macro-assembler-aarch32.cc.in124 // in the correct order. (Insertion order is only preserved for C++11.)

12