BencodeVisitor.cc 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #include "BencodeVisitor.h"
  36. #include "Data.h"
  37. #include "List.h"
  38. #include "Dictionary.h"
  39. #include "Util.h"
  40. #include <functional>
  41. #include <algorithm>
  42. namespace aria2 {
  43. BencodeVisitor::BencodeVisitor() {}
  44. BencodeVisitor::~BencodeVisitor() {}
  45. void BencodeVisitor::visit(const Data* d)
  46. {
  47. if(d->isNumber()) {
  48. _bencodedData += "i"+d->toString()+"e";
  49. } else {
  50. _bencodedData += Util::itos(d->getLen())+":"+d->toString();
  51. }
  52. }
  53. void BencodeVisitor::visit(const List* l)
  54. {
  55. _bencodedData += "l";
  56. std::for_each(l->getList().begin(), l->getList().end(),
  57. std::bind2nd(std::mem_fun(&MetaEntry::accept), this));
  58. _bencodedData += "e";
  59. }
  60. void BencodeVisitor::visit(const Dictionary* d)
  61. {
  62. _bencodedData += "d";
  63. for(std::deque<std::string>::const_iterator itr = d->getOrder().begin(); itr != d->getOrder().end(); ++itr) {
  64. _bencodedData += Util::uitos((*itr).size());
  65. _bencodedData += ":";
  66. _bencodedData += *itr;
  67. d->get(*itr)->accept(this);
  68. }
  69. _bencodedData += "e";
  70. }
  71. void BencodeVisitor::visit(const MetaEntry* e)
  72. {
  73. if(dynamic_cast<const Data*>(e) != 0) {
  74. visit(reinterpret_cast<const Data*>(e));
  75. } else if(dynamic_cast<const List*>(e) != 0) {
  76. visit(reinterpret_cast<const List*>(e));
  77. } else if(dynamic_cast<const Dictionary*>(e) != 0) {
  78. visit(reinterpret_cast<const Dictionary*>(e));
  79. }
  80. }
  81. } // namespace aria2