Answer the question
In order to leave comments, you need to log in
Answer the question
In order to leave comments, you need to log in
If you mean a virtual PBX, then as an option zadarma.com, but in fact all companies that provide IP telephony already have this service, and many of them on a free basis.
Put an asterisk on a cheap vds c ds in the region of residence and potential use and configure iptables
What does "resources providing free virtual telephone exchanges" mean? I have never seen such a thing. There are shareware PBXs, like Virtua.pro , for example.
The question was originally asked crazy -_-
If I understand you correctly, then here:
var array = [{a:"word",b:"world"},{a:"2015",b:"people"}];
var result = -1;
for(var i=0; i<array.length; i++) {
for(var key in array[i]) {
if(array[i][key] == "people") result = i;
}
if(result > -1) break;
}
document.write(result);
There is no specific tree search method in Javascript.
You need to recursively traverse the tree (width or height, it doesn't matter) and check each value.
here it is easier to use a non-standard solution:
1. split by the symbol "," (comma)
2. take the remainder of the division of the found element by 2 (the number of elements in the subarray)
As a result, there will be one array of 4 elements
(3rd: 2015) and the 4th (people-entry) - the required one:
2015: 3%2===1 - so it is the 1st.
people: 4%2===0 - so he is 2nd.
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question