www.antiyes.com - c#

Asp.Net MVC Calendar Helper

johnboker — Fri, 18 Feb 2011 14:00:59 +0000

What it looks like

Recently while working on a project with Asp.Net MVC 3 there was a need for a small calendar similar to the asp.net calendar control. After some searching I decided that the easiest method to get this done would be to write a Html Helper. Below is the code that seems to work nicely. This works even if the browser does not support javascript. For added functionality you could add an extra parameter to show highlighted dates or extend it to fill a page and add content to the cells.

using System;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using System.Web;
using System.Web.Mvc;
 
namespace AntiYes.Helpers
{
    public static class CalendarExtensions
    {
        public static IHtmlString Calendar(this HtmlHelper helper, DateTime dateToShow)
        {
            DateTimeFormatInfo cinfo = DateTimeFormatInfo.CurrentInfo;
            StringBuilder sb = new StringBuilder();
            DateTime date = new DateTime(dateToShow.Year, dateToShow.Month, 1);
            int emptyCells = ((int)date.DayOfWeek + 7 - (int)cinfo.FirstDayOfWeek) % 7;
            int days = DateTime.DaysInMonth(dateToShow.Year, dateToShow.Month);
            sb.Append("<table class='cal'><tr><th colspan='7'>" + cinfo.MonthNames[date.Month - 1] + " " + dateToShow.Year + "</th></tr>");
            for (int i = 0; i < ((days + emptyCells) > 35 ? 42 : 35); i++)
            {
                if (i % 7 == 0)
                {
                    if (i > 0) sb.Append("</tr>");
                    sb.Append("<tr>");
                }
 
                if (i < emptyCells || i >= emptyCells + days)
                {
                    sb.Append("<td class='cal-empty'>&nbsp;</td>");
                }
                else
                {
                    sb.Append("<td class='cal-day'>" + date.Day + "</td>");
                    date = date.AddDays(1);
                }
            }
            sb.Append("</tr></table>");
            return helper.Raw(sb.ToString());
        }
    }
}

29. Hash it! - Solution

johnboker — Fri, 26 Nov 2010 03:54:47 +0000

After going back and forth over this code for it seems like an eternity (about an hour) I finally got an accepted solution. The problem turned out to be a small typo.

Here it is, my solution to https://www.spoj.pl/problems/HASHIT/ in C#.

using System;
using System.Text;
 
namespace HASHIT
{
        class MainClass
        {
                public static void Main (string[] args)
                {                       
                        int t = Convert.ToInt32 (System.Console.ReadLine ());
                        
                        for (int i = 0; i < t; i++) 
                        {
                                string[] table = new string[101];
                                int n = Convert.ToInt32 (System.Console.ReadLine ());
                                for (int i2 = 0; i2 < n; i2++) 
                                {
                                        string line = System.Console.ReadLine ();
                                        string op = line.Substring (0, 3);
                                        string key = line.Substring (4);
                                        int ix = FindKey (table, key);
                                        
                                        if (op == "ADD") 
                                        {
                                                if (ix == -1) 
                                                {
                                                        ix = FindNextOpenAddress (table, Hash (key));
                                                        if (ix >= 0) 
                                                        {
                                                                table[ix] = key;
                                                        }
                                                }
                                        } 
                                        else 
                                        {
                                                if (ix >= 0) 
                                                {
                                                        table[ix] = string.Empty;
                                                }
                                        }
                                }
 
                                StringBuilder sb = new StringBuilder ();
                                int count = 0;
                                for (int j = 0; j < 101; j++) 
                                {
                                        if (!string.IsNullOrEmpty (table[j])) 
                                        {
                                                count++;
                                                sb.AppendLine (j + ":" + table[j]);
                                        }
                                }
                                Console.WriteLine (count);
                                Console.Write (sb.ToString ());
                        }
                }
 
                public static int Hash (string key)
                {
                        int ret = 0;
                        ret = h (key) % 101;
                        return ret;
                }
 
