Dynamic Data is a portable class library which brings the power of Reactive Extensions (Rx) to collections.
Rx is extremely powerful but out of the box provides nothing to assist with managing collections. In most applications there is a need to update the collections dynamically. Typically a collection is loaded and after the initial load, asynchronous updates are received. The original collection will need to reflect these changes. In simple scenarios the code is simple. However, typical applications are much more complicated and may apply a filter, transform the original dto and apply a sort. Even with these simple every day operations the complexity of the code is quickly magnified. Dynamic data has been developed to remove the tedious code of dynamically maintaining collections. It has grown to become functionally very rich with at least 60 collection based operations which amongst other things enable filtering, sorting, grouping, joining different sources, transforms, binding, pagination, data virtualisation, expiration, disposal management plus more.
The concept behind using dynamic data is you maintain a data source (either SourceCache<TObject, TKey> or SourceList<TObject>), then chain together various combinations of operators to declaratively manipulate and shape the data without the need to directly manage any collection.
As an example the following code will filter trades to select only live trades, creates a proxy for each live trade, and finally orders the results by most recent first. The resulting trade proxies are bound on the dispatcher thread to an observable collection. Also since the proxy is disposable DisposeMany() will ensure the proxy is disposed when no longer used.
ReadOnlyObservableCollection<TradeProxy> list;
var myTradeCache = new SourceCache<Trade, long>(trade => trade.Id);
var myOperation = myTradeCache.Connect()
.Filter(trade=>trade.Status == TradeStatus.Live)
.Transform(trade => new TradeProxy(trade))
.Sort(SortExpressionComparer<TradeProxy>.Descending(t => t.Timestamp))
.ObserveOnDispatcher()
.Bind(out list)
.DisposeMany()
.Subscribe()The magic is that as myTradeCache is maintained the target observable collection looks after itself.
This is a simple example to show how using Dynamic Data's collections and operators make in-memory data management extremely easy and can reduce the size and complexity of your code base by abstracting complicated and often repetitive operations.
- Sample WPF project trading project Dynamic Trader
- Various unit tested examples of many different operators Snippets
- Tail Blazer for tailing files
If you have any questions, want to get involved or would simply like to keep abreast of developments, you are welcome to join the slack community Reactive UI Slack. I am also available @RolandPheasant There is a blog at http://dynamic-data.org/ but alas it is hopelessly out of date.
Create an observable list like this:
var myInts = new SourceList<int>();The observable list provides the direct edit methods you would expect. For example:
myInts.AddRange(Enumerable.Range(0, 10000));
myInts.Add(99999);
myInts.Remove(99999);The AddRange, Add and Remove methods above will each produce a distinct change notification. In order to increase efficiency when making multiple amendments, the list provides a means of batch editing. This is achieved using the .Edit method which ensures only a single change notification is produced.
myInts.Edit(innerList =>
{
innerList.Clear();
innerList.AddRange(Enumerable.Range(0, 10000));
});If myInts is to be exposed publicly it can be made read only using .AsObservableList
IObservableList<int> readonlyInts = myInts.AsObservableList();which hides the edit methods.
The list's changes can be observed by calling myInts.Connect() like this:
IObservable<IChangeSet<int>> myIntsObservable = myInts.Connect();This creates an observable change set for which there are dozens of operators. The changes are transmitted as an Rx observable, so they are fluent and composable.
Create an observable cache like this:
var myCache = new SourceCache<TObject,TKey>(t => key);There are direct edit methods, for example
myCache.Clear();
myCache.AddOrUpdate(myItems);The Clear and AddOrUpdate methods above will each produce a distinct change notification. In order to increase efficiency when making multiple amendments, the cache provides a means of batch editing. This is achieved using the .Edit method which ensures only a single change notification is produced.
myCache.Edit(innerCache =>
{
innerCache.Clear();
innerCache.AddOrUpdate(myItems);
});If myCache is to be exposed publicly it can be made read only using .AsObservableCache
IObservableCache<TObject,TKey> readonlyCache = myCache.AsObservableCache();which hides the edit methods.
The cache is observed by calling myCache.Connect() like this:
IObservable<IChangeSet<TObject,TKey>> myCacheObservable = myCache.Connect();This creates an observable change set for which there are dozens of operators. The changes are transmitted as an Rx observable, so they are fluent and composable.
As stated in the introduction of this document, Dynamic Data is based on the concept of creating and manipulating observable change sets.
The primary method of creating observable change sets is to connect to instances of ISourceCache<T,K> and ISourceList<T>. There are alternative methods to produce observables change sets however, depending on the data source.
Calling Connect() on a ISourceList<T> or ISourceCache<T,K> will produce an observable change set.
var myObservableChangeSet = myDynamicDataSource.Connect();Given either of the following observables:
IObservable<T> myObservable;
IObservable<IEnumerable<T>> myObservable;an observable change set can be created like by calling .ToObservableChangeSet like this:
var myObservableChangeSet = myObservable.ToObservableChangeSet(t=> t.key);The problem with the example above is that the internal backing cache of the observable change set will grow in size forever.
To counter this behavior, there are overloads of .ToObservableChangeSet where a size limitation or expiry time can be specified for the internal cache.
To create a time expiring cache, call .ToObservableChangeSet and specify the expiry time using the expireAfter argument:
var myConnection = myObservable.ToObservableChangeSet(t=> t.key, expireAfter: item => TimeSpan.FromHours(1));To create a size limited cache, call .ToObservableChangeSet and specify the size limit using the limitSizeTo argument:
var myConnection = myObservable.ToObservableChangeSet(t=> t.key, limitSizeTo:10000);There is also an overload to specify expiration by both time and size.
var myObservableCollection = new ObservableCollection<T>();To create a cache based observable change set, call .ToObservableChangeSet and specify a key selector for the backing cache
var myConnection = myObservableCollection.ToObservableChangeSet(t => t.Key);or to create a list based observable change set call .ToObservableChangeSet with no arguments
var myConnection = myObservableCollection.ToObservableChangeSet();This method is only recommended for simple queries which act only on the UI thread as ObservableCollection is not thread safe.
var myBindingList = new BindingList<T>();To create a cache based observable change set, call .ToObservableChangeSet and specify a key selector for the backing cache
var myConnection = myBindingList.ToObservableChangeSet(t => t.Key);or to create a list based observable change set call .ToObservableChangeSet with no arguments
var myConnection = myBindingList.ToObservableChangeSet();This method is only recommended for simple queries which act only on the UI thread as ObservableCollection is not thread safe.
There is also another way to create observable change sets, and that is to use the ObservableChangeSet static class. This class is a facsimile of the Rx.Net Observable static class and provides an almost identical API.
An observable list can be created as follows:
var myObservableList = ObservableChangeSet.Create<int>(observableList =>
{
//some code to load data and subscribe
var loader= myService.LoadMyDataObservable().Subscribe(observableList.Add);
var subscriber = myService.GetMySubscriptionsObservable().Subscribe(observableList .Add);
//dispose of resources
return new CompositeDisposable(loader,subscriber );
});and creating a cache is almost identical except a key has to be specified
var myObservableCache = ObservableChangeSet.Create<Trade, int>(observableCache =>
{
//code omitted
}, trade = > trade.Id);There are several overloads ObservableChangeSet.Create which match the overloads which Observable.Create provides.
The examples below illustrate the kind of things you can achieve after creating an observable change set. Now you can create an observable cache or an observable list, here are a few quick fire examples to illustrate the diverse range of things you can do. In all of these examples the resulting sequences always exactly reflect the items is the cache i.e. adds, updates and removes are always propagated.
This example shows how you can create derived collections from an observable change set. It applies a filter to a collection, and then creates a new observable collection that only contains items from the original collection that pass the filter. This pattern is incredibly useful when you want make modifications to an existing collection and then expose the modified collection to consumers.
Even though the code in this example is very simple, this is one of the most powerful aspects of Dynamic Data.
Given a SourceList
var myList = new SourceList<People>();You can apply operators, in this case the Filter() operator, and then create a new observable list with AsObservableList()
var oldPeople = myList.Connect().Filter(person => person.Age > 65).AsObservableList();The resulting observable list, oldPeople, will only contain people who are older than 65.
The same pattern can be used with SourceCache by using .AsObservableCache() to create derived caches.
Filter the observable change set by using the Filter operator
var myPeople = new SourceList<People>();
var myPeopleObservable = myPeople.Connect();
var myFilteredObservable = myPeopleObservable.Filter(person => person.Age > 50); or to filter a change set dynamically
IObservable<Func<Person,bool>> observablePredicate=...;
var myFilteredObservable = myPeopleObservable.Filter(observablePredicate); Sort the observable change set by using the Sort operator
var myPeople = new SourceList<People>();
var myPeopleObservable = myPeople.Connect();
var mySortedObservable = myPeopleObservable.Sort(SortExpressionComparer.Ascending(p => p.Age); or to dynamically change sorting
IObservable<IComparer<Person>> observableComparer=...;
var mySortedObservable = myPeopleObservable.Sort(observableComparer);For more information on sorting see wiki
The GroupOn operator pre-caches the specified groups according to the group selector.
var myOperation = personChangeSet.GroupOn(person => person.Status)The value of the inner group is represented by an observable list for each matched group. When values matching the inner grouping are modified, it is the inner group which produces the changes.
You can also use GroupWithImmutableState which will produce a grouping who's inner items are a fixed size array.
The Transform operator allows you to map objects from the observable change set to another object
var myPeople = new SourceList<People>();
var myPeopleObservable = myPeople.Connect();
var myTransformedObservable = myPeopleObservable.Transform(person => new PersonProxy(person));The TransformToTree operator allows you to create a fully formed reactive tree (only available for observable cache)
var myPeople = new SourceCache<Person, string>(p => p.Name);
var myTransformedObservable = myPeople.Connect().TransformToTree(person => person.BossId);Flatten a child enumerable
var myOperation = personChangeSet.TransformMany(person => person.Children) The Count, Max, Min, Avg, and StdDev operators allow you to perform aggregate functions on observable change sets
var myPeople = new SourceList<People>();
var myPeopleObservable = myPeople.Connect();
var countObservable = myPeopleObservable.Count();
var maxObservable = myPeopleObservable.Max(p => p.Age);
var minObservable = myPeopleObservable.Min(p => p.Age);
var stdDevObservable = myPeopleObservable.StdDev(p => p.Age);
var avgObservable = myPeopleObservable.Avg(p => p.Age);More aggregating operators will be added soon.
The And, Or, Xor and Except operators allow you to perform logical operations on observable change sets
var peopleA = new SourceCache<Person,string>(p => p.Name);
var peopleB = new SourceCache<Person,string>(p => p.Name);
var observableA = peopleA.Connect();
var observableB = peopleB.Connect();
var inBoth = observableA.And(observableB);
var inEither= observableA.Or(observableB);
var inOnlyOne= observableA.Xor(observableB);
var inAandNotinB = observableA.Except(observableB);A recent and very powerful feature is dynamic logical operators. From version 4.6 onwards you can dynamically include and exclude collections from the resulting list.
var list1 = new SourceList<int>();
var list2 = new SourceList<int>();
var list3 = new SourceList<int>();
var combined = new SourceList<ISourceList<int>>();
//child lists can be added or removed any time
combined.Add(list1);
combined.Add(list2);
combined.Add(list3);
//The operators look after themselves
var inAll = combined.And();
var inAny = combined.Or();
var inOnlyOne= combined.Xor();
var inFirstAndNotAnyOther = combined.Except();For more information on grouping see wiki
The DisposeMany operator ensures that objects are disposed when removed from an observable stream
var myPeople = new SourceList<People>();
var myPeopleObservable = myPeople.Connect();
var myTransformedObservable = myPeopleObservable.Transform(person => new DisposablePersonProxy(person))
.DisposeMany();The DisposeMany operator is typically used when a transform function creates disposable objects.
The DistinctValues operator will select distinct values from the underlying collection
var myPeople = new SourceList<People>();
var myPeopleObservable = myPeople.Connect();
var myDistinctObservable = myPeopleObservable.DistinctValues(person => person.Age);Visualise data to restrict by index and segment size
IObservable<IVirtualRequest> request; //request stream
var virtualisedStream = someDynamicDataSource.Virtualise(request)Visualise data to restrict by index and page size
IObservable<IPageRequest> request; //request stream
var pagedStream = someDynamicDataSource.Page(request)In either of the above, the result is re-evaluated when the request stream changes
Top is an overload of Virtualise() and will return items matching the first 'n' items.
var topStream = someDynamicDataSource.Top(10)If the collection is made up of objects that implement INotifyPropertyChanged then the following operators are available
The WhenValueChanged operator returns an observable of the value of the specified property when it has changed
var ageChanged = peopleDataSource.Connect().WhenValueChanged(p => p.Age)The WhenPropertyChanged operator returns an observable made up of the value of the specified property as well as it's parent object when the specified property has changed
var ageChanged = peopleDataSource.Connect().WhenPropertyChanged(p => p.Age)The WhenAnyPropertyChanged operator returns an observable of objects when any of their properties have changed
var personChanged = peopleDataSource.Connect().WhenAnyPropertyChanged()Binding is a very small part of Dynamic Data. The above notify property changed overloads are just an example when binding. If you have a domain object which has children observables you can use MergeMany() which subscribes to and unsubscribes from items according to collection changes.
var myoperation = somedynamicdatasource.Connect()
.MergeMany(trade => trade.SomeObservable());This wires and unwires SomeObservable as the collection changes.
I get asked about the differences between these a lot and the answer is really simple. If you have a unique id, you should use an observable cache as it is dictionary based which will ensure no duplicates can be added and it notifies on adds, updates and removes, whereas list allows duplicates and only has no concept of an update.
There is another difference. The cache side of dynamic data is much more mature and has a wider range of operators. Having more operators is mainly because I found it easier to achieve good all round performance with the key based operators and do not want to add anything to Dynamic Data which inherently has poor performance.
Even before Rx existed I had implemented a similar concept using old fashioned events but the code was very ugly and my implementation full of race conditions so it never existed outside of my own private sphere. My second attempt was a similar implementation to the first but using Rx when it first came out. This also failed as my understanding of Rx was flawed and limited and my design forced consumers to implement interfaces. Then finally I got my design head on and in 2011-ish I started writing what has become dynamic data. No inheritance, no interfaces, just the ability to plug in and use it as you please. All along I meant to open source it but having so utterly failed on my first 2 attempts I decided to wait until the exact design had settled down. The wait lasted longer than I expected and end up taking over 2 years but the benefit is it has been trialled for 2 years on a very busy high volume low latency trading system which has seriously complicated data management. And what's more that system has gathered a load of attention for how slick and cool and reliable it is both from the user and IT point of view. So I present this library with the confidence of it being tried, tested, optimised and mature. I hope it can make your life easier like it has done for me.
I could go on endlessly but this is not the place for full documentation. I promise this will come but for now I suggest downloading my WPF sample app (links at top of document) as I intend it to be a 'living document' and I promise it will be continually maintained.
Also, if you following me on Twitter you will find out when new samples or blog posts have been updated.
Additionally, if you have read up to here and not pressed star then why not? Ha. A star may make me be more responsive to any requests or queries.