size

Following is the code for initializing my UISegmentedControl . - (void)initializeToolButtons { NSArray *buttonTitles = [NSArray arrayWithObjects:@"ANNEXET", @"HOVET", @"GLOBEN", "ALL", nil]; toolbuttons = [[UISegmentedControl alloc] initWithItems:buttonTitles]; toolbuttons.segmentedControlStyle = UISegmentedControlStyleBar; toolbuttons.tintColor = [UIColor darkGrayColor]; toolbuttons.backgroundColor = [UIColor blackColor]; toolbuttons.frame = CGRectMake(0, 0, 320, 30); [toolbuttons addTarget:self action:@selector(toolButtonsAction) forControlEvents:UIControlEventValueChanged]; [self.view

I have an ArrayList<Obj> and I wish to know how much memory it is using. The Obj is variant so, it is not as easy as multiply the number of elements in the array per the size of an object. Daniel DiPaolo You can use something like Runtime.getRuntime().totalMemory() and its counterpart Runtime.getRuntime().freeMemory() to get an educated guess, but that doesn't account for objects that are GC'ed between calls. bestsss It's the capacity of the java.util.ArrayList multiplied by the reference size (4 bytes on 32bit, 8bytes on 64bit) + [Object header + one int and one references] . The capacity is

Is the in operator's speed in python proportional to the length of the iterable? So, len(x) #10 if(a in x): #lets say this takes time A pass len(y) #10000 if(a in y): #lets say this takes time B pass Is A > B? A summary for in: list - Average: O(n) set/dict - Average: O(1), Worst: O(n) See this for more details. There's no general answer to this: it depends on the types of a and especially of b . If, for example, b is a list, then yes, in takes worst-case time O(len(b)) . But if, for example, b is a dict or a set, then in takes expected-case time O(1) (i.e., constant time). About "Is A > B?",

FileStream's read/write method can take only integer value as length. But FileStream object returns length in long . In this case, what if file size is larger than integer value (approximate more than 2GB). Then how FileStream's read/write method handle long value. Then you read and write in multiple chunks. The CLR has a limit on the size of any particular object anyway (also around 2GB IIRC, even on a 64-bit CLR), so you couldn't have a byte array big enough for it to be a problem. You should always loop when reading anyway, as you can't guarantee that a Read call will read as many bytes as

i'm trying to get the filesize of the cmdline file in proc/[pid]. For example porc/1/cmdline. The file is not empty, it contains "/sbin/init". But i get file_size = 0. int main(int argc, char **argv) { int file_size; FILE *file_cmd; file_cmd = fopen("/proc/1/cmdline", "r"); if(file_cmd == NULL) { perror("proc/1/cmdline"); exit(1); }else { if(fseek(file_cmd, 0L, SEEK_END)!=0) { perror("proc/1/cmdline"); exit(1); } file_size = ftell(file_cmd); } printf("fs: %d\n",file_size); fclose(file_cmd); } Regards That's normal. /proc files (most of them, there are a few exceptions) are generated by the

It might looks like a dumb question. In fact it's more like a poll: how big is your Sonar database? I need this to estimate the requirements for a virtual machine to host my Sonar instance. Also: how big is your team? how many additional bytes is used in the Sonar database for every new commit? I will appreciate any help. I'm assuming that you're referring to Sonar from Codehaus , and not SOund Navigation And Ranging . From the installation page : The Sonar web server requires 500Mo of RAM to run efficiently. In terms of data space and as an indication, on Nemo the public instance of Sonar,

没有优先队列的dijkstra不算真的dijkstra 所以我又回来补常识了 <1>priority_queue::emplace <7>priority_queue::top 1 // priority_queue::emplace 2 #include <iostream> // std::cout 3 #include <queue> // std::priority_queue 4 #include <string> // std::string 5 6 int main () 7 { 8 std::priority_queue<std::string> mypq; 9 10 mypq.emplace("orange"); 11 mypq.emplace("strawberry"); 12 mypq.emplace("apple"); 13 mypq.emplace("pear"); 14 15 std::cout << "mypq contains:"; 16 while (!mypq.empty()) 17 { 18 std::cout << ' ' << mypq.top(); 19 mypq.pop(); 20 } 21 std::cout << '\n'; 22 23 return 0; 24 } 25 //Ooutput:mypq contains: