Improved Indexing in Lex.DB 1.1 19

Original indexing feature was rather limited. You could look for records with specified values of indexed key only. Basically it was only useful for speedy access to related entities. Like child entities via parent key. This has now been drastically improved. The new indexing adds capabilities to query records with less, great and between operators. ...

NuGet Release of KindOfMagic

Happy to announce that latest version 1.2.1 of KindOfMagic MSBuild task is now available as NuGet package. I’ve got several requests to publish KindOfMagic on NuGet, but due to lack of time wasn’t able to accomplish this task before. But now it is finally happen. I dig into PowerShell scripts to find out how to transform .csproj files ...

Portable Usage Scenario of Lex.DB 8

Portable Usage Scenario of Lex.DB
Preface One of the beauties of .NET framework is that it works the same way across all Microsoft platforms including PCs, tablets, gaming consoles, phones and browsers. However there are still some major differences between CLR and BCL versions to make the same code truly cross-platform. For example, WinRT platform (Windows Store Apps) lacks FileStream ...

Supported types in Lex.DB 8

(previous post) Lex.DB supports following data member CLR types of out of box: string (System.String) byte (System.Byte) int (System.Int32) long (System.Int64) double (System.Double) float (System.Single) decimal (System.Decimal) bool (System.Boolean) System.DateTime System.DateTimeOffset System.TimeSpan System.Guid Enums based on int, long and byte types In addition to types listed above, Lex.DB supports derivative nullable types: byte? int? long? double? ...

Indexing in Lex.DB 10

(previous post) In this post I will explain, how to improve data access in Lex.DB using built-in indexing feature. To keep the lib compact, Lex.DB provides very simple, yet powerful indexing: all non-PK indexes are non-unique non-calculated indexes support composite keys based on up to 3 data members calculated indexes (indexes based on calculated data members) are ...

Introduction to Lex.DB 29

(previous post) Let’s start with simple example. We have a data class to store locally. Every piece of data has to have a primary key. The type of primary key is up to you. What is important, the PK type T has to implement IComparable<T>. Lex.DB maintains the Red-Black-Tree index of primary key values in memory. ...

Announcing Lex.DB

Announcing Lex.DB
After several years writing Line-of-Business (LOB) .NET applications, I started to really like disconnected app architecture. The idea is to load all needed data at once, keep it locally, minimize access time and server communication. Good examples of such architecture are various mail clients (Outlook, iPhone mail app) as well as feed readers (Twitter and Facebook ...

CoreCLR vs JavaScript

CoreCLR vs JavaScript
JavaScript is the technology that dies very hard. After several hard years of crazy optimizations by Microsoft, Apple, Google, etc. please welcome a new lap of JavaScript improvements called TypeScript. I will not explain what TypeScript is, neither will I predict its future. What I want to show, is how easy to port code from TypeScript ...