I suppose...a list here could store it's count internally as a member. It might modify or update its count as elements are added and deleted. Some overhead of counting elements through iteration might be reduced.
Actually, to be honest, I'd much rather view a C-Lite "map" or "hashtable" implementation, ...but this is nice.