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