Unit Instance

HTTP 200 OK
Allow: GET, PUT, PATCH, DELETE, HEAD, OPTIONS
Content-Type: application/json
Vary: Accept

{
    "translation": "https://translate-dev.freebsd.org/api/translations/freebsd-doc/articles_linux-emulation/es/?format=api",
    "source": [
        "<trademark class=\"registered\">Linux</trademark> implements 1:1 threading, i.e. it has to use in-kernel synchronization primitives. As stated earlier, well written threaded programs have little lock contention. So a typical sequence could be performed as two atomic increase/decrease mutex reference counter, which is very fast, as presented by the following example:"
    ],
    "previous_source": "",
    "target": [
        "<trademark class=\"registered\">Linux</trademark> implementa subprocesos 1: 1, es decir, tiene que usar primitivas de sincronización en el kernel. Como se indicó anteriormente, los programas con subprocesos bien escritos tienen poca contención de bloqueo. Entonces, una secuencia típica podría realizarse como dos contadores de referencia mutex de aumento/disminución atómicos, que es muy rápido, como se presenta en el siguiente ejemplo:"
    ],
    "id_hash": 3327955423491252255,
    "content_hash": 3327955423491252255,
    "location": "article.translate.xml:2010",
    "context": "",
    "note": "(itstool) path: sect3/para",
    "flags": "",
    "labels": [],
    "state": 20,
    "fuzzy": false,
    "translated": true,
    "approved": false,
    "position": 291,
    "has_suggestion": false,
    "has_comment": false,
    "has_failing_check": false,
    "num_words": 48,
    "source_unit": "https://translate-dev.freebsd.org/api/units/99688/?format=api",
    "priority": 100,
    "id": 26556,
    "web_url": "https://translate-dev.freebsd.org/translate/freebsd-doc/articles_linux-emulation/es/?checksum=ae2f45d34d87e01f",
    "url": "https://translate-dev.freebsd.org/api/units/26556/?format=api",
    "explanation": "",
    "extra_flags": "",
    "pending": false,
    "timestamp": "2019-10-20T12:10:41.299346Z"
}