Big O of sf::Clock::restart()

[xanderxylona]

How fast is sf::Clock::restart()? That is to say, what is O(n) where n is the amount of times restart() is called? I am predisposed to assume that all ∆ time incurrence is linearithmic, but I'm not sure this is true for SFML.

[eXpl0it3r]

Are you sure you understand what Big O notation means?
Instead of using random technical terms, maybe just ask the question you're trying to solve.

When n is the amount of times you call restart() then you don't have to look at SFML's code, but your own to figure out how often you do call restart().