B0 - История изменений

Alexey.kudinkin в 09:07, 15 мая 2015

2015-05-15T09:07:49Z

Alexey.kudinkin в 20:14, 24 апреля 2015

2015-04-24T20:14:09Z

Alexey.kudinkin в 20:01, 24 апреля 2015

2015-04-24T20:01:15Z

Alexey.kudinkin в 20:00, 24 апреля 2015

2015-04-24T20:00:34Z

Alexey.kudinkin: Отмена правки 5765, сделанной участником Alexey.kudinkin (обс.)

2015-04-24T19:59:42Z

Отмена правки 5765, сделанной участником Alexey.kudinkin (обс.)

Alexey.kudinkin: Отмена правки 5766, сделанной участником Alexey.kudinkin (обс.)

2015-04-24T19:59:28Z

Отмена правки 5766, сделанной участником Alexey.kudinkin (обс.)

Alexey.kudinkin: Отмена правки 5767, сделанной участником Alexey.kudinkin (обс.)

2015-04-24T19:59:16Z

Отмена правки 5767, сделанной участником Alexey.kudinkin (обс.)

Alexey.kudinkin: /* quiz */

2015-03-30T23:32:29Z

‎quiz

Alexey.kudinkin: /* quiz */

2015-03-30T23:32:18Z

‎quiz

Alexey.kudinkin в 23:30, 30 марта 2015

2015-03-30T23:30:12Z

← Предыдущая		Версия 09:07, 15 мая 2015
Строка 170:		Строка 170:
	}		}

		+	</source>
		+
		+
		+	== inherit ==
		+
		+	<source lang=cpp>
		+
		+	#include <iostream>
		+
		+
		+	struct NIL {};
		+
		+	template<class H, class T = NIL>
		+	struct cons {
		+	typedef T tail_type;
		+	typedef H head_type;
		+	};
		+
		+	template<class L>
		+	struct inherit : L::head_type, inherit<typename L::tail_type> {};
		+
		+	template<> struct inherit<NIL> {};
		+
		+
		+	struct A {
		+	void foo() { std::cout << "class A::foo\n"; }
		+	};
		+
		+	struct B {
		+	void foo() { std::cout << "class B::foo\n"; }
		+	};
		+
		+	struct C {
		+	void foo() { std::cout << "class C::foo\n"; }
		+	};
		+
		+	typedef cons< A, cons< B, cons< C > > > A_B_C;
		+
		+	template<typename T>
		+	struct D : inherit<T> {
		+
		+	void foo() {
		+	/* ? */
		+	}
		+
		+	};
		+
		+
		+	int main(int ARGC, char *ARGV[]) {
		+
		+	D<A_B_C> d;
		+
		+	d.foo();
		+
		+	return 0;
		+	}
	</source>		</source>

← Предыдущая		Версия 20:14, 24 апреля 2015
Строка 122:		Строка 122:

	'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`		'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`
		+
		+
		+
		+	== make_shared ==
		+
		+	Implement `make_shared` utility having signature:
		+
		+	<source lang=cpp>
		+	template<typename T>
		+	std::shared_ptr<T> make_shared(/* ? */);
		+	</source>
		+
		+	that accepts '''single''' argument and creates an object of type `T` and supplies caller with `shared_ptr` pointing to it.
		+
		+	'''NB''': Your implementation '''must''' comply with ''all'' of the following tests:
		+
		+	<source lang=cpp>
		+	template<typename T>
		+	std::shared_ptr<T> make_shared(/* ? */);
		+
		+	struct Y
		+	{
		+	Y(int& a) {}
		+	Y(const int & a) {}
		+
		+	private:
		+	Y(const Y&);
		+	};
		+
		+	struct X
		+	{
		+	X(Y&& a) {}
		+	X(Y& a) {}
		+	X(const Y& a) {}
		+	};
		+
		+
		+	int main(int ARGC, char *ARGV[])
		+	{
		+	auto _1 = make_shared<Y>(Y(0)); // X(Y&&);
		+
		+	Y y(0);
		+	auto _2 = make_shared<Y>(y); // X(Y&);
		+
		+	const Y cy(1);
		+	auto _3 = make_shared<X>(cy); // X(const Y&);
		+	}
		+
		+	</source>

← Предыдущая		Версия 20:01, 24 апреля 2015
Строка 118:		Строка 118:
	/* pred -- predicate selecting which elements should be gathered */		/* pred -- predicate selecting which elements should be gathered */
	</source>		</source>
		+
		+	* Implement [http://en.wikipedia.org/wiki/Quicksort QuickSort] '''without''' loops, using only utilitiies provided by STL.
		+
		+	'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`

