DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Implementation

Mercurial (b6d82b1a6b02)

VCS Links

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=4 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

/*
 * Implementation of DOM Traversal's TreeWalker
 */

#ifndef mozilla_dom_TreeWalker_h
#define mozilla_dom_TreeWalker_h

#include "nsISupports.h"
#include "nsTraversal.h"
#include "nsCOMPtr.h"
#include "nsTArray.h"
#include "nsCycleCollectionParticipant.h"

class nsINode;

namespace mozilla {
namespace dom {

class TreeWalker final : public nsISupports, public nsTraversal {
  virtual ~TreeWalker();

 public:
  NS_DECL_CYCLE_COLLECTING_ISUPPORTS

  TreeWalker(nsINode* aRoot, uint32_t aWhatToShow, NodeFilter* aFilter);

  NS_DECL_CYCLE_COLLECTION_CLASS(TreeWalker)

  // WebIDL API
  nsINode* Root() const { return mRoot; }
  uint32_t WhatToShow() const { return mWhatToShow; }
  NodeFilter* GetFilter() { return mFilter; }
  nsINode* CurrentNode() const { return mCurrentNode; }
  void SetCurrentNode(nsINode& aNode, ErrorResult& aResult);
  // All our traversal methods return strong refs because filtering can
  // remove nodes from the tree.
  already_AddRefed<nsINode> ParentNode(ErrorResult& aResult);
  already_AddRefed<nsINode> FirstChild(ErrorResult& aResult);
  already_AddRefed<nsINode> LastChild(ErrorResult& aResult);
  already_AddRefed<nsINode> PreviousSibling(ErrorResult& aResult);
  already_AddRefed<nsINode> NextSibling(ErrorResult& aResult);
  already_AddRefed<nsINode> PreviousNode(ErrorResult& aResult);
  already_AddRefed<nsINode> NextNode(ErrorResult& aResult);

  bool WrapObject(JSContext* aCx, JS::Handle<JSObject*> aGivenProto,
                  JS::MutableHandle<JSObject*> aReflector);

 private:
  nsCOMPtr<nsINode> mCurrentNode;

  /*
   * Implements FirstChild and LastChild which only vary in which direction
   * they search.
   * @param aReversed Controls whether we search forwards or backwards
   * @param aResult   Whether we threw or not.
   * @returns         The desired node. Null if no child is found
   */
  already_AddRefed<nsINode> FirstChildInternal(bool aReversed,
                                               ErrorResult& aResult);

  /*
   * Implements NextSibling and PreviousSibling which only vary in which
   * direction they search.
   * @param aReversed Controls whether we search forwards or backwards
   * @param aResult   Whether we threw or not.
   * @returns         The desired node. Null if no child is found
   */
  already_AddRefed<nsINode> NextSiblingInternal(bool aReversed,
                                                ErrorResult& aResult);
};

}  // namespace dom
}  // namespace mozilla

#endif  // mozilla_dom_TreeWalker_h