File: NodeFactory.tpp

package info (click to toggle)
fauhdlc 20180504-3.1
  • links: PTS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 3,064 kB
  • sloc: cpp: 23,188; ansic: 6,077; yacc: 3,764; lex: 763; makefile: 605; python: 412; xml: 403; sh: 61
file content (39 lines) | stat: -rw-r--r-- 967 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/* $Id$ 
 * vim:tabstop=8:shiftwidth=8:filetype=cpp:textwidth=72:
 *
 * Copyright (C) 2007-2009 FAUmachine Team <info@faumachine.org>.
 * This program is free software. You can redistribute it and/or modify it
 * under the terms of the GNU General Public License, either version 2 of
 * the License, or (at your option) any later version. See COPYING.
 */

#include <cassert>

namespace ast {

template <typename T, typename U>
std::list<T>*
NodeFactory::listCast(std::list<U>* l)
{
	U u = NULL; /* U should be a pointer */
	T t __attribute__((__unused__));
	t = u; /* won't work if classes aren't compatible */

	assert(sizeof(std::list<T>) == sizeof(std::list<U>));
	return reinterpret_cast< std::list<T>* >(l);
}

template <typename T>
void
NodeFactory::listCombine(std::list<T>* dest, std::list<T>* source)
{
	assert(source);
	assert(dest);

	for (typename std::list<T>::iterator i = source->begin(); 
		i != source->end(); i++) {
		dest->push_back(*i);
	}
}

};