← Предыдущая		Версия 20:00, 24 апреля 2015
Строка 91:		Строка 91:
	* Implement [http://en.wikipedia.org/wiki/Insertion_sort Insertion Sort] '''without''' loops, using only utilitiies provided by STL.		* Implement [http://en.wikipedia.org/wiki/Insertion_sort Insertion Sort] '''without''' loops, using only utilitiies provided by STL.

−	* ~~TBD~~	+	* Implement ''sliding'' procedure which allows you to move given range around the whole sequence (like dragging UI along the line)
		+
		+	[[Файл:Stdbea slide.png]]
		+
		+	<source lang="cpp">
		+	template <typename _RanIt>
		+	_RanIt slide(_RanIt first, _RanIt last, _RanIt pivot)
		+	/* first -- iterator pointing to the first element */
		+
		+	/* last -- iterator pointing past the last element */
		+	/* pivot -- iterator pointing to the element, where first element of the supplied subsequence should arrive at */
		+	</source>
		+
		+	* Implement ''gathering'' procedure which can be seen similar to the previous ''slide'' procedure: it ''gathers'' all elements in the given range for which supplied `predicate` value returns true and slides them towards the target position designated by the ''pivot'' iterator
		+
		+	[[Файл:Stdbea gather.png]]
		+
		+	<source lang="cpp">
		+	template <typename _BiIt, typename UnPred>
		+	_BiIt gather(_BiIt first, _BiIt last, _BiIt pivot, UnPred pred)
		+
		+	/* first -- iterator pointing to the first element */
		+
		+	/* last -- iterator pointing past the last element */
		+	/* pivot -- iterator pointing to the element, where first element of the supplied subsequence should arrive at */
		+	/* pred -- predicate selecting which elements should be gathered */
		+	</source>

@@ Строка 1: / Строка 1: @@
-== <algorithm> quiz ==
+= Осенний Семестр =
-* Implement ''in-place'' function ''rotating'' supplied sequence to the left, having following interface:
+TBD
-<source lang="cpp">
+= Весенний Семестр =
-template<typename It>
-void rotate(It first, It new_first, It last);
-/* first        -- iterator pointing to the first element */
-/* new_first    -- iterator pointing to the element, that should become first after rotation is finished */
-/* last         -- iterator pointing past the last element */
-</source>
-* Implement [http://en.wikipedia.org/wiki/Insertion_sort Insertion Sort] '''without''' loops, using only utilitiies provided by STL.
+== #2 Vector ==
-* Implement ''sliding'' procedure which allows you to move given range around the whole sequence (like dragging UI along the line)
+==== Part One ====
-[[Файл:Stdbea slide.png]]
+Implement vector-alike container matching performance requirements of the `std::vector`.
-<source lang="cpp">
+It should contain implementation for the following methods matching behaviour of the ones of `std::vector`:
-template <typename _RanIt>
-_RanIt slide(_RanIt first, _RanIt last, _RanIt pivot)
-/* first        -- iterator pointing to the first element */
-/* last         -- iterator pointing past the last element */
+* ''push_back''
-/* pivot        -- iterator pointing to the element, where first element of the supplied subsequence should arrive at */
+* ''pop_back''
-</source>
+* ''insert''
-* Implement ''gathering'' procedure which can be seen similar to the previous ''slide'' procedure: it ''gathers'' all elements in the given range for which supplied `predicate` value returns true and slides them towards the target position designated by the ''pivot'' iterator
+As a reference consider [http://en.cppreference.com/w/cpp/container/vector en.cppreference.com].
-[[Файл:Stdbea gather.png]]
+==== Part Two ====
-<source lang="cpp">
+Implement '''specialization''' of already implemented (template-) container for the simple type `'''bool'''` being ''as compact as possible''.
-template <typename _BiIt, typename UnPred>
-_BiIt gather(_BiIt first, _BiIt last, _BiIt pivot, UnPred pred)
-/* first        -- iterator pointing to the first element */
+== #3 Throwing Vector ==
 /* last         -- iterator pointing past the last element */
 </source>

← Предыдущая		Версия 19:59, 24 апреля 2015
Строка 40:		Строка 40:
	/* pred -- predicate selecting which elements should be gathered */		/* pred -- predicate selecting which elements should be gathered */
	</source>		</source>
−
−	* Implement [http://en.wikipedia.org/wiki/Quicksort QuickSort] '''without''' loops, using only utilitiies provided by STL.
−
−	~~'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`~~

← Предыдущая		Версия 19:59, 24 апреля 2015
Строка 42:		Строка 42:

	* Implement [http://en.wikipedia.org/wiki/Quicksort QuickSort] '''without''' loops, using only utilitiies provided by STL.		* Implement [http://en.wikipedia.org/wiki/Quicksort QuickSort] '''without''' loops, using only utilitiies provided by STL.
−
−

	'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`		'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`

← Предыдущая		Версия 23:32, 30 марта 2015
Строка 42:		Строка 42:

	* Implement [http://en.wikipedia.org/wiki/Quicksort QuickSort] '''without''' loops, using only utilitiies provided by STL.		* Implement [http://en.wikipedia.org/wiki/Quicksort QuickSort] '''without''' loops, using only utilitiies provided by STL.
		+
		+

	'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`		'''Hint''': following utilities may be especially helpful for the described tasks: `std::rotate`, `std::upper_bound`, `std::next`, `std::nth_element`