size

I am experimenting a little bit with gamestudio. I am making now a shooter game. I have an array with the pointer's to the enemies. I want. to when an enemy is killed. remove him from the list. And I also want to be able to create new enemies. Gamestudio uses a scripting language named lite-C. It has the same syntax as C and on the website they say, that it can be compiled with any C compiler. It is pure C, no C++ or anything else. I am new to C. I normally program in .NET languages and some scripting languages, Once an array in C has been created, it is set. You need a dynamic data structure

I want to know the detail description on the size of a class. I want to know if there is only data members & member function without any virtual keyword then why the class size depends only on data members. For an eg: class A { int a; public: int display() { cout << "A=" << a << endl; } }; When I check the sizeof(A) i found that it is 4 byte. Why it is so? Why member function has no effect on the size of class A? Thanks Because the class's functions are not saved inside the object itself. Think of it in terms of C programming, every function of class A takes one secret parameter, the this

1.电话号码的字母组合 题目描述： 给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。 给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。 示例: 输入："23" 输出：["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]. 说明: 尽管上面的答案是按字典序排列的，但是你可以任意选择答案输出的顺序。 实现代码： class Solution { public: vector<string> letterCombinations(string digits) { if(digits == ""){ return res; } letter(digits,0,""); return res; } private: string lett[10] = { " ", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" }; vector<string>res; void letter(string digits,int index,string s){ if(index == digits.size()){ res.push_back(s); return; } char c = digits[index]; string

I am calculating a large number of possible resulting combinations of an algortihm. To sort this combinations I rate them with a double value und store them in PriorityQueue. Currently, there are about 200k items in that queue which is pretty much memory intesive. Acutally, I only need lets say the best 1000 or 100 of all items in the list. So I just started to ask myself if there is a way to have a priority queue with a fixed size in Java. I should behave like this: Is the item better than one of the allready stored? If yes, insert it to the according position and throw the element with the

I'm wondering if I can know how long in bytes for a string in C#, anyone know? You can use encoding like ASCII to get a character per byte by using the System.Text.Encoding class. or try this System.Text.ASCIIEncoding.Unicode.GetByteCount(string); System.Text.ASCIIEncoding.ASCII.GetByteCount(string); From MSDN : A String object is a sequential collection of System.Char objects that represent a string. So you can use this: var howManyBytes = yourString.Length * sizeof(Char); System.Text.ASCIIEncoding.Unicode.GetByteCount(yourString); Or System.Text.ASCIIEncoding.ASCII.GetByteCount(yourString);