Yatao Li
I think it is better that we maintain both a (unordered) set of rather complete examples, and a (linear) series of tutorials, each covering a very specific topic of our...
This is particularly useful for situations, where the starting nodes come from an index, but we want logic to be applied.
Currently, [Index] attribute is interpreted by the TSL codegen, which will then generate an inverted index service for each of these fields. However, to make indexing more flexible, we should...
Sometimes, a simpe `fflush` does not guarantee data hitting the disk. The cache on the disk hardware has to be also flushed. Different systems behave different wrt this issue. There's...
This could be very useful for implementing generic algorithms on different cell types. Take this example: ``` struct E { [GraphEdge] cellid neighbor; [GraphEdgeWeight] double weight; } cell V {...
When we first build the codegen, we provided overridden implementations for == and !=, but not Equals and GetHashCode. This brings trouble for expressions like `if (a == null)` (we...
Currently we only have primitive data types, structs and lists. It could be very useful if we introduce other data types like set and map.
It could be useful if we have an offline tool to analyze the disk images. In general it could perform the following tasks: - Verify the cell entries: Duplication? Invalid...