Classes of graphs with low complexity: the case of classes with bounded linear rankwidth.