Search
Ze zkoušky je možné získat maximálně 40 bodů, 20 bodů z obsáhlejších otázek na této stránce a 20 bodů z krátkých otázek.
front()
push(element)
pop()
size()
empty()
false
template <typename T> class Queue { public: T& front(); const T& front() const; void push(const T& elem); void push(T&& elem); void pop(); size_t size() const; bool empty() const; private: std::vector<T> data; };
class B {}; class D : public B {}; void f(B& throwable) { throw throwable; } int main() { D status; try { f(status); } catch (D& e) { std::cout << "Chytil jsem D!\n"; } catch (...) { std::cout << "To je divny...\n"; } }
get_size()
const unsigned buf_size = 1024;
int ia[buf_size + 3];
int ib[get_size()];
int ic[9 * 6 - 55];
char id[4] = “cpp”;
ib
ic
struct A { A() { std::cout << "A "; } ~A() { std::cout << "~A "; } void say() { std::cout << "A says "; } void say() const { std::cout << "A says const "; } }; struct B : A { B() { std::cout << "B "; } ~B() { std::cout << "~B "; } void say() { std::cout << "B says "; } void say() const { std::cout << "B says const "; } }; int main() { A a; const B b; a.say(); b.say(); const A& aref = b; aref.say(); }
bool transfer_item(account& account1, account& account2, const item& item) { // Nejdriv zamkneme oba ucty std::lock_guard<std::mutex> lg1(account1.mutex); std::lock_guard<std::mutex> lg2(account2.mutex); // A pak se pokusime prevest item z jednoho do druheho. // Ucet uz ho nemusi vlastnit, takze je potreba to zkontrolovat // znovu if (account1.contains(item)) { account1.remove(item); account2.add(item); return true; } return false; }
std::vector<osoba>
#include <vector> #include <string> #include <algorithm> struct osoba { std::string prijmeni, jmeno; int vek; };
std::sort
std::stable_sort
std::vector
in
double
out