Status of this document
This document is not the real format specification. It's a simple draft to work. (For a simplified diagram of the layout of a Matroska file, see the Diagram page.) But since it's quite complete it is used as a reference for the development of libmatroska. An alternate version of the specification can be found here (PDF doc maintained by Alexander Noé -- may be outdated).
The table found below is now generated from the "source" of the Matroska specification. This XML file is also used to generate the semantic data used in libmatroska and libmatroska2. We encourage anyone to use and monitor its changes so your code is spec-proof and always up to date.
Note that versions 1, 2 and 3 have been finalized. Version 4 is currently work in progress. There may be further additions to v4.
EBML principle
EBML is short for Extensible Binary Meta Language. EBML specifies a binary and octet (byte) aligned format inspired by the principle of XML. EBML itself is a generalized description of the technique of binary markup. Like XML, it is completely agnostic to any data that it might contain. Therein, the Matroska project is a specific implementation using the rules of EBML: It seeks to define a subset of the EBML language in the context of audio and video data (though it obviously isn't limited to this purpose). The format is made of 2 parts: the semantic and the syntax. The semantic specifies a number of IDs and their basic type and is not included in the data file/stream. There is a specific project dealing with EBML in more details and more recent updates.
Just like XML, the specific "tags" (IDs in EBML parlance) used in an EBML implementation are arbitrary. However, the semantic of EBML outlines general data types and ID's.
The known basic types are:
- Signed Integer - Big-endian, any size from 1 to 8 octets
- Unsigned Integer - Big-endian, any size from 1 to 8 octets
- Float - Big-endian, defined for 4 and 8 octets (32, 64 bits)
- String - Printable ASCII (0x20 to 0x7E), zero-padded when needed
- UTF-8 - Unicode string, zero padded when needed (RFC 2279)
- Date - signed 8 octets integer in nanoseconds with 0 indicating the precise beginning of the millennium (at 2001-01-01T00:00:00,000000000 UTC)
- Master-Element - contains other EBML sub-elements of the next lower level
- Binary - not interpreted by the parser
As well as defining standard data types, EBML uses a system of Elements to make up an EBML "document." Elements incorporate an Element ID, a descriptor for the size of the element, and the binary data itself. Futher, Elements can be nested, or contain, Elements of a lower "level."
Element IDs (also called EBML IDs) are outlined as follows, beginning with the ID itself, followed by the Data Size, and then the non-interpreted Binary itself:
- Element ID coded with an UTF-8 like system :
bits, big-endian 1xxx xxxx - Class A IDs (2^7 -1 possible values) (base 0x8X) 01xx xxxx xxxx xxxx - Class B IDs (2^14-1 possible values) (base 0x4X 0xXX) 001x xxxx xxxx xxxx xxxx xxxx - Class C IDs (2^21-1 possible values) (base 0x2X 0xXX 0xXX) 0001 xxxx xxxx xxxx xxxx xxxx xxxx xxxx - Class D IDs (2^28-1 possible values) (base 0x1X 0xXX 0xXX 0xXX)
Some Notes:- The leading bits of the EBML IDs are used to identify the length of the ID. The number of leading 0's + 1 is the length of the ID in octets. We will refer to the leading bits as the Length Descriptor.
- Any ID where all x's are composed entirely of 1's is a Reserved ID, thus the -1 in the definitions above.
- The Reserved IDs (all x set to 1) are the only IDs that may change the Length Descriptor.
- Data size, in octets, is also coded with an UTF-8 like system :
bits, big-endian 1xxx xxxx - value 0 to 2^7-2 01xx xxxx xxxx xxxx - value 0 to 2^14-2 001x xxxx xxxx xxxx xxxx xxxx - value 0 to 2^21-2 0001 xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value 0 to 2^28-2 0000 1xxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value 0 to 2^35-2 0000 01xx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value 0 to 2^42-2 0000 001x xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value 0 to 2^49-2 0000 0001 xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value 0 to 2^56-2
Since modern computers do not easily deal with data coded in sizes greater than 64 bits, any larger Element Sizes are left undefined at the moment. Currently, the Element Size coding allows for an Element to grow to 72000 To, i.e. 7x10^16 octets or 72000 terabytes, which will be sufficient for the time being.
There is only one reserved word for Element Size encoding, which is an Element Size encoded to all 1's. Such a coding indicates that the size of the Element is unknown, which is a special case that we believe will be useful for live streaming purposes. However, avoid using this reserved word unnecessarily, because it makes parsing slower and more difficult to implement.
- Data
- Integers are stored in their standard big-endian form (no UTF-like encoding), only the size may differ from their usual form (24 or 40 bits for example).
- The Signed Integer is just the big-endian representation trimmed from some 0x00 and 0xFF where they are not meaningful (sign). For example -2 can be coded as 0xFFFFFFFFFFFFFE or 0xFFFE or 0xFE and 5 can be coded 0x000000000005 or 0x0005 or 0x05.
Elements semantic
A more detailed description of the column headers can be found in the Specification Notes.
If you are interrested in WebM you can have a look at this page that describes what parts of Matroska it kept.
- Element Name - The full name of the described element.
- L - Level - The level within an EBML tree that the element may occur at. + is for a recursive level (can be its own child). g: global element (can be found at any level)
- EBML ID - The Element ID displayed as octets.
- Ma - Mandatory - This element is mandatory in the file.
- Mu - Multiple - The element may appear multiple times within its parent element.
- Rng - Range - Valid range of values to store in the element.
- Default - The default value of the element.
- T - Element Type - The form of data the element contains. m: Master, u: unsigned int, i: signed integer, s: string, 8: UTF-8 string, b: binary, f: float, d: date
- 1 - The element is contained in Matroska version 1.
- 2 - The element is contained in Matroska version 2.
- 3 - The element is contained in Matroska version 3.
- 4 - The element is contained in Matroska version 4 (v4 is still work in progress; further additions are possible).
- W - All elements available for use in WebM.
- Description - A short description of the element's purpose.
| Element Name | L | EBML ID | Ma | Mu | Rng | Default | T | 1 | 2 | 3 | 4 | W | Description |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| EBML Header | |||||||||||||
| EBML | 0 | [1A][45][DF][A3] | * | * | - | - | m | * | * | * | * | * | Set the EBML characteristics of the data to follow. Each EBML document has to start with this. |
| EBMLVersion | 1 | [42][86] | * | - | - | 1 | u | * | * | * | * | * | The version of EBML parser used to create the file. |
| EBMLReadVersion | 1 | [42][F7] | * | - | - | 1 | u | * | * | * | * | * | The minimum EBML version a parser has to support to read this file. |
| EBMLMaxIDLength | 1 | [42][F2] | * | - | - | 4 | u | * | * | * | * | * | The maximum length of the IDs you'll find in this file (4 or less in Matroska). |
| EBMLMaxSizeLength | 1 | [42][F3] | * | - | - | 8 | u | * | * | * | * | * | The maximum length of the sizes you'll find in this file (8 or less in Matroska). This does not override the element size indicated at the beginning of an element. Elements that have an indicated size which is larger than what is allowed by EBMLMaxSizeLength shall be considered invalid. |
| DocType | 1 | [42][82] | * | - | - | matroska | s | * | * | * | * | * | A string that describes the type of document that follows this EBML header. 'matroska' in our case or 'webm' for webm files. |
| DocTypeVersion | 1 | [42][87] | * | - | - | 1 | u | * | * | * | * | * | The version of DocType interpreter used to create the file. |
| DocTypeReadVersion | 1 | [42][85] | * | - | - | 1 | u | * | * | * | * | * | The minimum DocType version an interpreter has to support to read this file. |
| Global elements (used everywhere in the format) | |||||||||||||
| Void | g | [EC] | - | - | - | - | b | * | * | * | * | * | Used to void damaged data, to avoid unexpected behaviors when using damaged data. The content is discarded. Also used to reserve space in a sub-element for later use. |
| CRC-32 | g | [BF] | - | - | - | - | b | * | * | * | * | The CRC is computed on all the data of the Master element it's in. The CRC element should be the first in it's parent master for easier reading. All level 1 elements should include a CRC-32. The CRC in use is the IEEE CRC32 Little Endian | |
| SignatureSlot | g | [1B][53][86][67] | - | * | - | - | m | Contain signature of some (coming) elements in the stream. | |||||
| SignatureAlgo | 1 | [7E][8A] | - | - | - | - | u | Signature algorithm used (1=RSA, 2=elliptic). | |||||
| SignatureHash | 1 | [7E][9A] | - | - | - | - | u | Hash algorithm used (1=SHA1-160, 2=MD5). | |||||
| SignaturePublicKey | 1 | [7E][A5] | - | - | - | - | b | The public key to use with the algorithm (in the case of a PKI-based signature). | |||||
| Signature | 1 | [7E][B5] | - | - | - | - | b | The signature of the data (until a new. | |||||
| SignatureElements | 1 | [7E][5B] | - | - | - | - | m | Contains elements that will be used to compute the signature. | |||||
| SignatureElementList | 2 | [7E][7B] | - | * | - | - | m | A list consists of a number of consecutive elements that represent one case where data is used in signature. Ex: Cluster|Block|BlockAdditional means that the BlockAdditional of all Blocks in all Clusters is used for encryption. | |||||
| SignedElement | 3 | [65][32] | - | * | - | - | b | An element ID whose data will be used to compute the signature. | |||||
| Element Name | L | EBML ID | Ma | Mu | Rng | Default | T | 1 | 2 | 3 | 4 | W | Description |
| Segment | |||||||||||||
| Segment | 0 | [18][53][80][67] | * | * | - | - | m | * | * | * | * | * | This element contains all other top-level (level 1) elements. Typically a Matroska file is composed of 1 segment. |
| Meta Seek Information | |||||||||||||
| SeekHead | 1 | [11][4D][9B][74] | - | * | - | - | m | * | * | * | * | * | Contains the position of other level 1 elements. |
| Seek | 2 | [4D][BB] | * | * | - | - | m | * | * | * | * | * | Contains a single seek entry to an EBML element. |
| SeekID | 3 | [53][AB] | * | - | - | - | b | * | * | * | * | * | The binary ID corresponding to the element name. |
| SeekPosition | 3 | [53][AC] | * | - | - | - | u | * | * | * | * | * | The position of the element in the segment in octets (0 = first level 1 element). |
| Segment Information | |||||||||||||
| Info | 1 | [15][49][A9][66] | * | * | - | - | m | * | * | * | * | * | Contains miscellaneous general information and statistics on the file. |
| SegmentUID | 2 | [73][A4] | - | - | not 0 | - | b | * | * | * | * | A randomly generated unique ID to identify the current segment between many others (128 bits). | |
| SegmentFilename | 2 | [73][84] | - | - | - | - | 8 | * | * | * | * | A filename corresponding to this segment. | |
| PrevUID | 2 | [3C][B9][23] | - | - | - | - | b | * | * | * | * | A unique ID to identify the previous chained segment (128 bits). | |
| PrevFilename | 2 | [3C][83][AB] | - | - | - | - | 8 | * | * | * | * | An escaped filename corresponding to the previous segment. | |
| NextUID | 2 | [3E][B9][23] | - | - | - | - | b | * | * | * | * | A unique ID to identify the next chained segment (128 bits). | |
| NextFilename | 2 | [3E][83][BB] | - | - | - | - | 8 | * | * | * | * | An escaped filename corresponding to the next segment. | |
| SegmentFamily | 2 | [44][44] | - | * | - | - | b | * | * | * | * | A randomly generated unique ID that all segments related to each other must use (128 bits). | |
| ChapterTranslate | 2 | [69][24] | - | * | - | - | m | * | * | * | * | A tuple of corresponding ID used by chapter codecs to represent this segment. | |
| ChapterTranslateEditionUID | 3 | [69][FC] | - | * | - | - | u | * | * | * | * | Specify an edition UID on which this correspondance applies. When not specified, it means for all editions found in the segment. | |
| ChapterTranslateCodec | 3 | [69][BF] | * | - | - | - | u | * | * | * | * | The chapter codec using this ID (0: Matroska Script, 1: DVD-menu). | |
| ChapterTranslateID | 3 | [69][A5] | * | - | - | - | b | * | * | * | * | The binary value used to represent this segment in the chapter codec data. The format depends on the ChapProcessCodecID used. | |
| TimecodeScale | 2 | [2A][D7][B1] | * | - | - | 1000000 | u | * | * | * | * | * | Timestamp scale in nanoseconds (1.000.000 means all timestamps in the segment are expressed in milliseconds). |
| Duration | 2 | [44][89] | - | - | > 0 | - | f | * | * | * | * | * | Duration of the segment (based on TimecodeScale). |
| DateUTC | 2 | [44][61] | - | - | - | - | d | * | * | * | * | * | Date of the origin of timestamp (value 0), i.e. production date. |
| Title | 2 | [7B][A9] | - | - | - | - | 8 | * | * | * | * | General name of the segment. | |
| MuxingApp | 2 | [4D][80] | * | - | - | - | 8 | * | * | * | * | * | Muxing application or library ("libmatroska-0.4.3"). |
| WritingApp | 2 | [57][41] | * | - | - | - | 8 | * | * | * | * | * | Writing application ("mkvmerge-0.3.3"). |
| Cluster | |||||||||||||
| Cluster | 1 | [1F][43][B6][75] | - | * | - | - | m | * | * | * | * | * | The lower level element containing the (monolithic) Block structure. |
| Timecode | 2 | [E7] | * | - | - | - | u | * | * | * | * | * | Absolute timestamp of the cluster (based on TimecodeScale). |
| SilentTracks | 2 | [58][54] | - | - | - | - | m | * | * | * | * | The list of tracks that are not used in that part of the stream. It is useful when using overlay tracks on seeking. Then you should decide what track to use. | |
| SilentTrackNumber | 3 | [58][D7] | - | * | - | - | u | * | * | * | * | One of the track number that are not used from now on in the stream. It could change later if not specified as silent in a further Cluster. | |
| Position | 2 | [A7] | - | - | - | - | u | * | * | * | * | The Position of the Cluster in the segment (0 in live broadcast streams). It might help to resynchronise offset on damaged streams. | |
| PrevSize | 2 | [AB] | - | - | - | - | u | * | * | * | * | * | Size of the previous Cluster, in octets. Can be useful for backward playing. |
| SimpleBlock | 2 | [A3] | - | * | - | - | b | * | * | * | * | Similar to Block but without all the extra information, mostly used to reduced overhead when no extra feature is needed. (see SimpleBlock Structure) | |
| BlockGroup | 2 | [A0] | - | * | - | - | m | * | * | * | * | * | Basic container of information containing a single Block or BlockVirtual, and information specific to that Block/VirtualBlock. |
| Block | 3 | [A1] | * | - | - | - | b | * | * | * | * | * | Block containing the actual data to be rendered and a timestamp relative to the Cluster Timecode. (see Block Structure) |
| BlockVirtual | 3 | [A2] | - | - | - | - | b | A Block with no data. It must be stored in the stream at the place the real Block should be in display order. (see Block Virtual) | |||||
| BlockAdditions | 3 | [75][A1] | - | - | - | - | m | * | * | * | * | Contain additional blocks to complete the main one. An EBML parser that has no knowledge of the Block structure could still see and use/skip these data. | |
| BlockMore | 4 | [A6] | * | * | - | - | m | * | * | * | * | Contain the BlockAdditional and some parameters. | |
| BlockAddID | 5 | [EE] | * | - | not 0 | 1 | u | * | * | * | * | An ID to identify the BlockAdditional level. | |
| BlockAdditional | 5 | [A5] | * | - | - | - | b | * | * | * | * | Interpreted by the codec as it wishes (using the BlockAddID). | |
| BlockDuration | 3 | [9B] | - | - | - | TrackDuration | u | * | * | * | * | * | The duration of the Block (based on TimecodeScale). This element is mandatory when DefaultDuration is set for the track (but can be omitted as other default values). When not written and with no DefaultDuration, the value is assumed to be the difference between the timestamp of this Block and the timestamp of the next Block in "display" order (not coding order). This element can be useful at the end of a Track (as there is not other Block available), or when there is a break in a track like for subtitle tracks. When set to 0 that means the frame is not a keyframe. |
| ReferencePriority | 3 | [FA] | * | - | - | 0 | u | * | * | * | * | This frame is referenced and has the specified cache priority. In cache only a frame of the same or higher priority can replace this frame. A value of 0 means the frame is not referenced. | |
| ReferenceBlock | 3 | [FB] | - | * | - | - | i | * | * | * | * | * | Timestamp of another frame used as a reference (ie: B or P frame). The timestamp is relative to the block it's attached to. |
| ReferenceVirtual | 3 | [FD] | - | - | - | - | i | Relative position of the data that should be in position of the virtual block. | |||||
| CodecState | 3 | [A4] | - | - | - | - | b | * | * | * | The new codec state to use. Data interpretation is private to the codec. This information should always be referenced by a seek entry. | ||
| DiscardPadding | 3 | [75][A2] | - | - | - | - | i | * | * | Duration in nanoseconds of the silent data added to the Block (padding at the end of the Block for positive value, at the beginning of the Block for negative value). The duration of DiscardPadding is not calculated in the duration of the TrackEntry and should be discarded during playback. | |||
| Slices | 3 | [8E] | - | - | - | - | m | * | * | * | * | * | Contains slices description. |
| TimeSlice | 4 | [E8] | - | * | - | - | m | * | * | * | * | * | Contains extra time information about the data contained in the Block. While there are a few files in the wild with this element, it is no longer in use and has been deprecated. Being able to interpret this element is not required for playback. |
| LaceNumber | 5 | [CC] | - | - | - | 0 | u | * | * | * | * | * | The reverse number of the frame in the lace (0 is the last frame, 1 is the next to last, etc). While there are a few files in the wild with this element, it is no longer in use and has been deprecated. Being able to interpret this element is not required for playback. |
| FrameNumber | 5 | [CD] | - | - | - | 0 | u | The number of the frame to generate from this lace with this delay (allow you to generate many frames from the same Block/Frame). | |||||
| BlockAdditionID | 5 | [CB] | - | - | - | 0 | u | The ID of the BlockAdditional element (0 is the main Block). | |||||
| Delay | 5 | [CE] | - | - | - | 0 | u | The (scaled) delay to apply to the element. | |||||
| SliceDuration | 5 | [CF] | - | - | - | 0 | u | The (scaled) duration to apply to the element. | |||||
| ReferenceFrame | 3 | [C8] | - | - | - | - | m | DivX trick track extenstions | |||||
| ReferenceOffset | 4 | [C9] | * | - | - | - | u | DivX trick track extenstions | |||||
| ReferenceTimeCode | 4 | [CA] | * | - | - | - | u | DivX trick track extenstions | |||||
| EncryptedBlock | 2 | [AF] | - | * | - | - | b | Similar to SimpleBlock but the data inside the Block are Transformed (encrypt and/or signed). (see EncryptedBlock Structure) | |||||
| Track | |||||||||||||
| Tracks | 1 | [16][54][AE][6B] | - | * | - | - | m | * | * | * | * | * | A top-level block of information with many tracks described. |
| TrackEntry | 2 | [AE] | * | * | - | - | m | * | * | * | * | * | Describes a track with all elements. |
| TrackNumber | 3 | [D7] | * | - | not 0 | - | u | * | * | * | * | * | The track number as used in the Block Header (using more than 127 tracks is not encouraged, though the design allows an unlimited number). |
| TrackUID | 3 | [73][C5] | * | - | not 0 | - | u | * | * | * | * | * | A unique ID to identify the Track. This should be kept the same when making a direct stream copy of the Track to another file. |
| TrackType | 3 | [83] | * | - | 1-254 | - | u | * | * | * | * | * | A set of track types coded on 8 bits (1: video, 2: audio, 3: complex, 0x10: logo, 0x11: subtitle, 0x12: buttons, 0x20: control). |
| FlagEnabled | 3 | [B9] | * | - | 0-1 | 1 | u | * | * | * | * | Set if the track is usable. (1 bit) | |
| FlagDefault | 3 | [88] | * | - | 0-1 | 1 | u | * | * | * | * | * | Set if that track (audio, video or subs) SHOULD be active if no language found matches the user preference. (1 bit) |
| FlagForced | 3 | [55][AA] | * | - | 0-1 | 0 | u | * | * | * | * | * | Set if that track MUST be active during playback. There can be many forced track for a kind (audio, video or subs), the player should select the one which language matches the user preference or the default + forced track. Overlay MAY happen between a forced and non-forced track of the same kind. (1 bit) |
| FlagLacing | 3 | [9C] | * | - | 0-1 | 1 | u | * | * | * | * | * | Set if the track may contain blocks using lacing. (1 bit) |
| MinCache | 3 | [6D][E7] | * | - | - | 0 | u | * | * | * | * | The minimum number of frames a player should be able to cache during playback. If set to 0, the reference pseudo-cache system is not used. | |
| MaxCache | 3 | [6D][F8] | - | - | - | - | u | * | * | * | * | The maximum cache size required to store referenced frames in and the current frame. 0 means no cache is needed. | |
| DefaultDuration | 3 | [23][E3][83] | - | - | not 0 | - | u | * | * | * | * | * | Number of nanoseconds (not scaled via TimecodeScale) per frame ('frame' in the Matroska sense -- one element put into a (Simple)Block). |
| DefaultDecodedFieldDuration | 3 | [23][4E][7A] | - | - | not 0 | - | u | * | The period in nanoseconds (not scaled by TimcodeScale) between two successive fields at the output of the decoding process (see the notes) | ||||
| TrackTimecodeScale | 3 | [23][31][4F] | * | - | > 0 | 1.0 | f | * | * | * | DEPRECATED, DO NOT USE. The scale to apply on this track to work at normal speed in relation with other tracks (mostly used to adjust video speed when the audio length differs). | ||
| TrackOffset | 3 | [53][7F] | - | - | - | 0 | i | A value to add to the Block's Timestamp. This can be used to adjust the playback offset of a track. | |||||
| MaxBlockAdditionID | 3 | [55][EE] | * | - | - | 0 | u | * | * | * | * | The maximum value of BlockAddID. A value 0 means there is no BlockAdditions for this track. | |
| Name | 3 | [53][6E] | - | - | - | - | 8 | * | * | * | * | * | A human-readable track name. |
| Language | 3 | [22][B5][9C] | - | - | - | eng | s | * | * | * | * | * | Specifies the language of the track in the Matroska languages form. |
| CodecID | 3 | [86] | * | - | - | - | s | * | * | * | * | * | An ID corresponding to the codec, see the codec page for more info. |
| CodecPrivate | 3 | [63][A2] | - | - | - | - | b | * | * | * | * | * | Private data only known to the codec. |
| CodecName | 3 | [25][86][88] | - | - | - | - | 8 | * | * | * | * | * | A human-readable string specifying the codec. |
| AttachmentLink | 3 | [74][46] | - | - | not 0 | - | u | * | * | * | * | The UID of an attachment that is used by this codec. | |
| CodecSettings | 3 | [3A][96][97] | - | - | - | - | 8 | A string describing the encoding setting used. | |||||
| CodecInfoURL | 3 | [3B][40][40] | - | * | - | - | s | A URL to find information about the codec used. | |||||
| CodecDownloadURL | 3 | [26][B2][40] | - | * | - | - | s | A URL to download about the codec used. | |||||
| CodecDecodeAll | 3 | [AA] | * | - | 0-1 | 1 | u | * | * | * | The codec can decode potentially damaged data (1 bit). | ||
| TrackOverlay | 3 | [6F][AB] | - | * | - | - | u | * | * | * | * | Specify that this track is an overlay track for the Track specified (in the u-integer). That means when this track has a gap (see SilentTracks) the overlay track should be used instead. The order of multiple TrackOverlay matters, the first one is the one that should be used. If not found it should be the second, etc. | |
| CodecDelay | 3 | [56][AA] | - | - | - | 0 | u | * | * | CodecDelay is The codec-built-in delay in nanoseconds. This value must be subtracted from each block timestamp in order to get the actual timestamp. The value should be small so the muxing of tracks with the same actual timestamp are in the same Cluster. | |||
| SeekPreRoll | 3 | [56][BB] | * | - | - | 0 | u | * | * | After a discontinuity, SeekPreRoll is the duration in nanoseconds of the data the decoder must decode before the decoded data is valid. | |||
| TrackTranslate | 3 | [66][24] | - | * | - | - | m | * | * | * | * | The track identification for the given Chapter Codec. | |
| TrackTranslateEditionUID | 4 | [66][FC] | - | * | - | - | u | * | * | * | * | Specify an edition UID on which this translation applies. When not specified, it means for all editions found in the segment. | |
| TrackTranslateCodec | 4 | [66][BF] | * | - | - | - | u | * | * | * | * | The chapter codec using this ID (0: Matroska Script, 1: DVD-menu). | |
| TrackTranslateTrackID | 4 | [66][A5] | * | - | - | - | b | * | * | * | * | The binary value used to represent this track in the chapter codec data. The format depends on the ChapProcessCodecID used. | |
| Video | 3 | [E0] | - | - | - | - | m | * | * | * | * | * | Video settings. |
| FlagInterlaced | 4 | [9A] | * | - | 0-1 | 0 | u | * | * | * | * | Set if the video is interlaced. (1 bit) | |
| StereoMode | 4 | [53][B8] | - | - | - | 0 | u | * | * | * | Stereo-3D video mode (0: mono, 1: side by side (left eye is first), 2: top-bottom (right eye is first), 3: top-bottom (left eye is first), 4: checkboard (right is first), 5: checkboard (left is first), 6: row interleaved (right is first), 7: row interleaved (left is first), 8: column interleaved (right is first), 9: column interleaved (left is first), 10: anaglyph (cyan/red), 11: side by side (right eye is first), 12: anaglyph (green/magenta), 13 both eyes laced in one Block (left eye is first), 14 both eyes laced in one Block (right eye is first)) . There are some more details on 3D support in the Specification Notes. | ||
| AlphaMode | 4 | [53][C0] | - | - | - | 0 | u | * | * | * | Alpha Video Mode. Presence of this element indicates that the BlockAdditional element could contain Alpha data. | ||
| OldStereoMode | 4 | [53][B9] | - | - | - | - | u | DEPRECATED, DO NOT USE. Bogus StereoMode value used in old versions of libmatroska. (0: mono, 1: right eye, 2: left eye, 3: both eyes). | |||||
| PixelWidth | 4 | [B0] | * | - | not 0 | - | u | * | * | * | * | * | Width of the encoded video frames in pixels. |
| PixelHeight | 4 | [BA] | * | - | not 0 | - | u | * | * | * | * | * | Height of the encoded video frames in pixels. |
| PixelCropBottom | 4 | [54][AA] | - | - | - | 0 | u | * | * | * | * | * | The number of video pixels to remove at the bottom of the image (for HDTV content). |
| PixelCropTop | 4 | [54][BB] | - | - | - | 0 | u | * | * | * | * | * | The number of video pixels to remove at the top of the image. |
| PixelCropLeft | 4 | [54][CC] | - | - | - | 0 | u | * | * | * | * | * | The number of video pixels to remove on the left of the image. |
| PixelCropRight | 4 | [54][DD] | - | - | - | 0 | u | * | * | * | * | * | The number of video pixels to remove on the right of the image. |
| DisplayWidth | 4 | [54][B0] | - | - | not 0 | PixelWidth | u | * | * | * | * | * | Width of the video frames to display. The default value is only valid when DisplayUnit is 0. |
| DisplayHeight | 4 | [54][BA] | - | - | not 0 | PixelHeight | u | * | * | * | * | * | Height of the video frames to display. The default value is only valid when DisplayUnit is 0. |
| DisplayUnit | 4 | [54][B2] | - | - | - | 0 | u | * | * | * | * | * | How DisplayWidth & DisplayHeight should be interpreted (0: pixels, 1: centimeters, 2: inches, 3: Display Aspect Ratio). |
| AspectRatioType | 4 | [54][B3] | - | - | - | 0 | u | * | * | * | * | * | Specify the possible modifications to the aspect ratio (0: free resizing, 1: keep aspect ratio, 2: fixed). |
| ColourSpace | 4 | [2E][B5][24] | - | - | - | - | b | * | * | * | * | Same value as in AVI (32 bits). | |
| GammaValue | 4 | [2F][B5][23] | - | - | > 0 | - | f | Gamma Value. | |||||
| FrameRate | 4 | [23][83][E3] | - | - | > 0 | - | f | Number of frames per second. Informational only. | |||||
| Audio | 3 | [E1] | - | - | - | - | m | * | * | * | * | * | Audio settings. |
| SamplingFrequency | 4 | [B5] | * | - | > 0 | 8000.0 | f | * | * | * | * | * | Sampling frequency in Hz. |
| OutputSamplingFrequency | 4 | [78][B5] | - | - | > 0 | Sampling Frequency | f | * | * | * | * | * | Real output sampling frequency in Hz (used for SBR techniques). |
| Channels | 4 | [9F] | * | - | not 0 | 1 | u | * | * | * | * | * | Numbers of channels in the track. |
| ChannelPositions | 4 | [7D][7B] | - | - | - | - | b | Table of horizontal angles for each successive channel, see appendix. | |||||
| BitDepth | 4 | [62][64] | - | - | not 0 | - | u | * | * | * | * | * | Bits per sample, mostly used for PCM. |
| TrackOperation | 3 | [E2] | - | - | - | - | m | * | * | Operation that needs to be applied on tracks to create this virtual track. For more details look at the Specification Notes on the subject. | |||
| TrackCombinePlanes | 4 | [E3] | - | - | - | - | m | * | * | Contains the list of all video plane tracks that need to be combined to create this 3D track | |||
| TrackPlane | 5 | [E4] | * | * | - | - | m | * | * | Contains a video plane track that need to be combined to create this 3D track | |||
| TrackPlaneUID | 6 | [E5] | * | - | not 0 | - | u | * | * | The trackUID number of the track representing the plane. | |||
| TrackPlaneType | 6 | [E6] | * | - | - | - | u | * | * | The kind of plane this track corresponds to (0: left eye, 1: right eye, 2: background). | |||
| TrackJoinBlocks | 4 | [E9] | - | - | - | - | m | * | * | Contains the list of all tracks whose Blocks need to be combined to create this virtual track | |||
| TrackJoinUID | 5 | [ED] | * | * | not 0 | - | u | * | * | The trackUID number of a track whose blocks are used to create this virtual track. | |||
| TrickTrackUID | 3 | [C0] | - | - | - | - | u | DivX trick track extenstions | |||||
| TrickTrackSegmentUID | 3 | [C1] | - | - | - | - | b | DivX trick track extenstions | |||||
| TrickTrackFlag | 3 | [C6] | - | - | - | 0 | u | DivX trick track extenstions | |||||
| TrickMasterTrackUID | 3 | [C7] | - | - | - | - | u | DivX trick track extenstions | |||||
| TrickMasterTrackSegmentUID | 3 | [C4] | - | - | - | - | b | DivX trick track extenstions | |||||
| ContentEncodings | 3 | [6D][80] | - | - | - | - | m | * | * | * | * | Settings for several content encoding mechanisms like compression or encryption. | |
| ContentEncoding | 4 | [62][40] | * | * | - | - | m | * | * | * | * | Settings for one content encoding like compression or encryption. | |
| ContentEncodingOrder | 5 | [50][31] | * | - | - | 0 | u | * | * | * | * | Tells when this modification was used during encoding/muxing starting with 0 and counting upwards. The decoder/demuxer has to start with the highest order number it finds and work its way down. This value has to be unique over all ContentEncodingOrder elements in the segment. | |
| ContentEncodingScope | 5 | [50][32] | * | - | not 0 | 1 | u | * | * | * | * | A bit field that describes which elements have been modified in this way. Values (big endian) can be OR'ed. Possible values: 1 - all frame contents, 2 - the track's private data, 4 - the next ContentEncoding (next ContentEncodingOrder. Either the data inside ContentCompression and/or ContentEncryption) |
|
| ContentEncodingType | 5 | [50][33] | * | - | - | 0 | u | * | * | * | * | A value describing what kind of transformation has been done. Possible values: 0 - compression, 1 - encryption |
|
| ContentCompression | 5 | [50][34] | - | - | - | - | m | * | * | * | * | Settings describing the compression used. Must be present if the value of ContentEncodingType is 0 and absent otherwise. Each block must be decompressable even if no previous block is available in order not to prevent seeking. | |
| ContentCompAlgo | 6 | [42][54] | * | - | - | 0 | u | * | * | * | * | The compression algorithm used. Algorithms that have been specified so far are: 0 - zlib, 3 - Header Stripping |
|
| ContentCompSettings | 6 | [42][55] | - | - | - | - | b | * | * | * | * | Settings that might be needed by the decompressor. For Header Stripping (ContentCompAlgo=3), the bytes that were removed from the beggining of each frames of the track. | |
| ContentEncryption | 5 | [50][35] | - | - | - | - | m | * | * | * | * | Settings describing the encryption used. Must be present if the value of ContentEncodingType is 1 and absent otherwise. | |
| ContentEncAlgo | 6 | [47][E1] | - | - | - | 0 | u | * | * | * | * | The encryption algorithm used. The value '0' means that the contents have not been encrypted but only signed. Predefined values: 1 - DES, 2 - 3DES, 3 - Twofish, 4 - Blowfish, 5 - AES |
|
| ContentEncKeyID | 6 | [47][E2] | - | - | - | - | b | * | * | * | * | For public key algorithms this is the ID of the public key the the data was encrypted with. | |
| ContentSignature | 6 | [47][E3] | - | - | - | - | b | * | * | * | * | A cryptographic signature of the contents. | |
| ContentSigKeyID | 6 | [47][E4] | - | - | - | - | b | * | * | * | * | This is the ID of the private key the data was signed with. | |
| ContentSigAlgo | 6 | [47][E5] | - | - | - | 0 | u | * | * | * | * | The algorithm used for the signature. A value of '0' means that the contents have not been signed but only encrypted. Predefined values: 1 - RSA |
|
| ContentSigHashAlgo | 6 | [47][E6] | - | - | - | 0 | u | * | * | * | * | The hash algorithm used for the signature. A value of '0' means that the contents have not been signed but only encrypted. Predefined values: 1 - SHA1-160 2 - MD5 |
|
| Cueing Data | |||||||||||||
| Cues | 1 | [1C][53][BB][6B] | - | - | - | - | m | * | * | * | * | * | A top-level element to speed seeking access. All entries are local to the segment. Should be mandatory for non "live" streams. |
| CuePoint | 2 | [BB] | * | * | - | - | m | * | * | * | * | * | Contains all information relative to a seek point in the segment. |
| CueTime | 3 | [B3] | * | - | - | - | u | * | * | * | * | * | Absolute timestamp according to the segment time base. |
| CueTrackPositions | 3 | [B7] | * | * | - | - | m | * | * | * | * | * | Contain positions for different tracks corresponding to the timestamp. |
| CueTrack | 4 | [F7] | * | - | not 0 | - | u | * | * | * | * | * | The track for which a position is given. |
| CueClusterPosition | 4 | [F1] | * | - | - | - | u | * | * | * | * | * | The position of the Cluster containing the required Block. |
| CueRelativePosition | 4 | [F0] | - | - | - | - | u | * | The relative position of the referenced block inside the cluster with 0 being the first possible position for an element inside that cluster. | ||||
| CueDuration | 4 | [B2] | - | - | - | - | u | * | The duration of the block according to the segment time base. If missing the track's DefaultDuration does not apply and no duration information is available in terms of the cues. | ||||
| CueBlockNumber | 4 | [53][78] | - | - | not 0 | 1 | u | * | * | * | * | * | Number of the Block in the specified Cluster. |
| CueCodecState | 4 | [EA] | - | - | - | 0 | u | * | * | * | The position of the Codec State corresponding to this Cue element. 0 means that the data is taken from the initial Track Entry. | ||
| CueReference | 4 | [DB] | - | * | - | - | m | * | * | * | The Clusters containing the required referenced Blocks. | ||
| CueRefTime | 5 | [96] | * | - | - | - | u | * | * | * | Timestamp of the referenced Block. | ||
| CueRefCluster | 5 | [97] | * | - | - | - | u | The Position of the Cluster containing the referenced Block. | |||||
| CueRefNumber | 5 | [53][5F] | - | - | not 0 | 1 | u | Number of the referenced Block of Track X in the specified Cluster. | |||||
| CueRefCodecState | 5 | [EB] | - | - | - | 0 | u | The position of the Codec State corresponding to this referenced element. 0 means that the data is taken from the initial Track Entry. | |||||
| Attachment | |||||||||||||
| Attachments | 1 | [19][41][A4][69] | - | - | - | - | m | * | * | * | * | Contain attached files. | |
| AttachedFile | 2 | [61][A7] | * | * | - | - | m | * | * | * | * | An attached file. | |
| FileDescription | 3 | [46][7E] | - | - | - | - | 8 | * | * | * | * | A human-friendly name for the attached file. | |
| FileName | 3 | [46][6E] | * | - | - | - | 8 | * | * | * | * | Filename of the attached file. | |
| FileMimeType | 3 | [46][60] | * | - | - | - | s | * | * | * | * | MIME type of the file. | |
| FileData | 3 | [46][5C] | * | - | - | - | b | * | * | * | * | The data of the file. | |
| FileUID | 3 | [46][AE] | * | - | not 0 | - | u | * | * | * | * | Unique ID representing the file, as random as possible. | |
| FileReferral | 3 | [46][75] | - | - | - | - | b | A binary value that a track/codec can refer to when the attachment is needed. | |||||
| FileUsedStartTime | 3 | [46][61] | - | - | - | - | u | DivX font extension | |||||
| FileUsedEndTime | 3 | [46][62] | - | - | - | - | u | DivX font extension | |||||
| Chapters | 1 | [10][43][A7][70] | - | - | - | - | m | * | * | * | * | * | A system to define basic menus and partition data. For more detailed information, look at the Chapters Explanation. |
| EditionEntry | 2 | [45][B9] | * | * | - | - | m | * | * | * | * | * | Contains all information about a segment edition. |
| EditionUID | 3 | [45][BC] | - | - | not 0 | - | u | * | * | * | * | A unique ID to identify the edition. It's useful for tagging an edition. | |
| EditionFlagHidden | 3 | [45][BD] | * | - | 0-1 | 0 | u | * | * | * | * | If an edition is hidden (1), it should not be available to the user interface (but still to Control Tracks; see flag notes). (1 bit) | |
| EditionFlagDefault | 3 | [45][DB] | * | - | 0-1 | 0 | u | * | * | * | * | If a flag is set (1) the edition should be used as the default one. (1 bit) | |
| EditionFlagOrdered | 3 | [45][DD] | - | - | 0-1 | 0 | u | * | * | * | * | Specify if the chapters can be defined multiple times and the order to play them is enforced. (1 bit) | |
| ChapterAtom | 3+ | [B6] | * | * | - | - | m | * | * | * | * | * | Contains the atom information to use as the chapter atom (apply to all tracks). |
| ChapterUID | 4 | [73][C4] | * | - | not 0 | - | u | * | * | * | * | * | A unique ID to identify the Chapter. |
| ChapterStringUID | 4 | [56][54] | - | - | - | - | 8 | * | * | * | A unique string ID to identify the Chapter. Use for WebVTT cue identifier storage. | ||
| ChapterTimeStart | 4 | [91] | * | - | - | - | u | * | * | * | * | * | Timestamp of the start of Chapter (not scaled). |
| ChapterTimeEnd | 4 | [92] | - | - | - | - | u | * | * | * | * | Timestamp of the end of Chapter (timestamp excluded, not scaled). | |
| ChapterFlagHidden | 4 | [98] | * | - | 0-1 | 0 | u | * | * | * | * | If a chapter is hidden (1), it should not be available to the user interface (but still to Control Tracks; see flag notes). (1 bit) | |
| ChapterFlagEnabled | 4 | [45][98] | * | - | 0-1 | 1 | u | * | * | * | * | Specify wether the chapter is enabled. It can be enabled/disabled by a Control Track. When disabled, the movie should skip all the content between the TimeStart and TimeEnd of this chapter (see flag notes). (1 bit) | |
| ChapterSegmentUID | 4 | [6E][67] | - | - | >0 | - | b | * | * | * | * | A segment to play in place of this chapter. Edition ChapterSegmentEditionUID should be used for this segment, otherwise no edition is used. | |
| ChapterSegmentEditionUID | 4 | [6E][BC] | - | - | not 0 | - | u | * | * | * | * | The EditionUID to play from the segment linked in ChapterSegmentUID. | |
| ChapterPhysicalEquiv | 4 | [63][C3] | - | - | - | - | u | * | * | * | * | Specify the physical equivalent of this ChapterAtom like "DVD" (60) or "SIDE" (50), see complete list of values. | |
| ChapterTrack | 4 | [8F] | - | - | - | - | m | * | * | * | * | List of tracks on which the chapter applies. If this element is not present, all tracks apply | |
| ChapterTrackNumber | 5 | [89] | * | * | not 0 | - | u | * | * | * | * | UID of the Track to apply this chapter too. In the absense of a control track, choosing this chapter will select the listed Tracks and deselect unlisted tracks. Absense of this element indicates that the Chapter should be applied to any currently used Tracks. | |
| ChapterDisplay | 4 | [80] | - | * | - | - | m | * | * | * | * | * | Contains all possible strings to use for the chapter display. |
| ChapString | 5 | [85] | * | - | - | - | 8 | * | * | * | * | * | Contains the string to use as the chapter atom. |
| ChapLanguage | 5 | [43][7C] | * | * | - | eng | s | * | * | * | * | * | The languages corresponding to the string, in the bibliographic ISO-639-2 form. |
| ChapCountry | 5 | [43][7E] | - | * | - | - | s | * | * | * | * | The countries corresponding to the string, same 2 octets as in Internet domains. | |
| ChapProcess | 4 | [69][44] | - | * | - | - | m | * | * | * | * | Contains all the commands associated to the Atom. | |
| ChapProcessCodecID | 5 | [69][55] | * | - | - | 0 | u | * | * | * | * | Contains the type of the codec used for the processing. A value of 0 means native Matroska processing (to be defined), a value of 1 means the DVD command set is used. More codec IDs can be added later. | |
| ChapProcessPrivate | 5 | [45][0D] | - | - | - | - | b | * | * | * | * | Some optional data attached to the ChapProcessCodecID information. For ChapProcessCodecID = 1, it is the "DVD level" equivalent. | |
| ChapProcessCommand | 5 | [69][11] | - | * | - | - | m | * | * | * | * | Contains all the commands associated to the Atom. | |
| ChapProcessTime | 6 | [69][22] | * | - | - | - | u | * | * | * | * | Defines when the process command should be handled (0: during the whole chapter, 1: before starting playback, 2: after playback of the chapter). | |
| ChapProcessData | 6 | [69][33] | * | - | - | - | b | * | * | * | * | Contains the command information. The data should be interpreted depending on the ChapProcessCodecID value. For ChapProcessCodecID = 1, the data correspond to the binary DVD cell pre/post commands. | |
| Tagging | |||||||||||||
| Tags | 1 | [12][54][C3][67] | - | * | - | - | m | * | * | * | * | Element containing elements specific to Tracks/Chapters. A list of valid tags can be found here. | |
| Tag | 2 | [73][73] | * | * | - | - | m | * | * | * | * | Element containing elements specific to Tracks/Chapters. | |
| Targets | 3 | [63][C0] | * | - | - | - | m | * | * | * | * | Contain all UIDs where the specified meta data apply. It is empty to describe everything in the segment. | |
| TargetTypeValue | 4 | [68][CA] | - | - | - | 50 | u | * | * | * | * | A number to indicate the logical level of the target (see TargetType). | |
| TargetType | 4 | [63][CA] | - | - | - | - | s | * | * | * | * | An informational string that can be used to display the logical level of the target like "ALBUM", "TRACK", "MOVIE", "CHAPTER", etc (see TargetType). | |
| TagTrackUID | 4 | [63][C5] | - | * | - | 0 | u | * | * | * | * | A unique ID to identify the Track(s) the tags belong to. If the value is 0 at this level, the tags apply to all tracks in the Segment. | |
| TagEditionUID | 4 | [63][C9] | - | * | - | 0 | u | * | * | * | * | A unique ID to identify the EditionEntry(s) the tags belong to. If the value is 0 at this level, the tags apply to all editions in the Segment. | |
| TagChapterUID | 4 | [63][C4] | - | * | - | 0 | u | * | * | * | * | A unique ID to identify the Chapter(s) the tags belong to. If the value is 0 at this level, the tags apply to all chapters in the Segment. | |
| TagAttachmentUID | 4 | [63][C6] | - | * | - | 0 | u | * | * | * | * | A unique ID to identify the Attachment(s) the tags belong to. If the value is 0 at this level, the tags apply to all the attachments in the Segment. | |
| SimpleTag | 3+ | [67][C8] | * | * | - | - | m | * | * | * | * | Contains general information about the target. | |
| TagName | 4 | [45][A3] | * | - | - | - | 8 | * | * | * | * | The name of the Tag that is going to be stored. | |
| TagLanguage | 4 | [44][7A] | * | - | - | und | s | * | * | * | * | Specifies the language of the tag specified, in the Matroska languages form. | |
| TagDefault | 4 | [44][84] | * | - | 0-1 | 1 | u | * | * | * | * | Indication to know if this is the default/original language to use for the given tag. (1 bit) | |
| TagString | 4 | [44][87] | - | - | - | - | 8 | * | * | * | * | The value of the Tag. | |
| TagBinary | 4 | [44][85] | - | - | - | - | b | * | * | * | * | The values of the Tag if it is binary. Note that this cannot be used in the same SimpleTag as TagString. | |
| Element Name | L | EBML ID | Ma | Mu | Rng | Default | T | 1 | 2 | 3 | 4 | W | Description |
All top-levels elements (Segment and direct sub-elements) are coded on 4 octets, i.e. class D elements.
Appendix
Language Codes
Language codes can be either the 3 letters bibliographic ISO-639-2 form (like "fre" for french), or such a language code followed by a dash and a country code for specialities in languages (like "fre-ca" for Canadian French). Country codes are the same as used for internet domains.
Physical Types
Each level can have different meanings for audio and video. The ORIGINAL_MEDIUM tag can be used to specify a string for ChapterPhysicalEquiv = 60. Here is the list of possible levels for both audio and video :
| ChapterPhysicalEquiv | Audio | Video | Comment |
|---|---|---|---|
| 70 | SET / PACKAGE | SET / PACKAGE | the collection of different media |
| 60 | CD / 12" / 10" / 7" / TAPE / MINIDISC / DAT | DVD / VHS / LASERDISC | the physical medium like a CD or a DVD |
| 50 | SIDE | SIDE | when the original medium (LP/DVD) has different sides |
| 40 | - | LAYER | another physical level on DVDs |
| 30 | SESSION | SESSION | as found on CDs and DVDs |
| 20 | TRACK | - | as found on audio CDs |
| 10 | INDEX | - | the first logical level of the side/medium |
Block Structure
Size = 1 + (1-8) + 4 + (4 + (4)) octets. So from 6 to 21 octets.
Bit 0 is the most significant bit.
Frames using references should be stored in "coding order". That means the references first and then the frames referencing them. A consequence is that timecodes may not be consecutive. But a frame with a past timecode must reference a frame already known, otherwise it's considered bad/void.
There can be many Blocks in a BlockGroup provided they all have the same timecode. It is used with different parts of a frame with different priorities.
| Block Header | ||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Offset | Player | Description | ||||||||||||||||||
| 0x00+ | must | Track Number (Track Entry). It is coded in EBML like form (1 octet if the value is < 0x80, 2 if < 0x4000, etc) (most significant bits set to increase the range). | ||||||||||||||||||
| 0x01+ | must | Timecode (relative to Cluster timecode, signed int16) | ||||||||||||||||||
| 0x03+ | - |
| ||||||||||||||||||
| Lace (when lacing bit is set) | ||||||||||||||||||||
| 0x00 | must | Number of frames in the lace-1 (uint8) | ||||||||||||||||||
| 0x01 / 0xXX | must* | Lace-coded size of each frame of the lace, except for the last one (multiple uint8). *This is not used with Fixed-size lacing as it is calculated automatically from (total size of lace) / (number of frames in lace). | ||||||||||||||||||
| (possibly) Laced Data | ||||||||||||||||||||
| 0x00 | must | Consecutive laced frames |
Lacing
Lacing is a mechanism to save space when storing data. It is typically used for small blocks of data (refered to as frames in matroska). There are 3 types of lacing : the Xiph one inspired by what is found in the Ogg container, the EBML one which is the same with sizes coded differently and the fixed-size one where the size is not coded. As an example is better than words...
Let's say you want to store 3 frames of the same track. The first frame is 800 octets long, the second is 500 octets long and the third is 1000 octets long. As these data are small, you can store them in a lace to save space. They will then be solved in the same block as follows:
Xiph lacing
- Block head (with lacing bits set to 01)
- Lacing head: Number of frames in the lace -1, i.e. 2 (the 800 and 400 octets one)
- Lacing sizes: only the 2 first ones will be coded, 800 gives 255;255;255;35, 500 gives 255;245. The size of the last frame is deduced from the total size of the Block.
- Data in frame 1
- Data in frame 2
- Data in frame 3
A frame with a size multiple of 255 is coded with a 0 at the end of the size, for example 765 is coded 255;255;255;0.
EBML lacing
In this case the size is not coded as blocks of 255 bytes, but as a difference with the previous size and this size is coded as in EBML. The first size in the lace is unsigned as in EBML. The others use a range shifting to get a sign on each value :
1xxx xxxx - value -(2^6-1) to 2^6-1 (ie 0 to 2^7-2 minus 2^6-1, half of the range) 01xx xxxx xxxx xxxx - value -(2^13-1) to 2^13-1 001x xxxx xxxx xxxx xxxx xxxx - value -(2^20-1) to 2^20-1 0001 xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value -(2^27-1) to 2^27-1 0000 1xxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value -(2^34-1) to 2^34-1 0000 01xx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value -(2^41-1) to 2^41-1 0000 001x xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx xxxx - value -(2^48-1) to 2^48-1
- Block head (with lacing bits set to 11)
- Lacing head: Number of frames in the lace -1, i.e. 2 (the 800 and 400 octets one)
- Lacing sizes: only the 2 first ones will be coded, 800 gives 0x320 0x4000 = 0x4320, 500 is coded as -300 : - 0x12C + 0x1FFF + 0x4000 = 0x5ED3. The size of the last frame is deduced from the total size of the Block.
- Data in frame 1
- Data in frame 2
- Data in frame 3
Fixed-size lacing
In this case only the number of frames in the lace is saved, the size of each frame is deduced from the total size of the Block. For example, for 3 frames of 800 octets each :
- Block head (with lacing bits set to 10)
- Lacing head: Number of frames in the lace -1, i.e. 2
- Data in frame 1
- Data in frame 2
- Data in frame 3
SimpleBlock Structure
The SimpleBlock is very inspired by the Block structure. The main differences are the added Keyframe flag and Discardable flag. Otherwise everything is the same.
Size = 1 + (1-8) + 4 + (4 + (4)) octets. So from 6 to 21 octets.
Bit 0 is the most significant bit.
Frames using references should be stored in "coding order". That means the references first and then the frames referencing them. A consequence is that timecodes may not be consecutive. But a frame with a past timecode must reference a frame already known, otherwise it's considered bad/void.
There can be many Blocks in a BlockGroup provided they all have the same timecode. It is used with different parts of a frame with different priorities.
| SimpleBlock Header | |||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Offset | Player | Description | |||||||||||||||||||||
| 0x00+ | must | Track Number (Track Entry). It is coded in EBML like form (1 octet if the value is < 0x80, 2 if < 0x4000, etc) (most significant bits set to increase the range). | |||||||||||||||||||||
| 0x01+ | must | Timecode (relative to Cluster timecode, signed int16) | |||||||||||||||||||||
| 0x03+ | - |
| |||||||||||||||||||||
| Lace (when lacing bit is set) | |||||||||||||||||||||||
| 0x00 | must | Number of frames in the lace-1 (uint8) | |||||||||||||||||||||
| 0x01 / 0xXX | must* | Lace-coded size of each frame of the lace, except for the last one (multiple uint8). *This is not used with Fixed-size lacing as it is calculated automatically from (total size of lace) / (number of frames in lace). | |||||||||||||||||||||
| (possibly) Laced Data | |||||||||||||||||||||||
| 0x00 | must | Consecutive laced frames |
EncryptedBlock Structure
The EncryptedBlock is very inspired by the SimpleBlock structure. The main differences is that the raw data are Transformed. That means the data after the lacing definition (if present) have been processed before put into the Block. The laced sizes apply on the decoded (Inverse Transform) data. This size of the Transformed data may not match the size of the initial chunk of data.
The other difference is that the number of frames in the lace are not saved if "no lacing" is specified (bits 5 and 6 set to 0).
The Transformation is specified by a TransformID in the Block (must be the same for all frames within the EncryptedBlock).
Size = 1 + (1-8) + 4 + (4 + (4)) octets. So from 6 to 21 octets.
Bit 0 is the most significant bit.
Frames using references should be stored in "coding order". That means the references first and then the frames referencing them. A consequence is that timecodes may not be consecutive. But a frame with a past timecode must reference a frame already known, otherwise it's considered bad/void.
There can be many Blocks in a BlockGroup provided they all have the same timecode. It is used with different parts of a frame with different priorities.
| EncryptedBlock Header | |||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Offset | Player | Description | |||||||||||||||||||||
| 0x00+ | must | Track Number (Track Entry). It is coded in EBML like form (1 octet if the value is < 0x80, 2 if < 0x4000, etc) (most significant bits set to increase the range). | |||||||||||||||||||||
| 0x01+ | must | Timecode (relative to Cluster timecode, signed int16) | |||||||||||||||||||||
| 0x03+ | - |
| |||||||||||||||||||||
| Lace (when lacing bit is set) | |||||||||||||||||||||||
| 0x00 | must* | Number of frames in the lace-1 (uint8) *Only available if bit 5 or bit 6 of the EncryptedBlock flag is set to one. | |||||||||||||||||||||
| 0x01 / 0xXX | must* | Lace-coded size of each frame of the lace, except for the last one (multiple uint8). *This is not used with Fixed-size lacing as it is calculated automatically from (total size of lace) / (number of frames in lace). | |||||||||||||||||||||
| (possibly) Laced Data | |||||||||||||||||||||||
| 0x00 | must | TransformID (EBML coded integer value). Value 0 = Null Transform | |||||||||||||||||||||
| 0x01+ | must | Consecutive laced frames |
Virtual Block
The data in matroska is stored in coding order. But that means if you seek to a particular point and a frame has been referenced far away, you won't know while playing and you might miss this frame (true for independent frames and overlapping of dependent frames). So the idea is to have a placeholder for the original frame in the timecode (display) order.
The structure is a scaled down version of the normal Block.
| Virtual Block Header | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Offset | Player | Description | |||||||||
| 0x00+ | must | Track Number (Track Entry). It is coded in EBML like form (1 octet if the value is < 0x80, 2 if < 0x4000, etc) (most significant bits set to increase the range). | |||||||||
| 0x01+ | must | Timecode (relative to Cluster timecode, signed int16) | |||||||||
| 0x03+ | - |
|


{% extends "riddle.html" %} {% block title %}Tomorrow{% endblock %} {% block subtitle %}Warm-up{% endblock %} {% block riddle %}
Or did we?
Let's make sure.
What date will it be tomorrow?


Cef3.2623 C ++ and JS interactive function test page
JS calls C ++ test
The text sent to C ++:
C ++ calls JS test
Received text from C ++：


Select the adequate information for your environment, this script will generate a file for Docker Compose that suits your needs. Just run it - and you'll have a working gBridge instance.
Setup a database in Docker
Use an own database server
MySQL servers (and compatible ones, like MariaDB) are supported. Create a new, empty database on your database server. Specify authentication and connection details.
Setup a Redis instance in Docker
Use an own redis server
Specify details for your own Redis server. Leave the password field empty if no authentication is required.
Specify details for your own MQTT server. Leave the username/ password field empty if no authentication is required.
Specify details you've entered while creating a new smart home action in the Google Actions Console.
The Client ID is given in the account linking settings in the Google Actions Console.
The Google Project ID is shown in the project settings in the Google Actions Console.
A Homegraph Key can be generated in the Google Cloud dashboard after enabling the Homegraph API.
Specify details about your application.
Enter the Laravel App Key you've used in a previous setup. Leave it empty if this is your first setup.
Select a port for the gBridge web interface to be available on.


| Class | Description |
|---|---|
| ContractorsResponse |
Response object for Contractors' REST API calls
|
| CostCentersResponse |
Response object for CostCenters' REST API links
|
| FXRatesResponse |
Response object for FXRates REST API link
|
| HiringManagerResponse |
Response object for Hiring Manager Add and Edit REST API links
|
| HiringManagersResponse |
Response object for HiringManagers REST API view link
|
| HRAddEditPayGradeResponse |
Response object for PayGrades' Add and Edit REST API links
|
| HRPayGradeResponse |
Response object for PayGrades' view link
|
| HRPositionRoleResponse |
Response Object for HR Position Role REST API view link
|
| HRRolesResponse |
Response object for REST API add and edit links of HRRoles
|
| LoginResponse |
Response object for the Login link
|
| LogoutResponse |
Response object for REST API logout link
|
| RefreshResponse |
Response object for the REST API Refresh link
|
| ReportResponse |
Response object for viewReportData REST API link
|
| Response |
Base response object
|
| SkillsAddResponse |
Response object for the REST API add skill link
|
| SkillsEditResponse |
Response object for the REST API edit skill link
|
| SkillsResponse |
Response Object for the REST API view skills link
|
| UsersAddResponse |
Response object for REST API add user link
|
| UsersEditResponse |
Response Object for REST API edit user link
|
| UsersResponse |
Response object for REST API view users link
|


Search By Zipcode:
Zip Code
City
State
{{code.fields.zip}}
{{code.fields.city}}
{{code.fields.state}}
No Result Found.


Have a question for our team? Want to know what's next for the platform? Have a great (or not so great) experience you'd like us to know about? We're happy to help. Please contact us using the below form and we'll get back to you as soon as we can.
Mentee
Mentor
Prospective User
Other


Latitude
Plot Visualizations
Max Temprature
Humidity
Cloudiness
Wind
Comparisons
(current)
Data
(current)
Data


Ionic Enterprise
Our SDKs, tools, integrations, and services are designed to modernize enterprise app development. Ionic empowers your app development teams with everything they need to deliver the mission-critical apps that keep your business running.
Contact sales to learn more


| 035:040 Khan | : |
Say (O Muhammad SAW): "Tell me or inform me (what) do you think about your (so-called) partner-gods to whom you call upon besides Allah, show me, what they have created of the earth? Or have they any share in the heavens? Or have We given them a Book, so that they act on clear proof therefrom? Nay, the Zalimun (polytheists and wrong-doers, etc.) promise one another nothing but delusions." |
| 035:040 Maulana | : |
Say: Have you seen your associates which you call upon besides Allah? Show me what they have created of the earth! Or have they any share in the heavens? Or, have We given them a Book so that they follow a clear argument thereof? Nay, the wrongdoers hold out promises one to another only to deceive. |
| 035:040 Pickthal | : |
Say: Have ye seen your partner-gods to whom ye pray beside Allah? Show me what they created of the earth! Or have they any portion in the heavens? Or have We given them a scripture so they act on clear proof therefrom? Nay, the evil-doers promise one another only to deceive. |
| 035:040 Rashad | : |
Say, "Consider the idols you have set up beside GOD; show me what on earth have they created." Do they own any partnership in the heavens? Have we given them a book wherein there is no doubt? Indeed, what the transgressors promise one another is no more than an illusion. |
| 035:040 Sarwar | : |
(Muhammad), ask them, "Think about the idols which you worship besides God. Show me what part of the earth they have created. Do they have any share in the heavens? Has God sent them a Book to confirm their authority? In fact, whatever the unjust promise each other is nothing but deceit." |
| 035:040 Shakir | : |
Say: Have you considered your associates which you call upon besides Allah? Show me what part of the earth they have created, or have they any share in the heavens; or, have We given them a book so that they follow a clear argument thereof? Nay, the unjust do not hold out promises one to another but only to deceive. |
| 035:040 Sherali | : |
Say, 'Have you seen your associate-gods whom you call on beside ALLAH? Show me, then, what they have created of the earth. Or they have a share in the creation of the heavens? Or, have WE given them a Book so that they have an evidence therefrom?' Nay, the wrongdoers promise one another nothing but delusion. |
| 035:040 Yusufali | : |
Say: "Have ye seen (these) 'Partners' of yours whom ye call upon besides Allah? Show Me what it is they have created in the (wide) earth. Or have they a share in the heavens? Or have We given them a Book from which they (can derive) clear (evidence)?- Nay, the wrong-doers promise each other nothing but delusions. |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الشرك والمشركون > أصنامهم والتهكم بهم على عبادتها Pillars of Islam> Islamic> Polytheism and the Polytheists> Their Idols and the Mockery for Worshipping them أركان الإسلام > التوحيد > الشرك والمشركون > تنزيه الله جلّ جلاله عن الشريك Pillars of Islam> Islamic> Polytheism and the Polytheists> Allah's Freedom from Partnership
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


Study finds 35% of under 35 have mental health issues
by By Digital Desk staffStress, anxiety and mental health issues are more common among under 35s, according to a new study.
Research by Aviva found that 54% of under 35s claim that they or someone close to them experience stress or anxiety, with 35% admitting to having mental health issues.
Compared to other age groups, on average 41% of men and 45% of women reported stress or anxiety and 21% of men and 28% of women claiming mental health issues.
Aviva's survey found that men claimed to be putting in the longest hours worked outside the home with 61% saying they worked between 36-50 hours versus 36% of women.
The survey also found that females, younger workers and those working longer hours are much more likely to have cancelled a healthcare appointment due to work commitments.
When it came to exercise females and those aged 25-44 are getting the least exercise at under four hours per week.
57% of 18-24-year-olds are targeting looking after their mental health and reducing stress levels amongst their top three priorities.
"These research findings are stark – both from the perspective of the number of young people citing anxiety, stress and mental health issues alongside the lack of any financial provision if they were unable to work or indeed lost their job," said Karen Gallagher, Aviva Life & Pensions.
"It is evident that people are conscious of the need to look after their mental health however, it is not always possible to prevent issues arising and a level of protection should be in place."
READ MORE
Boris Johnson's comments on barriers to trade crossing Irish Sea defended


Start Game Session
Game Master's Console
Increase Time
Decrease Time
Change Tag
Send Hint
Game Master
Master
Player1
Target
Player2
Chaser
Player3
Chaser
Activity Log


This page does not exist. Please feel free to contact us at<EMAIL_ADDRESS>to report this.


SecMon
Welcome to SecMon
oops... something went wrong!
Scene List
Camera 1
Scene List
Camera 1
Camera 2
Camera 3
Camera 4
Cameras
Cam 1
✧
►
❚❚
System Status
My first chart


How To Use Amazon Hub Delivery In Australia
by Tegan JonesAmazon has brought its Hub delivery service to Australia just in time for Black Friday.
It's interesting in that it's completely different to any other delivery service in Australia right now. You don't have to worry about packages being left on your doorstep or being greeted with a 'Sorry we missed you' slip when you were definitely home all day.
This is everything you need to know about how this new system works.
What is it?
Amazon Hub let's you choose to have your package delivered to either a Counter or a Locker so you can pick it up in your own time. This often means after business hours.
Which items can it be used for?
Items that Amazon dispatches can be used with a Hub - this includes some Marketplace items. Over 125 million products are currently eligible.
Which items can't it be used for?
Anything from a third party seller or items that are either age restricted or contain hazardous materials.
Does it cost extra?
Not for Amazon Prime members - you get it for free. If you're not a Prime member you'll be charged $4.99 for expedited delivery. However, if you spend more than $39 on eligible items you will qualify for free standard delivery.
How do I choose it as a delivery method?
Head over to the Amazon Hub page and select 'Locker' or 'Counter.
You then have the option to choose all delivery methods, Amazon Locker or Store.
Once you've made your choice, put in the address most appropriate for you. For example, I used my work address. You can also search by postcode and landmark.
You'll be given a list of nearby options. Select the most convenient for you.
This will be now saved as one of your delivery addresses. You can also choose to make it your default.
Now when you go to your checkout on the Amazon online store you'll be able to select it as a delivery option.
How does the Locker work?
Once you place your order has arrived you will be emailed a unique barcode and six digit number.
Lockers are self service so you will need to either scan the barcode or punch in the six-digit pin to unlock the locker.
How does the Counter work?
Once you place your order has arrived you will be emailed a unique barcode and six digit number.
You will then need to either show your number or have your barcode scanner by a cashier to get your package.
How do I find a Hub near me
You can type in the appropriate address here and you'll be given a list of nearby hubs.
As it is just rolling out it isn't Australia wide yet. You're most likely to be able to find one if you're in Sydney or Melbourne.
What if I want to pick up after business hours?
The whole point of Amazon Hub is to offer more flexible delivery and pick up options. The list of Hubs near you over on this page will also show what the opening hours are. As you'll notice some will be after business hours and some are even open 24 hours.
What's the time limit for picking up my order?
You have 3 days to pick up your parcel from Lockers and 14 days from Counters. If you fail to pick up during that time period the items will be returned for a refund.
Can I return orders to a locker or counter
Not at the present time, you'll need to go through current Amazon returns instead.
Will Lockers be congested during busy periods?
Considering that Amazon Hub has only just launched, we're not sure yet! We have asked Amazon this question though. Considering that the service has been in use in the U.S. for years, as well as the 3 day turn around on Locker pickups, we expect that this shouldn't be too much of a problem.


Introduction¶
What does it do?¶
LCOPT is designed to provide a simple and intuitive way to create ‘fully parameterised’ Life Cycle Inventory foreground models.
What’s a Life Cycle Inventory foreground model?¶
To conduct a Life Cycle Assessment (LCA) we need to create a model of the life cycle of a given product or process which we can then use to estimate the potential environmental impact which results. This includes extraction of raw materials, processing, transport, use, disposal etc. etc.
Because each item used in a life cycle has it’s own set upstream processes the LCA model tends to be split into the foreground system - the processes under the control of the person doing the LCA - and the background system - the rest of the industrial economy which provides the materials and services required by the foreground system.
Background system models are either determined by data providers (e.g. ecoinvent) or can be customised using Ocelot.
The foreground model is a set of linked unit processes. A unit process describes a stage in the life cycle. It is basically a list of the exchanges required to produce one unit of an intermediate (or final) product. These exchanges can either be inputs from the technosphere - the human constructed industrial economy - or resources from or emissions to the biosphere. Technosphere exchanges can either come from the background system or other processes in the foreground system.
For example, when you make a cup of tea you make some boiling water, add this to some tea leaves, add some milk, then use/drink it.
The boiling water is created in the unit process kettle which takes inputs from the background system of water and electricity and emits a small amount of water vapour to the biosphere.
The next unit process is teapot. This takes an input of boiling water from our first process, and tea leaves from the background system to produce black tea.
Finally, teacup takes an input of black tea from the teapot process and milk from the background system Note : we’re making a proper British cup of tea!
We now have a foreground model for our cup of tea LCA.
Why use LCOPT for creating foreground models?¶
How you create your foreground model is up to you.
Simple models can be constructed in Excel. More complex models can be created in commercially available softwares such as SimaPro or GaBi, or freeware such as OpenLCA.
These fully featured software packages have a steep learning curve, can cost a lot of money, or require administrator rights to run (which can be an issue with university or company owned computers).
Lcopt is free, open source and written in Python. You can install it without admin rights and it runs in a normal web browser. It’s designed to be simple and intuitive, but powerful enough to conduct proper LCAs.
How do you create foreground models in LCOPT?¶
When you start an LCA, its usually a good idea to draw out a flow diagram of the system you’re modelling on a piece of paper. This helps you identify the unit processes involved, the inputs they use and the extent of the foreground system you might be able to get primary data for.
Creating foreground models in Lcopt is as simple as drawing out your flow chart.
Instead of having to write out lists of exchanges to describe each unit process, you simply draw out a flow sheet of your process. You can add processes, link them together and add inputs and outputs. In the background Lcopt compiles these exchange lists, and gives each link a parameter. When you’ve finished your drawing you have a fully parameterised foreground model.
What does fully parameterised mean?¶
In order to analyse your LCA model, you need to know how much of each exchange is required by each unit process. In most softwares the default is to hard code these values in the unit process itself. This is great for a one-off model, but can be a real hassle if there are multiple variants of your system which you want to assess and compare.
Taking the example from above, some people like their tea with milk, some like it black. Some people like strong tea (with more tea leaves) others like it weaker. If you want to compare weak milky tea with strong black tea you’d need to create two different teapot processes (one for weak, one for strong) and two different teacup processes (one for milky, one for black), with the correct exchange amounts, and links to the version of teapot with the correct output.
If you then decide you want to model strong milky tea or weak black tea you need to create more unit processes…
Most LCA softwares allow you to replace the values in the unit processes with parameters, which you can then vary externally to create scenarios. Choosing, typing out and remembering parameters can be a boring and time consuming task though. With Lcopt it’s all done automatically in the background. Every link in the model is given a parameter instead of a value. By default, the model is ‘fully parameterised’.
This makes creating the model a lot quicker and the modelling and analysis a lot more flexible.
 This provides a value for each link in a given scenario.
You can either enter an explicit value, or you can tell the model to generate its own value based on a function/formula. To help this you can also create global parameters to use in these functions.
For example, the amount of electrity (kWh) a kettle uses to boil a litre of water can be determined by it’s power rating (kW) and the amount of time it takes to boil (minutes).
You can create a global parameter for power rating and another one for boil minutes. You can then tell the model to generate a value for the input of electricity to kettle using the function power_rating * boil_mins / 60
.
Now you can easily compare different kettles in your cup of tea LCA.
You can use any parameter in a function, including inputs to any process. For example, if you want to add transport of an input (in units of kg.km) you could create a ‘transport distance’ parameter, and tell Lcopt to work out the amount of ‘transport’ required by multiplying the amount of your input (kg) by the distance (km). Now whenever you change the amount of your input, the transport of that input automatically changes too.
Once you have a ‘default’ parameter set you can duplicate it and edit whichever parameters you need to describe a new scenario.
For example you can change the parameter for the input of milk to teacup to zero to model a black tea scenario, or increase the input of tea leaves to teapot to model a strong tea scenario.
How do you analyse a model?¶
To analyse the model you have two options.
If you have a copy of SimaPro and are using lcopt as an easy way to generate a fully parameterised foreground model, you can export the model as a SimaPro .csv file and the parameter sets as an .xlsx file.
The second option is to run the analysis directly from Lcopt. This uses Brightway to do the calcuations. Brightway is an open source LCA software also written in Python.
When you analyse a model from within Lcopt for the first time it creates a Brightway project. The foreground model is stored as it’s own separate database within the project, with links to the biosphere and technosphere databases.
Lcopt calculates all of the parameters for each parameter set and then modifies the exchanges in the Brightway database before running the LCA calculations for that scenario.
You can choose from over 700 different impact assessment methods (don’t worry, there is a search function), and use as many as you like in one go. The default set is climate change (IPCC 2013 100a) and human toxicity (USEtox).
Lcopt’s results screens contain bar charts, pie charts, tree diagrams, hotspot charts and tables. Charts can be exported to image files (300 dpi .png with transparent backgrounds) and the tables exported as Excel files.
Once the analysis has been run you can open the model in Brightway as you would any other project if you need to conduct a more detailed analysis. Note however that Brightway will only ‘remember’ the last scenario you ran so to do this it might be best to create your model with only one parameter set.
How do I get started?¶
To get started, follow the installation instructions on the next page, learn how to launch lcopt in your browser in the usage instructions then check out the video runthrough to see how to make the cup of tea model using Lcopt.


Spark AR Studio is an augmented reality platform for Mac & Windows that allows you to somewhat easily create AR effects for mobile cameras. Think of it like Photoshop or Sketch, but for AR.
Basically, PowerPoint is a presentation program developed by Microsoft. However, I saw one of my friends use this to do more creative thing beyond slide.
"TouchDesigner visualizes data flow through each step of the process. Perceive behavior at a glance and get instant visual feedback from your creation. Start thinking visually."


Notice the double quotes below
"$@"
Without these any quoted arguments containing spaces will not be properly passed along.
function env_on_import_db() {
call_plugin mysql import_db "$@"
}
Or shift the first argument and pass the rest:
function remote_ssh_by_environment() {
local environment_id="$1"
eval $(get_config_as env_auth "environments.$environment_id.ssh")
[[ "$env_auth" ]] || return 1
echo ssh -t -o BatchMode=yes "$env_auth" "${@:2}"
}
Follow this pattern for best results.
function lorem_echo_color() {
local is_colorblind="$1"
[[ "$is_colorblind" == true ]] && echo "Observer is colorblind." && return 1
echo "blue" && return 0
}
if color=$(lorem_echo_color); then
echo "The color has been set to: $color"
fi
function parent_caller() {
local color
! color=$(lorem_echo_color) && fail_because "$color" && return 1
}
# In this example `lorem_echo_color` is not being called from inside a parent function.
! color=$(lorem_echo_color) && fail_because "$color" && exit_with_failure
# Use this pattern for an empty or default value
color=$(lorem_echo_color) || color=''
color=$(lorem_echo_color) || color='some default'
Points to take note of:
fail_because
inside of functions that echo their results. The message will get lost due due to the subshell aspect.fail_because
by the caller.local
on the same line as the color=
assignment or this will cause the return 1
to be lost.


Illuaminate is a series of tools for working with Lua source code, providing ways of making your codebase clearer and easier to understand. It's currently rather bare bones, and still at a POC stage, but hopefully will expand and become more useful as it continues to develop.
For more information, including how to build and example usage, please see the GitHub repository.
Loading Illuaminate...


coming soon, winter quarter 2015!
Back to top of page
Github: https://github.com/Tsuruko
Email: liu.mona.c@gmail.com


Corona Extra NO.1
14.50
Corona Extra NO.2
Corona Extra NO.3
Corona Extra NO.4
Corona Extra NO.5
Corona Extra NO.6
Corona Extra NO.7
Corona Extra NO.8


The Relations tool enables you to draw connections between annotations in a text, and tag the connection in order to make a statement about its type.
How to Use the Relations Tool
Switch to Relations annotation mode in the toolbar. To start a connection, click on an annotation once (or click and hold if your prefer). Move the mouse to the target annotation and click again (or release the mouse, if you started by click-and-hold).
Type a tag into the editor box that pops up and hit Enter to confirm and create the connection. Alternatively, click the checkmark icon. If you want to cancel and delete the connection instead, hit Escape or click the trashcan icon.
Exporting Relations Data
Recogito can export relation data to multiple formats. Go to the downloads page
Network Exports
If relations exist in your document, the downloads page includes an additional box with network-specific download options. Currently, there is only one option: CSV node and edge lists compatible with the Gephi graph visualization platform.
Note that each network node corresponds to one annotation. If you annotate multiple occurences of the same place in the text, then each will be a node in the graph. We may offer aggregated exports later, where occurrences are grouped, so that each place is represented as one node, even if annotated multiple times.
Embedded Exports
In addition, relations are also embedded into the TEI export, represented as
<relation>
elements in the document header.


Card 1
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with
Kiwis are oval shaped with a brownish outer skin. The flesh is bright green and juicy with


Laws need rethink to stop ‘darker’ web emerging, inventor tells the world
Sir Tim Berners-Lee said the web is ‘at a tipping point’.
Laws and regulations must be rethought in order to prevent the web from becoming “darker” for future generations, the world wide web’s inventor Sir Tim Berners-Lee has said.
Launching his foundation’s Contract for the Web on Monday, the British computer scientist warned that the web is at a “tipping point” as threats such as disinformation and privacy invasions prevail online.
“Never before has the web’s power for good been under more threat,” he explained in Berlin.
“Just as in the offline world, we’re seeing walls go up around the web.”
Sir Tim – who celebrated the 30th anniversary of his invention this year – said a deep digital divide threatens to be “one of the greatest sources of inequality in our world” which governments, companies and citizens should collectively work to close fast.
“Just as more people come online, there are some in power who want to stop people communicating with each other and want to divide humanity,” he continued.
“When governments successfully shut down access to the web, they violate people’s fundamental rights to communicate, organise and debate.”
Sir Tim’s World Wide Web Foundation has put together a Contract for the Web, calling on governments, companies and the public to ensure the web is a safe, free and open platform for all.
The commitment has been backed by mover 160 organisations, including Google and Facebook, which sets out nine key principles.
During his speech, Sir Tim also took aim at technology companies who fail to halt the spread of misinformation on their platforms, saying lack of action to address such issues makes the world “more polarised, more dysfunctional, and it also undermines our trust in information, sows division and undermines democracy”.
“The web is at a tipping point – if it is to be a force for the good, we must act now,” he urged.
“If we fail to tackle the threats that we face, we risk a digital dystopia, we cannot leave the next generation a web and a world that is darker than the one we have today.
“The web’s challenges are complex and can’t be solved by any one party – we need to rethink laws, regulations and technology design, and human behaviour, that means everyone, governments, companies, civil society and citizens must co-operate in this fight for the future.”


Ask questions or make suggestions about marketing, business development, or anything else relevant. This is the channel to discuss topics with Komodo team.
100 messages
Before 05-Dec-19 12:00 AM
phm8706-May-19 05:00 PM
So I may use another block explorer code in the future. Mine works but I don t like to use unmaintained/old code
Thank you. Please feel free to contact me for early tests
An obscure cryptocurrency that first started getting noticed during the 2014 altcoin boom is showing itself a true diamond in the rough.
seems FLO is used as it can handle 1024 bytes in opreturn
komodo chains can handle 10000 bytes in opreturn
Daniel CP09-May-19 09:04 AM
That's per transaction?
dukeleto09-May-19 09:19 AM
yes
FLO almost used DPoW, but didn't. I am not sure they have 51% attack prevention, seems pretty bad idea for overstock.com to build on top of FLO, but what do I know
polycryptoblog09-May-19 09:23 AM
They went with self referential 51% protection
Daniel CP09-May-19 09:31 AM
yeah the article says they have some rule that prevents re-orgs beyond a certain number of blocks
I will email our PR agency, I'm genuinely curious how projects like that get such lengthy coverage on Coin Desk
Blockchain Startup RedFOX Labs Levels Up the World’s Fastest-Growing eSports Region
Mentions Komodo techs
Ok didn't notice I was late:-)
siu - Chainmakers13-May-19 01:28 PM
Hi, is there someone from KMD at consensus?
@Team Admin
gcharang13-May-19 01:51 PM
@polycryptoblog might be at the same venue @siu - Chainmakers
siu - Chainmakers13-May-19 01:55 PM
thanks
Audo13-May-19 02:34 PM
Are you there @siu - Chainmakers ?
siu - Chainmakers13-May-19 02:35 PM
no, was just wondering if someone was there.
Audo13-May-19 02:38 PM
ok, I PM'ed @polycryptoblog to take some pics
so we can be there in spirit
siu - Chainmakers13-May-19 03:26 PM
hehehe, great.
I already contacted poly
Malti13-May-19 09:15 PM
I’m really looking forward to see some rebranded materials. How is it coming along? Y’all were in last phase right?
Audo13-May-19 10:31 PM
yep! It's looking good. We are happy about our messaging materials. It will be really strong.
We will upgrade our 4 technology pillars to something else
Plus the product launches of blockchain builder + new mobile wallet
Plus we will rebrand the CC technology
1
Malti14-May-19 04:30 AM
Sounds promising. You are also lucky in a sense that you are potentially able to time the release together with an uptrend market
1
designer14-May-19 04:38 AM
strategy must be perfect. opportunities are uncommon.
komodo have to fight the giant it dinosaurs.
1
richardt14-May-19 12:21 PM
@Malti Yes, hoping the team could take advantage of this opportunity!
Dr Debt14-May-19 07:13 PM
We doing another countdown video? Lol
richardt14-May-19 10:20 PM
I'm really hoping countdown and brown sheets announcement again
1
Dr Debt15-May-19 05:02 PM
PTYX16-May-19 02:45 AM
3
1
@richardt
The men, the myth, the legends
polycryptoblog16-May-19 02:59 AM
Lol
Good times,
Dr Debt16-May-19 03:34 AM
Ya know ppl gave the kmd team hell over the ol brownsheet but you guys accomplished everything you said you would. So for that reason alone I’m happy to be on this ride.
But let’s get market makers to push it up a few 10k sats and start a frenzy of fomo over the rebrand.
Get the bottom set at 0.002 and let marketing push it up to 0.03, where it belongs
PTYX16-May-19 03:46 AM
The team and project altogether has come a long way
Dr Debt16-May-19 03:59 AM
For sure. I have a lot of respect for this team.
1
Cabey16-May-19 04:00 AM
Anyone got a link to the livestream? I'd love to take another look. I barely knew KMD back then
Dr Debt16-May-19 04:03 AM
I remember watching it dump as I was thinking: these ppl are crazy(edited)
PTYX16-May-19 04:03 AM
The video was taken down a long time ago
The news were good at the time, there was just a problem on the delivery via the video
Yeah, unfortunately the price took a hit after that.
You can tell anyone if you need to, but never anyone else.
there is actually a good standard to do so.
the most appropriate middle road between "not telling anyone" and " telling everyone," that's the company.
the best entrepreneurs must know this.
because all great companies are built on hidden secrets that are hidden from others. a great company is nothing short of a plan to change the world. If you shared a hidden secret that only you knew, the other party is now a conspirator.(edited)
designer16-May-19 06:16 AM
"beware the quiet man.
for while others speak, he watches.
and while others act, he plans.
and when they finally rest... he strikes."
-anonymous-
movie Vice, 2018
Dr Debt16-May-19 02:15 PM
@designer what are u talking about? Lol
1
Cryptoon16-May-19 03:40 PM
It’s @jl777c’s philosophical account, isnt it obvious?
1
designer16-May-19 04:38 PM
you can't separate from society and become independent. believing that alone is enough is not a characteristic of a strong individual, but just a characteristic for someone who misunderstood public worship(or jeering) as truth. the biggest risk for a start-up is to be so convinced of his own myths that he becomes a lunatic. the same risk of penetrating all enterprises is to mistake the awakening as wisdom after losing all meaning myths.
designer16-May-19 05:24 PM
Engineers always try to make great products that are 'sold automatically'. But if anyone says this about a real product, he must be lying. He is either mistaken (in lying to himself) or willing to sell something (without thinking so).
In the world of business, this is often said to warn of the opposite. "The best product doesn't necessarily win." Economists say it's because of 'path dependence.' In other words, certain historical environments, independent of objective quality, can determine which products will be widely accepted. True, but that doesn't mean that the key arrangement we use now is purely accidental. Rather, it is better to think of distribution as a necessary part of the product. If you have invented something new, but you have not invented a way to sell it effectively, your business will be terrible. No matter how good the product is, it's no use.(edited)
3
Outstanding sales and distribution can create monopoly in itself. Even if there is no product differentiation at all. No matter how powerful the product is (even if it fits into existing habits and those who have tried it themselves immediately come to like it), it should be backed up with a strong distribution plan.
jl777c16-May-19 05:36 PM
komodo is an open source project that doesnt charge for the software
distribution is via free downloads over the internet, which seems pretty competitive
I see a lot of questions about if KMD doesnt charge any KMD for usage of its platform “why should anybody hodl KMD”. Implicit in the…
1
designer16-May-19 05:55 PM
Until now, there seems to be no competition company for the tax-free Komodo platform. I think it's an monopoly position. James, what do you think?
jl777c16-May-19 05:58 PM
there are only half a dozen multichain platforms, and the rest are doing the most monetizations they can think of. project lockin, deposits, gas, etc
so yes, it seems we are uniquely positioned
designer16-May-19 06:11 PM
you've probably heard of the word 'first mover advantage.' a company that enters a market for the first time can gain significant market share while other competitors are rushing around. but moving first is just a strategy, not a goal. what really matters is to generate cash flows in the future.
so it's no use being the first mover if someone follows in and takes the top spot. I'd rather be a 'last mover' than that. that is, the last great development in a particular market is to enjoy exclusive profit for several years, even decades. the way to do so is to take over a small niche, then expand its scale from there and move toward an ambitious long-term vision. business is similar to chess in this respect. Jose Raul caplablanca, who became the "grandmaster" of chess players, said. to succeed, "Study the last card before anything else."
I support Komodo's journey.
jl777c16-May-19 06:13 PM
plz read my post about tokenomics
komodo is not a company
we are not selling, though we do need to make sure the projects out there know komodo exists
that alone should be sufficient for the intelligent teams to make the komodo decision
Dr Debt16-May-19 11:13 PM
The best product doesn’t always win. The best presentation wins. I understand you don’t see this as a company but to average investors it is. I’m just glad that you guys work off the beaten path that others abandoned long ago.
yorklab16-May-19 11:49 PM
@Dr Debt You are right about the best presentation winning. I think we'll probably see something when there's product ready to present.
Dr Debt17-May-19 12:05 AM
I do as well. If there’s a rebrand coming though it needs to be pumped up major.
Give this project the value it deserves, so to speak
2
2
yorklab17-May-19 12:36 AM
I agree. You want as many eyes as possible looking BEFORE any big announcement. Like perhaps a lot of volume and price movement causing interest from outside the community. I guess we'll see how it all plays out.
Dr Debt17-May-19 12:45 AM
I believe in terms of value kmd could easily take a top 10 position as is with a good amount of marketing be it social media or a series of press releases. Remember the average investor doesn’t understand or even want to understand how this works, but if they think they can 100x on it they’ll shill it to every soul alive.
That’s exactly how I found out about it. Hype around a countdown. I stayed because of what was said during that video.
Make mountains out of molehills and get value pumped before rebrand, then when rebrand hits, roll out more amazing “announcements” and watch the momentum shift.
allbits17-May-19 12:56 AM
Not needed
Waste of resources to focus on "marketing" that's all about pumping ur bagz. Resources are best used to drive developer talent and actual end user engagement of dapps. That's why I love how the "marketing" is done on this project. They've always had the right priorities, even tho the drive-by analysts consistently drop in insisting on a better way to do things.
yorklab17-May-19 01:01 AM
@allbits I do actually agree with all you just stated. Only saying "when" they do some major marketing. I'm sure some marketing is part of the plan.
designer17-May-19 01:03 AM
Komodo should strongly identify that it is an irreplaceable open-source project.
1
Dr Debt17-May-19 01:59 AM
It’s not about pumping my bags, it’s about establishing a strong point of value.
allbits17-May-19 02:08 AM
"establishing a strong point of value" - I don't know what that means
Dr Debt17-May-19 02:13 AM
With the problems being solved, it is my personal opinion that this coin should be, at its lowest point, 0.001 btc at its floor. This is what I mean by point of value. Investors look at the $$
allbits17-May-19 02:15 AM
That's what I suspected
Dr Debt17-May-19 02:17 AM
No worries. No one seems to care about the investors making anything, so I’ll just leave it be. Came to see if I could help out in any way with marketing, got “we don’t care about price” y’all be easy.
allbits17-May-19 02:18 AM
I think you mean to say "speculators", not investors.
Dr Debt17-May-19 02:19 AM
If I drop 100k into a project, I’m invested.
Like I said no worries
designer17-May-19 02:21 AM
be frankly, what is the difference between investment and speculation?
What I do is investment?
What other people do is speculation?
Dr Debt17-May-19 02:24 AM
You guys just keep at it. I’m gonna start working on my investment strategy going forward.
allbits17-May-19 02:28 AM
Yeah, might wanna choose from the many projects that are interested in devoting significant resources to raising profile among speculators. Nothing wrong with that of course. I've been here four years and that's definitely not the way it's done here. Prices in crypto are largely dominated by short term speculation and komodo doesn't seem to interest those folks as much as other coins do.


These are the simple APIs for the variety of resources made available via the API Specification Toolbox.
These are the simple APIs for the variety of resources made available via the API Specification Toolbox.
| Specifications | Documentation | |
| Extensions | Documentation | |
| Services | Documentation | |
| Tools | Documentation | |
| Sectors | Documentation | |
| Videos | Documentation | |
| Projects | Documentation |


Select Product
Search

Get All Casses
ENDPOINT 1:
myTransware Test
myTransware Model
ENDPOINT 2:
myTransware Test
myTransware Model
Popular Keys
Clear
Selected Keys
Compare
No
Popular Selected Keys
Test Cases
No
Name
Close
Output Table
CLOSE
Search History
Name:
Custom Query
Selected Attribute
Value
Include/Exclude
SEARCH
Search History
No.
Last Search
Search Query
Name
Select Attributes
Attribute
Category
Value
Number Of Records


{% load staticfiles %}
Back to Video List
You do not have the latest version of Flash installed. Please visit this link to download it: http://www.adobe.com/products/flashplayer/