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.

1102 lines
35KB

  1. /*
  2. ==============================================================================
  3. This file is part of the JUCE library.
  4. Copyright (c) 2013 - Raw Material Software Ltd.
  5. Permission is granted to use this software under the terms of either:
  6. a) the GPL v2 (or any later version)
  7. b) the Affero GPL v3
  8. Details of these licenses can be found at: www.gnu.org/licenses
  9. JUCE is distributed in the hope that it will be useful, but WITHOUT ANY
  10. WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
  11. A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  12. ------------------------------------------------------------------------------
  13. To release a closed-source product which uses JUCE, commercial licenses are
  14. available: visit www.juce.com for more information.
  15. ==============================================================================
  16. */
  17. class ValueTree::SharedObject : public ReferenceCountedObject
  18. {
  19. public:
  20. typedef ReferenceCountedObjectPtr<SharedObject> Ptr;
  21. explicit SharedObject (const Identifier t) noexcept
  22. : type (t), parent (nullptr)
  23. {
  24. }
  25. SharedObject (const SharedObject& other)
  26. : ReferenceCountedObject(),
  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. if (SetPropertyAction* const next = dynamic_cast <SetPropertyAction*> (nextAction))
  407. if (next->target == target && next->name == name
  408. && ! (next->isAddingNewProperty || next->isDeletingProperty))
  409. return new SetPropertyAction (target, name, next->newValue, oldValue, false, false);
  410. }
  411. return nullptr;
  412. }
  413. private:
  414. const Ptr target;
  415. const Identifier name;
  416. const var newValue;
  417. var oldValue;
  418. const bool isAddingNewProperty : 1, isDeletingProperty : 1;
  419. JUCE_DECLARE_NON_COPYABLE (SetPropertyAction)
  420. };
  421. //==============================================================================
  422. class AddOrRemoveChildAction : public UndoableAction
  423. {
  424. public:
  425. AddOrRemoveChildAction (SharedObject* target_, const int childIndex_, SharedObject* newChild_)
  426. : target (target_),
  427. child (newChild_ != nullptr ? newChild_ : target_->children.getObjectPointer (childIndex_)),
  428. childIndex (childIndex_),
  429. isDeleting (newChild_ == nullptr)
  430. {
  431. jassert (child != nullptr);
  432. }
  433. bool perform()
  434. {
  435. if (isDeleting)
  436. target->removeChild (childIndex, nullptr);
  437. else
  438. target->addChild (child, childIndex, nullptr);
  439. return true;
  440. }
  441. bool undo()
  442. {
  443. if (isDeleting)
  444. {
  445. target->addChild (child, childIndex, nullptr);
  446. }
  447. else
  448. {
  449. // If you hit this, it seems that your object's state is getting confused - probably
  450. // because you've interleaved some undoable and non-undoable operations?
  451. jassert (childIndex < target->children.size());
  452. target->removeChild (childIndex, nullptr);
  453. }
  454. return true;
  455. }
  456. int getSizeInUnits()
  457. {
  458. return (int) sizeof (*this); //xxx should be more accurate
  459. }
  460. private:
  461. const Ptr target, child;
  462. const int childIndex;
  463. const bool isDeleting;
  464. JUCE_DECLARE_NON_COPYABLE (AddOrRemoveChildAction)
  465. };
  466. //==============================================================================
  467. class MoveChildAction : public UndoableAction
  468. {
  469. public:
  470. MoveChildAction (SharedObject* const parent_, const int startIndex_, const int endIndex_) noexcept
  471. : parent (parent_), startIndex (startIndex_), endIndex (endIndex_)
  472. {
  473. }
  474. bool perform()
  475. {
  476. parent->moveChild (startIndex, endIndex, nullptr);
  477. return true;
  478. }
  479. bool undo()
  480. {
  481. parent->moveChild (endIndex, startIndex, nullptr);
  482. return true;
  483. }
  484. int getSizeInUnits()
  485. {
  486. return (int) sizeof (*this); //xxx should be more accurate
  487. }
  488. UndoableAction* createCoalescedAction (UndoableAction* nextAction)
  489. {
  490. if (MoveChildAction* next = dynamic_cast <MoveChildAction*> (nextAction))
  491. if (next->parent == parent && next->startIndex == endIndex)
  492. return new MoveChildAction (parent, startIndex, next->endIndex);
  493. return nullptr;
  494. }
  495. private:
  496. const Ptr parent;
  497. const int startIndex, endIndex;
  498. JUCE_DECLARE_NON_COPYABLE (MoveChildAction)
  499. };
  500. //==============================================================================
  501. const Identifier type;
  502. NamedValueSet properties;
  503. ReferenceCountedArray<SharedObject> children;
  504. SortedSet<ValueTree*> valueTreesWithListeners;
  505. SharedObject* parent;
  506. private:
  507. SharedObject& operator= (const SharedObject&);
  508. JUCE_LEAK_DETECTOR (SharedObject)
  509. };
  510. //==============================================================================
  511. ValueTree::ValueTree() noexcept
  512. {
  513. }
  514. const ValueTree ValueTree::invalid;
  515. ValueTree::ValueTree (const Identifier type_)
  516. : object (new ValueTree::SharedObject (type_))
  517. {
  518. jassert (type_.toString().isNotEmpty()); // All objects should be given a sensible type name!
  519. }
  520. ValueTree::ValueTree (SharedObject* const object_)
  521. : object (object_)
  522. {
  523. }
  524. ValueTree::ValueTree (const ValueTree& other)
  525. : object (other.object)
  526. {
  527. }
  528. ValueTree& ValueTree::operator= (const ValueTree& other)
  529. {
  530. if (listeners.size() > 0)
  531. {
  532. if (object != nullptr)
  533. object->valueTreesWithListeners.removeValue (this);
  534. if (other.object != nullptr)
  535. other.object->valueTreesWithListeners.add (this);
  536. }
  537. object = other.object;
  538. listeners.call (&ValueTree::Listener::valueTreeRedirected, *this);
  539. return *this;
  540. }
  541. #if JUCE_COMPILER_SUPPORTS_MOVE_SEMANTICS
  542. ValueTree::ValueTree (ValueTree&& other) noexcept
  543. : object (static_cast <SharedObject::Ptr&&> (other.object))
  544. {
  545. }
  546. #endif
  547. ValueTree::~ValueTree()
  548. {
  549. if (listeners.size() > 0 && object != nullptr)
  550. object->valueTreesWithListeners.removeValue (this);
  551. }
  552. bool ValueTree::operator== (const ValueTree& other) const noexcept
  553. {
  554. return object == other.object;
  555. }
  556. bool ValueTree::operator!= (const ValueTree& other) const noexcept
  557. {
  558. return object != other.object;
  559. }
  560. bool ValueTree::isEquivalentTo (const ValueTree& other) const
  561. {
  562. return object == other.object
  563. || (object != nullptr && other.object != nullptr
  564. && object->isEquivalentTo (*other.object));
  565. }
  566. ValueTree ValueTree::createCopy() const
  567. {
  568. return ValueTree (createCopyIfNotNull (object.get()));
  569. }
  570. bool ValueTree::hasType (const Identifier typeName) const
  571. {
  572. return object != nullptr && object->type == typeName;
  573. }
  574. Identifier ValueTree::getType() const
  575. {
  576. return object != nullptr ? object->type : Identifier();
  577. }
  578. ValueTree ValueTree::getParent() const
  579. {
  580. return ValueTree (object != nullptr ? object->parent
  581. : static_cast <SharedObject*> (nullptr));
  582. }
  583. ValueTree ValueTree::getSibling (const int delta) const
  584. {
  585. if (object == nullptr || object->parent == nullptr)
  586. return invalid;
  587. const int index = object->parent->indexOf (*this) + delta;
  588. return ValueTree (object->parent->children.getObjectPointer (index));
  589. }
  590. const var& ValueTree::operator[] (const Identifier name) const
  591. {
  592. return object == nullptr ? var::null : object->getProperty (name);
  593. }
  594. const var& ValueTree::getProperty (const Identifier name) const
  595. {
  596. return object == nullptr ? var::null : object->getProperty (name);
  597. }
  598. var ValueTree::getProperty (const Identifier name, const var& defaultReturnValue) const
  599. {
  600. return object == nullptr ? defaultReturnValue
  601. : object->getProperty (name, defaultReturnValue);
  602. }
  603. ValueTree& ValueTree::setProperty (const Identifier name, const var& newValue,
  604. UndoManager* const undoManager)
  605. {
  606. jassert (name.toString().isNotEmpty()); // Must have a valid property name!
  607. jassert (object != nullptr); // Trying to add a property to a null ValueTree will fail!
  608. if (object != nullptr)
  609. object->setProperty (name, newValue, undoManager);
  610. return *this;
  611. }
  612. bool ValueTree::hasProperty (const Identifier name) const
  613. {
  614. return object != nullptr && object->hasProperty (name);
  615. }
  616. void ValueTree::removeProperty (const Identifier name, UndoManager* const undoManager)
  617. {
  618. if (object != nullptr)
  619. object->removeProperty (name, undoManager);
  620. }
  621. void ValueTree::removeAllProperties (UndoManager* const undoManager)
  622. {
  623. if (object != nullptr)
  624. object->removeAllProperties (undoManager);
  625. }
  626. int ValueTree::getNumProperties() const
  627. {
  628. return object == nullptr ? 0 : object->properties.size();
  629. }
  630. Identifier ValueTree::getPropertyName (const int index) const
  631. {
  632. return object == nullptr ? Identifier()
  633. : object->properties.getName (index);
  634. }
  635. void ValueTree::copyPropertiesFrom (const ValueTree& source, UndoManager* const undoManager)
  636. {
  637. jassert (object != nullptr || source.object == nullptr); // Trying to add properties to a null ValueTree will fail!
  638. if (source.object == nullptr)
  639. removeAllProperties (undoManager);
  640. else if (object != nullptr)
  641. object->copyPropertiesFrom (*(source.object), undoManager);
  642. }
  643. //==============================================================================
  644. class ValueTreePropertyValueSource : public Value::ValueSource,
  645. private ValueTree::Listener
  646. {
  647. public:
  648. ValueTreePropertyValueSource (const ValueTree& vt, const Identifier prop, UndoManager* um)
  649. : tree (vt), property (prop), undoManager (um)
  650. {
  651. tree.addListener (this);
  652. }
  653. ~ValueTreePropertyValueSource()
  654. {
  655. tree.removeListener (this);
  656. }
  657. var getValue() const { return tree [property]; }
  658. void setValue (const var& newValue) { tree.setProperty (property, newValue, undoManager); }
  659. private:
  660. ValueTree tree;
  661. const Identifier property;
  662. UndoManager* const undoManager;
  663. void valueTreePropertyChanged (ValueTree& treeWhosePropertyHasChanged,
  664. const Identifier& changedProperty) override
  665. {
  666. if (tree == treeWhosePropertyHasChanged && property == changedProperty)
  667. sendChangeMessage (false);
  668. }
  669. void valueTreeChildAdded (ValueTree&, ValueTree&) override {}
  670. void valueTreeChildRemoved (ValueTree&, ValueTree&) override {}
  671. void valueTreeChildOrderChanged (ValueTree&) override {}
  672. void valueTreeParentChanged (ValueTree&) override {}
  673. JUCE_DECLARE_NON_COPYABLE_WITH_LEAK_DETECTOR (ValueTreePropertyValueSource)
  674. };
  675. Value ValueTree::getPropertyAsValue (const Identifier name, UndoManager* const undoManager)
  676. {
  677. return Value (new ValueTreePropertyValueSource (*this, name, undoManager));
  678. }
  679. //==============================================================================
  680. int ValueTree::getNumChildren() const
  681. {
  682. return object == nullptr ? 0 : object->children.size();
  683. }
  684. ValueTree ValueTree::getChild (int index) const
  685. {
  686. return ValueTree (object != nullptr ? object->children.getObjectPointer (index)
  687. : static_cast <SharedObject*> (nullptr));
  688. }
  689. ValueTree ValueTree::getChildWithName (const Identifier type) const
  690. {
  691. return object != nullptr ? object->getChildWithName (type) : ValueTree::invalid;
  692. }
  693. ValueTree ValueTree::getOrCreateChildWithName (const Identifier type, UndoManager* undoManager)
  694. {
  695. return object != nullptr ? object->getOrCreateChildWithName (type, undoManager) : ValueTree::invalid;
  696. }
  697. ValueTree ValueTree::getChildWithProperty (const Identifier propertyName, const var& propertyValue) const
  698. {
  699. return object != nullptr ? object->getChildWithProperty (propertyName, propertyValue) : ValueTree::invalid;
  700. }
  701. bool ValueTree::isAChildOf (const ValueTree& possibleParent) const
  702. {
  703. return object != nullptr && object->isAChildOf (possibleParent.object);
  704. }
  705. int ValueTree::indexOf (const ValueTree& child) const
  706. {
  707. return object != nullptr ? object->indexOf (child) : -1;
  708. }
  709. void ValueTree::addChild (const ValueTree& child, int index, UndoManager* const undoManager)
  710. {
  711. jassert (object != nullptr); // Trying to add a child to a null ValueTree!
  712. if (object != nullptr)
  713. object->addChild (child.object, index, undoManager);
  714. }
  715. void ValueTree::removeChild (const int childIndex, UndoManager* const undoManager)
  716. {
  717. if (object != nullptr)
  718. object->removeChild (childIndex, undoManager);
  719. }
  720. void ValueTree::removeChild (const ValueTree& child, UndoManager* const undoManager)
  721. {
  722. if (object != nullptr)
  723. object->removeChild (object->children.indexOf (child.object), undoManager);
  724. }
  725. void ValueTree::removeAllChildren (UndoManager* const undoManager)
  726. {
  727. if (object != nullptr)
  728. object->removeAllChildren (undoManager);
  729. }
  730. void ValueTree::moveChild (int currentIndex, int newIndex, UndoManager* undoManager)
  731. {
  732. if (object != nullptr)
  733. object->moveChild (currentIndex, newIndex, undoManager);
  734. }
  735. //==============================================================================
  736. void ValueTree::createListOfChildren (OwnedArray<ValueTree>& list) const
  737. {
  738. jassert (object != nullptr);
  739. for (int i = 0; i < object->children.size(); ++i)
  740. list.add (new ValueTree (object->children.getObjectPointerUnchecked(i)));
  741. }
  742. void ValueTree::reorderChildren (const OwnedArray<ValueTree>& newOrder, UndoManager* undoManager)
  743. {
  744. jassert (object != nullptr);
  745. object->reorderChildren (newOrder, undoManager);
  746. }
  747. //==============================================================================
  748. void ValueTree::addListener (Listener* listener)
  749. {
  750. if (listener != nullptr)
  751. {
  752. if (listeners.size() == 0 && object != nullptr)
  753. object->valueTreesWithListeners.add (this);
  754. listeners.add (listener);
  755. }
  756. }
  757. void ValueTree::removeListener (Listener* listener)
  758. {
  759. listeners.remove (listener);
  760. if (listeners.size() == 0 && object != nullptr)
  761. object->valueTreesWithListeners.removeValue (this);
  762. }
  763. void ValueTree::sendPropertyChangeMessage (const Identifier property)
  764. {
  765. if (object != nullptr)
  766. object->sendPropertyChangeMessage (property);
  767. }
  768. //==============================================================================
  769. XmlElement* ValueTree::createXml() const
  770. {
  771. return object != nullptr ? object->createXml() : nullptr;
  772. }
  773. ValueTree ValueTree::fromXml (const XmlElement& xml)
  774. {
  775. ValueTree v (xml.getTagName());
  776. v.object->properties.setFromXmlAttributes (xml);
  777. forEachXmlChildElement (xml, e)
  778. v.addChild (fromXml (*e), -1, nullptr);
  779. return v;
  780. }
  781. String ValueTree::toXmlString() const
  782. {
  783. const ScopedPointer<XmlElement> xml (createXml());
  784. return xml != nullptr ? xml->createDocument (String::empty) : String::empty;
  785. }
  786. //==============================================================================
  787. void ValueTree::writeToStream (OutputStream& output) const
  788. {
  789. SharedObject::writeObjectToStream (output, object);
  790. }
  791. ValueTree ValueTree::readFromStream (InputStream& input)
  792. {
  793. const String type (input.readString());
  794. if (type.isEmpty())
  795. return ValueTree::invalid;
  796. ValueTree v (type);
  797. const int numProps = input.readCompressedInt();
  798. if (numProps < 0)
  799. {
  800. jassertfalse; // trying to read corrupted data!
  801. return v;
  802. }
  803. for (int i = 0; i < numProps; ++i)
  804. {
  805. const String name (input.readString());
  806. jassert (name.isNotEmpty());
  807. const var value (var::readFromStream (input));
  808. v.object->properties.set (name, value);
  809. }
  810. const int numChildren = input.readCompressedInt();
  811. v.object->children.ensureStorageAllocated (numChildren);
  812. for (int i = 0; i < numChildren; ++i)
  813. {
  814. ValueTree child (readFromStream (input));
  815. v.object->children.add (child.object);
  816. child.object->parent = v.object;
  817. }
  818. return v;
  819. }
  820. ValueTree ValueTree::readFromData (const void* const data, const size_t numBytes)
  821. {
  822. MemoryInputStream in (data, numBytes, false);
  823. return readFromStream (in);
  824. }
  825. ValueTree ValueTree::readFromGZIPData (const void* const data, const size_t numBytes)
  826. {
  827. MemoryInputStream in (data, numBytes, false);
  828. GZIPDecompressorInputStream gzipStream (in);
  829. return readFromStream (gzipStream);
  830. }
  831. void ValueTree::Listener::valueTreeRedirected (ValueTree&) {}
  832. //==============================================================================
  833. #if JUCE_UNIT_TESTS
  834. class ValueTreeTests : public UnitTest
  835. {
  836. public:
  837. ValueTreeTests() : UnitTest ("ValueTrees") {}
  838. static String createRandomIdentifier (Random& r)
  839. {
  840. char buffer[50] = { 0 };
  841. const char chars[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_-:";
  842. for (int i = 1 + r.nextInt (numElementsInArray (buffer) - 2); --i >= 0;)
  843. buffer[i] = chars [r.nextInt (sizeof (chars) - 1)];
  844. return CharPointer_ASCII (buffer);
  845. }
  846. static String createRandomWideCharString (Random& r)
  847. {
  848. juce_wchar buffer[50] = { 0 };
  849. for (int i = r.nextInt (numElementsInArray (buffer) - 1); --i >= 0;)
  850. {
  851. if (r.nextBool())
  852. {
  853. do
  854. {
  855. buffer[i] = (juce_wchar) (1 + r.nextInt (0x10ffff - 1));
  856. }
  857. while (! CharPointer_UTF16::canRepresent (buffer[i]));
  858. }
  859. else
  860. buffer[i] = (juce_wchar) (1 + r.nextInt (0x7e));
  861. }
  862. return CharPointer_UTF32 (buffer);
  863. }
  864. static ValueTree createRandomTree (UndoManager* undoManager, int depth, Random& r)
  865. {
  866. ValueTree v (createRandomIdentifier (r));
  867. for (int i = r.nextInt (10); --i >= 0;)
  868. {
  869. switch (r.nextInt (5))
  870. {
  871. case 0: v.setProperty (createRandomIdentifier (r), createRandomWideCharString (r), undoManager); break;
  872. case 1: v.setProperty (createRandomIdentifier (r), r.nextInt(), undoManager); break;
  873. case 2: if (depth < 5) v.addChild (createRandomTree (undoManager, depth + 1, r), r.nextInt (v.getNumChildren() + 1), undoManager); break;
  874. case 3: v.setProperty (createRandomIdentifier (r), r.nextBool(), undoManager); break;
  875. case 4: v.setProperty (createRandomIdentifier (r), r.nextDouble(), undoManager); break;
  876. default: break;
  877. }
  878. }
  879. return v;
  880. }
  881. void runTest()
  882. {
  883. beginTest ("ValueTree");
  884. Random r = getRandom();
  885. for (int i = 10; --i >= 0;)
  886. {
  887. MemoryOutputStream mo;
  888. ValueTree v1 (createRandomTree (nullptr, 0, r));
  889. v1.writeToStream (mo);
  890. MemoryInputStream mi (mo.getData(), mo.getDataSize(), false);
  891. ValueTree v2 = ValueTree::readFromStream (mi);
  892. expect (v1.isEquivalentTo (v2));
  893. ScopedPointer <XmlElement> xml1 (v1.createXml());
  894. ScopedPointer <XmlElement> xml2 (v2.createCopy().createXml());
  895. expect (xml1->isEquivalentTo (xml2, false));
  896. ValueTree v4 = v2.createCopy();
  897. expect (v1.isEquivalentTo (v4));
  898. }
  899. }
  900. };
  901. static ValueTreeTests valueTreeTests;
  902. #endif