Attachment #7177 for issue #11742

View | Details | Raw Unified | Return to issue 11742
Collapse All | Expand All




{
  public:
    typedef std::vector<ELEM>       source;
    typedef typename source::const_iterator source_iterator;

                        SCI_Vector(
                            const source &      i_rSource  );

{
  public:
    typedef std::map<KEY,VALUE>     source;
    typedef typename source::const_iterator source_iterator;

                        SCI_Map(
                            const source &      i_rSource  );

    typedef typename TYPES::element_type    element;
    typedef typename TYPES::sort_type       sorter;
    typedef std::set<element, sorter>       source;
    typedef typename source::const_iterator source_iterator;

                        SCI_Set(
                            const source &      i_rSource  );




}

template <class UNIT>
typename Root<UNIT>::const_iterator
Root<UNIT>::Begin() const
{
    const_iterator ret(dpBlocks, pBlocksEnd, (*dpBlocks).Begin());

}

template <class UNIT>
typename Root<UNIT>::iterator
Root<UNIT>::Begin()
{
    iterator ret(dpBlocks, pBlocksEnd, (*dpBlocks).Begin());

    which can stay where it is.
*/
template <class UNIT>
typename Root<UNIT>::block_type *
Root<UNIT>::ResizeBlockList()
{
    uintt nOldSize = pBlocksEnd - dpBlocks;

Lines 131-137 RE & Link Here

(-)source/ary/store/t_storg.hxx (-2 / +2 lines)
131	StdReStorage<RE>::do_Add( const KEY & i_rKey,	131	StdReStorage<RE>::do_Add( const KEY & i_rKey,
132	DYN RE & let_drElement )	132	DYN RE & let_drElement )
133	{	133	{
134	std::pair<DataBase::iterator, bool> result	134	std::pair<typename DataBase::iterator, bool> result
135	= aDataBase.insert(DataBase::value_type(i_rKey, &let_drElement));	135	= aDataBase.insert(DataBase::value_type(i_rKey, &let_drElement));
136	if (result.second == false)	136	if (result.second == false)
137	delete &let_drElement;	137	delete &let_drElement;
Lines 142-148 template <class RE> Link Here
142	uintt	142	uintt
143	StdReStorage<RE>::do_ForEach( const Manipulator< RE > & i_rManip )	143	StdReStorage<RE>::do_ForEach( const Manipulator< RE > & i_rManip )
144	{	144	{
145	for ( DataBase::iterator it = aDataBase.begin();	145	for ( typename DataBase::iterator it = aDataBase.begin();
146	it != aDataBase.end();	146	it != aDataBase.end();
147	++it )	147	++it )
148	{	148	{

Lines 178-184 CreateHtml::OutputDir() const Link Here

(-)source/exes/adc_uni/adc_cmds.hxx (-1 / +1 lines)
178	//inline const String &	178	//inline const String &
179	//Save::ReposyDir() const	179	//Save::ReposyDir() const
180	// { return sRepositoryDirectory; }	180	// { return sRepositoryDirectory; }
181	#endif 0 // KORR_FUTURE	181	#endif // 0 - KORR_FUTURE
182		182
183		183
184		184

Lines 82-88 class EStack : private std::slist<ELEM> Link Here

(-)source/inc/estack.hxx (-1 / +1 lines)
82		82
83	public:	83	public:
84	typedef ELEM value_type;	84	typedef ELEM value_type;
85	typedef std::slist<ELEM>::size_type size_type;	85	typedef typename std::slist<ELEM>::size_type size_type;
86		86
87	// LIFECYCLE	87	// LIFECYCLE
88	EStack() {}	88	EStack() {}

Lines 111-117 template <class PE> Link Here

(-)source/parser/inc/semantic/callf.hxx (-2 / +2 lines)
111	class PeStatus	111	class PeStatus
112	{	112	{
113	public:	113	public:
114	typedef CallFunction<PE>::F_Tok F_Tok;	114	typedef typename CallFunction<PE>::F_Tok F_Tok;
115		115
116	PeStatus(	116	PeStatus(
117	PE & i_rMyPE,	117	PE & i_rMyPE,
Lines 180-186 CallFunction<PE>::CallFunction( F_Tok i Link Here
180	}	180	}
181		181
182	template <class PE>	182	template <class PE>
183	inline CallFunction<PE>::F_Tok	183	inline typename CallFunction<PE>::F_Tok
184	CallFunction<PE>::GetF() const	184	CallFunction<PE>::GetF() const
185	{	185	{
186	return f2Call;	186	return f2Call;

Lines 211-217 StateMachine::Peek(intt in_nBranch) Link Here

(-)source/parser/tokens/tkpstama.cxx (-1 / +1 lines)
211	void	211	void
212	StateMachine::PrintOut()	212	StateMachine::PrintOut()
213	{	213	{
214	const anzahl = nNrofStati;	214	const intt anzahl = nNrofStati;
215	for (int i = 0; i < anzahl; i++)	215	for (int i = 0; i < anzahl; i++)
216	{	216	{
217	Cout() << i << ':';	217	Cout() << i << ':';

Lines 210-216 StateMachin2::Peek(intt in_nBranch) Link Here

(-)source/parser_i/tokens/tkpstam2.cxx (-1 / +1 lines)
210	void	210	void
211	StateMachin2::PrintOut()	211	StateMachin2::PrintOut()
212	{	212	{
213	const anzahl = nNrofStati;	213	const intt anzahl = nNrofStati;
214	for (int i = 0; i < anzahl; i++)	214	for (int i = 0; i < anzahl; i++)
215	{	215	{
216	Cout() << i << ':';	216	Cout() << i << ':';

Return to issue 11742

Lines 302-308 Root<UNIT>::EraseAll() Link Here

(-)source/ary/inc/store/st_root.hxx (-3 / +3 lines)
302	}	302	}
303		303
304	template <class UNIT>	304	template <class UNIT>
305	Root<UNIT>::const_iterator	305	typename Root<UNIT>::const_iterator
306	Root<UNIT>::Begin() const	306	Root<UNIT>::Begin() const
307	{	307	{
308	const_iterator ret(dpBlocks, pBlocksEnd, (*dpBlocks).Begin());	308	const_iterator ret(dpBlocks, pBlocksEnd, (*dpBlocks).Begin());
Lines 311-317 Root<UNIT>::Begin() const Link Here
311	}	311	}
312		312
313	template <class UNIT>	313	template <class UNIT>
314	Root<UNIT>::iterator	314	typename Root<UNIT>::iterator
315	Root<UNIT>::Begin()	315	Root<UNIT>::Begin()
316	{	316	{
317	iterator ret(dpBlocks, pBlocksEnd, (*dpBlocks).Begin());	317	iterator ret(dpBlocks, pBlocksEnd, (*dpBlocks).Begin());
Lines 341-347 Root<UNIT>::Expand() Link Here
341	which can stay where it is.	341	which can stay where it is.
342	*/	342	*/
343	template <class UNIT>	343	template <class UNIT>
344	Root<UNIT>::block_type *	344	typename Root<UNIT>::block_type *
345	Root<UNIT>::ResizeBlockList()	345	Root<UNIT>::ResizeBlockList()
346	{	346	{
347	uintt nOldSize = pBlocksEnd - dpBlocks;	347	uintt nOldSize = pBlocksEnd - dpBlocks;

Lines 82-88 class SCI_Vector : public StdConstIterat Link Here

(-)source/ary/inc/sci_impl.hxx (-3 / +3 lines)
82	{	82	{
83	public:	83	public:
84	typedef std::vector<ELEM> source;	84	typedef std::vector<ELEM> source;
85	typedef source::const_iterator source_iterator;	85	typedef typename source::const_iterator source_iterator;
86		86
87	SCI_Vector(	87	SCI_Vector(
88	const source & i_rSource );	88	const source & i_rSource );
Lines 109-115 class SCI_Map : public StdConstIterator< Link Here
109	{	109	{
110	public:	110	public:
111	typedef std::map<KEY,VALUE> source;	111	typedef std::map<KEY,VALUE> source;
112	typedef source::const_iterator source_iterator;	112	typedef typename source::const_iterator source_iterator;
113		113
114	SCI_Map(	114	SCI_Map(
115	const source & i_rSource );	115	const source & i_rSource );
Lines 139-145 class SCI_Set : public StdConstIterator< Link Here
139	typedef typename TYPES::element_type element;	139	typedef typename TYPES::element_type element;
140	typedef typename TYPES::sort_type sorter;	140	typedef typename TYPES::sort_type sorter;
141	typedef std::set<element, sorter> source;	141	typedef std::set<element, sorter> source;
142	typedef source::const_iterator source_iterator;	142	typedef typename source::const_iterator source_iterator;
143		143
144	SCI_Set(	144	SCI_Set(
145	const source & i_rSource );	145	const source & i_rSource );