// This file is part of libigl, a simple c++ geometry processing library. // // Copyright (C) 2013 Alec Jacobson // // This Source Code Form is subject to the terms of the Mozilla Public License // v. 2.0. If a copy of the MPL was not distributed with this file, You can // obtain one at http://mozilla.org/MPL/2.0/. #include "min_size.h" template IGL_INLINE int igl::min_size(const std::vector & V) { int min_size = -1; for( typename std::vector::const_iterator iter = V.begin(); iter != V.end(); iter++) { int size = (int)iter->size(); // have to handle base case if(min_size == -1) { min_size = size; }else{ min_size = (min_size < size ? min_size : size); } } return min_size; } #ifdef IGL_STATIC_LIBRARY // Explicit template instantiation // generated by autoexplicit.sh template int igl::min_size > >(std::vector >, std::allocator > > > const&); // generated by autoexplicit.sh template int igl::min_size > >(std::vector >, std::allocator > > > const&); // generated by autoexplicit.sh template int igl::min_size > >(std::vector >, std::allocator > > > const&); // generated by autoexplicit.sh template int igl::min_size > >(std::vector >, std::allocator > > > const&); template int igl::min_size > >(std::vector >, std::allocator > > > const&); template int igl::min_size > >(std::vector >, std::allocator > > > const&); #endif