You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

CachingTree.php 1.6KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354
  1. <?php
  2. /**
  3. * @copyright Copyright (c) 2017 Robin Appelman <robin@icewind.nl>
  4. *
  5. * @author Joas Schilling <coding@schilljs.com>
  6. * @author Robin Appelman <robin@icewind.nl>
  7. *
  8. * @license GNU AGPL version 3 or any later version
  9. *
  10. * This program is free software: you can redistribute it and/or modify
  11. * it under the terms of the GNU Affero General Public License as
  12. * published by the Free Software Foundation, either version 3 of the
  13. * License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU Affero General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Affero General Public License
  21. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  22. *
  23. */
  24. namespace OCA\DAV\Connector\Sabre;
  25. use Sabre\DAV\Tree;
  26. class CachingTree extends Tree {
  27. /**
  28. * Store a node in the cache
  29. *
  30. * @param Node $node
  31. * @param null|string $path
  32. */
  33. public function cacheNode(Node $node, $path = null) {
  34. if (is_null($path)) {
  35. $path = $node->getPath();
  36. }
  37. $this->cache[trim($path, '/')] = $node;
  38. }
  39. public function markDirty($path) {
  40. // We don't care enough about sub-paths
  41. // flushing the entire cache
  42. $path = trim($path, '/');
  43. foreach ($this->cache as $nodePath => $node) {
  44. $nodePath = (string) $nodePath;
  45. if ('' === $path || $nodePath == $path || 0 === strpos($nodePath, $path.'/')) {
  46. unset($this->cache[$nodePath]);
  47. }
  48. }
  49. }
  50. }