* Register a node which have tag, line and column. * Does nothing if the argument is NULL. * Calls __synctex_node_make_friend_tlc. * - argument

* The page number of the target. * - author: JL */

Rougly speaking, this is: * node's h coordinate - hit point's h coordinate. * If node is to the right of the hit point, then this distance is posi

Returns a list of boxes (e.g., for the purpose of selecting text) Box rectangles are in pdf coordinates (i.e., bp) The backend may return big boxes co

virtual

static

Loads the file specified by filename. If this succeeds, the new file is displayed and true is returned. Otherwise, the view is not altered and false i

static

This is a convenience function for returning the page number of the first page item inside a given area of the scene. If no page is in the specified a

Uses doc-read-lock

static*/

FIXME: _isStoredInFilesystem should actually be set by load and save methods \deprecated

* The next nodes corresponds to a deep first tree traversal. * Creates child proxies as side effect. * May loop infinitely many times if the tree

Public */ * @brief Get the name of an input node. * * Corresponds to `Input:<tag>:<name>` entries in the `.synctex` file. * @param scanner * @pa

* The next result of a query. */

Where the synctex scanner parses the contents of the file. */

* The sheet of the scanner with a given page number. * - parameter scanner: a scanner. * - parameter page: a 1 based page number. * If page

TODO: Find a better place to put this

* The returned proxy will be the child or a sibling of owning_proxy. * The returned proxy has no parent, nor child. * Used only by synctex_node_c

* */

This functions opens the file at the "output" given location. * It manages the problem of quoted filenames that appear with pdftex and filenames con

Used when parsing the synctex file. * Read an Input record. * - parameter scanner: non NULL scanner * - returns SYNCTEX_STATUS_OK on successful

* Loop the candidate friendly list to find the ones with the proper * tag and line. * Returns a tree of results targeting the found candidates.

* When we have parsed a box, we must register * all the contained heading boundary nodes * that have not yet been registered. * Those handles w

* Free node and its siblings and return its detached child. */

* The next nodes corresponds to a deep first tree traversal. * Does not create child proxies as side effect contrary to * the synctex_node_next m

* The next nodes corresponds to a deep first tree traversal. * Does not create child proxies as side effect contrary to * the synctex_node_next m

Rougly speaking, this is: * node's v coordinate - hit point's v coordinate. * If node is at the top of the hit point, then this distance is positi

* Apply the processor f to the tree hierarchy rooted at proxy. * proxy has replaced a form ref, no children yet. * As a side effect all the hiera