Browse by Tags

Rough draft of a new JQuery method
24 November 08 08:41 PM | MattManela | 1 Comments   
I have run into issues recently with the browsers' implementation of the resize event on the window. Opera, Safari, IE and Firefox all have different behaviors when this event is fired. Firefox only fires it when you release the mouse. IE fires this event Read More...
Parameterized State Transformer Monad in F#?
04 November 08 09:30 PM | MattManela | 2 Comments   
I have have been playing around with F# and I decided to create a state monad. This worked out really well since I was able to leverage the F# computation expressions . I then decided to try to extend this and make it more general by creating a parameterized Read More...
Filed under: , ,
SQL CE 3.5 with LINQ to SQL Revisited
26 September 08 08:26 AM | MattManela | 1 Comments   
A few days ago I made a post about using SQL CE 3.5 with LINQ to SQL .   I described a way to use connection pooling with SQL CE. A gracious blog reader (Mike Brown)  pointed out a way I could make my solution much simpler by using the Read More...
Filed under: , ,
CollectionView.DeferRefresh() : My new best friend
28 August 08 02:23 PM | MattManela | 2 Comments   
Well, maybe not best friend but its a nice function.  When working with bound collections in WPF you often end up dealing with a CollectionView .  This is the MSDN documentation description of a CollectionView : You can think of a collection Read More...
Filed under: , ,
I started playing with F#...
22 August 08 09:23 AM | MattManela | 0 Comments   
I decided to do some Project Euler problems using F#.  So here is my first one, Problem # 31.  Nothing in this solution really shows off anything special about F# but you have to start somewhere ;)   1: #light 2:   3: let rec combos Read More...
The two most important WPF Tools
01 August 08 08:49 AM | MattManela | 0 Comments   
I have been working a lot with WPF and I found the following two FREE tools to be extremely helpful. The first is: XamlPadX - ( http://blogs.msdn.com/llobo/archive/2007/12/19/xamlpadx-v3-0.aspx ) This is an enhanced version of XamlPad which comes with Read More...
Filed under: , , ,
Foreach is Duck Typed!
22 July 08 10:04 AM | MattManela | 5 Comments   
I thought I know how the foreach construct worked under the covers. I figured the compiler would check if the type being iterated over implement IEnumerable or IEnumerator. And if so it will call MoveNext and Current to loop over the elements. But then Read More...
Filed under: , ,
Writing a Regular Expression parser in Haskell: Part 4
21 June 08 04:18 PM | MattManela | 1 Comments   
With the previous two modules in place we are now set up to use a DFA to match against a string. In my implementation I support either a greedy match or an short match. In a full featured regular expression engine this ability to choose greedy or not Read More...
Filed under: ,
Attachment(s): SimpleRegex.zip
Writing a Regular Expression parser in Haskell: Part 3
09 June 08 11:08 PM | MattManela | 1 Comments   
The third module in the simple regular expression parser is called: NFAtoDFA. Which as you might have guessed, takes the NFA that resulted from the first module and converts it into a DFA. The structure that the DFA uses is the same that the NFA uses Read More...
Filed under: ,
Attachment(s): NFAtoDFA.hs
ArgumentNullException vs ArgumentException
28 May 08 09:17 PM | MattManela | 2 Comments   
Both ArgumentNullException and ArgumentException have a constructor which takes two strings. One is the name of the parameter (or argument) in question and the other is a string describing the exception. The funny/odd/interesting thing about them is that Read More...
Filed under: ,
Intro to LINQ to SQL Optimistic Concurrency
22 May 08 08:40 PM | MattManela | 0 Comments   
After some investigation I feel I have a decent understanding on how LINQ to SQL concurrency works. LINQ to SQL uses optimistic concurrency which means that it never takes an exclusive lock on a table. It caches the information you are working with and Read More...
Filed under: , ,
Breadth First Tree Traversal in Haskell
11 May 08 07:30 PM | MattManela | 0 Comments   
As my interest in functional languages has grown, I have become increasingly interested in using them to implement algorithms which I can already write with imperative languages. For example, I was taught to implement (and I assume most other people as Read More...
Filed under: ,
Closures and Pass by Reference
30 April 08 07:15 PM | MattManela | 5 Comments   
What do you think the following code will do? Compile time error Run time error Work fine 1: static void Main( string [] args) 2: { 3: int x = 10; 4: int y = 5; 5: Swap( ref x, ref y); 6: } 7: 8: 9: static void Swap( ref int x, ref int y) 10: { 11: int Read More...
Filed under: ,
The J Language
27 April 08 10:13 PM | MattManela | 2 Comments   
I have been experimenting with this programming language called J . J is a full featured programming language capable of doing anything your more conventional language do. What makes J different is how it approaches solving problems. All functions (called Read More...
Filed under: ,
Combining Silverlight and JavaScript
13 April 08 04:49 PM | MattManela | 2 Comments   
Silverlight 2 is currently in Beta 1 but even in this early stage it has many amazing features. One of these features which I was toying around with today was its ability to integrate with its host page's DOM . What this means is that from Silverlight Read More...
More Posts Next page »
Page view tracker