open_toontown_panda3d/panda/src/graph/nodeRelation.h

// Filename: nodeRelation.h
// Created by:  drose (26Oct98)
//
////////////////////////////////////////////////////////////////////
//
// PANDA 3D SOFTWARE
// Copyright (c) 2001, Disney Enterprises, Inc.  All rights reserved
//
// All use of this software is subject to the terms of the Panda 3d
// Software license.  You should have received a copy of this license
// along with this source code; you will also find a current copy of
// the license at http://www.panda3d.org/license.txt .
//
// To contact the maintainers of this program write to
// panda3d@yahoogroups.com .
//
////////////////////////////////////////////////////////////////////

#ifndef NODERELATION_H
#define NODERELATION_H

#include <pandabase.h>

#include "nodeTransitions.h"
#include "nodeTransitionCache.h"
#include "boundedObject.h"
#include "pt_Node.h"

#include <typedWritableReferenceCount.h>
#include <bamWriter.h>
#include <bamReader.h>
#include <pointerTo.h>
#include <updateSeq.h>
#include <factory.h>

#include "pset.h"
#include "pmap.h"
#include <stdlib.h>

class Node;

// This function keeps a monotonically incrementing sequence number
// for each change made to the graph, for the purpose of invalidating
// wrt cache values.  A different sequence number is kept for each
// type of graph, hence the parameter.
extern EXPCL_PANDA UpdateSeq &last_graph_update(TypeHandle graph_type);

EXPCL_PANDA INLINE_GRAPH void remove_arc(NodeRelation *arc);

///////////////////////////////////////////////////////////////////
//       Class : NodeRelation
// Description : The base class for all scene graph arcs.  This is the
//               glue between Nodes that defines the scene graph.
//               There are no arcs of type NodeRelation per se, but
//               there may be any number of types of arcs that inherit
//               from NodeRelation.
//
//               All arcs are directed binary relations, from a parent
//               node to a child node, and may include any number of
//               NodeTransitions which affect the attributes of the
//               child node and later descendants.
////////////////////////////////////////////////////////////////////
class EXPCL_PANDA NodeRelation : public TypedWritableReferenceCount, public BoundedObject {
public:
  NodeRelation(Node *from, Node *to, int sort, TypeHandle graph_type);

protected:
  // Normally, this should only be used from derived classes for
  // passing to the factory.  Don't attempt to create an unattached
  // arc directly.
  NodeRelation(TypeHandle graph_type);

private:
  // It is an error to attempt to copy an arc.
  NodeRelation(const NodeRelation &copy);
  void operator = (const NodeRelation &copy);

public:
  // The destructor needs to be virtual so that we can delete the
  // NodeRelations of various types when the Node they're attached to
  // destructs.  However, a NodeRelation should not generally be
  // deleted directly, because it is reference-counted in the tree;
  // instead, you should call remove_arc().
  virtual ~NodeRelation();

PUBLISHED:
  void output(ostream &out) const;
  INLINE_GRAPH void output_transitions(ostream &out) const;
  INLINE_GRAPH void write_transitions(ostream &out, int indent = 0) const;

  INLINE_GRAPH Node *get_parent() const;
  INLINE_GRAPH Node *get_child() const;
  INLINE_GRAPH int get_sort() const;
  INLINE_GRAPH TypeHandle get_graph_type() const;

  INLINE_GRAPH bool is_attached() const;

  void ref_parent();
  void unref_parent();

  INLINE_GRAPH void change_parent(Node *parent);
  INLINE_GRAPH void change_parent(Node *parent, int sort);
  INLINE_GRAPH void change_child(Node *child);
  INLINE_GRAPH void change_parent_and_child(Node *parent, Node *child);
  INLINE_GRAPH void set_sort(int sort);
  INLINE_GRAPH void set_graph_type(TypeHandle graph_type);

  PT(NodeTransition) set_transition(TypeHandle handle, NodeTransition *trans);  /*DONT INLINE_GRAPH THIS*/
  INLINE_GRAPH PT(NodeTransition) set_transition(NodeTransition *trans);
  INLINE_GRAPH PT(NodeTransition) set_transition(NodeTransition *trans, int priority);
  PT(NodeTransition) clear_transition(TypeHandle handle);  /*DONT INLINE_GRAPH THIS*/