                public static int h (string key)
                {
                        int ret = 0;
                        int cnt = key.Length;
                        for (int i = 0; i < cnt; i++) 
                        {
                                ret += (int)key[i] * (i + 1);
                        }
                        return ret * 19;
                }
 
                public static int FindKey (string[] table, string key)
                {
                        int ix = Hash (key);
                        if (table[ix] == key)
                                return ix;
                        for (int j = 1; j < 20; j++) 
                        {
                                int newix = (ix + j * j + 23 * j) % 101;
                                if (table[newix] == key) 
                                {
                                        return newix;
                                }
                        }
                        return -1;
                }
 
                public static int FindNextOpenAddress (string[] table, int ix)
                {
                        if (string.IsNullOrEmpty (table[ix]))
                                return ix;
                        for (int j = 1; j < 20; j++) 
                        {
                                int newix = (ix + j * j + 23 * j) % 101;
                                if (string.IsNullOrEmpty (table[newix])) 
                                {
                                        return newix;
                                }
                        }
                        return -1;
                }
        }
}

Stir Trek 2: Iron Man Edition

johnboker — Mon, 19 Apr 2010 13:40:42 +0000

When:

Friday, May 7, 2010 - 7:30am - 7:00pm

Stir Trek is an opportunity to learn about the newest advances in web and mobile development. There will be 20 sessions, in four tracks, so you’ll be able to pick the content that interests you the most. In addition, the day will include lunch, a raffle with some significant prizes, and a private screening of the new IronMan 2 movie, which opens in theaters the day of this event.

Visit http://www.stirtrek.com/ for more information.

Central Ohio Day of .NET 2010

johnboker — Tue, 13 Apr 2010 14:09:54 +0000

When:

Saturday, June 5, 2010 - 8:00am - 5:00pm

The Central Ohio Day of .NET is a joint venture between the Dayton .NET Developers Group, Central Ohio .NET Developers Group, Cincinnati SQL Server Users Group and the Cincinnati .NET Users Group. The event originally was called the Cincinnati-Dayton Area Code camp and ran in 2006 and 2007 under that name. With the inclusion of the Columbus And CincySQL group the event has been renamed to the Central Ohio Day of .NET. The event is a FREE day of technology discussions devoted to helping the local development community grow. Please check back often for more information about Day of .NET events.

Day of .NET events are a series of mini-conferences organized by developers for developers. You can find out more about Day of .NET events, including seeing upcoming events, on the series website at http://www.dodn.org.
Central Ohio Day of .NET 2010!

The Cincinnati .Net Users Group, Central Ohio .NET Developers Group, Dayton .Net Developers Group and Cincinnati SQL Users Group will be hosting this year's Central Ohio Day of .NET on June 5th, 2010. The event will be held at the Roberts Centre in Wilmington, OH (off exit 50 on I-71).

899. Ws Cipher

johnboker — Sat, 13 Mar 2010 06:49:52 +0000

https://www.spoj.pl/problems/WSCIPHER/

Weird Wally's Wireless Widgets, Inc. manufactures an eclectic assortment of small, wireless, network capable devices, ranging from dog collars, to pencils, to fishing bobbers. All these devices have very small memories. Encryption algorithms like Rijndael, the candidate for the Advanced Encryption Standard (AES) are demonstrably secure but they don't fit in such a tiny memory. In order to provide some security for transmissions to and from the devices, WWWW uses the following algorithm, which you are to implement.

Encrypting a message requires three integer keys, k₁, k₂, and k₃. The letters [a-i] form one group, [j-r] a second group, and everything else ([s-z] and underscore) the third group. Within each group the letters are rotated left by k_i positions in the message. Each group is rotated independently of the other two. Decrypting the message means doing a right rotation by k_i positions within each group.

Consider the message the_quick_brown_fox encrypted with k_i values of 2, 3 and 1. The encrypted string is _icuo_bfnwhoq_kxert. The figure below shows the decrypting right rotations for one character in each of the three character groups.

