On 2017/11/15 8:13, David Rowley wrote: > So some sort of hierarchical structure of the partition hierarchy > would need to be stored in the Append node and then you'd need to > search at each level, and then somehow match the results up to the > subpaths that you have in the Append. Although, I'm still not sure > this is the best way to go about this.
I think we should try to use PartitionDispatch stuff for this somehow, just like get_partition_for_tuple() does, although I haven't thought very hard whether that infrastructure would be useful as is. Thanks, Amit
