The distance of a circulator $$c to a circulator $$d is the number of elements in the range $$[c, d). It is defined to be zero for a circulator on an empty sequence and it returns the size of the data structure when applied to a range of the form $$[c, c).
#include <CGAL/circulator.h>
 


circulator_size, iterator_distance, is_empty_range, Circulator.