Looking at all the letters in the group [a-i] we see {i,c,b,f,h,e} appear at positions {2,3,7,8,11,17} within the encrypted message. After a right rotation of k₁=2, these positions contain the letters {h,e,i,c,b,f}. The table below shows the intermediate strings that come from doing all the rotations in the first group, then all rotations in the second group, then all the rotations in the third group. Rotating letters in one group will not change any letters in any of the other groups.

	[a-i], k₁= 2	[j-r], k₂= 3	[s-z] and _, k₃= 1
Encrypted:	`_icuo_bfnwhoq_kxert`	`_heuo_icnwboq_kxfrt`	`_heuq_ickwbro_nxfot`
Decrypted:	`_heuo_icnwboq_kxfrt`	`_heuq_ickwbro_nxfot`	`the_quick_brown_fox`
Changes:	`^^ ^^ ^ ^`	`^ ^ ^^ ^ ^`	`^ ^ ^ ^ ^ ^ ^`

All input strings contain only lowercase letters and underscores(_). Each string will be at most 80 characters long. The k_i are all positive integers in the range 1-100.

Input consists of information for one or more encrypted messages. Each problem begins with one line containing k₁, k₂, and k₃ followed by a line containing the encrypted message. The end of the input is signalled by a line with all key values of 0.

For each encrypted message, the output is a single line containing the decrypted string.

Input:
2 3 1
_icuo_bfnwhoq_kxert
1 1 1
bcalmkyzx
3 7 4
wcb_mxfep_dorul_eov_qtkrhe_ozany_dgtoh_u_eji
2 4 3
cjvdksaltbmu
0 0 0

Output:
the_quick_brown_fox
abcklmxyz
the_quick_brown_fox_jumped_over_the_lazy_dog
ajsbktcludmv

Added by:	Wanderley Guimarães
Date:	2006-06-09
Time limit:	1s
Source limit:	50000B
Languages:	All except: ERL TECS JS
Resource:	ACM Mid Central Regionals 2001

My Solution

using System;
using System.Collections.Generic;
 
namespace www.spoj.pl._899_WSCIPHER
{
    class Program
    {
        static void Main(string[] args)
        {
            while (true)
            {
                string line = Console.In.ReadLine();
                string[] nums = line.Split(new char[] { ' ' });
                if (nums.Length == 3)
                {
                    int k1 = 0;
                    int.TryParse(nums[0], out k1);
                    int k2 = 0;
                    int.TryParse(nums[1], out k2);
                    int k3 = 0;
                    int.TryParse(nums[2], out k3);
 
                    if (k1 == 0 && k2 == 0 && k3 == 0)
                        break;
 
                    string ciphertext = Console.In.ReadLine();
 
                    CipherGroup Group1 = new CipherGroup(k1);
                    CipherGroup Group2 = new CipherGroup(k2);
                    CipherGroup Group3 = new CipherGroup(k3);
                    int len = ciphertext.Length;
                    for (int i = 0; i < len; i++)
                    {
                        char c = ciphertext[i];
                        if (c >= 'a' && c <= 'i')
                        {
                            Group1.Add(c, i);
                        }
                        else if (c >= 'j' && c <= 'r')
                        {
                            Group2.Add(c, i);
                        }
                        else
                        {
                            Group3.Add(c, i);
                        }
                    }
 
                    Group1.Rotate();
                    Group2.Rotate();
                    Group3.Rotate();
 
                    string[] letters = new string[len];
                    Group1.AddToArray(letters);
                    Group2.AddToArray(letters);
                    Group3.AddToArray(letters);
 
                    Console.WriteLine(string.Join("", letters));
                }
            }
        }
    }
 
    public class CipherGroup
    {
        public int k { get; set; }
        public List<char> Letters { get; set; }
        public List<int> Positions { get; set; }
        public CipherGroup(int k1)
        {
            k = k1;
            Letters = new List<char>();
            Positions = new List<int>();
        }
        public void Add(char c, int p)
        {
            Letters.Add(c);
            Positions.Add(p);
        }
        public void Rotate()
        {
            int len = Letters.Count;
            if (len == 0) return;
            for (int i = 0; i < k; i++)
            {
                Letters.Insert(0, Letters[len - 1]);
                Letters.RemoveAt(len);
            }
        }
 
