Click here to Skip to main content
15,917,320 members
Home / Discussions / C#
   

C#

 
AnswerRe: Application Domain Pin
Eddy Vluggen15-Jan-10 3:11
professionalEddy Vluggen15-Jan-10 3:11 
GeneralRe: Application Domain Pin
dataminers15-Jan-10 9:50
dataminers15-Jan-10 9:50 
GeneralRe: Application Domain Pin
Eddy Vluggen15-Jan-10 11:17
professionalEddy Vluggen15-Jan-10 11:17 
GeneralRe: Application Domain Pin
dataminers16-Jan-10 2:23
dataminers16-Jan-10 2:23 
GeneralRe: Application Domain Pin
Eddy Vluggen16-Jan-10 8:50
professionalEddy Vluggen16-Jan-10 8:50 
GeneralRe: Application Domain Pin
dataminers15-Jan-10 10:31
dataminers15-Jan-10 10:31 
QuestionCaching powers of 2 -- performance consideration Pin
Lutosław14-Jan-10 22:36
Lutosław14-Jan-10 22:36 
AnswerRe: BitVector performance question [modified] Pin
Covean14-Jan-10 23:00
Covean14-Jan-10 23:00 
GeneralRe: BitVector performance question Pin
Lutosław14-Jan-10 23:55
Lutosław14-Jan-10 23:55 
GeneralRe: BitVector performance question Pin
Covean15-Jan-10 0:09
Covean15-Jan-10 0:09 
GeneralRe: BitVector performance question Pin
Lutosław15-Jan-10 0:33
Lutosław15-Jan-10 0:33 
JokeRe: BitVector performance question Pin
Covean15-Jan-10 0:54
Covean15-Jan-10 0:54 
GeneralRe: BitVector performance question Pin
Lutosław15-Jan-10 0:04
Lutosław15-Jan-10 0:04 
GeneralRe: BitVector performance question Pin
Lutosław15-Jan-10 0:09
Lutosław15-Jan-10 0:09 
GeneralRe: BitVector performance question Pin
Luc Pattyn15-Jan-10 1:47
sitebuilderLuc Pattyn15-Jan-10 1:47 
AnswerRe: Caching powers of 2 -- performance consideration Pin
harold aptroot15-Jan-10 4:38
harold aptroot15-Jan-10 4:38 
Jacek Gajek wrote:

My question: Is there any sens in caching masks? that is: {0x0, 0x1, 0x2,... ,0x10, 0x20,....0x100000...}. It would take 0,5 kB.

Only on old CPU's that don't have a single cycle shift by cl

Also, I would really ditch the % and / and use & and >> instead. The optimizer of the JIT compiler does optimize divisions and modulo's by constants, but for signed integers (even when it's trivial to prove that they can not be negative at that point) it wants to perfectly match real modulo en real division (which is not needed since it's not going to be negative anyway)

like: return (table[bit >> 6] & (1ul << bit)) != 0

edit: removed the redundant & 63
GeneralRe: Caching powers of 2 -- performance consideration Pin
Lutosław15-Jan-10 11:24
Lutosław15-Jan-10 11:24 
GeneralRe: Caching powers of 2 -- performance consideration Pin
harold aptroot15-Jan-10 11:51
harold aptroot15-Jan-10 11:51 
QuestionGenerate Color Book File Format (.acb file) for Photoshop using .NET or Other Language Pin
shaktisinh14-Jan-10 19:13
shaktisinh14-Jan-10 19:13 
Questionhow to inflate GDI+ Regoins Pin
VCsamir14-Jan-10 19:02
VCsamir14-Jan-10 19:02 
QuestionAny one having code to compare two xml files....? Pin
koolprasad200314-Jan-10 18:48
professionalkoolprasad200314-Jan-10 18:48 
AnswerRe: Any one having code to compare two xml files....? Pin
VCsamir14-Jan-10 18:56
VCsamir14-Jan-10 18:56 
GeneralRe: Any one having code to compare two xml files....? Pin
koolprasad200314-Jan-10 20:39
professionalkoolprasad200314-Jan-10 20:39 
GeneralRe: Any one having code to compare two xml files....? Pin
VCsamir14-Jan-10 21:17
VCsamir14-Jan-10 21:17 
GeneralRe: Any one having code to compare two xml files....? Pin
J4amieC14-Jan-10 21:31
J4amieC14-Jan-10 21:31 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.