Tab completion functional.

git-svn-id: svn://rakshasa.no/libtorrent/trunk/rtorrent@357 e378c898-3ddf-0310-93e7-cc216c733640

src/input/path_input.cc

@@ -0,0 +1,137 @@
+// rTorrent - BitTorrent client
+// Copyright (C) 2005, Jari Sundell
+//
+// This program is free software; you can redistribute it and/or modify
+// it under the terms of the GNU General Public License as published by
+// the Free Software Foundation; either version 2 of the License, or
+// (at your option) any later version.
+// 
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+// 
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+//
+// Contact:  Jari Sundell <jaris@ifi.uio.no>
+//
+//           Skomakerveien 33
+//           3185 Skoppum, NORWAY
+
+#include "config.h"
+
+#include <functional>
+
+#include "path_input.h"
+
+namespace input {
+
+struct
+string_starts_with : public std::binary_function<std::string, std::string, bool> {
+  bool operator () (const std::string& complete, const std::string& base) const {
+    return !complete.compare(0, base.size(), base);
+  }
+};
+
+template <typename _InputIter>
+typename std::iterator_traits<_InputIter>::difference_type
+count_base(_InputIter __first1, _InputIter __last1,
+	   _InputIter __first2, _InputIter __last2) {
+
+  typename std::iterator_traits<_InputIter>::difference_type __n = 0;
+
+  for ( ;__first1 != __last1 && __first2 != __last2; ++__first1, ++__first2, ++__n)
+    if (*__first1 != *__first2)
+      return __n;
+
+  return __n;
+}
+
+template <typename _InputIter>
+std::string
+make_base(_InputIter __first, _InputIter __last) {
+  if (__first == __last)
+    return "";
+
+  std::string __base = *__first++;
+
+  for ( ;__first != __last; ++__first) {
+    std::string::size_type __pos = count_base(__base.begin(), __base.end(),
+					      __first->begin(), __first->end());
+
+    if (__pos < __base.size())
+      __base.resize(__pos);
+  }
+
+  return __base;
+}
+
+PathInput::PathInput() {
+}
+
+bool
+PathInput::pressed(int key) {
+  if (key == '\t')
+    receive_do_complete();
+  else
+    return TextInput::pressed(key);
+
+  return true;
+}
+
+void
+PathInput::receive_do_complete() {
+  size_type dirEnd = find_last_delim();
+
+  utils::Directory dir(dirEnd != 0 ? str().substr(0, dirEnd) : "./");
+  
+  if (!dir.update() || dir.empty()) {
+    str() += "!";
+    mark_dirty();
+
+    return;
+  }
+
+  Range r = find_incomplete(dir, str().substr(dirEnd, get_pos()));
+
+  if (r.first == r.second)
+    return; // Show some nice colors here.
+
+  std::string base = make_base(r.first, r.second);
+
+  // Clear the path after the cursor to make this code cleaner. It's
+  // not really nessesary to add the complexity just because someone
+  // might start tab-completeing in the middle of a path.
+  str().resize(dirEnd);
+  str().insert(dirEnd, base);
+
+  set_pos(dirEnd + base.size());
+
+  mark_dirty();
+}
+
+PathInput::size_type
+PathInput::find_last_delim() {
+  size_type r = str().rfind('/', get_pos());
+
+  if (r == npos)
+    return 0;
+  else if (r == size())
+    return r;
+  else
+    return r + 1;
+}
+
+PathInput::Range
+PathInput::find_incomplete(utils::Directory& d, const std::string& f) {
+  Range r;
+
+  r.first  = std::find_if(d.begin(), d.end(), std::bind2nd(string_starts_with(), f));
+  r.second = std::find_if(r.first, d.end(), std::not1(std::bind2nd(string_starts_with(), f)));
+
+  return r;
+}
+
+}