        public void AddToArray(string[] letters)
        {
            int len = Letters.Count;
            for (int i = 0; i < len; i++)
            {
                letters[Positions[i]] = Letters[i].ToString();
            }
        }
    }
}

1026. Questions and answers

johnboker — Thu, 11 Mar 2010 03:13:45 +0000

http://acm.timus.ru/problem.aspx?space=1&num=1026

Time Limit: 2.0 second
Memory Limit: 16 MB

Background

The database of the Pentagon contains a top-secret information. We don’t know what the information is — you know, it’s top-secret, — but we know the format of its representation. It is extremely simple. We don’t know why, but all the data is coded by the natural numbers from 1 up to 5000. The size of the main base (we’ll denote it be N) is rather big — it may contain up to 100 000 those numbers. The database is to process quickly every query. The most often query is: "Which element is i-th by its value?"— with i being a natural number in a range from 1 to N.

Problem

Your program is to play a role of a controller of the database. In the other words, it should be able to process quickly queries like this.

Input

Input of the problem consists of two parts. At first, a database is written, and then there’s a sequence of queries. The format of database is very simple: in the first line there’s a number N, in the next N lines there are numbers of the database one in each line in an arbitrary order. A sequence of queries is written simply as well: in the first line of the sequence a number of queries K (1 ≤ K ≤ 100) is written, and in the next K lines there are queries one in each line. The query "Which element is i-th by its value?" is coded by the number i. A database is separated from a sequence of queries by the string of three symbols "#".

Output

The output should consist of K lines. In each line there should be an answer to the corresponding query. The answer to the query "i" is an element from the database, which is i-th by its value (in the order from the least up to the greatest element).

Sample

input	output
5 7 121 123 7 121 ### 4 3 3 2 5	121 121 7 123

Problem Author: Leonid Volkov
Problem Source: Ural State University Internal Contest October'2000 Junior Session

My Solution

using System;
using System.Collections;
using System.Globalization;
 
namespace acm.timus.ru_p1026
{
    class Program
    {
        static void Main(string[] args)
        {
            ArrayList list = new ArrayList(100000);
            NumberFormatInfo nfi = NumberFormatInfo.InvariantInfo;
            string[] input = Console.In.ReadToEnd().Split(new char[] { ' ', '\t', '\n', '\r' }, StringSplitOptions.RemoveEmptyEntries);
            int i = 0;
            int len1 = Int32.Parse(input[0]);
            for (i = 1; i <= len1; i++)
            {
                int n = Int32.Parse(input[i]);               
                list.Add(n);
            }
            int len2 = Int32.Parse(input[len1+2]) + len1 + 3;
            list.Sort();
            for (int j = len1 + 3; j < len2; j++)
            {
                int n = Int32.Parse(input[j])-1;
                Console.WriteLine(list[n]);
            }
        }
    }
}

Asp.net: File Download Handler

johnboker — Tue, 24 Nov 2009 07:16:10 +0000

Recently I had the need to make a file download page where statistics could be collected and saved on each individual download. After a little research I found a nice way to get this task done easily.

Because it is only collecting stats about the download and then sending the file to the browser, I decided to use an Asp.net Generic Handler.

Download.ashx.cs:

using System;
using System.Collections.Generic;
using System.Linq;
using System.Web;
using System.Web.Services;
using System.IO;
 
namespace WriteFileTest
{
    [WebService(Namespace = "http://tempuri.org/")]
    [WebServiceBinding(ConformsTo = WsiProfiles.BasicProfile1_1)]
    public class Download : IHttpHandler
    {
 
        private string FilesPath
        {
            get
            {
                return @"C:\Users\John Boker\Documents\Visual Studio 2008\Projects\WriteFileTest\Files\";
            }
        }
 
