{
  "translations": {
    "en": {
      "sc1": "Members <code>front</code> and <code>rear</code> are pointers to the front and rear queue elements, respectively.",
      "sc2": "We will use a header link node, which allows for a simpler implementation of the enqueue operation by avoiding any special cases when the queue is empty.",
      "sc3": "On initialization, the front and rear pointers will point to the header node.",
      "sc4": "<code>front</code> will always point to the header node while rear points to the true last link node in the queue."
    }
  },
  "code": {
    "java": [{
      "url": "../../../SourceCode/Java/Lists/LQueue.java",
      "lineNumbers": false,
      "startAfter": "/* *** ODSATag: LQueue1 *** */",
      "endBefore": "/* *** ODSAendTag: LQueue1 *** */",
      "tags": {
        "vars": [3, 4],
        "init": [9, 10, 11, 12, 13]
      }
    }],
    "java_generic": [{
      "url": "../../../SourceCode/Java_Generic/Lists/LQueue.java",
      "lineNumbers": false,
      "startAfter": "/* *** ODSATag: LQueue1 *** */",
      "endBefore": "/* *** ODSAendTag: LQueue1 *** */",
      "tags": {
        "vars": [3, 4],
        "init": [11, 12, 13, 14, 15]
      }
    }]
  }
}