/freebsd-10-stable/contrib/dialog/samples/ |
H A D | editbox | 12 Hi, this is an edit box. It can be used to edit text from a file. 14 It's like a simple text editor, with these keys implemented: 33 It supports the mouse - but only for positioning in the editbox,
|
H A D | editbox2 | 10 Hi, this is an edit box. It can be used to edit text from a file. 12 It's like a simple text editor, with these keys implemented: 31 It supports the mouse - but only for positioning in the editbox,
|
H A D | editbox4 | 12 Hi, this is an edit box. It can be used to edit text from a file. 14 It's like a simple text editor, with these keys implemented: 33 It supports the mouse - but only for positioning in the editbox,
|
H A D | checklist12 | 18 Apple:It's an apple.:off
|
H A D | textbox | 9 Hi, this is a text dialog box. It can be used to display text from a file. 13 It's like a simple text file viewer, with these keys implemented:
|
H A D | textbox2 | 9 Hi, this is a text dialog box. It can be used to display text from a file. 13 It's like a simple text file viewer, with these keys implemented:
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | DeclLookups.h | 27 StoredDeclsMap::iterator It, End; member in class:clang::DeclContext::all_lookups_iterator 36 all_lookups_iterator(StoredDeclsMap::iterator It, argument 38 : It(It), End(End) {} 40 DeclarationName getLookupName() const { return It->first; } 42 reference operator*() const { return It->second.getLookupResult(); } 43 pointer operator->() const { return It->second.getLookupResult(); } 50 ++It; 51 } while (It != End && 52 It [all...] |
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-10-stable/contrib/llvm/lib/Target/R600/ |
H A D | R600OptimizeVectorRegisters.cpp | 49 for (MachineRegisterInfo::def_iterator It = MRI.def_begin(Reg), 50 E = MRI.def_end(); It != E; ++It) { 51 return (*It).isImplicitDef(); 147 for (DenseMap<unsigned, unsigned>::iterator It = ToMerge->RegToChan.begin(), 148 E = ToMerge->RegToChan.end(); It != E; ++It) { 150 Untouched->RegToChan.find((*It).first); 153 ((*It).second, (*PosInUntouched).second)); 159 ((*It) [all...] |
H A D | AMDILCFGStructurizer.cpp | 214 int countActiveBlock(MBBVector::const_iterator It, 350 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); local 351 if (It == BlockInfoMap.end()) 353 return (*It).second->SccNum; 358 LoopLandInfoMap::const_iterator It = LLInfoMap.find(LoopRep); local 359 if (It == LLInfoMap.end()) 361 return (*It).second; 377 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); local 378 if (It == BlockInfoMap.end()) 380 return (*It) 413 countActiveBlock(MBBVector::const_iterator It, MBBVector::const_iterator E) const argument 585 MachineBasicBlock::succ_iterator It = MBB->succ_begin(); local 627 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 651 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 661 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 719 MachineBasicBlock::iterator It = Pre; local 811 SmallVectorImpl<MachineBasicBlock *>::const_iterator It = local 947 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); local 1153 GTIM::ChildIteratorType It = GTIM::child_begin(LoopHeader), local 1878 std::set<MachineBasicBlock *>::const_iterator It = MBBs.begin(); local [all...] |
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/ |
H A D | assoc_container.hpp | 39 // purpose. It is provided "as is" without express or implied 217 template<typename It> 218 cc_hash_table(It first, It last) 224 template<typename It> 225 cc_hash_table(It first, It last, const hash_fn& h) 235 template<typename It> 236 cc_hash_table(It first, It las [all...] |
H A D | priority_queue.hpp | 39 // purpose. It is provided "as is" without express or implied 95 template<typename It> 96 priority_queue(It first_it, It last_it) 103 template<typename It> 104 priority_queue(It first_it, It last_it, const cmp_fn& r_cmp_fn)
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | constructor_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 65 template<typename It> 68 copy_from_range(It first_it, It last_it) 80 template<typename It> 82 PB_DS_CLASS_NAME(It first_it, It last_it) : m_p_l(NULL)
|
/freebsd-10-stable/contrib/ntp/ntpsnmpd/ |
H A D | ntpsnmpd-opts.def | 91 .It Li ntpEntSoftwareName 93 .It Li ntpEntSoftwareVersion 95 .It Li ntpEntSoftwareVersionVal 97 .It Li ntpEntSoftwareVendor 99 .It Li ntpEntSystemType 101 .It Li ntpEntTimeResolution 103 .It Li ntpEntTimeResolutionVal 105 .It Li ntpEntTimePrecision 107 .It Li ntpEntTimePrecisionVal 109 .It L [all...] |
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 106 template<typename It> 109 copy_from_range(It first_it, It last_it) 135 template<typename It> 138 copy_from_ordered_range(It first_it, It last_it) 146 It source_it = first_it; 147 It source_end_it = last_it; 177 template<typename It> [all...] |
H A D | erase_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 130 template<typename It> 131 It 133 erase_imp(It it) 185 return It(ret_it);
|
/freebsd-10-stable/contrib/llvm/include/llvm/ADT/ |
H A D | SetVector.h | 53 template<typename It> 54 SetVector(It Start, It End) { 110 template<typename It> 111 void insert(It Start, It End) { 223 template<typename It> 224 SmallSetVector(It Start, It End) {
|
/freebsd-10-stable/contrib/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); 49 It != End; ++It) 50 IntervalMap.insert(std::make_pair(*It, I));
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); local 68 if (It == WorklistMap.end()) return; // Not in worklist. 71 Worklist[It->second] = 0; 73 WorklistMap.erase(It);
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-10-stable/contrib/llvm/include/llvm/Support/ |
H A D | CFG.h | 34 USE_iterator It; member in class:llvm::PredIterator 38 while (!It.atEnd() && !isa<TerminatorInst>(*It)) 39 ++It; 47 explicit inline PredIterator(Ptr *bb) : It(bb->use_begin()) { 50 inline PredIterator(Ptr *bb, bool) : It(bb->use_end()) {} 52 inline bool operator==(const Self& x) const { return It == x.It; } 56 assert(!It.atEnd() && "pred_iterator out of range!"); 57 return cast<TerminatorInst>(*It) [all...] |
H A D | GetElementPtrTypeIterator.h | 33 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { argument 36 I.OpIt = It; 39 static generic_gep_type_iterator end(ItTy It) { argument 42 I.OpIt = It; 62 // This is a non-standard operator->. It allows you to call methods on the
|