Browse Source

Doc++

pull/168/head
Vladimír Vondruš 3 years ago
parent
commit
4197f9379d
  1. 4
      src/Magnum/Text/AbstractShaper.h
  2. 2
      src/Magnum/Trade/SceneData.h

4
src/Magnum/Text/AbstractShaper.h

@ -293,7 +293,7 @@ class MAGNUM_TEXT_EXPORT AbstractShaper {
/** /**
* @brief Shape a text * @brief Shape a text
* @param text Text in UTF-8 * @param text Text in UTF-8
* @param features OpenType features to apply for the whole text or * @param features Typographic features to apply for the whole text or
* its subranges * its subranges
* *
* Expects that both @p begin and all @ref FeatureRange::begin() are * Expects that both @p begin and all @ref FeatureRange::begin() are
@ -327,7 +327,7 @@ class MAGNUM_TEXT_EXPORT AbstractShaper {
* @param text Text in UTF-8 * @param text Text in UTF-8
* @param begin Beginning byte in the input text * @param begin Beginning byte in the input text
* @param end (One byte after) the end byte in the input text * @param end (One byte after) the end byte in the input text
* @param features OpenType features to apply for the whole text or * @param features Typographic features to apply for the whole text or
* its subranges * its subranges
* *
* A variant of @ref shape(Containers::StringView, Containers::ArrayView<const FeatureRange>) * A variant of @ref shape(Containers::StringView, Containers::ArrayView<const FeatureRange>)

2
src/Magnum/Trade/SceneData.h

@ -2265,7 +2265,7 @@ class MAGNUM_TRADE_EXPORT SceneData {
* *
* If the field has @ref SceneFieldFlag::ImplicitMapping, the lookup is * If the field has @ref SceneFieldFlag::ImplicitMapping, the lookup is
* done in an @f$ \mathcal{O}(m) @f$ complexity with @f$ m @f$ being * done in an @f$ \mathcal{O}(m) @f$ complexity with @f$ m @f$ being
* the * field count. Otherwise, if the field has * the field count. Otherwise, if the field has
* @ref SceneFieldFlag::OrderedMapping, the lookup is done in an * @ref SceneFieldFlag::OrderedMapping, the lookup is done in an
* @f$ \mathcal{O}(m + \log{} n) @f$ complexity with @f$ m @f$ being * @f$ \mathcal{O}(m + \log{} n) @f$ complexity with @f$ m @f$ being
* the field count and @f$ n @f$ the size of the field. Otherwise, the * the field count and @f$ n @f$ the size of the field. Otherwise, the

Loading…
Cancel
Save