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
35KB

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