The JUCE cross-platform C++ framework, with DISTRHO/KXStudio specific changes
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.

1108 lines
34KB

  1. /*
  2. ==============================================================================
  3. This file is part of the JUCE library - "Jules' Utility Class Extensions"
  4. Copyright 2004-11 by Raw Material Software Ltd.
  5. ------------------------------------------------------------------------------
  6. JUCE can be redistributed and/or modified under the terms of the GNU General
  7. Public License (Version 2), as published by the Free Software Foundation.
  8. A copy of the license is included in the JUCE distribution, or can be found
  9. online at www.gnu.org/licenses.
  10. JUCE is distributed in the hope that it will be useful, but WITHOUT ANY
  11. WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
  12. A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  13. ------------------------------------------------------------------------------
  14. To release a closed-source product which uses JUCE, commercial licenses are
  15. available: visit www.rawmaterialsoftware.com/juce for more information.
  16. ==============================================================================
  17. */
  18. BEGIN_JUCE_NAMESPACE
  19. //==============================================================================
  20. class ValueTree::SharedObject : public SingleThreadedReferenceCountedObject
  21. {
  22. public:
  23. typedef ReferenceCountedObjectPtr<SharedObject> Ptr;
  24. explicit SharedObject (const Identifier& type_) noexcept
  25. : type (type_), parent (nullptr)
  26. {
  27. }
  28. SharedObject (const SharedObject& other)
  29. : type (other.type), properties (other.properties), parent (nullptr)
  30. {
  31. for (int i = 0; i < other.children.size(); ++i)
  32. {
  33. SharedObject* const child = new SharedObject (*other.children.getObjectPointerUnchecked(i));
  34. child->parent = this;
  35. children.add (child);
  36. }
  37. }
  38. ~SharedObject()
  39. {
  40. jassert (parent == nullptr); // this should never happen unless something isn't obeying the ref-counting!
  41. for (int i = children.size(); --i >= 0;)
  42. {
  43. const Ptr c (children.getObjectPointerUnchecked(i));
  44. c->parent = nullptr;
  45. children.remove (i);
  46. c->sendParentChangeMessage();
  47. }
  48. }
  49. void sendPropertyChangeMessage (ValueTree& tree, const Identifier& property)
  50. {
  51. for (int i = valueTreesWithListeners.size(); --i >= 0;)
  52. {
  53. ValueTree* const v = valueTreesWithListeners[i];
  54. if (v != nullptr)
  55. v->listeners.call (&ValueTree::Listener::valueTreePropertyChanged, tree, property);
  56. }
  57. }
  58. void sendPropertyChangeMessage (const Identifier& property)
  59. {
  60. ValueTree tree (this);
  61. for (ValueTree::SharedObject* t = this; t != nullptr; t = t->parent)
  62. t->sendPropertyChangeMessage (tree, property);
  63. }
  64. void sendChildAddedMessage (ValueTree& tree, ValueTree& child)
  65. {
  66. for (int i = valueTreesWithListeners.size(); --i >= 0;)
  67. {
  68. ValueTree* const v = valueTreesWithListeners[i];
  69. if (v != nullptr)
  70. v->listeners.call (&ValueTree::Listener::valueTreeChildAdded, tree, child);
  71. }
  72. }
  73. void sendChildAddedMessage (ValueTree child)
  74. {
  75. ValueTree tree (this);
  76. for (ValueTree::SharedObject* t = this; t != nullptr; t = t->parent)
  77. t->sendChildAddedMessage (tree, child);
  78. }
  79. void sendChildRemovedMessage (ValueTree& tree, ValueTree& child)
  80. {
  81. for (int i = valueTreesWithListeners.size(); --i >= 0;)
  82. {
  83. ValueTree* const v = valueTreesWithListeners[i];
  84. if (v != nullptr)
  85. v->listeners.call (&ValueTree::Listener::valueTreeChildRemoved, tree, child);
  86. }
  87. }
  88. void sendChildRemovedMessage (ValueTree child)
  89. {
  90. ValueTree tree (this);
  91. for (ValueTree::SharedObject* t = this; t != nullptr; t = t->parent)
  92. t->sendChildRemovedMessage (tree, child);
  93. }
  94. void sendChildOrderChangedMessage (ValueTree& tree)
  95. {
  96. for (int i = valueTreesWithListeners.size(); --i >= 0;)
  97. {
  98. ValueTree* const v = valueTreesWithListeners[i];
  99. if (v != nullptr)
  100. v->listeners.call (&ValueTree::Listener::valueTreeChildOrderChanged, tree);
  101. }
  102. }
  103. void sendChildOrderChangedMessage()
  104. {
  105. ValueTree tree (this);
  106. for (ValueTree::SharedObject* t = this; t != nullptr; t = t->parent)
  107. t->sendChildOrderChangedMessage (tree);
  108. }
  109. void sendParentChangeMessage()
  110. {
  111. ValueTree tree (this);
  112. for (int j = children.size(); --j >= 0;)
  113. {
  114. SharedObject* const child = children.getObjectPointer (j);
  115. if (child != nullptr)
  116. child->sendParentChangeMessage();
  117. }
  118. for (int i = valueTreesWithListeners.size(); --i >= 0;)
  119. {
  120. ValueTree* const v = valueTreesWithListeners[i];
  121. if (v != nullptr)
  122. v->listeners.call (&ValueTree::Listener::valueTreeParentChanged, tree);
  123. }
  124. }
  125. const var& getProperty (const Identifier& name) const noexcept
  126. {
  127. return properties [name];
  128. }
  129. var getProperty (const Identifier& name, const var& defaultReturnValue) const
  130. {
  131. return properties.getWithDefault (name, defaultReturnValue);
  132. }
  133. void setProperty (const Identifier& name, const var& newValue, UndoManager* const undoManager)
  134. {
  135. if (undoManager == nullptr)
  136. {
  137. if (properties.set (name, newValue))
  138. sendPropertyChangeMessage (name);
  139. }
  140. else
  141. {
  142. const var* const existingValue = properties.getVarPointer (name);
  143. if (existingValue != nullptr)
  144. {
  145. if (*existingValue != newValue)
  146. undoManager->perform (new SetPropertyAction (this, name, newValue, *existingValue, false, false));
  147. }
  148. else
  149. {
  150. undoManager->perform (new SetPropertyAction (this, name, newValue, var::null, true, false));
  151. }
  152. }
  153. }
  154. bool hasProperty (const Identifier& name) const noexcept
  155. {
  156. return properties.contains (name);
  157. }
  158. void removeProperty (const Identifier& name, UndoManager* const undoManager)
  159. {
  160. if (undoManager == nullptr)
  161. {
  162. if (properties.remove (name))
  163. sendPropertyChangeMessage (name);
  164. }
  165. else
  166. {
  167. if (properties.contains (name))
  168. undoManager->perform (new SetPropertyAction (this, name, var::null, properties [name], false, true));
  169. }
  170. }
  171. void removeAllProperties (UndoManager* const undoManager)
  172. {
  173. if (undoManager == nullptr)
  174. {
  175. while (properties.size() > 0)
  176. {
  177. const Identifier name (properties.getName (properties.size() - 1));
  178. properties.remove (name);
  179. sendPropertyChangeMessage (name);
  180. }
  181. }
  182. else
  183. {
  184. for (int i = properties.size(); --i >= 0;)
  185. undoManager->perform (new SetPropertyAction (this, properties.getName(i), var::null,
  186. properties.getValueAt(i), false, true));
  187. }
  188. }
  189. ValueTree getChildWithName (const Identifier& typeToMatch) const
  190. {
  191. for (int i = 0; i < children.size(); ++i)
  192. {
  193. SharedObject* const s = children.getObjectPointerUnchecked (i);
  194. if (s->type == typeToMatch)
  195. return ValueTree (s);
  196. }
  197. return ValueTree::invalid;
  198. }
  199. ValueTree getOrCreateChildWithName (const Identifier& typeToMatch, UndoManager* undoManager)
  200. {
  201. for (int i = 0; i < children.size(); ++i)
  202. {
  203. SharedObject* const s = children.getObjectPointerUnchecked (i);
  204. if (s->type == typeToMatch)
  205. return ValueTree (s);
  206. }
  207. SharedObject* const newObject = new SharedObject (typeToMatch);
  208. addChild (newObject, -1, undoManager);
  209. return ValueTree (newObject);
  210. }
  211. ValueTree getChildWithProperty (const Identifier& propertyName, const var& propertyValue) const
  212. {
  213. for (int i = 0; i < children.size(); ++i)
  214. {
  215. SharedObject* const s = children.getObjectPointerUnchecked (i);
  216. if (s->getProperty (propertyName) == propertyValue)
  217. return ValueTree (s);
  218. }
  219. return ValueTree::invalid;
  220. }
  221. bool isAChildOf (const SharedObject* const possibleParent) const noexcept
  222. {
  223. const SharedObject* p = parent;
  224. while (p != nullptr)
  225. {
  226. if (p == possibleParent)
  227. return true;
  228. p = p->parent;
  229. }
  230. return false;
  231. }
  232. int indexOf (const ValueTree& child) const noexcept
  233. {
  234. return children.indexOf (child.object);
  235. }
  236. void addChild (SharedObject* child, int index, UndoManager* const undoManager)
  237. {
  238. if (child != nullptr && child->parent != this)
  239. {
  240. if (child != this && ! isAChildOf (child))
  241. {
  242. // You should always make sure that a child is removed from its previous parent before
  243. // adding it somewhere else - otherwise, it's ambiguous as to whether a different
  244. // undomanager should be used when removing it from its current parent..
  245. jassert (child->parent == nullptr);
  246. if (child->parent != nullptr)
  247. {
  248. jassert (child->parent->children.indexOf (child) >= 0);
  249. child->parent->removeChild (child->parent->children.indexOf (child), undoManager);
  250. }
  251. if (undoManager == nullptr)
  252. {
  253. children.insert (index, child);
  254. child->parent = this;
  255. sendChildAddedMessage (ValueTree (child));
  256. child->sendParentChangeMessage();
  257. }
  258. else
  259. {
  260. if (index < 0)
  261. index = children.size();
  262. undoManager->perform (new AddOrRemoveChildAction (this, index, child));
  263. }
  264. }
  265. else
  266. {
  267. // You're attempting to create a recursive loop! A node
  268. // can't be a child of one of its own children!
  269. jassertfalse;
  270. }
  271. }
  272. }
  273. void removeChild (const int childIndex, UndoManager* const undoManager)
  274. {
  275. const Ptr child (children.getObjectPointer (childIndex));
  276. if (child != nullptr)
  277. {
  278. if (undoManager == nullptr)
  279. {
  280. children.remove (childIndex);
  281. child->parent = nullptr;
  282. sendChildRemovedMessage (ValueTree (child));
  283. child->sendParentChangeMessage();
  284. }
  285. else
  286. {
  287. undoManager->perform (new AddOrRemoveChildAction (this, childIndex, nullptr));
  288. }
  289. }
  290. }
  291. void removeAllChildren (UndoManager* const undoManager)
  292. {
  293. while (children.size() > 0)
  294. removeChild (children.size() - 1, undoManager);
  295. }
  296. void moveChild (int currentIndex, int newIndex, UndoManager* undoManager)
  297. {
  298. // The source index must be a valid index!
  299. jassert (isPositiveAndBelow (currentIndex, children.size()));
  300. if (currentIndex != newIndex
  301. && isPositiveAndBelow (currentIndex, children.size()))
  302. {
  303. if (undoManager == nullptr)
  304. {
  305. children.move (currentIndex, newIndex);
  306. sendChildOrderChangedMessage();
  307. }
  308. else
  309. {
  310. if (! isPositiveAndBelow (newIndex, children.size()))
  311. newIndex = children.size() - 1;
  312. undoManager->perform (new MoveChildAction (this, currentIndex, newIndex));
  313. }
  314. }
  315. }
  316. void reorderChildren (const OwnedArray<ValueTree>& newOrder, UndoManager* undoManager)
  317. {
  318. jassert (newOrder.size() == children.size());
  319. if (undoManager == nullptr)
  320. {
  321. children.clear();
  322. children.ensureStorageAllocated (newOrder.size());
  323. for (int i = 0; i < newOrder.size(); ++i)
  324. children.add (newOrder.getUnchecked(i)->object);
  325. sendChildOrderChangedMessage();
  326. }
  327. else
  328. {
  329. for (int i = 0; i < children.size(); ++i)
  330. {
  331. SharedObject* const child = newOrder.getUnchecked(i)->object;
  332. if (children.getObjectPointerUnchecked (i) != child)
  333. {
  334. const int oldIndex = children.indexOf (child);
  335. jassert (oldIndex >= 0);
  336. moveChild (oldIndex, i, undoManager);
  337. }
  338. }
  339. }
  340. }
  341. bool isEquivalentTo (const SharedObject& other) const
  342. {
  343. if (type != other.type
  344. || properties.size() != other.properties.size()
  345. || children.size() != other.children.size()
  346. || properties != other.properties)
  347. return false;
  348. for (int i = 0; i < children.size(); ++i)
  349. if (! children.getObjectPointerUnchecked(i)->isEquivalentTo (*other.children.getObjectPointerUnchecked(i)))
  350. return false;
  351. return true;
  352. }
  353. XmlElement* createXml() const
  354. {
  355. XmlElement* const xml = new XmlElement (type.toString());
  356. properties.copyToXmlAttributes (*xml);
  357. for (int i = 0; i < children.size(); ++i)
  358. xml->addChildElement (children.getObjectPointerUnchecked(i)->createXml());
  359. return xml;
  360. }
  361. void writeToStream (OutputStream& output) const
  362. {
  363. output.writeString (type.toString());
  364. output.writeCompressedInt (properties.size());
  365. for (int j = 0; j < properties.size(); ++j)
  366. {
  367. output.writeString (properties.getName (j).toString());
  368. properties.getValueAt(j).writeToStream (output);
  369. }
  370. output.writeCompressedInt (children.size());
  371. for (int i = 0; i < children.size(); ++i)
  372. writeObjectToStream (output, children.getObjectPointerUnchecked(i));
  373. }
  374. static void writeObjectToStream (OutputStream& output, const SharedObject* const object)
  375. {
  376. if (object != nullptr)
  377. {
  378. object->writeToStream (output);
  379. }
  380. else
  381. {
  382. output.writeString (String::empty);
  383. output.writeCompressedInt (0);
  384. output.writeCompressedInt (0);
  385. }
  386. }
  387. //==============================================================================
  388. class SetPropertyAction : public UndoableAction
  389. {
  390. public:
  391. SetPropertyAction (SharedObject* const target_, const Identifier& name_,
  392. const var& newValue_, const var& oldValue_,
  393. const bool isAddingNewProperty_, const bool isDeletingProperty_)
  394. : target (target_), name (name_), newValue (newValue_), oldValue (oldValue_),
  395. isAddingNewProperty (isAddingNewProperty_), isDeletingProperty (isDeletingProperty_)
  396. {
  397. }
  398. bool perform()
  399. {
  400. jassert (! (isAddingNewProperty && target->hasProperty (name)));
  401. if (isDeletingProperty)
  402. target->removeProperty (name, nullptr);
  403. else
  404. target->setProperty (name, newValue, nullptr);
  405. return true;
  406. }
  407. bool undo()
  408. {
  409. if (isAddingNewProperty)
  410. target->removeProperty (name, nullptr);
  411. else
  412. target->setProperty (name, oldValue, nullptr);
  413. return true;
  414. }
  415. int getSizeInUnits()
  416. {
  417. return (int) sizeof (*this); //xxx should be more accurate
  418. }
  419. UndoableAction* createCoalescedAction (UndoableAction* nextAction)
  420. {
  421. if (! (isAddingNewProperty || isDeletingProperty))
  422. {
  423. SetPropertyAction* const next = dynamic_cast <SetPropertyAction*> (nextAction);
  424. if (next != nullptr && next->target == target && next->name == name
  425. && ! (next->isAddingNewProperty || next->isDeletingProperty))
  426. {
  427. return new SetPropertyAction (target, name, next->newValue, oldValue, false, false);
  428. }
  429. }
  430. return nullptr;
  431. }
  432. private:
  433. const Ptr target;
  434. const Identifier name;
  435. const var newValue;
  436. var oldValue;
  437. const bool isAddingNewProperty : 1, isDeletingProperty : 1;
  438. JUCE_DECLARE_NON_COPYABLE (SetPropertyAction);
  439. };
  440. //==============================================================================
  441. class AddOrRemoveChildAction : public UndoableAction
  442. {
  443. public:
  444. AddOrRemoveChildAction (SharedObject* target_, const int childIndex_, SharedObject* newChild_)
  445. : target (target_),
  446. child (newChild_ != nullptr ? newChild_ : target_->children.getObjectPointer (childIndex_)),
  447. childIndex (childIndex_),
  448. isDeleting (newChild_ == nullptr)
  449. {
  450. jassert (child != nullptr);
  451. }
  452. bool perform()
  453. {
  454. if (isDeleting)
  455. target->removeChild (childIndex, nullptr);
  456. else
  457. target->addChild (child, childIndex, nullptr);
  458. return true;
  459. }
  460. bool undo()
  461. {
  462. if (isDeleting)
  463. {
  464. target->addChild (child, childIndex, nullptr);
  465. }
  466. else
  467. {
  468. // If you hit this, it seems that your object's state is getting confused - probably
  469. // because you've interleaved some undoable and non-undoable operations?
  470. jassert (childIndex < target->children.size());
  471. target->removeChild (childIndex, nullptr);
  472. }
  473. return true;
  474. }
  475. int getSizeInUnits()
  476. {
  477. return (int) sizeof (*this); //xxx should be more accurate
  478. }
  479. private:
  480. const Ptr target, child;
  481. const int childIndex;
  482. const bool isDeleting;
  483. JUCE_DECLARE_NON_COPYABLE (AddOrRemoveChildAction);
  484. };
  485. //==============================================================================
  486. class MoveChildAction : public UndoableAction
  487. {
  488. public:
  489. MoveChildAction (SharedObject* const parent_, const int startIndex_, const int endIndex_) noexcept
  490. : parent (parent_), startIndex (startIndex_), endIndex (endIndex_)
  491. {
  492. }
  493. bool perform()
  494. {
  495. parent->moveChild (startIndex, endIndex, nullptr);
  496. return true;
  497. }
  498. bool undo()
  499. {
  500. parent->moveChild (endIndex, startIndex, nullptr);
  501. return true;
  502. }
  503. int getSizeInUnits()
  504. {
  505. return (int) sizeof (*this); //xxx should be more accurate
  506. }
  507. UndoableAction* createCoalescedAction (UndoableAction* nextAction)
  508. {
  509. MoveChildAction* next = dynamic_cast <MoveChildAction*> (nextAction);
  510. if (next != nullptr && next->parent == parent && next->startIndex == endIndex)
  511. return new MoveChildAction (parent, startIndex, next->endIndex);
  512. return nullptr;
  513. }
  514. private:
  515. const Ptr parent;
  516. const int startIndex, endIndex;
  517. JUCE_DECLARE_NON_COPYABLE (MoveChildAction);
  518. };
  519. //==============================================================================
  520. const Identifier type;
  521. NamedValueSet properties;
  522. ReferenceCountedArray<SharedObject> children;
  523. SortedSet<ValueTree*> valueTreesWithListeners;
  524. SharedObject* parent;
  525. private:
  526. SharedObject& operator= (const SharedObject&);
  527. JUCE_LEAK_DETECTOR (SharedObject);
  528. };
  529. //==============================================================================
  530. ValueTree::ValueTree() noexcept
  531. {
  532. }
  533. const ValueTree ValueTree::invalid;
  534. ValueTree::ValueTree (const Identifier& type_)
  535. : object (new ValueTree::SharedObject (type_))
  536. {
  537. jassert (type_.toString().isNotEmpty()); // All objects should be given a sensible type name!
  538. }
  539. ValueTree::ValueTree (SharedObject* const object_)
  540. : object (object_)
  541. {
  542. }
  543. ValueTree::ValueTree (const ValueTree& other)
  544. : object (other.object)
  545. {
  546. }
  547. ValueTree& ValueTree::operator= (const ValueTree& other)
  548. {
  549. if (listeners.size() > 0)
  550. {
  551. if (object != nullptr)
  552. object->valueTreesWithListeners.removeValue (this);
  553. if (other.object != nullptr)
  554. other.object->valueTreesWithListeners.add (this);
  555. }
  556. object = other.object;
  557. return *this;
  558. }
  559. #if JUCE_COMPILER_SUPPORTS_MOVE_SEMANTICS
  560. ValueTree::ValueTree (ValueTree&& other) noexcept
  561. : object (static_cast <SharedObject::Ptr&&> (other.object))
  562. {
  563. }
  564. ValueTree& ValueTree::operator= (ValueTree&& other) noexcept
  565. {
  566. object = static_cast <SharedObject::Ptr&&> (other.object);
  567. return *this;
  568. }
  569. #endif
  570. ValueTree::~ValueTree()
  571. {
  572. if (listeners.size() > 0 && object != nullptr)
  573. object->valueTreesWithListeners.removeValue (this);
  574. }
  575. bool ValueTree::operator== (const ValueTree& other) const noexcept
  576. {
  577. return object == other.object;
  578. }
  579. bool ValueTree::operator!= (const ValueTree& other) const noexcept
  580. {
  581. return object != other.object;
  582. }
  583. bool ValueTree::isEquivalentTo (const ValueTree& other) const
  584. {
  585. return object == other.object
  586. || (object != nullptr && other.object != nullptr
  587. && object->isEquivalentTo (*other.object));
  588. }
  589. ValueTree ValueTree::createCopy() const
  590. {
  591. return ValueTree (createCopyIfNotNull (object.getObject()));
  592. }
  593. bool ValueTree::hasType (const Identifier& typeName) const
  594. {
  595. return object != nullptr && object->type == typeName;
  596. }
  597. Identifier ValueTree::getType() const
  598. {
  599. return object != nullptr ? object->type : Identifier();
  600. }
  601. ValueTree ValueTree::getParent() const
  602. {
  603. return ValueTree (object != nullptr ? object->parent
  604. : static_cast <SharedObject*> (nullptr));
  605. }
  606. ValueTree ValueTree::getSibling (const int delta) const
  607. {
  608. if (object == nullptr || object->parent == nullptr)
  609. return invalid;
  610. const int index = object->parent->indexOf (*this) + delta;
  611. return ValueTree (object->parent->children.getObjectPointer (index));
  612. }
  613. const var& ValueTree::operator[] (const Identifier& name) const
  614. {
  615. return object == nullptr ? var::null : object->getProperty (name);
  616. }
  617. const var& ValueTree::getProperty (const Identifier& name) const
  618. {
  619. return object == nullptr ? var::null : object->getProperty (name);
  620. }
  621. var ValueTree::getProperty (const Identifier& name, const var& defaultReturnValue) const
  622. {
  623. return object == nullptr ? defaultReturnValue
  624. : object->getProperty (name, defaultReturnValue);
  625. }
  626. ValueTree& ValueTree::setProperty (const Identifier& name, const var& newValue,
  627. UndoManager* const undoManager)
  628. {
  629. jassert (name.toString().isNotEmpty());
  630. if (object != nullptr)
  631. object->setProperty (name, newValue, undoManager);
  632. return *this;
  633. }
  634. bool ValueTree::hasProperty (const Identifier& name) const
  635. {
  636. return object != nullptr && object->hasProperty (name);
  637. }
  638. void ValueTree::removeProperty (const Identifier& name, UndoManager* const undoManager)
  639. {
  640. if (object != nullptr)
  641. object->removeProperty (name, undoManager);
  642. }
  643. void ValueTree::removeAllProperties (UndoManager* const undoManager)
  644. {
  645. if (object != nullptr)
  646. object->removeAllProperties (undoManager);
  647. }
  648. int ValueTree::getNumProperties() const
  649. {
  650. return object == nullptr ? 0 : object->properties.size();
  651. }
  652. Identifier ValueTree::getPropertyName (const int index) const
  653. {
  654. return object == nullptr ? Identifier()
  655. : object->properties.getName (index);
  656. }
  657. //==============================================================================
  658. class ValueTreePropertyValueSource : public Value::ValueSource,
  659. public ValueTree::Listener
  660. {
  661. public:
  662. ValueTreePropertyValueSource (const ValueTree& tree_, const Identifier& property_,
  663. UndoManager* const undoManager_)
  664. : tree (tree_), property (property_), undoManager (undoManager_)
  665. {
  666. tree.addListener (this);
  667. }
  668. ~ValueTreePropertyValueSource()
  669. {
  670. tree.removeListener (this);
  671. }
  672. var getValue() const { return tree [property]; }
  673. void setValue (const var& newValue) { tree.setProperty (property, newValue, undoManager); }
  674. void valueTreePropertyChanged (ValueTree& treeWhosePropertyHasChanged,
  675. const Identifier& changedProperty)
  676. {
  677. if (tree == treeWhosePropertyHasChanged && property == changedProperty)
  678. sendChangeMessage (false);
  679. }
  680. void valueTreeChildAdded (ValueTree&, ValueTree&) {}
  681. void valueTreeChildRemoved (ValueTree&, ValueTree&) {}
  682. void valueTreeChildOrderChanged (ValueTree&) {}
  683. void valueTreeParentChanged (ValueTree&) {}
  684. private:
  685. ValueTree tree;
  686. const Identifier property;
  687. UndoManager* const undoManager;
  688. JUCE_DECLARE_NON_COPYABLE (ValueTreePropertyValueSource);
  689. };
  690. Value ValueTree::getPropertyAsValue (const Identifier& name, UndoManager* const undoManager) const
  691. {
  692. return Value (new ValueTreePropertyValueSource (*this, name, undoManager));
  693. }
  694. //==============================================================================
  695. int ValueTree::getNumChildren() const
  696. {
  697. return object == nullptr ? 0 : object->children.size();
  698. }
  699. ValueTree ValueTree::getChild (int index) const
  700. {
  701. return ValueTree (object != nullptr ? object->children.getObjectPointer (index)
  702. : static_cast <SharedObject*> (nullptr));
  703. }
  704. ValueTree ValueTree::getChildWithName (const Identifier& type) const
  705. {
  706. return object != nullptr ? object->getChildWithName (type) : ValueTree::invalid;
  707. }
  708. ValueTree ValueTree::getOrCreateChildWithName (const Identifier& type, UndoManager* undoManager)
  709. {
  710. return object != nullptr ? object->getOrCreateChildWithName (type, undoManager) : ValueTree::invalid;
  711. }
  712. ValueTree ValueTree::getChildWithProperty (const Identifier& propertyName, const var& propertyValue) const
  713. {
  714. return object != nullptr ? object->getChildWithProperty (propertyName, propertyValue) : ValueTree::invalid;
  715. }
  716. bool ValueTree::isAChildOf (const ValueTree& possibleParent) const
  717. {
  718. return object != nullptr && object->isAChildOf (possibleParent.object);
  719. }
  720. int ValueTree::indexOf (const ValueTree& child) const
  721. {
  722. return object != nullptr ? object->indexOf (child) : -1;
  723. }
  724. void ValueTree::addChild (const ValueTree& child, int index, UndoManager* const undoManager)
  725. {
  726. if (object != nullptr)
  727. object->addChild (child.object, index, undoManager);
  728. }
  729. void ValueTree::removeChild (const int childIndex, UndoManager* const undoManager)
  730. {
  731. if (object != nullptr)
  732. object->removeChild (childIndex, undoManager);
  733. }
  734. void ValueTree::removeChild (const ValueTree& child, UndoManager* const undoManager)
  735. {
  736. if (object != nullptr)
  737. object->removeChild (object->children.indexOf (child.object), undoManager);
  738. }
  739. void ValueTree::removeAllChildren (UndoManager* const undoManager)
  740. {
  741. if (object != nullptr)
  742. object->removeAllChildren (undoManager);
  743. }
  744. void ValueTree::moveChild (int currentIndex, int newIndex, UndoManager* undoManager)
  745. {
  746. if (object != nullptr)
  747. object->moveChild (currentIndex, newIndex, undoManager);
  748. }
  749. //==============================================================================
  750. void ValueTree::createListOfChildren (OwnedArray<ValueTree>& list) const
  751. {
  752. jassert (object != nullptr);
  753. for (int i = 0; i < object->children.size(); ++i)
  754. list.add (new ValueTree (object->children.getObjectPointerUnchecked(i)));
  755. }
  756. void ValueTree::reorderChildren (const OwnedArray<ValueTree>& newOrder, UndoManager* undoManager)
  757. {
  758. jassert (object != nullptr);
  759. object->reorderChildren (newOrder, undoManager);
  760. }
  761. //==============================================================================
  762. void ValueTree::addListener (Listener* listener)
  763. {
  764. if (listener != nullptr)
  765. {
  766. if (listeners.size() == 0 && object != nullptr)
  767. object->valueTreesWithListeners.add (this);
  768. listeners.add (listener);
  769. }
  770. }
  771. void ValueTree::removeListener (Listener* listener)
  772. {
  773. listeners.remove (listener);
  774. if (listeners.size() == 0 && object != nullptr)
  775. object->valueTreesWithListeners.removeValue (this);
  776. }
  777. void ValueTree::sendPropertyChangeMessage (const Identifier& property)
  778. {
  779. if (object != nullptr)
  780. object->sendPropertyChangeMessage (property);
  781. }
  782. //==============================================================================
  783. XmlElement* ValueTree::createXml() const
  784. {
  785. return object != nullptr ? object->createXml() : nullptr;
  786. }
  787. ValueTree ValueTree::fromXml (const XmlElement& xml)
  788. {
  789. ValueTree v (xml.getTagName());
  790. v.object->properties.setFromXmlAttributes (xml);
  791. forEachXmlChildElement (xml, e)
  792. v.addChild (fromXml (*e), -1, nullptr);
  793. return v;
  794. }
  795. //==============================================================================
  796. void ValueTree::writeToStream (OutputStream& output)
  797. {
  798. SharedObject::writeObjectToStream (output, object);
  799. }
  800. ValueTree ValueTree::readFromStream (InputStream& input)
  801. {
  802. const String type (input.readString());
  803. if (type.isEmpty())
  804. return ValueTree::invalid;
  805. ValueTree v (type);
  806. const int numProps = input.readCompressedInt();
  807. if (numProps < 0)
  808. {
  809. jassertfalse; // trying to read corrupted data!
  810. return v;
  811. }
  812. int i;
  813. for (i = 0; i < numProps; ++i)
  814. {
  815. const String name (input.readString());
  816. jassert (name.isNotEmpty());
  817. const var value (var::readFromStream (input));
  818. v.object->properties.set (name, value);
  819. }
  820. const int numChildren = input.readCompressedInt();
  821. for (i = 0; i < numChildren; ++i)
  822. {
  823. ValueTree child (readFromStream (input));
  824. v.object->children.add (child.object);
  825. child.object->parent = v.object;
  826. }
  827. return v;
  828. }
  829. ValueTree ValueTree::readFromData (const void* const data, const size_t numBytes)
  830. {
  831. MemoryInputStream in (data, numBytes, false);
  832. return readFromStream (in);
  833. }
  834. //==============================================================================
  835. #if JUCE_UNIT_TESTS
  836. class ValueTreeTests : public UnitTest
  837. {
  838. public:
  839. ValueTreeTests() : UnitTest ("ValueTrees") {}
  840. static String createRandomIdentifier()
  841. {
  842. char buffer[50] = { 0 };
  843. const char chars[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_-:";
  844. Random r;
  845. for (int i = 1 + r.nextInt (numElementsInArray (buffer) - 2); --i >= 0;)
  846. buffer[i] = chars [r.nextInt (sizeof (chars) - 1)];
  847. return CharPointer_ASCII (buffer);
  848. }
  849. static String createRandomWideCharString()
  850. {
  851. juce_wchar buffer[50] = { 0 };
  852. Random r;
  853. for (int i = r.nextInt (numElementsInArray (buffer) - 1); --i >= 0;)
  854. {
  855. if (r.nextBool())
  856. {
  857. do
  858. {
  859. buffer[i] = (juce_wchar) (1 + r.nextInt (0x10ffff - 1));
  860. }
  861. while (! CharPointer_UTF16::canRepresent (buffer[i]));
  862. }
  863. else
  864. buffer[i] = (juce_wchar) (1 + r.nextInt (0x7e));
  865. }
  866. return CharPointer_UTF32 (buffer);
  867. }
  868. static ValueTree createRandomTree (UndoManager* undoManager, int depth)
  869. {
  870. Random r;
  871. ValueTree v (createRandomIdentifier());
  872. for (int i = r.nextInt (10); --i >= 0;)
  873. {
  874. switch (r.nextInt (5))
  875. {
  876. case 0: v.setProperty (createRandomIdentifier(), createRandomWideCharString(), undoManager); break;
  877. case 1: v.setProperty (createRandomIdentifier(), r.nextInt(), undoManager); break;
  878. case 2: if (depth < 5) v.addChild (createRandomTree (undoManager, depth + 1), r.nextInt (v.getNumChildren() + 1), undoManager); break;
  879. case 3: v.setProperty (createRandomIdentifier(), r.nextBool(), undoManager); break;
  880. case 4: v.setProperty (createRandomIdentifier(), r.nextDouble(), undoManager); break;
  881. default: break;
  882. }
  883. }
  884. return v;
  885. }
  886. void runTest()
  887. {
  888. beginTest ("ValueTree");
  889. for (int i = 10; --i >= 0;)
  890. {
  891. MemoryOutputStream mo;
  892. ValueTree v1 (createRandomTree (nullptr, 0));
  893. v1.writeToStream (mo);
  894. MemoryInputStream mi (mo.getData(), mo.getDataSize(), false);
  895. ValueTree v2 = ValueTree::readFromStream (mi);
  896. expect (v1.isEquivalentTo (v2));
  897. ScopedPointer <XmlElement> xml1 (v1.createXml());
  898. ScopedPointer <XmlElement> xml2 (v2.createCopy().createXml());
  899. expect (xml1->isEquivalentTo (xml2, false));
  900. ValueTree v4 = v2.createCopy();
  901. expect (v1.isEquivalentTo (v4));
  902. }
  903. }
  904. };
  905. static ValueTreeTests valueTreeTests;
  906. #endif
  907. END_JUCE_NAMESPACE