constraint.h 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536
  1. #pragma once
  2. #include <functional>
  3. #include <map>
  4. #include <memory>
  5. #include <set>
  6. #include <string_view>
  7. #include <unordered_map>
  8. #include <unordered_set>
  9. #include <jvalidate/constraint/array_constraint.h>
  10. #include <jvalidate/constraint/general_constraint.h>
  11. #include <jvalidate/constraint/number_constraint.h>
  12. #include <jvalidate/constraint/object_constraint.h>
  13. #include <jvalidate/constraint/string_constraint.h>
  14. #include <jvalidate/detail/expect.h>
  15. #include <jvalidate/detail/parser_context.h>
  16. #include <jvalidate/enum.h>
  17. #include <jvalidate/forward.h>
  18. namespace jvalidate {
  19. template <Adapter A> class ConstraintFactory {
  20. public:
  21. using pConstraint = std::unique_ptr<constraint::Constraint>;
  22. using Object = decltype(std::declval<A>().as_object());
  23. using MakeConstraint = std::function<pConstraint(detail::ParserContext<A> const &)>;
  24. template <typename V> using Versioned = std::map<schema::Version, V, std::greater<>>;
  25. template <typename V> using Keywords = std::unordered_map<std::string_view, V>;
  26. private:
  27. using Self = ConstraintFactory<A>;
  28. private:
  29. Keywords<MakeConstraint> constraints_{
  30. {"additionalProperties", &Self::additionalProperties},
  31. {"enum", &Self::isInEnumuration},
  32. {"maxItems", &Self::maxItems},
  33. {"maxLength", &Self::maxLength},
  34. {"maximum", &Self::maximum},
  35. {"minItems", &Self::minItems},
  36. {"minLength", &Self::minLength},
  37. {"minimum", &Self::minimum},
  38. {"pattern", &Self::pattern},
  39. {"patternProperties", &Self::patternProperties},
  40. {"properties", &Self::properties},
  41. {"type", &Self::type},
  42. {"uniqueItems", &Self::uniqueItems},
  43. };
  44. Keywords<Versioned<MakeConstraint>> versioned_constraints_{
  45. {"additionalItems",
  46. {{schema::Version::Draft04, &Self::additionalItems},
  47. {schema::Version::Draft2020_12, nullptr}}},
  48. {"allOf", {{schema::Version::Draft04, &Self::allOf}}},
  49. {"anyOf", {{schema::Version::Draft04, &Self::anyOf}}},
  50. {"const", {{schema::Version::Draft06, &Self::isConstant}}},
  51. {"contains", {{schema::Version::Draft06, &Self::contains}}},
  52. {"dependencies",
  53. {{schema::Version::Draft04, &Self::dependencies}, {schema::Version::Draft2019_09, nullptr}}},
  54. {"dependentRequired", {{schema::Version::Draft2019_09, &Self::dependentRequired}}},
  55. {"dependentSchemas", {{schema::Version::Draft2019_09, &Self::dependentSchemas}}},
  56. {"divisibleBy",
  57. {{schema::Version::Draft04, &Self::multipleOf}, {schema::Version::Draft04, nullptr}}},
  58. {"exclusiveMaximum", {{schema::Version::Draft06, &Self::exclusiveMaximum}}},
  59. {"exclusiveMinimum", {{schema::Version::Draft06, &Self::exclusiveMinimum}}},
  60. {"format",
  61. {{schema::Version::Draft04, &Self::warnUnimplemented},
  62. {schema::Version::Draft2020_12, nullptr}}},
  63. {"format-assertion", {{schema::Version::Draft2020_12, &Self::fatalUnimplemented}}},
  64. {"if", {{schema::Version::Draft07, &Self::ifThenElse}}},
  65. {"items",
  66. {{schema::Version::Draft04, &Self::itemsTupleOrVector},
  67. {schema::Version::Draft2020_12, &Self::additionalItems}}},
  68. {"maxProperties", {{schema::Version::Draft04, &Self::maxProperties}}},
  69. {"minProperties", {{schema::Version::Draft04, &Self::minProperties}}},
  70. {"multipleOf", {{schema::Version::Draft04, &Self::multipleOf}}},
  71. {"not", {{schema::Version::Draft04, &Self::isNot}}},
  72. {"oneOf", {{schema::Version::Draft04, &Self::oneOf}}},
  73. {"prefixItems", {{schema::Version::Draft2020_12, &Self::prefixItems}}},
  74. {"propertyNames", {{schema::Version::Draft06, &Self::propertyNames}}},
  75. {"required", {{schema::Version::Draft04, &Self::required}}},
  76. {"unevaluatedItems", {{schema::Version::Draft2019_09, &Self::unevaluatedItems}}},
  77. {"unevaluatedProperties", {{schema::Version::Draft2019_09, &Self::unevaluatedProperties}}},
  78. };
  79. Keywords<Versioned<std::set<schema::Wraps>>> keywords_{
  80. {"$defs", {{schema::Version::Draft2019_09, {schema::Wraps::Object}}}},
  81. {"additionalItems",
  82. {{schema::Version::Draft04, {schema::Wraps::Schema}}, {schema::Version::Draft2020_12, {}}}},
  83. {"additionalProperties", {{schema::Version::Draft04, {schema::Wraps::Schema}}}},
  84. {"allOf", {{schema::Version::Draft04, {schema::Wraps::Array}}}},
  85. {"anyOf", {{schema::Version::Draft04, {schema::Wraps::Array}}}},
  86. {"definitions",
  87. {{schema::Version::Draft04, {schema::Wraps::Object}}, {schema::Version::Draft2019_09, {}}}},
  88. {"dependencies",
  89. {{schema::Version::Draft04, {schema::Wraps::Object}}, {schema::Version::Draft2019_09, {}}}},
  90. {"dependentSchemas", {{schema::Version::Draft2019_09, {schema::Wraps::Object}}}},
  91. {"else", {{schema::Version::Draft04, {schema::Wraps::Schema}}}},
  92. {"if", {{schema::Version::Draft04, {schema::Wraps::Schema}}}},
  93. {"items",
  94. {{schema::Version::Draft04, {schema::Wraps::Array, schema::Wraps::Schema}},
  95. {schema::Version::Draft2020_12, {schema::Wraps::Schema}}}},
  96. {"not", {{schema::Version::Draft04, {schema::Wraps::Schema}}}},
  97. {"oneOf", {{schema::Version::Draft04, {schema::Wraps::Array}}}},
  98. {"patternProperties", {{schema::Version::Draft04, {schema::Wraps::Object}}}},
  99. {"prefixItems", {{schema::Version::Draft2020_12, {schema::Wraps::Array}}}},
  100. {"properties", {{schema::Version::Draft04, {schema::Wraps::Object}}}},
  101. {"then", {{schema::Version::Draft04, {schema::Wraps::Schema}}}},
  102. {"unevaluatedItems", {{schema::Version::Draft2020_12, {schema::Wraps::Schema}}}},
  103. {"unevaluatedProperties", {{schema::Version::Draft2020_12, {schema::Wraps::Schema}}}},
  104. };
  105. public:
  106. ConstraintFactory() = default;
  107. explicit ConstraintFactory(
  108. Keywords<MakeConstraint> const & user_keywords,
  109. Keywords<Versioned<MakeConstraint>> const & user_versioned_keywords = {}) {
  110. constraints_.insert(constraints_.end(), user_keywords.begin(), user_keywords.end());
  111. versioned_constraints_.insert(versioned_constraints_.end(), user_versioned_keywords.begin(),
  112. user_versioned_keywords.end());
  113. }
  114. bool is_post_constraint(std::string_view key) const {
  115. return key == "unevaluatedItems" || key == "unevaluatedProperties";
  116. }
  117. Keywords<std::set<schema::Wraps>> keywords(schema::Version version) const {
  118. Keywords<std::set<schema::Wraps>> rval;
  119. for (auto const & [key, versions] : keywords_) {
  120. if (auto it = versions.lower_bound(version); it != versions.end()) {
  121. rval.emplace(key, it->second);
  122. }
  123. }
  124. return rval;
  125. }
  126. MakeConstraint operator()(std::string_view key, schema::Version version) const {
  127. if (auto it = constraints_.find(key); it != constraints_.end()) {
  128. return it->second;
  129. }
  130. if (auto it = versioned_constraints_.find(key); it != versioned_constraints_.end()) {
  131. if (auto vit = it->second.lower_bound(version); vit != it->second.end()) {
  132. return vit->second;
  133. }
  134. }
  135. return nullptr;
  136. }
  137. // SECTION: Untyped Constraints
  138. static pConstraint warnUnimplemented(detail::ParserContext<A> const & context) {
  139. std::cerr << "Unimplemented constraint " << context.where << "\n";
  140. return nullptr;
  141. }
  142. static pConstraint fatalUnimplemented(detail::ParserContext<A> const & context) {
  143. JVALIDATE_THROW(std::runtime_error, "Unimplemented constraint " << context.where);
  144. }
  145. static auto type(detail::ParserContext<A> const & context) {
  146. static std::unordered_map<std::string_view, adapter::Type> const s_type_names{
  147. {"null", adapter::Type::Null}, {"boolean", adapter::Type::Boolean},
  148. {"integer", adapter::Type::Integer}, {"number", adapter::Type::Number},
  149. {"string", adapter::Type::String}, {"array", adapter::Type::Array},
  150. {"object", adapter::Type::Object},
  151. };
  152. auto to_type = [](std::string_view type) {
  153. EXPECT_M(s_type_names.contains(type), "Unknown type " << type);
  154. return s_type_names.at(type);
  155. };
  156. adapter::Type const type = context.schema.type();
  157. if (type == adapter::Type::String) {
  158. return std::make_unique<constraint::TypeConstraint>(to_type(context.schema.as_string()));
  159. }
  160. EXPECT(type == adapter::Type::Array);
  161. std::set<adapter::Type> types;
  162. for (auto subschema : context.schema.as_array()) {
  163. types.insert(to_type(subschema.as_string()));
  164. }
  165. return std::make_unique<constraint::TypeConstraint>(types);
  166. }
  167. static pConstraint ifThenElse(detail::ParserContext<A> const & context) {
  168. schema::Node const * then_ = context.fixed_schema(true);
  169. if (context.parent->contains("then")) {
  170. then_ = context.neighbor("then").node();
  171. }
  172. schema::Node const * else_ = context.fixed_schema(true);
  173. if (context.parent->contains("else")) {
  174. else_ = context.neighbor("else").node();
  175. }
  176. return std::make_unique<constraint::ConditionalConstraint>(context.node(), then_, else_);
  177. }
  178. static auto isInEnumuration(detail::ParserContext<A> const & context) {
  179. EXPECT(context.schema.type() == adapter::Type::Array);
  180. std::vector<std::unique_ptr<adapter::Const const>> rval;
  181. for (auto subschema : context.schema.as_array()) {
  182. rval.push_back(subschema.freeze());
  183. }
  184. return std::make_unique<constraint::EnumConstraint>(std::move(rval));
  185. }
  186. static auto isConstant(detail::ParserContext<A> const & context) {
  187. return std::make_unique<constraint::EnumConstraint>(context.schema.freeze());
  188. }
  189. static auto allOf(detail::ParserContext<A> const & context) {
  190. EXPECT(context.schema.type() == adapter::Type::Array);
  191. std::vector<schema::Node const *> rval;
  192. size_t index = 0;
  193. for (auto subschema : context.schema.as_array()) {
  194. rval.push_back(context.child(subschema, index).node());
  195. ++index;
  196. }
  197. return std::make_unique<constraint::AllOfConstraint>(rval);
  198. }
  199. static auto anyOf(detail::ParserContext<A> const & context) {
  200. EXPECT(context.schema.type() == adapter::Type::Array);
  201. std::vector<schema::Node const *> rval;
  202. size_t index = 0;
  203. for (auto subschema : context.schema.as_array()) {
  204. rval.push_back(context.child(subschema, index).node());
  205. ++index;
  206. }
  207. return std::make_unique<constraint::AnyOfConstraint>(rval);
  208. }
  209. static auto oneOf(detail::ParserContext<A> const & context) {
  210. EXPECT(context.schema.type() == adapter::Type::Array);
  211. std::vector<schema::Node const *> rval;
  212. size_t index = 0;
  213. for (auto subschema : context.schema.as_array()) {
  214. rval.push_back(context.child(subschema, index).node());
  215. ++index;
  216. }
  217. return std::make_unique<constraint::OneOfConstraint>(rval);
  218. }
  219. static auto isNot(detail::ParserContext<A> const & context) {
  220. return std::make_unique<constraint::NotConstraint>(context.node());
  221. }
  222. // SECTION: Numeric Constraints
  223. static auto minimum(detail::ParserContext<A> const & context) {
  224. double value = context.schema.as_number();
  225. if (context.version < schema::Version::Draft06 &&
  226. context.parent->contains("exclusiveMinimum")) {
  227. auto exclusive = (*context.parent)["exclusiveMinimum"];
  228. EXPECT(exclusive.type() == adapter::Type::Boolean);
  229. return std::make_unique<constraint::MinimumConstraint>(value, exclusive.as_boolean());
  230. }
  231. return std::make_unique<constraint::MinimumConstraint>(value, false);
  232. }
  233. static pConstraint exclusiveMinimum(detail::ParserContext<A> const & context) {
  234. double value = context.schema.as_number();
  235. return std::make_unique<constraint::MinimumConstraint>(value, true);
  236. }
  237. static auto maximum(detail::ParserContext<A> const & context) {
  238. double value = context.schema.as_number();
  239. if (context.version < schema::Version::Draft06 &&
  240. context.parent->contains("exclusiveMaximum")) {
  241. auto exclusive = (*context.parent)["exclusiveMaximum"];
  242. EXPECT(exclusive.type() == adapter::Type::Boolean);
  243. return std::make_unique<constraint::MaximumConstraint>(value, exclusive.as_boolean());
  244. }
  245. return std::make_unique<constraint::MaximumConstraint>(value, false);
  246. }
  247. static pConstraint exclusiveMaximum(detail::ParserContext<A> const & context) {
  248. double value = context.schema.as_number();
  249. return std::make_unique<constraint::MaximumConstraint>(value, true);
  250. }
  251. static auto multipleOf(detail::ParserContext<A> const & context) {
  252. double value = context.schema.as_number();
  253. return std::make_unique<constraint::MultipleOfConstraint>(value);
  254. }
  255. // SECTION: String Constraints
  256. static auto minLength(detail::ParserContext<A> const & context) {
  257. EXPECT(context.schema.type() == adapter::Type::Integer ||
  258. context.schema.type() == adapter::Type::Number);
  259. return std::make_unique<constraint::MinLengthConstraint>(context.schema.as_integer());
  260. }
  261. static auto maxLength(detail::ParserContext<A> const & context) {
  262. EXPECT(context.schema.type() == adapter::Type::Integer ||
  263. context.schema.type() == adapter::Type::Number);
  264. return std::make_unique<constraint::MaxLengthConstraint>(context.schema.as_integer());
  265. }
  266. static auto pattern(detail::ParserContext<A> const & context) {
  267. return std::make_unique<constraint::PatternConstraint>(context.schema.as_string());
  268. }
  269. // SECTION: Array Constraints
  270. static auto contains(detail::ParserContext<A> const & context) {
  271. if (context.version < schema::Version::Draft2019_09) {
  272. return std::make_unique<constraint::ContainsConstraint>(context.node());
  273. }
  274. std::optional<size_t> maximum;
  275. std::optional<size_t> minimum;
  276. if (context.parent->contains("maxContains")) {
  277. maximum = (*context.parent)["maxContains"].as_integer();
  278. }
  279. if (context.parent->contains("minContains")) {
  280. minimum = (*context.parent)["minContains"].as_integer();
  281. }
  282. return std::make_unique<constraint::ContainsConstraint>(context.node(), minimum, maximum);
  283. }
  284. static auto minItems(detail::ParserContext<A> const & context) {
  285. EXPECT(context.schema.type() == adapter::Type::Integer ||
  286. context.schema.type() == adapter::Type::Number);
  287. return std::make_unique<constraint::MinItemsConstraint>(context.schema.as_integer());
  288. }
  289. static auto maxItems(detail::ParserContext<A> const & context) {
  290. EXPECT(context.schema.type() == adapter::Type::Integer ||
  291. context.schema.type() == adapter::Type::Number);
  292. return std::make_unique<constraint::MaxItemsConstraint>(context.schema.as_integer());
  293. }
  294. static auto prefixItems(detail::ParserContext<A> const & context) {
  295. EXPECT(context.schema.type() == adapter::Type::Array);
  296. std::vector<schema::Node const *> rval;
  297. size_t index = 0;
  298. for (auto subschema : context.schema.as_array()) {
  299. rval.push_back(context.child(subschema, index).node());
  300. ++index;
  301. }
  302. return std::make_unique<constraint::TupleConstraint>(rval);
  303. }
  304. static auto additionalItemsAfter(detail::ParserContext<A> const & context, size_t n) {
  305. using C = constraint::AdditionalItemsConstraint;
  306. if (context.version < schema::Version::Draft06 &&
  307. context.schema.type() == adapter::Type::Boolean) {
  308. return std::make_unique<C>(context.always(), n);
  309. }
  310. return std::make_unique<C>(context.node(), n);
  311. }
  312. static pConstraint additionalItems(detail::ParserContext<A> const & context) {
  313. std::string const prefix =
  314. context.version >= schema::Version::Draft2020_12 ? "prefixItems" : "items";
  315. Object const & parent = *context.parent;
  316. // Before Draft 2020-12, the "items" could be either a subschema or a tuple.
  317. // When not provided, we therefore treat it as an "accept-all" schema, and
  318. // thus will never have additionalItems to process. Similarly - if it is an
  319. // Object, then it must act on all items.
  320. if (context.version < schema::Version::Draft2020_12 &&
  321. (not parent.contains(prefix) || parent[prefix].type() == adapter::Type::Object)) {
  322. return nullptr;
  323. }
  324. return additionalItemsAfter(context, parent[prefix].array_size());
  325. }
  326. static pConstraint itemsTupleOrVector(detail::ParserContext<A> const & context) {
  327. if (context.schema.type() == adapter::Type::Array) {
  328. return prefixItems(context);
  329. }
  330. return additionalItemsAfter(context, 0);
  331. }
  332. static auto unevaluatedItems(detail::ParserContext<A> const & context) {
  333. return std::make_unique<constraint::UnevaluatedItemsConstraint>(context.node());
  334. }
  335. static pConstraint uniqueItems(detail::ParserContext<A> const & context) {
  336. EXPECT(context.schema.type() == adapter::Type::Boolean);
  337. if (not context.schema.as_boolean()) {
  338. return nullptr;
  339. }
  340. return std::make_unique<constraint::UniqueItemsConstraint>();
  341. }
  342. // SECTION: Object Constraints
  343. static auto required(detail::ParserContext<A> const & context) {
  344. EXPECT(context.schema.type() == adapter::Type::Array);
  345. std::unordered_set<std::string> rval;
  346. for (auto subschema : context.schema.as_array()) {
  347. EXPECT(subschema.type() == adapter::Type::String);
  348. rval.insert(subschema.as_string());
  349. }
  350. return std::make_unique<constraint::RequiredConstraint>(rval);
  351. }
  352. static auto minProperties(detail::ParserContext<A> const & context) {
  353. EXPECT(context.schema.type() == adapter::Type::Integer ||
  354. context.schema.type() == adapter::Type::Number);
  355. return std::make_unique<constraint::MinPropertiesConstraint>(context.schema.as_integer());
  356. }
  357. static auto maxProperties(detail::ParserContext<A> const & context) {
  358. EXPECT(context.schema.type() == adapter::Type::Integer ||
  359. context.schema.type() == adapter::Type::Number);
  360. return std::make_unique<constraint::MaxPropertiesConstraint>(context.schema.as_integer());
  361. }
  362. static auto patternProperties(detail::ParserContext<A> const & context) {
  363. EXPECT(context.schema.type() == adapter::Type::Object);
  364. std::vector<std::pair<std::string, schema::Node const *>> rval;
  365. for (auto [prop, subschema] : context.schema.as_object()) {
  366. rval.emplace_back(prop, context.child(subschema, prop).node());
  367. }
  368. return std::make_unique<constraint::PatternPropertiesConstraint>(rval);
  369. }
  370. static auto properties(detail::ParserContext<A> const & context) {
  371. EXPECT(context.schema.type() == adapter::Type::Object);
  372. std::map<std::string, schema::Node const *> rval;
  373. for (auto [prop, subschema] : context.schema.as_object()) {
  374. rval.emplace(prop, context.child(subschema, prop).node());
  375. }
  376. return std::make_unique<constraint::PropertiesConstraint>(rval);
  377. }
  378. static auto propertyNames(detail::ParserContext<A> const & context) {
  379. return std::make_unique<constraint::PropertyNamesConstraint>(context.node());
  380. }
  381. static auto unevaluatedProperties(detail::ParserContext<A> const & context) {
  382. return std::make_unique<constraint::UnevaluatedPropertiesConstraint>(context.node());
  383. }
  384. static auto additionalProperties(detail::ParserContext<A> const & context) {
  385. std::unordered_set<std::string> properties;
  386. std::vector<std::string> patterns;
  387. Object const & parent = *context.parent;
  388. if (parent.contains("properties")) {
  389. for (auto [key, _] : parent["properties"].as_object()) {
  390. properties.insert(key);
  391. }
  392. }
  393. if (parent.contains("patternProperties")) {
  394. for (auto [key, _] : parent["patternProperties"].as_object()) {
  395. patterns.push_back(key);
  396. }
  397. }
  398. using C = constraint::AdditionalPropertiesConstraint;
  399. if (context.version < schema::Version::Draft06 &&
  400. context.schema.type() == adapter::Type::Boolean) {
  401. return std::make_unique<C>(context.always(), properties, patterns);
  402. }
  403. return std::make_unique<C>(context.node(), properties, patterns);
  404. }
  405. static auto dependencies(detail::ParserContext<A> const & context) {
  406. EXPECT(context.schema.type() == adapter::Type::Object);
  407. std::map<std::string, schema::Node const *> schemas;
  408. std::map<std::string, std::unordered_set<std::string>> required;
  409. for (auto [prop, subschema] : context.schema.as_object()) {
  410. if (subschema.type() == adapter::Type::Array) {
  411. for (auto key : subschema.as_array()) {
  412. EXPECT(key.type() == adapter::Type::String);
  413. required[prop].insert(key.as_string());
  414. }
  415. } else {
  416. schemas.emplace(prop, context.child(subschema, prop).node());
  417. }
  418. }
  419. return std::make_unique<constraint::DependenciesConstraint>(schemas, required);
  420. }
  421. static auto dependentSchemas(detail::ParserContext<A> const & context) {
  422. EXPECT(context.schema.type() == adapter::Type::Object);
  423. std::map<std::string, schema::Node const *> rval;
  424. for (auto [prop, subschema] : context.schema.as_object()) {
  425. rval.emplace(prop, context.child(subschema, prop).node());
  426. }
  427. return std::make_unique<constraint::DependenciesConstraint>(rval);
  428. }
  429. static auto dependentRequired(detail::ParserContext<A> const & context) {
  430. EXPECT(context.schema.type() == adapter::Type::Object);
  431. std::map<std::string, std::unordered_set<std::string>> rval;
  432. for (auto [prop, subschema] : context.schema.as_object()) {
  433. EXPECT(subschema.type() == adapter::Type::Array);
  434. for (auto key : subschema.as_array()) {
  435. EXPECT(key.type() == adapter::Type::String);
  436. rval[prop].insert(key.as_string());
  437. }
  438. }
  439. return std::make_unique<constraint::DependenciesConstraint>(rval);
  440. }
  441. };
  442. }