  INLINE_GRAPH bool has_transition(TypeHandle handle) const;
  INLINE_GRAPH bool has_any_transition() const;
  INLINE_GRAPH NodeTransition *get_transition(TypeHandle handle) const;
  void copy_transitions_from(const NodeRelation *arc);
  void compose_transitions_from(const NodeRelation *arc);
  void copy_transitions_from(const NodeTransitions &trans);
  void compose_transitions_from(const NodeTransitions &trans);
  void adjust_all_priorities(int adjustment);

  INLINE_GRAPH int compare_transitions_to(const NodeRelation *arc) const;

  INLINE_GRAPH UpdateSeq get_last_update() const;
  INLINE_GRAPH void clear_wrt_cache();

public:
  bool sub_render_trans(const AllTransitionsWrapper &input_trans,
                        AllTransitionsWrapper &modify_trans,
                        RenderTraverser *trav);
  bool has_sub_render_trans() const;
  int get_num_sub_render_trans() const;

public:
  // Factory stuff: to create a new NodeRelation based on its
  // TypeHandle.
  INLINE_GRAPH static NodeRelation *
  create_typed_arc(TypeHandle type, Node *parent, Node *child, int sort = 0);

  // This is just to be called at initialization time; don't try to
  // call this directly.
  INLINE_GRAPH static void register_with_factory();

protected:
  INLINE_GRAPH static Factory<NodeRelation> &get_factory();

private:
  static NodeRelation *make_arc(const FactoryParams &params);
  static Factory<NodeRelation> *_factory;

protected:
  void attach();
  PT(TypedWritableReferenceCount) detach();
  PT(TypedWritableReferenceCount) detach_below();

private:
  // We reference-count the child pointer, but not the parent pointer,
  // to avoid circular reference counting.

  Node *_parent;
  PT_Node _child;
  int _sort;
  TypeHandle _graph_type;
  bool _attached;
  int _parent_ref;

private:
  // This is the set of transitions assigned to the arc.  You should
  // never access this directly; use set_transition() and friends
  // instead.
  NodeTransitions _transitions;

  // This stores the known net transitions from the _top_subtree node,
  // which is either NULL to indicate the root of the graph, or a
  // pointer to the nearest descendent with multiple parents.  You
  // should never even attempt to access it directly; it exists only
  // to support caching in wrt().
  PT(NodeTransitionCache) _net_transitions;
  Node *_top_subtree;

  // This is updated with the current update sequence whenever we
  // verify that *all* the transitions to this arc are accurately
  // reflected in the above set.
  UpdateSeq _all_verified;

  // This is updated with the current update sequence each time the
  // arc is changed (for instance, to change its state or to reparent
  // it or something).  It exists to support caching in the cull
  // traversal.
  UpdateSeq _last_update;

public:
  static void register_with_read_factory(void);
  virtual void write_datagram(BamWriter* manager, Datagram &me);
  virtual int complete_pointers(TypedWritable **plist,
                                BamReader *manager);

  static TypedWritable *make_NodeRelation(const FactoryParams &params);

protected:
  void fillin(DatagramIterator& scan, BamReader* manager);

private:
  //This value is only used for the process of re-construction
  //from a binary source. DO NOT ACCESS.  The value is only
  //guaranteed to be accurate during that process
  int _num_transitions;

public:
  virtual void changed_transition(TypeHandle transition_type);

protected:
  virtual void propagate_stale_bound();
  virtual BoundingVolume *recompute_bound();

PUBLISHED:
  INLINE_GRAPH static TypeHandle get_class_type();
  INLINE_GRAPH static TypeHandle get_stashed_type();

public:
  static void init_type();
  virtual TypeHandle get_type() const;
  virtual TypeHandle force_init_type();

private:
  static TypeHandle _type_handle;
  static TypeHandle _stashed_type_handle;

  // Should not include storage class specifiers in friend declaration.
  friend EXPCL_PANDA void remove_arc(NodeRelation *arc);

  friend class Node;
  friend class NodeTransitionWrapper;
  friend class AllTransitionsWrapper;
  friend class GraphPriorityAdjuster;
};

EXPCL_PANDA INLINE_GRAPH ostream &
operator << (ostream &out, const NodeRelation &arc);

#include "nodeRelation.T"

#ifndef DONT_INLINE_GRAPH
#include "nodeRelation.I"
#endif

// We include node.h here at the end, so we'll know that nodes are of
// type ReferenceCount and will be able to compile anything that uses
// a NodeRelation.  We have to include it here at the end instead of
// the beginning because node.h also includes nodeRelation.h.

// This comment tells ppremake that we know this is a circular
// #include reference, and please don't bother us about it.  The line
// must be exactly as shown.
/* okcircular */
#include "node.h"

#endif