CSharp Feeds

More on Zip in .NET [Richard Lee]

BCLTeam — Thu, 29 Jul 2010 23:21:29 GMT

First, I’d like to thank everybody for their comments on the Zip APIs. It’s great to know that I’m working on something that a lot of people will hopefully find useful. I’ll try to address the themes that came up in the comments. Streams A lot of the comments mentioned support for streams. The API does support creating a ZipArchive with a stream as the backing store, and input from streams. The following code sample takes the contents of instream and writes a Zip archive to outstream containin

There's a hole in my abstraction, dear Liza, dear Liza

skeet — Thu, 29 Jul 2010 20:41:06 GMT

I had an interesting day at work today. I thought my code had broken... but it turns out it was just a strange corner case which made it work very slowly. Usually when something interesting happens in my code it's quite hard to blog about it, because of all the confidentiality issues involved. In this case, it's extremely easy to reproduce the oddity in an entirely vanilla manner. All we need is the Java collections API. I have a set - a HashSet, in fact. I want to remove some items fro

Graph Colouring, Part Five

Eric Lippert — Thu, 29 Jul 2010 13:40:00 GMT

I said last time that I was interested in finding colourings for graphs that have lots of fully connected subgraphs, aka "cliques". For instance, I'd like to find a four-colouring for this sixteen-node graph: Yuck. What a mess. What this graph is doing a bad job of conveying is that there are twelve fully connected subsets. {0, 1, 2, 3} forms a clique. So does {0, 1, 4, 5}. And so does {0, 4, 8, 12}. It would be great if I had a better way to display full connectedness. How about this: I'll j

Iterate, damn you!

skeet — Tue, 27 Jul 2010 18:52:23 GMT

Do you know the hardest thing about presenting code with surprising results? It's hard to do so without effectively inviting readers to look for the trick. Not that that's always enough - I failed the last of Neal and Eric's C# puzzlers at NDC, for example. (If you haven't already watched the video, please do so now. It's far more entertaining than this blog post.) Anyway, this one may be obvious to some of you, but there are some interesting aspects even when you've got

Introducing ASP.NET MVC 3 (Preview 1)

ScottGu — Tue, 27 Jul 2010 16:06:23 GMT

This morning we posted the “Preview 1” release of ASP.NET MVC 3. You can download it here. We’ve used an iterative development approach from the very beginning of the ASP.NET MVC project, and deliver regular preview drops throughout the development cycle. Our goal with early preview releases like the one today is to get feedback – both on what you like/dislike, and what you find missing/incomplete. This feedback is super valuable – and ultimately makes the final product m

Graph Colouring, Part Four

Eric Lippert — Mon, 26 Jul 2010 15:20:00 GMT

Let's give it a try. Can we colour South America with only four colours? Let's start by stating what all the edges are in the graph of South America: const int Brazil = 0;const int FrenchGuiana = 1;const int Suriname = 2;const int Guyana = 3; const int Venezuala = 4;const int Colombia = 5;const int Ecuador = 6;const int Peru = 7;const int Chile = 8;const int Bolivia = 9;const int Paraguay = 10;const int Uruguay = 11;const int Argentina = 12;var SA = new Dictionary<int, int[]>(){ &nb

Degrees of reality in sample code

skeet — Sun, 25 Jul 2010 20:58:03 GMT

Yesterday I tweeted a link to an article about overloading that I'd just finished. In that article, all my examples look a bit like this: using System; class Test { static void Foo(int x, int y = 5) { Console.WriteLine("Foo(int x, int y = 5)"); } static void Foo(double x) {

FakeItEasy Login Service Example Series – Part 7

Patrik Hägne — Sat, 24 Jul 2010 11:18:00 GMT

This is the seventh and last part in the series of posts where I’m porting Brett Schucherts excelent demo of Mockito in Java to C# and FakeItEasy. The source for this example series can be found in a Mercurial repository at Google code. Each test implementation and following code update is a separate commit so you can easily update your repository to look at the full code at any given state. Find the repository here. Part 1 can be found here. Part 2 can be found here. Part 3 can be found her

Entity Framework 4 “Code-First” - Custom Database Schema Mapping

ScottGu — Fri, 23 Jul 2010 08:09:00 GMT

Last week I blogged about the new Entity Framework 4 “code first” development option. The EF “code-first” option enables a pretty sweet code-centric development workflow for working with data. It enables you to: Develop without ever having to open a designer or define an XML mapping file Define model objects by simply writing “plain old classes” with no base classes required Use a “convention over configuration” approach that enables database persistence withou

Graph Colouring with Simple Backtracking, Part Three

Eric Lippert — Thu, 22 Jul 2010 13:54:00 GMT

OK, we've got our basic data structures in place. Graph colouring is a very well-studied problem. It's known to be NP-complete for arbitrary graphs, so (assuming that P!=NP) we're not going to find an always-fast algorithm for colouring an arbitrary graph. However, for typical graphs that we encounter in the wild, the following simple algorithm is pretty good. Start by saying that every node can be every possible colour. Then: 1) Do you have a single possible colouring for every node in t