Do NOT edit English resources here.

English resources should only be changed through Pull Requests on GitHub.

Component Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
Glossary Easer GPL-3.0-only 0 0 0 0 0 0 0
Plugins CC0-1.0 0 0 0 0 0 0 0
Strings CC0-1.0 0 0 0 0 0 0 1

Overview

Project website renyuneyun.github.io/Easer
Project maintainers User avatar renyuneyun
Language French
Language code fr
Text direction Left to right
Number of speakers 295,510,923
yesterday

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 402 1,468 9,427
Translated 100% 402 100% 1,468 100% 9,427
Needs editing 0% 0 0% 0 0% 0
Read-only 1% 2 1% 3 1% 23
Failing checks 0% 0 0% 0 0% 0
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 0% 0 0% 0 0% 0
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 6 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes
DecJanFebMarAprMayJunJulAugSepOctNov

Quick numbers

1,468
Hosted words
402
Hosted strings
100%
Translated
0
Contributors
and previous 30 days

Trends of last 30 days

—
Hosted words
+100%
—
Hosted strings
+100%
—
Translated
+100%
—
Contributors
—
User avatar None

Changes committed
Changes committed a year ago
User avatar None

Changes committed
Changes committed a year ago
User avatar Efrit

Translation changed
Scripts are structured as <a href="https://en.wikipedia.org/wiki/Graph_(abstract_data_type)">graphs</a>, by choosing the relevant predecessors (parents).

Roughly speaking:
- From predecessors to successors, AND logic is performed.
- Between nodes, OR logic is performed.
- Multiple predecessors have AND relation, concerning the successor.
Les scripts sont structurés comme des <a href="https://enfr.wikipedia.org/wiki/Tree_structure">arbres</a>, en choisissant un parent pertinent.

Dans chaque brancheGraphe_(type_abstrait)">graphes</a>, en choisissant les prédécesseurs pertinents (parents).

Grosso modo :
– des prédécesseurs aux successeurs, la logique ET est effectuée.
Eappliquée ;
– entre les branchenœuds, la logique OUR est effectuée


L'extension des arbres aux graphiques est prévue mais n'est pas encore mise en œuvreappliquée ;
– de multiples prédécesseurs ont une relation ET, relativement au successeur.
a year ago
User avatar Efrit

Suggestion accepted
Times of repeats
Nombre de répétitions
a year ago
User avatar Efrit

Translation changed
Loop the media
Boucler sur le média
a year ago
User avatar Efrit

Suggestion accepted
Loop the media
Boucle sur le média
a year ago
User avatar renyuneyun

Resource updated
Parsing of the “app/src/main/res/values-fr/plugins.xml” file was enforced. 2 years ago
User avatar renyuneyun

Resource updated
Parsing of the “app/src/main/res/values-fr/strings.xml” file was enforced. 2 years ago
User avatar None

String updated in the repository
Scripts are structured as <a href="https://en.wikipedia.org/wiki/Graph_(abstract_data_type)">graphs</a>, by choosing the relevant predecessors (parents).

Roughly speaking:
- From predecessors to successors, AND logic is performed.
- Between nodes, OR logic is performed.
- Multiple predecessors have AND relation, concerning the successor.
Les scripts sont structurés comme <a href="https://en.wikipedia.org/wiki/Tree_structure">arbres</a>, en choisissant un parent pertinent.

Dans chaque branche, la logique ET est effectuée.
Entre les branches, la logique OU est effectuée


L'extension des arbres aux graphiques est prévue mais n'est pas encore mise en œuvre.
2 years ago
User avatar None

Resource updated
The “app/src/main/res/values/strings.xml” file was changed. 2 years ago
Browse all changes for this language