((Func<int?, int?>)(x => ++x))(default(int));
:doh:
T
t bast
@t bast
Posts
-
How about this little c# code -
Design Pattern Seminar in EuropeYou have "The User Experience 2007 Conference", Barcelona 4 November. http://www.nngroup.com/events/barcelona/agenda.html[^]
-
Different Voting CriteriaAnd be able to change my vote when the article is updated.
-
I’m trying to figure out a way to store my data in an clever wayThe objects to store contains a regular integer and a pointer. Each integer value is unique and received in a sequential order (the value is increased by one or more for each time). - I want to find an object with a particular integer value as fast as possible. - I don’t know the number of objects at load time, so I cant load all at once and use binary search. I believe using a tree structure is not the most clever idea, since the data is in order from start. Maybe a skip list is the best idea?.
-
how to declare and use an array of pointer on functions?one idea is to use a function with a pointer to a class holding you parameters.
typedef (int)MyFuncPrototype(pParamObject)