Hi all,
I just want to know if there are some videos of presentation/ review/ slides
which are available somewhere?
cheers,
Olivier
___
Mono-devel-list mailing list
Mono-devel-list@lists.ximian.com
http://lists.ximian.com/mailman/listinfo/mono-devel-lis
Dear Monkeys,
I would like firstly to thank everyone for the great time I had during
this Mono Summit. It was a pleasure for me to meet and spend this week
with you guys.
I suggest everyone replies to this e-mail with a link of his/her
zip-ed/tar-ed/whatever photos of the event. Also if you don't
So, I have done a unit test (and run it on linux but not on windows) and fix
some bug thanks to it ;)
If someone can test it under the MS framework.
So here is a new patch with unit test and modified class. I have truncate
the patch to remove my other changes. So maybe it will not work. If you have
hi !
i write a little class for fsw. under windows i received
the fullname and name of the concerned file in the right length.
if i copy the executables to opensuse10.2 (mono 1.2.5.1) on the vm and
run the exe with "mono programmname.exe" i miss the first byte after
slash if a get the FileSyste
On Sat, 2007-12-01 at 18:01 +, Alan McGovern wrote:
> Well, 'N' could be computed by asking what percent bloat is 'OK' or it
> could be computed by asking 'What % speedup do we want to make this a
> worthwhile tradeoff'.
Wouldn't be this a good case for "desktop" vs "server" runtime mode?
Whi
On Dec 1, 2007 5:55 PM, Robert Jordan <[EMAIL PROTECTED]> wrote:
> You have 3 choices:
> [...]
Thanks for the quick answer. That was very helpful.
> 1. Embed the mono runtime. See
> http://www.mono-project.com/Embedding_Mono
I've tried this solution. It works great. Thanks a lot.
--
Laur
It doesn't make much sense to pre-compute the hashcode for a string
whose length is not greater than the cacheline size. Anything that
fits into the cacheline and is not memory bound is plenty fast enough.
For the same reason, the size and hashcode of a string would need to
be juxtaposed i
Also, worst case scenario for a zero length string would mean a 22%
increase, not a 100% increase as was said before.
Alan.
On Dec 1, 2007 6:01 PM, Alan McGovern <[EMAIL PROTECTED]> wrote:
> Well, 'N' could be computed by asking what percent bloat is 'OK' or it
> could be computed by asking 'Wha
Well, 'N' could be computed by asking what percent bloat is 'OK' or it could
be computed by asking 'What % speedup do we want to make this a worthwhile
tradeoff'.
Currently a string has these two fields, an int and a char. Add in the
object overhead of (i think) 12 bytes per object, you're up to 1
Hi Alan,
Alan McGovern wrote:
> Also, just looking at the string source a bit more closely, it has a
> GetCaseInsensitiveHashcode method too, so i'd assume that would need to be
> cached too which would mean 8 bytes would be needed. This wouldn't scale
> well.
>
> Fair enough. Twas just an idea.
Laurent Le Brun wrote:
> Hi,
>
> I'd like to create a dynamic library (for Linux), from a .NET source
> file. I've searched in the web for this, but didn't find anything. I
> hope this is the right list for this question.
There is a reason for the lack of informations about
using a .NET assembly
Hi,
I'd like to create a dynamic library (for Linux), from a .NET source
file. I've searched in the web for this, but didn't find anything. I
hope this is the right list for this question.
So, I'd like to get a .so library, that I can call from C/C++ code.
I compiled my .NET files into a .dll fil
Also, just looking at the string source a bit more closely, it has a
GetCaseInsensitiveHashcode method too, so i'd assume that would need to be
cached too which would mean 8 bytes would be needed. This wouldn't scale
well.
Fair enough. Twas just an idea.
Alan.
On Dec 1, 2007 4:09 PM, Robert Jord
Tinco Andringa wrote:
> (Woops, only replied to kamil)
>
> If Jerome is right and the overhead is only 4 bytes, then overhead
> shouldn't be a problem at all. The worst case size of a string would
> be 1 character, of 2 bytes + something to end it with, like an int
> containing its length, 2 bytes
(Woops, only replied to kamil)
If Jerome is right and the overhead is only 4 bytes, then overhead shouldn't be
a problem at all. The worst case size of a string would be 1 character, of 2
bytes + something to end it with, like an int containing its length, 2 bytes,
or a terminating character,
Alan McGovern wrote:
> A thought struck me while i was dozing on the plane on the way home from the
> summit.
>
> Since strings are immutable, shouldn't it be possible to compute the
> hashcode once and store it rather than recomputing it over and over again?
> Is there some really obvious reason
If you find a bug that affects you that you need fixed, it's up to you to
show that there is a bug. If you paste code in an email, of course people
are going to look at it. If that code is wrong, well, that's not our fault.
You shouldn't paste code which supposedly shows an issue when in fact that
On the day of Friday 30 November 2007 Andreas Färber hast written:
> Am 30.11.2007 um 22:10 schrieb Prakash Punnoor:
> > On the day of Friday 30 November 2007 Robert Jordan hast written:
> >> The layouts don't match, since declaring a field "private" won't
> >> magically subtract it from struct lay
18 matches
Mail list logo
