{"comment":{"url":"https://api.github.com/repos/poparteu/openMVG/comments/14874434","html_url":"https://github.com/poparteu/openMVG/commit/c726ca5b6b875ca424324af66483d464921fd547#commitcomment-14874434","id":14874434,"user":{"login":"simogasp","id":1331744,"avatar_url":"https://avatars.githubusercontent.com/u/1331744?v=3","gravatar_id":"","url":"https://api.github.com/users/simogasp","html_url":"https://github.com/simogasp","followers_url":"https://api.github.com/users/simogasp/followers","following_url":"https://api.github.com/users/simogasp/following{/other_user}","gists_url":"https://api.github.com/users/simogasp/gists{/gist_id}","starred_url":"https://api.github.com/users/simogasp/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/simogasp/subscriptions","organizations_url":"https://api.github.com/users/simogasp/orgs","repos_url":"https://api.github.com/users/simogasp/repos","events_url":"https://api.github.com/users/simogasp/events{/privacy}","received_events_url":"https://api.github.com/users/simogasp/received_events","type":"User","site_admin":false},"position":17,"line":135,"path":"src/openMVG/dataio/ImageFeed.cpp","commit_id":"c726ca5b6b875ca424324af66483d464921fd547","created_at":"2015-12-09T14:33:22Z","updated_at":"2015-12-09T14:33:22Z","body":"As far as i read on the doc it uses a vector and it just add the elements in the order so that the first is always the greater/smaller http://www.cplusplus.com/reference/queue/priority_queue/. But maybe sorting afterwards it may be better even if the complexity is N*log(N) for both."}}