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

Untracked file

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 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is mozilla.org code.
 *
 * The Initial Developer of the Original Code is
 * Netscape Communications Corporation.
 * Portions created by the Initial Developer are Copyright (C) 2002
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *   Mike Shaver <shaver@mozilla.org>
 *   Randell Jesup <rjesup@wgate.com>
 *   Chris Waterson <waterson@netscape.com>
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either of the GNU General Public License Version 2 or later (the "GPL"),
 * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the MPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the MPL, the GPL or the LGPL.
 *
 * ***** END LICENSE BLOCK ***** */

#ifndef nsReflowPath_h__
#define nsReflowPath_h__

#include "nscore.h"
#include "pldhash.h"
#include "nsReflowType.h"
#include "nsVoidArray.h"

#ifdef DEBUG
#include <stdio.h>
#endif

class nsIFrame;
class nsHTMLReflowCommand;
class nsPresContext;

/**
 * A reflow `path' that is a sparse tree the parallels the frame
 * hierarchy. This is used during an incremental reflow to record the
 * path which the reflow must trace through the frame hierarchy.
 */
class nsReflowPath
{
public:
    /**
     * Construct a reflow path object that parallels the specified
     * frame.
     */
    nsReflowPath(nsIFrame *aFrame)
        : mFrame(aFrame),
          mReflowCommand(nsnull) {}

    ~nsReflowPath();

    /**
     * An iterator for enumerating the reflow path's immediate
     * children.
     */
    class iterator
    {
    protected:
        nsReflowPath *mNode;
        PRInt32 mIndex;

        friend class nsReflowPath;

        iterator(nsReflowPath *aNode, PRInt32 aIndex)
            : mNode(aNode), mIndex(aIndex) {}

        void
        Advance() { --mIndex; }

    public:
        iterator()
            : mNode(nsnull) {}

        iterator(const iterator &iter)
            : mNode(iter.mNode), mIndex(iter.mIndex) {}

        iterator &
        operator=(const iterator &iter) {
            mNode = iter.mNode;
            mIndex = iter.mIndex;
            return *this; }

        nsReflowPath *
        get() const {
            return NS_STATIC_CAST(nsReflowPath *, mNode->mChildren[mIndex]); }

        nsReflowPath *
        get() {
            return NS_STATIC_CAST(nsReflowPath *, mNode->mChildren[mIndex]); }

        nsIFrame *
        operator*() const {
            return get()->mFrame; }

        nsIFrame *&
        operator*() {
            return get()->mFrame; }

        iterator &
        operator++() { Advance(); return *this; }

        iterator
        operator++(int) {
            iterator temp(*this);
            Advance();
            return temp; }

        PRBool
        operator==(const iterator &iter) const {
            return (mNode == iter.mNode) && (mIndex == iter.mIndex); }

        PRBool
        operator!=(const iterator &iter) const {
            return !iter.operator==(*this); }
    };

    /**
     * Return an iterator that points to the first immediate child of
     * the reflow path.
     */
    iterator FirstChild() { return iterator(this, mChildren.Count() - 1); }

    /**
     * Return an iterator that points `one past the end' of the
     * immediate children of the reflow path.
     */
    iterator EndChildren() { return iterator(this, -1); }

    /**
     * Determine if the reflow path contains the specified frame as
     * one of its immediate children.
     */
    PRBool
    HasChild(nsIFrame *aFrame) const {
        return GetSubtreeFor(aFrame) != nsnull; }

    /**
     * Return an iterator over the current reflow path that
     * corresponds to the specified child frame. Returns EndChildren
     * if aFrame is not an immediate child of the reflow path.
     */
    iterator
    FindChild(nsIFrame *aFrame);

    /**
     * Remove the specified child frame from the reflow path, along
     * with any of its descendants. Does nothing if aFrame is not an
     * immediate child of the reflow path.
     */
    void
    RemoveChild(nsIFrame *aFrame) { 
        iterator iter = FindChild(aFrame);
        Remove(iter); }

    /**
     * Return the child reflow path that corresponds to the specified
     * frame, or null if the frame is not an immediate descendant.
     */
    nsReflowPath *
    GetSubtreeFor(nsIFrame *aFrame) const;

    /**
     * Return the child reflow path that corresponds to the specified
     * frame, constructing a new child reflow path if one doesn't
     * exist already.
     */
    nsReflowPath *
    EnsureSubtreeFor(nsIFrame *aFrame);

    /**
     * Remove the child reflow path that corresponds to the specified
     * iterator.
     */
    void
    Remove(iterator &aIterator);

#ifdef DEBUG
    /**
     * Recursively dump the reflow path object and its descendants.
     */
    void
    Dump(nsPresContext *aPresContext, FILE *aFile, int aDepth);
#endif

    /**
     * The frame that this reflow path object is associated with.
     */
    nsIFrame            *mFrame;

    /**
     * If mFrame is the immediate target of an incremental reflow,
     * this contains the reflow command that targeted it. Otherwise,
     * this is null (and mFrame simply lies along the path to a target
     * frame). The reflow path object assumes ownership of the reflow
     * command.
     */
    nsHTMLReflowCommand *mReflowCommand;

protected:
    /**
     * The children of this reflow path; also contains pointers to
     * nsReflowPath objects.
     */
    nsSmallVoidArray     mChildren;

    friend class iterator;
};

#endif