Identical literal strings are not guaranty to be identical, but you can build type from it which can compare identical (without comparing string), something like: // Sequence of char template <char…Cs> struct char_sequence { template <char C> using push_back = char_sequence<Cs…, C>; }; // Remove all chars from char_sequence from ‘\0’ template <typename, char…> struct … Read more
Just in case, here is what I meant by hiding ViewOf inside a type class (type classes is an alternative to match types). Sadly, in Scala 3 this is wordy. (version 1) import scala.annotation.experimental import scala.quoted.{Expr, Quotes, Type, quotes} // Library part trait View extends Selectable { def applyDynamic(key: String)(args: Any*): Any = { println(s”$key … Read more
My guess as to why this happens: complete specializations are no longer “template classes/functions”, they are are “real” classes/methods, and get to have real (linker-visible) symbols. But for a completely-specialized template inside a partially-specialized one, this would not be true. Probably this decision was taken just to simplify the life of compiler-writers (and make life … Read more
Yup, simply use send (or, better yet, public_send) like so: arg1.public_send(op, arg2) This works because most operators in Ruby (including +, -, *, /, and more) simply call methods. So 1 + 2 is the same as 1.+(2). You may also want to whitelist op if it’s user input, e.g. %w[+ – * /].include?(op), as … Read more
In principle, this is possible, although the solution probably isn’t what you’re looking for. In short, you need to provide an explicit mapping from the types to the integer values, with one entry for each possible type: template< typename T > struct type2int { // enum { result = 0 }; // do this if … Read more
Compile time re-writing isn’t directly supported by Roslyn today, but syntactic and semantic transformations definitely are. In fact, take a look at the “ImplementNotifyPropertyChanged” sample included in the CTP to see something of what you want to do. The sample is implemented as a design time transformation in and IDE feature, but you can extract … Read more
I don’t think this would be possible. On some STL libraries you actually have a vector iterator as a pointer type, i.e. std::vector<T>::iterator is a T* so I can’t think of any way you could get back to the container type from that.
eval evaluates stuff like 5+3 exec executes stuff like for … >>> eval(“for x in range(3):print x”) Traceback (most recent call last): File “<stdin>”, line 1, in <module> File “<string>”, line 1 for x in range(3):print x ^ SyntaxError: invalid syntax >>> exec(“for x in range(3):print x”) 0 1 2 >>> eval(‘5+3’) 8
I am late, but I think I have an answer (to anyone who visit here). You can trace until you find the end of the class definition. I did it in a method which I called after_inherited: class Class def after_inherited child = nil, &blk line_class = nil set_trace_func(lambda do |event, file, line, id, binding, … Read more
What is this weird template that takes <int N>? In C++, template arguments can either be types (prefixed with class or typename) or integers (prefixed with int or unsigned int). Here we are in the second case. What is this second weird template <>? template<> struct Factorial<0> is a complete specialization of Factorial class template, … Read more