TestsForPedick

  const BiDirectionalList<int> f;
  BiDirectionalList<int> f1{};
  BiDirectionalList<int> f3{1, 2, 3, 4};
  const std::initializer_list<int> x = {1, 2, 3};
  BiDirectionalList<int> f4(x);
  std::initializer_list<int> x1 = {1, 2, 3};
  BiDirectionalList<int> f5(x1);
  const BiDirectionalList<int> opa(f5);
  BiDirectionalList<int> opa2(opa);
  const BiDirectionalList<int>& opa3(std::move(opa2));
  std::cout << (f5.Size() != f.Size() && f.IsEmpty());
  const int zzzz = 2;
  f1.PushFront(zzzz);
  f1.PushBack(zzzz);
  std::cout << (f1.Back()->value == f1.Front()->value);
  std::cout << (opa.Front() != opa.Back());
  f1.PopBack();
  f1.PopFront();
  std::cout << (f1.Size() == 0);
  const std::vector<int> buka = opa.ToVector();
  const std::vector<int> buka2 = opa.FindAll(zzzz);
  opa2 = opa;
  opa2[1];
  opa[1];
  opa2.InsertBefore(opa2.Back(), zzzz);
  opa2.InsertBefore(opa2.Front(), zzzz);
  opa2.InsertAfter(opa2.Front(), zzzz);
  opa2.InsertAfter(opa2.Back(), zzzz);
  opa2.InsertAfter(opa2[0], zzzz);
  while (!opa2.IsEmpty()) { opa2.Erase(opa2[0]); }
  std::cout << (opa2 == f1 && f1 == opa2);
  f1 = opa;
  f1 = opa2;
  // = = = = Shared
  SharedPtr<int> hoba;
  const SharedPtr<int> zoba(hoba); // !?
  SharedPtr<int> boba(hoba); // !?
  boba = zoba;
  const SharedPtr<int> cobra(new int(41));
  boba = cobra;
  std::cout << (*cobra.Get() == 41);

  boba.Release();
  SharedPtr<int> novaya(new int(43));
  std::cout << ((*novaya) == 43 && *(novaya.Get()) == 43);
  const SharedPtr<int> novaya2(new int(44));
  std::cout << ((*novaya2) == 44 && *(novaya2.Get()) == 44);
  const SharedPtr<int>* novaya4 = &novaya2;
  std::cout << (*(novaya4->Get()) == 44) << (*novaya4 == novaya2)
      && (novaya2 == *novaya4);
  int* ccc = new int(44);
  const int* ddd = ccc;

  const SharedPtr<int> skolko_mojno(ccc);
  std::cout << (skolko_mojno == ddd);
  std::cout << (ccc == skolko_mojno);

  SharedPtr<int> tttt;
  tttt = skolko_mojno;
  tttt = boba;