        public void ProcessRequest(HttpContext context)
        {
            string filename = context.Request.QueryString["file"];
            if (!string.IsNullOrEmpty(filename) && File.Exists(FilesPath + filename))
            {
                context.Response.ContentType = "application/octet-stream";
                context.Response.AddHeader("Content-Disposition", string.Format("attachment; filename=\"{0}\"", filename));
                context.Response.WriteFile(FilesPath + filename);
            }
            else
            {
                context.Response.ContentType = "text/plain";
                context.Response.Write("Invalid filename");
            }
        }
 
        public bool IsReusable
        {
            get
            {
                return false;
            }
        }
    }
}

One advantage to this method is the files do not have to be in the website directories and public, extra authentication can be done and the download can be disallowed if necessary.

To test this i created a small Default.aspx page containing:

<%@ Page Language="C#" AutoEventWireup="true" CodeBehind="Default.aspx.cs" Inherits="WriteFileTest._Default" %>
 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head runat="server">
    <title></title>
</head>
<body>
    <form id="form1" runat="server">
    <div>
        <a href="Download.ashx?file=FileZilla_3.3.0.1_win32-setup.exe&d=<%= DateTime.Now.Ticks %>">FileZilla_3.3.0.1_win32-setup.exe</a>
        <br />
        <a href="Download.ashx?file=gimp-2.6.7-i686-setup.exe&d=<%= DateTime.Now.Ticks %>">gimp-2.6.7-i686-setup.exe</a>
        <br />
        <a href="Download.ashx?file=jdk-6u17-windows-x64.exe&d=<%= DateTime.Now.Ticks %>">jdk-6u17-windows-x64.exe</a>
        <br />
        <a href="Download.ashx?file=WampServer2.0i.exe&d=<%= DateTime.Now.Ticks %>">WampServer2.0i.exe</a>
    </div>
    </form>
</body>
</html>

As you can see i added another argument to the QueryString; this is to keep the browser from caching files with the same link and filename.

The results after clicking the filezilla link:

This was a very simple method to take care of multiple issues including:

Download Tracking
Alternate File Locations
Browser Caching Issues
Extra Authentication

StringBuilder vs. Concatenation

johnboker — Sun, 16 Aug 2009 21:57:29 +0000

1: Intro

After the if vs. ternary deathmatch I started wondering just how much slower string concatenation was versus using a StringBuilder. Below are the test and results, not very surprising though.

2: Code

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;
 
namespace ConsoleApplication4
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] words = ("Quisque in neque at orci congue " +
                            "tempor. Donec id eros velit, eu " +
                            "sodales est. Sed purus eros, tempor  " +
                            "id ultricies eget, volutpat a mauris.  " +
                            "Suspendisse potenti. Suspendisse id  " +
                            "ligula nec felis mattis pellentesque  " +
                            "nec quis ipsum. Vivamus sed metus nunc,  " +
                            "non eleifend ligula. Sed mollis sagittis  " +
                            "pellentesque. Nam sit amet ante ut risus  " +
                            "pulvinar rhoncus. Vestibulum molestie  " +
                            "feugiat leo sed placerat. Sed consectetur " +
                            "velit ut magna molestie molestie tincidunt " +
                            "magna viverra. Quisque eu diam lacus. Sed  " +
                            "blandit, felis vel sollicitudin pellentesque, " +
                            "sapien nisl ullamcorper mauris, dapibus  " +
                            "accumsan diam augue et diam. Ut suscipit  " +
                            "nibh pretium nisi pulvinar vitae condimentum  " +
                            "felis mattis. Donec justo orci, gravida in  " +
                            "aliquam et, cursus sit amet sapien. Pellentesque " +
                            "mauris ipsum, ornare ac blandit nec, pretium  " +
                            "nec purus. Curabitur malesuada, lectus at  " +
                            "fermentum tempus, risus orci condimentum  " +
                            "lorem, id consequat dolor velit sed arcu.  " +
                            "Duis hendrerit rutrum tellus, a dignissim  " +
                            "velit facilisis ac. Curabitur pretium quam a " +
                            "metus sagittis mattis. Cum sociis natoque  " +
                            "penatibus et magnis dis parturient montes,  " +
                            "nascetur ridiculus mus.").Split(" ".ToCharArray());
 
 
            TimeSpan concatenationTestTime = TestConcatenation(words);
            TimeSpan stringbuilderTestTime = TestStringBuilder(words);
 
            Console.WriteLine(string.Format("StringBuilder: {0}", stringbuilderTestTime));
            Console.WriteLine(string.Format("Concatenation: {0}", concatenationTestTime));
 
            Console.ReadLine();
 
        }
 
        static TimeSpan TestConcatenation(string[] words)
        {
            string finalResult = string.Empty;
            Stopwatch sw = new Stopwatch();
            sw.Start();
            for (int i = 0; i < 100; i++)
            {
                foreach (string word in words)
                {
                    finalResult = finalResult + word;
                    finalResult = finalResult + " ";
                }
            }
            sw.Stop();
            return sw.Elapsed;
        }
 
        static TimeSpan TestStringBuilder(string[] words)
        {
            string finalResult = string.Empty;
            StringBuilder full = new StringBuilder();
            Stopwatch sw = new Stopwatch();
            sw.Start();
            for (int i = 0; i < 100; i++)
            {
                foreach (string word in words)
                {
                    full.Append(word);
                    full.Append(" ");
                }
            }
            finalResult = full.ToString();
            sw.Stop();
            return sw.Elapsed;
        }
    }
}

