Lex's Blog

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. ...

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 ...

(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? ...

(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 ...

(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. ...