Geeklog - The Ultimate Weblog System - 0 views
AutoMapper - CodePlex - 0 views
-
AutoMapper uses a fluent configuration API to define an object-object mapping strategy. AutoMapper uses a convention-based matching algorithm to match up source to destination values.
-
AutoMapper uses a fluent configuration API to define an object-object mapping strategy. AutoMapper uses a convention-based matching algorithm to match up source to destination values.
Web IDE EAP - JetBrains - 1 views
Embedding Python in LaTeX - 0 views
Joe Duffy's Weblog - OnBeingStateful - 0 views
-
The biggest question left unanswered in my mind is the role state will play in software of the future.
-
The biggest question left unanswered in my mind is the role state will play in software of the future. That seems like an absurd statement, or a naïve one at the very least. State is everywhere: The values held in memory. Data locally on disk. Data in-flight that is being sent over a network. Data stored in the cloud, including on a database, remote filesystem, etc. Certainly all of these kinds of state will continue to exist far into the future. Data is king, and is one major factor that will drive the shift to parallel computing. The question then is how will concurrent programs interact with this state, read and mutate it, and what isolation and synchronization mechanisms are necessary to do so?
-
Many programs have ample gratuitous dependencies, simply because of the habits we’ve grown accustomed to over 30 odd years of imperative programming. Our education, mental models, books, best-of-breed algorithms, libraries, and languages all push us in this direction. We like to scribble intermediary state into shared variables because it’s simple to do so and because it maps to our von Neumann model of how the computer works.
- ...3 more annotations...
MIT's Introduction to Algorithms, Lectures 22 and 23: Cache Oblivious Algorithms - good... - 0 views
-
Cache-oblivious algorithms should not be confused with cache-aware algorithms. Cache-aware algorithms and data structures explicitly depend on various hardware configuration parameters, such as the cache size. Cache-oblivious algorithms do not depend on any hardware parameters.
-
An example of cache-aware (not cache-oblivious) data structure is a B-Tree that has the explicit parameter B, the size of a node. The main disadvantage of cache-aware algorithms is that they are based on the knowledge of the memory structure and size, which makes it difficult to move implementations from one architecture to another.
-
« Cache-oblivious algorithms take into account something that has been ignored in all the lectures so far, particularly, the multilevel memory hierarchy of modern computers. Retrieving items from various levels of memory and cache make up a dominant factor of running time, so for speed it is crucial to minimize these costs. The main idea of cache-oblivious algorithms is to achieve optimal use of caches on all levels of a memory hierarchy without knowledge of their size. »
The Cloud as a Platform for Platforms - 0 views
-
AWS is not only a rich platform to build solutions but also a platform for building specialized platforms. Customers can choose to either use the AWS cloud directly or take advantage of these value-added platforms. Customers can also mix and match platforms from this rich ecosystem. \n\nIn this post, we look at some of the best examples of specialized platforms built on AWS:
JungleJar | Featured Web Application: PHPanywhere.net - 0 views
-
This is an extremely cool and useful web application, and if it hasn't been thought of before, I'm absolutely shocked, because it makes so much sense. Essentially, PHPanywhere is a web based free Integrated Development Environment or IDE for the PHP language. In other words it is a web based application that provides PHP developers a PHP code editor that mocks a desktop application, and it does so very well.
Axum - Microsoft DevLabs - 0 views
Functional Programming Has Warped Me - Blaine Buxton - 0 views
Free osCommerce Templates - 0 views
Alarming Development : JavaScript is good enough | Jan 2009 - 0 views
-
It is impossible to build a hash table in JavaScript that works on arbitrary objects. You would have to manually allocate unique ID’s for every object and include them in the toString. So no collections in JavaScript. Adobe provides a true built-in hashtable in ActionScript 3.
-
Objects can function as sets and maps. Arrays can function as lists and iterators (generate an array when you need an iterator). More that good enough in this context.
-
VB also often compiles down to better MSIL than C#. It is also the only .NET language with first-class edit-and-continue Lisp-like debugging capabilities.
- ...1 more annotation...
Diff/Merge/Patch Library for C#/.NET - 0 views
AvalonEdit - SharpDevelop Wiki - 0 views
Putting the "M" Back in MVC : Rob Conery - 0 views
Remember Smalltalk? | Gartner Blogs 2008 - 1 views
-
2) If you are BIG fan of dynamics languages (closures, meta programming, and all that cool stuff) then consider giving Smalltalk a look. You might like what you see. Its like Ruby but with bigger muscles. You think Rails is cool? Check out seaside. In the end we’ll see a up tick in Smalltalk momentum over the next few years.
-
Please don’t talk about Smalltalk. I enjoy my competitive advantage over the Java/NET crowd
-
Where Smalltalk really shines recently is in field of web applications due to its dynamic nature (live upgrading, debugging etc.) and because its shortcoming are not relevant here.
- ...9 more annotations...
Tailor - DarcsWiki - 1 views
-
Tailor is a tool to migrate or replicate changesets between ArX, Bazaar, Bazaar-NG, CVS, Codeville, Darcs, Git, Mercurial, Monotone, Subversion and Tla repositories.
-
Thanks for bookmarking this - if it works well, it is likely to lower the barriers to adoption of advanced source control tools like Darcs.
« First
‹ Previous
701 - 720 of 909
Next ›
Last »
Showing 20▼ items per page