Timeline for Generic wrapper for equality and hash implementation
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 16, 2013 at 11:42 | comment | added | usr | Googling for "c# expression trees" I find some good stuff: msdn.microsoft.com/en-us/library/bb397951.aspx stackoverflow.com/questions/403088/… stackoverflow.com/questions/683620/… If you have specific questions about them I'll answer them on SO if I happen to see them. | |
Apr 16, 2013 at 11:39 | comment | added | nawfal | Do you have a good starter link to start with? A related question or so? Or some key words for google will do too.. | |
Apr 16, 2013 at 11:37 | comment | added | usr | Your 2nd approach is combining delegates, not the expressions they were built from. It is really hard to give a short overview about expression trees. I suggest you read a little about them because that will be a more thorough information that I can offer here. Basically, expressions are a way to represent C# expressions at runtime in the form of an AST. That allows you to manipulate them and create new functions at runtime. | |
Apr 16, 2013 at 11:33 | comment | added | nawfal |
Can you give a pointer? Or the bare minimum code to get me going? I did not understand this: Analyze what field they point to and build up the corresponding expressions for hashing and equality. Isn't that my 2nd approach is already doing?
|
|
Apr 16, 2013 at 11:29 | history | answered | usr | CC BY-SA 3.0 |