3: Results

The not too surprising results: StringBuilder is a lot faster than string concatenation.

If vs Ternary: Deathmatch

johnboker — Sat, 08 Aug 2009 19:38:15 +0000

1: INTRO

The Fun With the ?? Operator in C#: if { } or ?? – Which is Faster? article by Keith Elder got me thinking about the if statement and the ternary operator.

Is there a real difference or are they both the same?

To answer this question I put together a little project that tests both cases and times them.

2: CODE

using System;
using System.Diagnostics;
 
namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
 
            string[] strArray = new string[20000];
            Random r = new Random((int)DateTime.Now.Ticks);
            for (int i = 0; i < 500; i++)
            {
                int rnum = r.Next();
                if (rnum % 2 == 0)
                {
                    strArray[i] = null;
                }
                else
                {
                    strArray[i] = rnum.ToString();
                }
            }
 
            TimeSpan ts1 = TimeSpan.Zero;
            TimeSpan ts2 = TimeSpan.Zero;
 
            for (int i = 0; i < strArray.Length; i++)
            {
                ts2 = ts2.Add(countWithTernary(strArray));
                ts1 = ts1.Add(countWithIf(strArray));
            }
 
            for (int i = 0; i < strArray.Length; i++)
            {
                ts1 = ts1.Add(countWithIf(strArray));
                ts2 = ts2.Add(countWithTernary(strArray));
            }
 
            Console.WriteLine("     if: " + ts1.TotalMilliseconds.ToString());
            Console.WriteLine("ternary: " + ts2.TotalMilliseconds.ToString());
            Console.ReadLine();
        }
 
 
        private static TimeSpan countWithIf(string[] arr)
        {
            Stopwatch sw = new Stopwatch();
            int len = arr.Length;
            int count = 0;
            sw.Start();
            for (int i = 0; i < len; i++)
            {
                if (arr[i] == null)
                {
                    count += 1;
                }
                else
                {
                    count += 2;
                }
            }
            sw.Stop();
            return sw.Elapsed;
        }
 
        private static TimeSpan countWithTernary(string[] arr)
        {
            Stopwatch sw = new Stopwatch();
            int len = arr.Length;
            int count = 0;
            sw.Start();
            for (int i = 0; i < len; i++)
            {
                count += arr[i] == null ? 1 : 2;
            }
            sw.Stop();
            return sw.Elapsed;
        }
    }
}

3: RESULTS

The output of the above code suprised me, here are the results:

Here we see that using the if statement is much faster than the ternary operator.

In release the if statement gets faster and the ternary stays about the same.

Surprising to me here was when compiled with x64 the if statement was just as slow (or even slower) than the ternary one.

In release for the x64 they're both almost the same again but the ternary operation is faster than the x86 version.

