containers minimum elements, windows memory leaks

libs/main/containers/picontainers.cpp

@@ -0,0 +1,34 @@
+/*
+	PIP - Platform Independent Primitives
+	Base macros for generic containers
+	Ivan Pelipenko peri4ko@yandex.ru
+
+	This program is free software: you can redistribute it and/or modify
+	it under the terms of the GNU Lesser General Public License as published by
+	the Free Software Foundation, either version 3 of the License, or
+	(at your option) any later version.
+
+	This program is distributed in the hope that it will be useful,
+	but WITHOUT ANY WARRANTY; without even the implied warranty of
+	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+	GNU Lesser General Public License for more details.
+
+	You should have received a copy of the GNU Lesser General Public License
+	along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include "picontainers.h"
+
+
+const ssize_t minAlloc = 64;
+
+
+ssize_t _PIContainerConstantsBase::calcMinCountPoT(ssize_t szof) {
+	ssize_t ret = 0, elc = 1;
+	while (elc * szof < minAlloc) {
+		elc *= 2;
+		++ret;
+	}
+	//printf("calcMinCount sizeof = %d, min_count = %d, pot = %d\n", szof, elc, ret);
+	return ret;
+}

libs/main/containers/picontainers.h

@@ -63,6 +63,18 @@ private:
 };
 
 
+class PIP_EXPORT _PIContainerConstantsBase {
+public:
+	static ssize_t calcMinCountPoT(ssize_t szof);
+};
+
+template<typename T>
+class _PIContainerConstants {
+public:
+	static ssize_t minCountPoT() {static ssize_t ret = _PIContainerConstantsBase::calcMinCountPoT(sizeof(T)); return ret;}
+};
+
+
 //! \brief
 //! \~english Template reverse wrapper over any container
 //! \~russian Шаблонная функция обертки любого контейнера для обратного доступа через итераторы

libs/main/containers/pideque.h

@@ -2280,10 +2280,9 @@ private:
 		if (pid_rsize + pid_rsize >= size_t(s) && pid_rsize < size_t(s)) {
 			return pid_rsize + pid_rsize;
 		}
-		ssize_t t = 0, s_ = s - 1;
-		while (s_ >> t) {
+		ssize_t t = _PIContainerConstants<T>::minCountPoT(), s_ = s - 1;
+		while (s_ >> t)
 			++t;
-		}
 		return (1 << t);
 	}
 	template<typename T1 = T, typename std::enable_if<

libs/main/containers/pivector.h

@@ -2205,8 +2205,9 @@ private:
 		if (piv_rsize + piv_rsize >= s && piv_rsize < s) {
 			return piv_rsize + piv_rsize;
 		}
-		ssize_t t = 0, s_ = s - 1;
-		while (s_ >> t) ++t;
+		ssize_t t = _PIContainerConstants<T>::minCountPoT(), s_ = s - 1;
+		while (s_ >> t)
+			++t;
 		return (1 << t);
 	}
 	template<typename T1 = T, typename std::enable_if<