Lines Matching refs:number
311 if (input.size() >= 6) { //6:Maximum port number size
316 const int maxPort = 65535; // 65535:Maximum port number
388 int size = 7 - (count - 2); // 7:point number 2:Continuous colon number
630 std::string SplitNum(std::string num, size_t& number)
633 number = num.size();
647 number = nums.size();
671 size_t number = 0;
672 std::string temp = SplitNum(nums[index], number);
673 if (number + (len - 1) > 4) { // 4:ipv4 max size
677 for (size_t i = 0; i < 4 - (len - 1 + number); ++i) { // 4:ipv4 max size
696 if (isipv4 == true && lastSize > 8) { // 8: ipv4 last number size
1786 for (size_t i = 0; i < size; i += 2) { // 2:Searching for the number and number of keys and values
1820 for (size_t i = 0; i < size; i += 2) { // 2:Searching for the number and number of keys and values
1880 iter = searchParams.erase(iter, iter + 2); // 2:Searching for the number and number of keys and values
1882 iter += 2; // 2:Searching for the number and number of keys and values
1896 for (size_t i = 0; i < size; i += 2) { // 2:Searching for the number and number of keys and values
1903 napi_set_element(env, resend, i / 2, result); // 2:Find the number of keys
1924 for (size_t i = 0; i != lenStr; i += 2) { // 2:Searching for the number and number of keys and values
1968 it += 2; // 2:Searching for the number and number of keys and values
1970 it = searchParams.erase(it, it + 2); // 2:Searching for the number and number of keys and values
1973 it += 2; // 2:Searching for the number and number of keys and values
2009 size_t stepSize = 2; // 2:Searching for the number and number of keys and values
2011 if (lenStr % 2 == 0) { // 2:Get the number of values
2029 size_t stepSize = 2; // 2:Searching for the number and number of keys and values
2031 if (lenStr % 2 == 0) { // 2:Get the number of values