4: CONCLUSION

In conclusion i think using the if statement would be faster in most cases although in most applications the difference would be unnoticeable.

Codestock 2009 Agenda

johnboker — Tue, 09 Jun 2009 03:46:45 +0000

The Codestock agenda has been posted, here's the pdf CodeStockSchedule2009.pdf

More Randomer - one year at a time

johnboker — Tue, 02 Jun 2009 18:48:40 +0000

It's been a full year since our company's code was posted to the daily wtf at more randomer (<-- link to the more randomer post).

The creator of dosomethinghere.com saw the need for cupcakes, he also has a better comment on this occasion.

Codestock

johnboker — Fri, 29 May 2009 20:56:08 +0000

When:

Friday, June 26, 2009 (All day) - Saturday, June 27, 2009 (All day)

CodeStock is about Community. For Developers, by Developers (with love for SysAdmins and DBAs too!). Last year an idea started at CodeStock to mix Open Spaces within a traditional conference. This year we're going to crank things up to 11 and rip off the knob - and you're being drafted to help!

CodeStock On Web

If you've blogged about CodeStock, let us know!

Read A Letter to the Community on CodeStock 2009 by CodeStock Organizer, Michael C. Neel

Visual Studio 2010 Beta1 Install

johnboker — Sun, 24 May 2009 01:55:07 +0000

Visual Studio 2010 Beta1 Install

Visual Studio 2010 Beta 1 download options

johnboker — Wed, 20 May 2009 20:06:25 +0000

http://blogs.msdn.com/onoj/

Visual Studio 2010 Beta 1 download options

Visual Studio 2010 beta 1 alternative download options and sku's, set to go live May 20 AM (PSDT):

Professional

Visual Studio 2010 Professional Beta 1 – Web Installer

Visual Studio 2010 Professional Beta 1 – ISO

Team System

Visual Studio Team System 2010 Team Suite Beta 1 – Web Installer

Visual Studio Team System 2010 Team Suite Beta 1 - ISO

Visual Studio Team System 2010 Test Load Agent Beta 1

Visual Studio Team System 2010 Team Foundation Server Beta 1

Microsoft Visual Studio Lab Management 2010 Beta 1

Visual Studio Team System 2010 Lab Agent Beta 1

.NET Framework

Microsoft .NET Framework 4.0 Beta 1

Microsoft .NET Framework 4.0 Client Profile Beta 1

Other bits

Microsoft Visual Studio 2010 Remote Debugger (Beta 1)

Visual Studio 2010 Shell (Integrated) Beta 1 Redistributable Package

Visual Studio 2010 Shell (Isolated) Beta 1 Redistributable Package

Visit the Visual Studio 2010 and .NET Framework 4 Beta 1 site (link to go live May 20, AM (PSDT)) to download the Beta, submit product feedback, find links to forums or for additional information about the Beta.

Visual Studio 2010 Beta1

johnboker — Fri, 15 May 2009 12:18:16 +0000

http://blogs.msdn.com/dannawi/archive/2009/05/15/visual-studio-2010-beta-1-available-for-the-msdn-subscribers-on-monday-may-18th.aspx

Visual Studio 2010 Beta 1 available for the MSDN subscribers on Monday May 18th

On Monday, May 18th, Visual Studio 2010 Beta 1 (Professional, Suite and Team Foundation Server) will be available to MSDN Subscribers through MSDN Subscriber Downloads and to the general public on Wednesday, May 20th through Microsoft Downloads.

Stir Trek

johnboker — Thu, 30 Apr 2009 01:38:33 +0000

When:

Friday, May 8, 2009 - 9:00am - 6:00pm

Stir Trek is an opportunity to learn about the key announcements from the Mix 09 conference, at a location that is a little closer to home, and in the comfort of a movie theater. There will be 10 sessions, in two tracks, so you’ll be able to pick the content that interests you the most.

.Net Programming

johnboker — Sat, 11 Apr 2009 06:11:51 +0000

if(iWroteIt())
{
    HasBugs = true;
}

Here is where .NET programming information will go.