25:null 26:["$","title",null,{"children":"Playing with PlantUML in Observable | Figay | Observable"}] 2b:Te8f,plantuml = { async function plantuml(texts) { let config = { ...plantuml_config }; let text = texts.raw[0] + "", i = 0, n = arguments.length; if (arguments.length > 1 && arguments[1].config) { //look for local config object at position 1 only! //overwrite global config Object.assign(config, arguments[1].config); i++; text = texts.raw[1] + ""; } while (++i < n) { text += arguments[i] + "" + texts.raw[i]; } let uml = text.trim(); let svgDOMString = await render(uml, config); const container = document.createElement("div"); container.innerHTML = svgDOMString; let svg = d3.select(container).select("svg"); let g = svg.select("g"); //initial sizes; let w = Number.parseInt(svg.style("width")); let h = Number.parseInt(svg.style("height")); //let aspect = w / h; //scale factor (to reduce larger diagrams) let scale = Math.max(1, w / config.maxWidth, h / config.maxHeight); //Use the smaller of the available width/height and the diagram width/height let width_ = w / scale; let height_ = h / scale; //apply d3 zoom for panning and zooming //only on large diagrams if (scale > 1 && config.panAndZoom) { svg.call( d3 .zoom() .extent([[0, 0], [width_, height_]]) .scaleExtent([1, Math.ceil(scale)]) .on("zoom", function() { g.attr("transform", d3.event.transform); }) ); } //svg.attr("viewBox", [0, 0, width_, height_]); svg.attr("preserveAspectRatio", "xMidYMid meet"); if (scale > 1) { svg.style("width", Math.max(width_, config.maxWidth) + "px"); svg.attr("width", Math.max(width_, config.maxWidth) + "px"); } else { svg.style("width", width_ + "px"); svg.attr("width", width_ + "px"); } svg.attr("height", height_ + "px"); svg.style("height", height_ + "px"); return container; } function compress(s) { //UTF8 s = unescape(encodeURIComponent(s)); var compressed = zip_deflate(s, 9); return compressed; } async function render(uml, config) { var url = config.server + "/svg/" + encode64(compress(uml)); if (!config.cache) { url += '?nocache=' + Date.now(); } const svg = await fetch(url).then(response => response.text()); return stripXmlPreamble(svg); } function stripXmlPreamble(str) { return str.replace(/^<\?xml version=\"1.0\".+\?>/, '').replace(/^\n/, ''); } function encode64(data) { let r = ""; for (let i = 0; i < data.length; i += 3) { if (i + 2 == data.length) { r += append3bytes(data.charCodeAt(i), data.charCodeAt(i + 1), 0); } else if (i + 1 == data.length) { r += append3bytes(data.charCodeAt(i), 0, 0); } else { r += append3bytes( data.charCodeAt(i), data.charCodeAt(i + 1), data.charCodeAt(i + 2) ); } } return r; } function append3bytes(b1, b2, b3) { let c1 = b1 >> 2; let c2 = ((b1 & 0x3) << 4) | (b2 >> 4); let c3 = ((b2 & 0xF) << 2) | (b3 >> 6); let c4 = b3 & 0x3F; let r = ""; r += encode6bit(c1 & 0x3F); r += encode6bit(c2 & 0x3F); r += encode6bit(c3 & 0x3F); r += encode6bit(c4 & 0x3F); return r; } function encode6bit(b) { if (b < 10) { return String.fromCharCode(48 + b); } b -= 10; if (b < 26) { return String.fromCharCode(65 + b); } b -= 26; if (b < 26) { return String.fromCharCode(97 + b); } b -= 26; if (b == 0) { return '-'; } if (b == 1) { return '_'; } return '?'; } return plantuml; }2c:Tcfe5,zip_deflate = { /* Copyright (C) 1999 Masanao Izumo * Version: 1.0.1 * LastModified: Dec 25 1999 */ /* Interface: * data = zip_deflate(src); */ /* constant parameters */ var zip_WSIZE = 32768; // Sliding Window size var zip_STORED_BLOCK = 0; var zip_STATIC_TREES = 1; var zip_DYN_TREES = 2; /* for deflate */ var zip_DEFAULT_LEVEL = 6; var zip_FULL_SEARCH = true; var zip_INBUFSIZ = 32768; // Input buffer size var zip_INBUF_EXTRA = 64; // Extra buffer var zip_OUTBUFSIZ = 1024 * 8; var zip_window_size = 2 * zip_WSIZE; var zip_MIN_MATCH = 3; var zip_MAX_MATCH = 258; var zip_BITS = 16; // for SMALL_MEM var zip_LIT_BUFSIZE = 0x2000; var zip_HASH_BITS = 13; // for MEDIUM_MEM // var zip_LIT_BUFSIZE = 0x4000; // var zip_HASH_BITS = 14; // for BIG_MEM // var zip_LIT_BUFSIZE = 0x8000; // var zip_HASH_BITS = 15; if(zip_LIT_BUFSIZE > zip_INBUFSIZ) alert("error: zip_INBUFSIZ is too small"); if((zip_WSIZE<<1) > (1< zip_BITS-1) alert("error: zip_HASH_BITS is too large"); if(zip_HASH_BITS < 8 || zip_MAX_MATCH != 258) alert("error: Code too clever"); var zip_DIST_BUFSIZE = zip_LIT_BUFSIZE; var zip_HASH_SIZE = 1 << zip_HASH_BITS; var zip_HASH_MASK = zip_HASH_SIZE - 1; var zip_WMASK = zip_WSIZE - 1; var zip_NIL = 0; // Tail of hash chains var zip_TOO_FAR = 4096; var zip_MIN_LOOKAHEAD = zip_MAX_MATCH + zip_MIN_MATCH + 1; var zip_MAX_DIST = zip_WSIZE - zip_MIN_LOOKAHEAD; var zip_SMALLEST = 1; var zip_MAX_BITS = 15; var zip_MAX_BL_BITS = 7; var zip_LENGTH_CODES = 29; var zip_LITERALS =256; var zip_END_BLOCK = 256; var zip_L_CODES = zip_LITERALS + 1 + zip_LENGTH_CODES; var zip_D_CODES = 30; var zip_BL_CODES = 19; var zip_REP_3_6 = 16; var zip_REPZ_3_10 = 17; var zip_REPZ_11_138 = 18; var zip_HEAP_SIZE = 2 * zip_L_CODES + 1; var zip_H_SHIFT = parseInt((zip_HASH_BITS + zip_MIN_MATCH - 1) / zip_MIN_MATCH); /* variables */ var zip_free_queue; var zip_qhead, zip_qtail; var zip_initflag; var zip_outbuf = null; var zip_outcnt, zip_outoff; var zip_complete; var zip_window; var zip_d_buf; var zip_l_buf; var zip_prev; var zip_bi_buf; var zip_bi_valid; var zip_block_start; var zip_ins_h; var zip_hash_head; var zip_prev_match; var zip_match_available; var zip_match_length; var zip_prev_length; var zip_strstart; var zip_match_start; var zip_eofile; var zip_lookahead; var zip_max_chain_length; var zip_max_lazy_match; var zip_compr_level; var zip_good_match; var zip_nice_match; var zip_dyn_ltree; var zip_dyn_dtree; var zip_static_ltree; var zip_static_dtree; var zip_bl_tree; var zip_l_desc; var zip_d_desc; var zip_bl_desc; var zip_bl_count; var zip_heap; var zip_heap_len; var zip_heap_max; var zip_depth; var zip_length_code; var zip_dist_code; var zip_base_length; var zip_base_dist; var zip_flag_buf; var zip_last_lit; var zip_last_dist; var zip_last_flags; var zip_flags; var zip_flag_bit; var zip_opt_len; var zip_static_len; var zip_deflate_data; var zip_deflate_pos; /* constant tables */ var zip_extra_lbits = new Array( 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0); var zip_extra_dbits = new Array( 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13); var zip_extra_blbits = new Array( 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7); var zip_bl_order = new Array( 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15); var zip_configuration_table = new Array( new zip_DeflateConfiguration(0, 0, 0, 0), new zip_DeflateConfiguration(4, 4, 8, 4), new zip_DeflateConfiguration(4, 5, 16, 8), new zip_DeflateConfiguration(4, 6, 32, 32), new zip_DeflateConfiguration(4, 4, 16, 16), new zip_DeflateConfiguration(8, 16, 32, 32), new zip_DeflateConfiguration(8, 16, 128, 128), new zip_DeflateConfiguration(8, 32, 128, 256), new zip_DeflateConfiguration(32, 128, 258, 1024), new zip_DeflateConfiguration(32, 258, 258, 4096)); /* objects (deflate) */ function zip_DeflateCT() { this.fc = 0; // frequency count or bit string this.dl = 0; // father node in Huffman tree or length of bit string } function zip_DeflateTreeDesc() { this.dyn_tree = null; // the dynamic tree this.static_tree = null; // corresponding static tree or NULL this.extra_bits = null; // extra bits for each code or NULL this.extra_base = 0; // base index for extra_bits this.elems = 0; // max number of elements in the tree this.max_length = 0; // max bit length for the codes this.max_code = 0; // largest code with non zero frequency } /* Values for max_lazy_match, good_match and max_chain_length, depending on * the desired pack level (0..9). The values given below have been tuned to * exclude worst case performance for pathological files. Better values may be * found for specific files. */ function zip_DeflateConfiguration(a, b, c, d) { this.good_length = a; // reduce lazy search above this match length this.max_lazy = b; // do not perform lazy search above this match length this.nice_length = c; // quit search above this match length this.max_chain = d; } function zip_DeflateBuffer() { this.next = null; this.len = 0; this.ptr = new Array(zip_OUTBUFSIZ); this.off = 0; } /* routines (deflate) */ function zip_deflate_start(level) { var i; if(!level) level = zip_DEFAULT_LEVEL; else if(level < 1) level = 1; else if(level > 9) level = 9; zip_compr_level = level; zip_initflag = false; zip_eofile = false; if(zip_outbuf != null) return; zip_free_queue = zip_qhead = zip_qtail = null; zip_outbuf = new Array(zip_OUTBUFSIZ); zip_window = new Array(zip_window_size); zip_d_buf = new Array(zip_DIST_BUFSIZE); zip_l_buf = new Array(zip_INBUFSIZ + zip_INBUF_EXTRA); zip_prev = new Array(1 << zip_BITS); zip_dyn_ltree = new Array(zip_HEAP_SIZE); for(i = 0; i < zip_HEAP_SIZE; i++) zip_dyn_ltree[i] = new zip_DeflateCT(); zip_dyn_dtree = new Array(2*zip_D_CODES+1); for(i = 0; i < 2*zip_D_CODES+1; i++) zip_dyn_dtree[i] = new zip_DeflateCT(); zip_static_ltree = new Array(zip_L_CODES+2); for(i = 0; i < zip_L_CODES+2; i++) zip_static_ltree[i] = new zip_DeflateCT(); zip_static_dtree = new Array(zip_D_CODES); for(i = 0; i < zip_D_CODES; i++) zip_static_dtree[i] = new zip_DeflateCT(); zip_bl_tree = new Array(2*zip_BL_CODES+1); for(i = 0; i < 2*zip_BL_CODES+1; i++) zip_bl_tree[i] = new zip_DeflateCT(); zip_l_desc = new zip_DeflateTreeDesc(); zip_d_desc = new zip_DeflateTreeDesc(); zip_bl_desc = new zip_DeflateTreeDesc(); zip_bl_count = new Array(zip_MAX_BITS+1); zip_heap = new Array(2*zip_L_CODES+1); zip_depth = new Array(2*zip_L_CODES+1); zip_length_code = new Array(zip_MAX_MATCH-zip_MIN_MATCH+1); zip_dist_code = new Array(512); zip_base_length = new Array(zip_LENGTH_CODES); zip_base_dist = new Array(zip_D_CODES); zip_flag_buf = new Array(parseInt(zip_LIT_BUFSIZE / 8)); } function zip_deflate_end() { zip_free_queue = zip_qhead = zip_qtail = null; zip_outbuf = null; zip_window = null; zip_d_buf = null; zip_l_buf = null; zip_prev = null; zip_dyn_ltree = null; zip_dyn_dtree = null; zip_static_ltree = null; zip_static_dtree = null; zip_bl_tree = null; zip_l_desc = null; zip_d_desc = null; zip_bl_desc = null; zip_bl_count = null; zip_heap = null; zip_depth = null; zip_length_code = null; zip_dist_code = null; zip_base_length = null; zip_base_dist = null; zip_flag_buf = null; } function zip_reuse_queue(p) { p.next = zip_free_queue; zip_free_queue = p; } function zip_new_queue() { var p; if(zip_free_queue != null) { p = zip_free_queue; zip_free_queue = zip_free_queue.next; } else p = new zip_DeflateBuffer(); p.next = null; p.len = p.off = 0; return p; } function zip_head1(i) { return zip_prev[zip_WSIZE + i]; } function zip_head2(i, val) { return zip_prev[zip_WSIZE + i] = val; } /* put_byte is used for the compressed output, put_ubyte for the * uncompressed output. However unlzw() uses window for its * suffix table instead of its output buffer, so it does not use put_ubyte * (to be cleaned up). */ function zip_put_byte(c) { zip_outbuf[zip_outoff + zip_outcnt++] = c; if(zip_outoff + zip_outcnt == zip_OUTBUFSIZ) zip_qoutbuf(); } /* Output a 16 bit value, lsb first */ function zip_put_short(w) { w &= 0xffff; if(zip_outoff + zip_outcnt < zip_OUTBUFSIZ - 2) { zip_outbuf[zip_outoff + zip_outcnt++] = (w & 0xff); zip_outbuf[zip_outoff + zip_outcnt++] = (w >>> 8); } else { zip_put_byte(w & 0xff); zip_put_byte(w >>> 8); } } /* ========================================================================== * Insert string s in the dictionary and set match_head to the previous head * of the hash chain (the most recent string with same hash key). Return * the previous length of the hash chain. * IN assertion: all calls to to INSERT_STRING are made with consecutive * input characters and the first MIN_MATCH bytes of s are valid * (except for the last MIN_MATCH-1 bytes of the input file). */ function zip_INSERT_STRING() { zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[zip_strstart + zip_MIN_MATCH - 1] & 0xff)) & zip_HASH_MASK; zip_hash_head = zip_head1(zip_ins_h); zip_prev[zip_strstart & zip_WMASK] = zip_hash_head; zip_head2(zip_ins_h, zip_strstart); } /* Send a code of the given tree. c and tree must not have side effects */ function zip_SEND_CODE(c, tree) { zip_send_bits(tree[c].fc, tree[c].dl); } /* Mapping from a distance to a distance code. dist is the distance - 1 and * must not have side effects. dist_code[256] and dist_code[257] are never * used. */ function zip_D_CODE(dist) { return (dist < 256 ? zip_dist_code[dist] : zip_dist_code[256 + (dist>>7)]) & 0xff; } /* ========================================================================== * Compares to subtrees, using the tree depth as tie breaker when * the subtrees have equal frequency. This minimizes the worst case length. */ function zip_SMALLER(tree, n, m) { return tree[n].fc < tree[m].fc || (tree[n].fc == tree[m].fc && zip_depth[n] <= zip_depth[m]); } /* ========================================================================== * read string data */ function zip_read_buff(buff, offset, n) { var i; for(i = 0; i < n && zip_deflate_pos < zip_deflate_data.length; i++) buff[offset + i] = zip_deflate_data.charCodeAt(zip_deflate_pos++) & 0xff; return i; } /* ========================================================================== * Initialize the "longest match" routines for a new file */ function zip_lm_init() { var j; /* Initialize the hash table. */ for(j = 0; j < zip_HASH_SIZE; j++) // zip_head2(j, zip_NIL); zip_prev[zip_WSIZE + j] = 0; /* prev will be initialized on the fly */ /* Set the default configuration parameters: */ zip_max_lazy_match = zip_configuration_table[zip_compr_level].max_lazy; zip_good_match = zip_configuration_table[zip_compr_level].good_length; if(!zip_FULL_SEARCH) zip_nice_match = zip_configuration_table[zip_compr_level].nice_length; zip_max_chain_length = zip_configuration_table[zip_compr_level].max_chain; zip_strstart = 0; zip_block_start = 0; zip_lookahead = zip_read_buff(zip_window, 0, 2 * zip_WSIZE); if(zip_lookahead <= 0) { zip_eofile = true; zip_lookahead = 0; return; } zip_eofile = false; /* Make sure that we always have enough lookahead. This is important * if input comes from a device such as a tty. */ while(zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) zip_fill_window(); /* If lookahead < MIN_MATCH, ins_h is garbage, but this is * not important since only literal bytes will be emitted. */ zip_ins_h = 0; for(j = 0; j < zip_MIN_MATCH - 1; j++) { // UPDATE_HASH(ins_h, window[j]); zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[j] & 0xff)) & zip_HASH_MASK; } } /* ========================================================================== * Set match_start to the longest match starting at the given string and * return its length. Matches shorter or equal to prev_length are discarded, * in which case the result is equal to prev_length and match_start is * garbage. * IN assertions: cur_match is the head of the hash chain for the current * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 */ function zip_longest_match(cur_match) { var chain_length = zip_max_chain_length; // max hash chain length var scanp = zip_strstart; // current string var matchp; // matched string var len; // length of current match var best_len = zip_prev_length; // best match length so far /* Stop when cur_match becomes <= limit. To simplify the code, * we prevent matches with the string of window index 0. */ var limit = (zip_strstart > zip_MAX_DIST ? zip_strstart - zip_MAX_DIST : zip_NIL); var strendp = zip_strstart + zip_MAX_MATCH; var scan_end1 = zip_window[scanp + best_len - 1]; var scan_end = zip_window[scanp + best_len]; /* Do not waste too much time if we already have a good match: */ if(zip_prev_length >= zip_good_match) chain_length >>= 2; // Assert(encoder->strstart <= window_size-MIN_LOOKAHEAD, "insufficient lookahead"); do { // Assert(cur_match < encoder->strstart, "no future"); matchp = cur_match; /* Skip to next match if the match length cannot increase * or if the match length is less than 2: */ if(zip_window[matchp + best_len] != scan_end || zip_window[matchp + best_len - 1] != scan_end1 || zip_window[matchp] != zip_window[scanp] || zip_window[++matchp] != zip_window[scanp + 1]) { continue; } /* The check at best_len-1 can be removed because it will be made * again later. (This heuristic is not always a win.) * It is not necessary to compare scan[2] and match[2] since they * are always equal when the other bytes match, given that * the hash keys are equal and that HASH_BITS >= 8. */ scanp += 2; matchp++; /* We check for insufficient lookahead only every 8th comparison; * the 256th check will be made at strstart+258. */ do { } while(zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && zip_window[++scanp] == zip_window[++matchp] && scanp < strendp); len = zip_MAX_MATCH - (strendp - scanp); scanp = strendp - zip_MAX_MATCH; if(len > best_len) { zip_match_start = cur_match; best_len = len; if(zip_FULL_SEARCH) { if(len >= zip_MAX_MATCH) break; } else { if(len >= zip_nice_match) break; } scan_end1 = zip_window[scanp + best_len-1]; scan_end = zip_window[scanp + best_len]; } } while((cur_match = zip_prev[cur_match & zip_WMASK]) > limit && --chain_length != 0); return best_len; } /* ========================================================================== * Fill the window when the lookahead becomes insufficient. * Updates strstart and lookahead, and sets eofile if end of input file. * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0 * OUT assertions: at least one byte has been read, or eofile is set; * file reads are performed for at least two bytes (required for the * translate_eol option). */ function zip_fill_window() { var n, m; // Amount of free space at the end of the window. var more = zip_window_size - zip_lookahead - zip_strstart; /* If the window is almost full and there is insufficient lookahead, * move the upper half to the lower one to make room in the upper half. */ if(more == -1) { /* Very unlikely, but possible on 16 bit machine if strstart == 0 * and lookahead == 1 (input done one byte at time) */ more--; } else if(zip_strstart >= zip_WSIZE + zip_MAX_DIST) { /* By the IN assertion, the window is not empty so we can't confuse * more == 0 with more == 64K on a 16 bit machine. */ // Assert(window_size == (ulg)2*WSIZE, "no sliding with BIG_MEM"); // System.arraycopy(window, WSIZE, window, 0, WSIZE); for(n = 0; n < zip_WSIZE; n++) zip_window[n] = zip_window[n + zip_WSIZE]; zip_match_start -= zip_WSIZE; zip_strstart -= zip_WSIZE; /* we now have strstart >= MAX_DIST: */ zip_block_start -= zip_WSIZE; for(n = 0; n < zip_HASH_SIZE; n++) { m = zip_head1(n); zip_head2(n, m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL); } for(n = 0; n < zip_WSIZE; n++) { /* If n is not on any hash chain, prev[n] is garbage but * its value will never be used. */ m = zip_prev[n]; zip_prev[n] = (m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL); } more += zip_WSIZE; } // At this point, more >= 2 if(!zip_eofile) { n = zip_read_buff(zip_window, zip_strstart + zip_lookahead, more); if(n <= 0) zip_eofile = true; else zip_lookahead += n; } } /* ========================================================================== * Processes a new input file and return its compressed length. This * function does not perform lazy evaluationof matches and inserts * new strings in the dictionary only for unmatched strings or for short * matches. It is used only for the fast compression options. */ function zip_deflate_fast() { while(zip_lookahead != 0 && zip_qhead == null) { var flush; // set if current block must be flushed /* Insert the string window[strstart .. strstart+2] in the * dictionary, and set hash_head to the head of the hash chain: */ zip_INSERT_STRING(); /* Find the longest match, discarding those <= prev_length. * At this point we have always match_length < MIN_MATCH */ if(zip_hash_head != zip_NIL && zip_strstart - zip_hash_head <= zip_MAX_DIST) { /* To simplify the code, we prevent matches with the string * of window index 0 (in particular we have to avoid a match * of the string with itself at the start of the input file). */ zip_match_length = zip_longest_match(zip_hash_head); /* longest_match() sets match_start */ if(zip_match_length > zip_lookahead) zip_match_length = zip_lookahead; } if(zip_match_length >= zip_MIN_MATCH) { // check_match(strstart, match_start, match_length); flush = zip_ct_tally(zip_strstart - zip_match_start, zip_match_length - zip_MIN_MATCH); zip_lookahead -= zip_match_length; /* Insert new strings in the hash table only if the match length * is not too large. This saves time but degrades compression. */ if(zip_match_length <= zip_max_lazy_match) { zip_match_length--; // string at strstart already in hash table do { zip_strstart++; zip_INSERT_STRING(); /* strstart never exceeds WSIZE-MAX_MATCH, so there are * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH * these bytes are garbage, but it does not matter since * the next lookahead bytes will be emitted as literals. */ } while(--zip_match_length != 0); zip_strstart++; } else { zip_strstart += zip_match_length; zip_match_length = 0; zip_ins_h = zip_window[zip_strstart] & 0xff; // UPDATE_HASH(ins_h, window[strstart + 1]); zip_ins_h = ((zip_ins_h< zip_lookahead) zip_match_length = zip_lookahead; /* Ignore a length 3 match if it is too distant: */ if(zip_match_length == zip_MIN_MATCH && zip_strstart - zip_match_start > zip_TOO_FAR) { /* If prev_match is also MIN_MATCH, match_start is garbage * but we will ignore the current match anyway. */ zip_match_length--; } } /* If there was a match at the previous step and the current * match is not better, output the previous match: */ if(zip_prev_length >= zip_MIN_MATCH && zip_match_length <= zip_prev_length) { var flush; // set if current block must be flushed // check_match(strstart - 1, prev_match, prev_length); flush = zip_ct_tally(zip_strstart - 1 - zip_prev_match, zip_prev_length - zip_MIN_MATCH); /* Insert in hash table all strings up to the end of the match. * strstart-1 and strstart are already inserted. */ zip_lookahead -= zip_prev_length - 1; zip_prev_length -= 2; do { zip_strstart++; zip_INSERT_STRING(); /* strstart never exceeds WSIZE-MAX_MATCH, so there are * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH * these bytes are garbage, but it does not matter since the * next lookahead bytes will always be emitted as literals. */ } while(--zip_prev_length != 0); zip_match_available = 0; zip_match_length = zip_MIN_MATCH - 1; zip_strstart++; if(flush) { zip_flush_block(0); zip_block_start = zip_strstart; } } else if(zip_match_available != 0) { /* If there was no match at the previous position, output a * single literal. If there was a match but the current match * is longer, truncate the previous match to a single literal. */ if(zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff)) { zip_flush_block(0); zip_block_start = zip_strstart; } zip_strstart++; zip_lookahead--; } else { /* There is no previous match to compare with, wait for * the next step to decide. */ zip_match_available = 1; zip_strstart++; zip_lookahead--; } /* Make sure that we always have enough lookahead, except * at the end of the input file. We need MAX_MATCH bytes * for the next match, plus MIN_MATCH bytes to insert the * string following the next match. */ while(zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) zip_fill_window(); } } function zip_init_deflate() { if(zip_eofile) return; zip_bi_buf = 0; zip_bi_valid = 0; zip_ct_init(); zip_lm_init(); zip_qhead = null; zip_outcnt = 0; zip_outoff = 0; if(zip_compr_level <= 3) { zip_prev_length = zip_MIN_MATCH - 1; zip_match_length = 0; } else { zip_match_length = zip_MIN_MATCH - 1; zip_match_available = 0; } zip_complete = false; } /* ========================================================================== * Same as above, but achieves better compression. We use a lazy * evaluation for matches: a match is finally adopted only if there is * no better match at the next window position. */ function zip_deflate_internal(buff, off, buff_size) { var n; if(!zip_initflag) { zip_init_deflate(); zip_initflag = true; if(zip_lookahead == 0) { // empty zip_complete = true; return 0; } } if((n = zip_qcopy(buff, off, buff_size)) == buff_size) return buff_size; if(zip_complete) return n; if(zip_compr_level <= 3) // optimized for speed zip_deflate_fast(); else zip_deflate_better(); if(zip_lookahead == 0) { if(zip_match_available != 0) zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff); zip_flush_block(1); zip_complete = true; } return n + zip_qcopy(buff, n + off, buff_size - n); } function zip_qcopy(buff, off, buff_size) { var n, i, j; n = 0; while(zip_qhead != null && n < buff_size) { i = buff_size - n; if(i > zip_qhead.len) i = zip_qhead.len; // System.arraycopy(qhead.ptr, qhead.off, buff, off + n, i); for(j = 0; j < i; j++) buff[off + n + j] = zip_qhead.ptr[zip_qhead.off + j]; zip_qhead.off += i; zip_qhead.len -= i; n += i; if(zip_qhead.len == 0) { var p; p = zip_qhead; zip_qhead = zip_qhead.next; zip_reuse_queue(p); } } if(n == buff_size) return n; if(zip_outoff < zip_outcnt) { i = buff_size - n; if(i > zip_outcnt - zip_outoff) i = zip_outcnt - zip_outoff; // System.arraycopy(outbuf, outoff, buff, off + n, i); for(j = 0; j < i; j++) buff[off + n + j] = zip_outbuf[zip_outoff + j]; zip_outoff += i; n += i; if(zip_outcnt == zip_outoff) zip_outcnt = zip_outoff = 0; } return n; } /* ========================================================================== * Allocate the match buffer, initialize the various tables and save the * location of the internal file attribute (ascii/binary) and method * (DEFLATE/STORE). */ function zip_ct_init() { var n; // iterates over tree elements var bits; // bit counter var length; // length value var code; // code value var dist; // distance index if(zip_static_dtree[0].dl != 0) return; // ct_init already called zip_l_desc.dyn_tree = zip_dyn_ltree; zip_l_desc.static_tree = zip_static_ltree; zip_l_desc.extra_bits = zip_extra_lbits; zip_l_desc.extra_base = zip_LITERALS + 1; zip_l_desc.elems = zip_L_CODES; zip_l_desc.max_length = zip_MAX_BITS; zip_l_desc.max_code = 0; zip_d_desc.dyn_tree = zip_dyn_dtree; zip_d_desc.static_tree = zip_static_dtree; zip_d_desc.extra_bits = zip_extra_dbits; zip_d_desc.extra_base = 0; zip_d_desc.elems = zip_D_CODES; zip_d_desc.max_length = zip_MAX_BITS; zip_d_desc.max_code = 0; zip_bl_desc.dyn_tree = zip_bl_tree; zip_bl_desc.static_tree = null; zip_bl_desc.extra_bits = zip_extra_blbits; zip_bl_desc.extra_base = 0; zip_bl_desc.elems = zip_BL_CODES; zip_bl_desc.max_length = zip_MAX_BL_BITS; zip_bl_desc.max_code = 0; // Initialize the mapping length (0..255) -> length code (0..28) length = 0; for(code = 0; code < zip_LENGTH_CODES-1; code++) { zip_base_length[code] = length; for(n = 0; n < (1< dist code (0..29) */ dist = 0; for(code = 0 ; code < 16; code++) { zip_base_dist[code] = dist; for(n = 0; n < (1<>= 7; // from now on, all distances are divided by 128 for( ; code < zip_D_CODES; code++) { zip_base_dist[code] = dist << 7; for(n = 0; n < (1<<(zip_extra_dbits[code]-7)); n++) zip_dist_code[256 + dist++] = code; } // Assert (dist == 256, "ct_init: 256+dist != 512"); // Construct the codes of the static literal tree for(bits = 0; bits <= zip_MAX_BITS; bits++) zip_bl_count[bits] = 0; n = 0; while(n <= 143) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; } while(n <= 255) { zip_static_ltree[n++].dl = 9; zip_bl_count[9]++; } while(n <= 279) { zip_static_ltree[n++].dl = 7; zip_bl_count[7]++; } while(n <= 287) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; } /* Codes 286 and 287 do not exist, but we must include them in the * tree construction to get a canonical Huffman tree (longest code * all ones) */ zip_gen_codes(zip_static_ltree, zip_L_CODES + 1); /* The static distance tree is trivial: */ for(n = 0; n < zip_D_CODES; n++) { zip_static_dtree[n].dl = 5; zip_static_dtree[n].fc = zip_bi_reverse(n, 5); } // Initialize the first block of the first file: zip_init_block(); } /* ========================================================================== * Initialize a new block. */ function zip_init_block() { var n; // iterates over tree elements // Initialize the trees. for(n = 0; n < zip_L_CODES; n++) zip_dyn_ltree[n].fc = 0; for(n = 0; n < zip_D_CODES; n++) zip_dyn_dtree[n].fc = 0; for(n = 0; n < zip_BL_CODES; n++) zip_bl_tree[n].fc = 0; zip_dyn_ltree[zip_END_BLOCK].fc = 1; zip_opt_len = zip_static_len = 0; zip_last_lit = zip_last_dist = zip_last_flags = 0; zip_flags = 0; zip_flag_bit = 1; } /* ========================================================================== * Restore the heap property by moving down the tree starting at node k, * exchanging a node with the smallest of its two sons if necessary, stopping * when the heap property is re-established (each father smaller than its * two sons). */ function zip_pqdownheap( tree, // the tree to restore k) { // node to move down var v = zip_heap[k]; var j = k << 1; // left son of k while(j <= zip_heap_len) { // Set j to the smallest of the two sons: if(j < zip_heap_len && zip_SMALLER(tree, zip_heap[j + 1], zip_heap[j])) j++; // Exit if v is smaller than both sons if(zip_SMALLER(tree, v, zip_heap[j])) break; // Exchange v with the smallest son zip_heap[k] = zip_heap[j]; k = j; // And continue down the tree, setting j to the left son of k j <<= 1; } zip_heap[k] = v; } /* ========================================================================== * Compute the optimal bit lengths for a tree and update the total bit length * for the current block. * IN assertion: the fields freq and dad are set, heap[heap_max] and * above are the tree nodes sorted by increasing frequency. * OUT assertions: the field len is set to the optimal bit length, the * array bl_count contains the frequencies for each bit length. * The length opt_len is updated; static_len is also updated if stree is * not null. */ function zip_gen_bitlen(desc) { // the tree descriptor var tree = desc.dyn_tree; var extra = desc.extra_bits; var base = desc.extra_base; var max_code = desc.max_code; var max_length = desc.max_length; var stree = desc.static_tree; var h; // heap index var n, m; // iterate over the tree elements var bits; // bit length var xbits; // extra bits var f; // frequency var overflow = 0; // number of elements with bit length too large for(bits = 0; bits <= zip_MAX_BITS; bits++) zip_bl_count[bits] = 0; /* In a first pass, compute the optimal bit lengths (which may * overflow in the case of the bit length tree). */ tree[zip_heap[zip_heap_max]].dl = 0; // root of the heap for(h = zip_heap_max + 1; h < zip_HEAP_SIZE; h++) { n = zip_heap[h]; bits = tree[tree[n].dl].dl + 1; if(bits > max_length) { bits = max_length; overflow++; } tree[n].dl = bits; // We overwrite tree[n].dl which is no longer needed if(n > max_code) continue; // not a leaf node zip_bl_count[bits]++; xbits = 0; if(n >= base) xbits = extra[n - base]; f = tree[n].fc; zip_opt_len += f * (bits + xbits); if(stree != null) zip_static_len += f * (stree[n].dl + xbits); } if(overflow == 0) return; // This happens for example on obj2 and pic of the Calgary corpus // Find the first bit length which could increase: do { bits = max_length - 1; while(zip_bl_count[bits] == 0) bits--; zip_bl_count[bits]--; // move one leaf down the tree zip_bl_count[bits + 1] += 2; // move one overflow item as its brother zip_bl_count[max_length]--; /* The brother of the overflow item also moves one step up, * but this does not affect bl_count[max_length] */ overflow -= 2; } while(overflow > 0); /* Now recompute all bit lengths, scanning in increasing frequency. * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all * lengths instead of fixing only the wrong ones. This idea is taken * from 'ar' written by Haruhiko Okumura.) */ for(bits = max_length; bits != 0; bits--) { n = zip_bl_count[bits]; while(n != 0) { m = zip_heap[--h]; if(m > max_code) continue; if(tree[m].dl != bits) { zip_opt_len += (bits - tree[m].dl) * tree[m].fc; tree[m].fc = bits; } n--; } } } /* ========================================================================== * Generate the codes for a given tree and bit counts (which need not be * optimal). * IN assertion: the array bl_count contains the bit length statistics for * the given tree and the field len is set for all tree elements. * OUT assertion: the field code is set for all tree elements of non * zero code length. */ function zip_gen_codes(tree, // the tree to decorate max_code) { // largest code with non zero frequency var next_code = new Array(zip_MAX_BITS+1); // next code value for each bit length var code = 0; // running code value var bits; // bit index var n; // code index /* The distribution counts are first used to generate the code values * without bit reversal. */ for(bits = 1; bits <= zip_MAX_BITS; bits++) { code = ((code + zip_bl_count[bits-1]) << 1); next_code[bits] = code; } /* Check that the bit counts in bl_count are consistent. The last code * must be all ones. */ // Assert (code + encoder->bl_count[MAX_BITS]-1 == (1<> 1; n >= 1; n--) zip_pqdownheap(tree, n); /* Construct the Huffman tree by repeatedly combining the least two * frequent nodes. */ do { n = zip_heap[zip_SMALLEST]; zip_heap[zip_SMALLEST] = zip_heap[zip_heap_len--]; zip_pqdownheap(tree, zip_SMALLEST); m = zip_heap[zip_SMALLEST]; // m = node of next least frequency // keep the nodes sorted by frequency zip_heap[--zip_heap_max] = n; zip_heap[--zip_heap_max] = m; // Create a new node father of n and m tree[node].fc = tree[n].fc + tree[m].fc; // depth[node] = (char)(MAX(depth[n], depth[m]) + 1); if(zip_depth[n] > zip_depth[m] + 1) zip_depth[node] = zip_depth[n]; else zip_depth[node] = zip_depth[m] + 1; tree[n].dl = tree[m].dl = node; // and insert the new node in the heap zip_heap[zip_SMALLEST] = node++; zip_pqdownheap(tree, zip_SMALLEST); } while(zip_heap_len >= 2); zip_heap[--zip_heap_max] = zip_heap[zip_SMALLEST]; /* At this point, the fields freq and dad are set. We can now * generate the bit lengths. */ zip_gen_bitlen(desc); // The field len is now set, we can generate the bit codes zip_gen_codes(tree, max_code); } /* ========================================================================== * Scan a literal or distance tree to determine the frequencies of the codes * in the bit length tree. Updates opt_len to take into account the repeat * counts. (The contribution of the bit length codes will be added later * during the construction of bl_tree.) */ function zip_scan_tree(tree,// the tree to be scanned max_code) { // and its largest code of non zero frequency var n; // iterates over all tree elements var prevlen = -1; // last emitted length var curlen; // length of current code var nextlen = tree[0].dl; // length of next code var count = 0; // repeat count of the current code var max_count = 7; // max repeat count var min_count = 4; // min repeat count if(nextlen == 0) { max_count = 138; min_count = 3; } tree[max_code + 1].dl = 0xffff; // guard for(n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[n + 1].dl; if(++count < max_count && curlen == nextlen) continue; else if(count < min_count) zip_bl_tree[curlen].fc += count; else if(curlen != 0) { if(curlen != prevlen) zip_bl_tree[curlen].fc++; zip_bl_tree[zip_REP_3_6].fc++; } else if(count <= 10) zip_bl_tree[zip_REPZ_3_10].fc++; else zip_bl_tree[zip_REPZ_11_138].fc++; count = 0; prevlen = curlen; if(nextlen == 0) { max_count = 138; min_count = 3; } else if(curlen == nextlen) { max_count = 6; min_count = 3; } else { max_count = 7; min_count = 4; } } } /* ========================================================================== * Send a literal or distance tree in compressed form, using the codes in * bl_tree. */ function zip_send_tree(tree, // the tree to be scanned max_code) { // and its largest code of non zero frequency var n; // iterates over all tree elements var prevlen = -1; // last emitted length var curlen; // length of current code var nextlen = tree[0].dl; // length of next code var count = 0; // repeat count of the current code var max_count = 7; // max repeat count var min_count = 4; // min repeat count /* tree[max_code+1].dl = -1; */ /* guard already set */ if(nextlen == 0) { max_count = 138; min_count = 3; } for(n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[n+1].dl; if(++count < max_count && curlen == nextlen) { continue; } else if(count < min_count) { do { zip_SEND_CODE(curlen, zip_bl_tree); } while(--count != 0); } else if(curlen != 0) { if(curlen != prevlen) { zip_SEND_CODE(curlen, zip_bl_tree); count--; } // Assert(count >= 3 && count <= 6, " 3_6?"); zip_SEND_CODE(zip_REP_3_6, zip_bl_tree); zip_send_bits(count - 3, 2); } else if(count <= 10) { zip_SEND_CODE(zip_REPZ_3_10, zip_bl_tree); zip_send_bits(count-3, 3); } else { zip_SEND_CODE(zip_REPZ_11_138, zip_bl_tree); zip_send_bits(count-11, 7); } count = 0; prevlen = curlen; if(nextlen == 0) { max_count = 138; min_count = 3; } else if(curlen == nextlen) { max_count = 6; min_count = 3; } else { max_count = 7; min_count = 4; } } } /* ========================================================================== * Construct the Huffman tree for the bit lengths and return the index in * bl_order of the last bit length code to send. */ function zip_build_bl_tree() { var max_blindex; // index of last bit length code of non zero freq // Determine the bit length frequencies for literal and distance trees zip_scan_tree(zip_dyn_ltree, zip_l_desc.max_code); zip_scan_tree(zip_dyn_dtree, zip_d_desc.max_code); // Build the bit length tree: zip_build_tree(zip_bl_desc); /* opt_len now includes the length of the tree representations, except * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. */ /* Determine the number of bit length codes to send. The pkzip format * requires that at least 4 bit length codes be sent. (appnote.txt says * 3 but the actual value used is 4.) */ for(max_blindex = zip_BL_CODES-1; max_blindex >= 3; max_blindex--) { if(zip_bl_tree[zip_bl_order[max_blindex]].dl != 0) break; } /* Update opt_len to include the bit length tree and counts */ zip_opt_len += 3*(max_blindex+1) + 5+5+4; // Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", // encoder->opt_len, encoder->static_len)); return max_blindex; } /* ========================================================================== * Send the header for a block using dynamic Huffman trees: the counts, the * lengths of the bit length codes, the literal tree and the distance tree. * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. */ function zip_send_all_trees(lcodes, dcodes, blcodes) { // number of codes for each tree var rank; // index in bl_order // Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); // Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, // "too many codes"); // Tracev((stderr, "\nbl counts: ")); zip_send_bits(lcodes-257, 5); // not +255 as stated in appnote.txt zip_send_bits(dcodes-1, 5); zip_send_bits(blcodes-4, 4); // not -3 as stated in appnote.txt for(rank = 0; rank < blcodes; rank++) { // Tracev((stderr, "\nbl code %2d ", bl_order[rank])); zip_send_bits(zip_bl_tree[zip_bl_order[rank]].dl, 3); } // send the literal tree zip_send_tree(zip_dyn_ltree,lcodes-1); // send the distance tree zip_send_tree(zip_dyn_dtree,dcodes-1); } /* ========================================================================== * Determine the best encoding for the current block: dynamic trees, static * trees or store, and output the encoded block to the zip file. */ function zip_flush_block(eof) { // true if this is the last block for a file var opt_lenb, static_lenb; // opt_len and static_len in bytes var max_blindex; // index of last bit length code of non zero freq var stored_len; // length of input block stored_len = zip_strstart - zip_block_start; zip_flag_buf[zip_last_flags] = zip_flags; // Save the flags for the last 8 items // Construct the literal and distance trees zip_build_tree(zip_l_desc); // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", // encoder->opt_len, encoder->static_len)); zip_build_tree(zip_d_desc); // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", // encoder->opt_len, encoder->static_len)); /* At this point, opt_len and static_len are the total bit lengths of * the compressed block data, excluding the tree representations. */ /* Build the bit length tree for the above two trees, and get the index * in bl_order of the last bit length code to send. */ max_blindex = zip_build_bl_tree(); // Determine the best encoding. Compute first the block length in bytes opt_lenb = (zip_opt_len +3+7)>>3; static_lenb = (zip_static_len+3+7)>>3; // Trace((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ", // opt_lenb, encoder->opt_len, // static_lenb, encoder->static_len, stored_len, // encoder->last_lit, encoder->last_dist)); if(static_lenb <= opt_lenb) opt_lenb = static_lenb; if(stored_len + 4 <= opt_lenb // 4: two words for the lengths && zip_block_start >= 0) { var i; /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. * Otherwise we can't have processed more than WSIZE input bytes since * the last block flush, because compression would have been * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to * transform a block into a stored block. */ zip_send_bits((zip_STORED_BLOCK<<1)+eof, 3); /* send block type */ zip_bi_windup(); /* align on byte boundary */ zip_put_short(stored_len); zip_put_short(~stored_len); // copy block /* p = &window[block_start]; for(i = 0; i < stored_len; i++) put_byte(p[i]); */ for(i = 0; i < stored_len; i++) zip_put_byte(zip_window[zip_block_start + i]); } else if(static_lenb == opt_lenb) { zip_send_bits((zip_STATIC_TREES<<1)+eof, 3); zip_compress_block(zip_static_ltree, zip_static_dtree); } else { zip_send_bits((zip_DYN_TREES<<1)+eof, 3); zip_send_all_trees(zip_l_desc.max_code+1, zip_d_desc.max_code+1, max_blindex+1); zip_compress_block(zip_dyn_ltree, zip_dyn_dtree); } zip_init_block(); if(eof != 0) zip_bi_windup(); } /* ========================================================================== * Save the match info and tally the frequency counts. Return true if * the current block must be flushed. */ function zip_ct_tally( dist, // distance of matched string lc) { // match length-MIN_MATCH or unmatched char (if dist==0) zip_l_buf[zip_last_lit++] = lc; if(dist == 0) { // lc is the unmatched char zip_dyn_ltree[lc].fc++; } else { // Here, lc is the match length - MIN_MATCH dist--; // dist = match distance - 1 // Assert((ush)dist < (ush)MAX_DIST && // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && // (ush)D_CODE(dist) < (ush)D_CODES, "ct_tally: bad match"); zip_dyn_ltree[zip_length_code[lc]+zip_LITERALS+1].fc++; zip_dyn_dtree[zip_D_CODE(dist)].fc++; zip_d_buf[zip_last_dist++] = dist; zip_flags |= zip_flag_bit; } zip_flag_bit <<= 1; // Output the flags if they fill a byte if((zip_last_lit & 7) == 0) { zip_flag_buf[zip_last_flags++] = zip_flags; zip_flags = 0; zip_flag_bit = 1; } // Try to guess if it is profitable to stop the current block here if(zip_compr_level > 2 && (zip_last_lit & 0xfff) == 0) { // Compute an upper bound for the compressed length var out_length = zip_last_lit * 8; var in_length = zip_strstart - zip_block_start; var dcode; for(dcode = 0; dcode < zip_D_CODES; dcode++) { out_length += zip_dyn_dtree[dcode].fc * (5 + zip_extra_dbits[dcode]); } out_length >>= 3; // Trace((stderr,"\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ", // encoder->last_lit, encoder->last_dist, in_length, out_length, // 100L - out_length*100L/in_length)); if(zip_last_dist < parseInt(zip_last_lit/2) && out_length < parseInt(in_length/2)) return true; } return (zip_last_lit == zip_LIT_BUFSIZE-1 || zip_last_dist == zip_DIST_BUFSIZE); /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K * on 16 bit machines and because stored blocks are restricted to * 64K-1 bytes. */ } /* ========================================================================== * Send the block data compressed using the given Huffman trees */ function zip_compress_block( ltree, // literal tree dtree) { // distance tree var dist; // distance of matched string var lc; // match length or unmatched char (if dist == 0) var lx = 0; // running index in l_buf var dx = 0; // running index in d_buf var fx = 0; // running index in flag_buf var flag = 0; // current flags var code; // the code to send var extra; // number of extra bits to send if(zip_last_lit != 0) do { if((lx & 7) == 0) flag = zip_flag_buf[fx++]; lc = zip_l_buf[lx++] & 0xff; if((flag & 1) == 0) { zip_SEND_CODE(lc, ltree); /* send a literal byte */ // Tracecv(isgraph(lc), (stderr," '%c' ", lc)); } else { // Here, lc is the match length - MIN_MATCH code = zip_length_code[lc]; zip_SEND_CODE(code+zip_LITERALS+1, ltree); // send the length code extra = zip_extra_lbits[code]; if(extra != 0) { lc -= zip_base_length[code]; zip_send_bits(lc, extra); // send the extra length bits } dist = zip_d_buf[dx++]; // Here, dist is the match distance - 1 code = zip_D_CODE(dist); // Assert (code < D_CODES, "bad d_code"); zip_SEND_CODE(code, dtree); // send the distance code extra = zip_extra_dbits[code]; if(extra != 0) { dist -= zip_base_dist[code]; zip_send_bits(dist, extra); // send the extra distance bits } } // literal or match pair ? flag >>= 1; } while(lx < zip_last_lit); zip_SEND_CODE(zip_END_BLOCK, ltree); } /* ========================================================================== * Send a value on a given number of bits. * IN assertion: length <= 16 and value fits in length bits. */ var zip_Buf_size = 16; // bit size of bi_buf function zip_send_bits( value, // value to send length) { // number of bits /* If not enough room in bi_buf, use (valid) bits from bi_buf and * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) * unused bits in value. */ if(zip_bi_valid > zip_Buf_size - length) { zip_bi_buf |= (value << zip_bi_valid); zip_put_short(zip_bi_buf); zip_bi_buf = (value >> (zip_Buf_size - zip_bi_valid)); zip_bi_valid += length - zip_Buf_size; } else { zip_bi_buf |= value << zip_bi_valid; zip_bi_valid += length; } } /* ========================================================================== * Reverse the first len bits of a code, using straightforward code (a faster * method would use a table) * IN assertion: 1 <= len <= 15 */ function zip_bi_reverse( code, // the value to invert len) { // its bit length var res = 0; do { res |= code & 1; code >>= 1; res <<= 1; } while(--len > 0); return res >> 1; } /* ========================================================================== * Write out any remaining bits in an incomplete byte. */ function zip_bi_windup() { if(zip_bi_valid > 8) { zip_put_short(zip_bi_buf); } else if(zip_bi_valid > 0) { zip_put_byte(zip_bi_buf); } zip_bi_buf = 0; zip_bi_valid = 0; } function zip_qoutbuf() { if(zip_outcnt != 0) { var q, i; q = zip_new_queue(); if(zip_qhead == null) zip_qhead = zip_qtail = q; else zip_qtail = zip_qtail.next = q; q.len = zip_outcnt - zip_outoff; // System.arraycopy(zip_outbuf, zip_outoff, q.ptr, 0, q.len); for(i = 0; i < q.len; i++) q.ptr[i] = zip_outbuf[zip_outoff + i]; zip_outcnt = zip_outoff = 0; } } function zip_deflate(str, level) { var out, buff; var i, j; zip_deflate_data = str; zip_deflate_pos = 0; if(typeof level == "undefined") level = zip_DEFAULT_LEVEL; zip_deflate_start(level); buff = new Array(1024); out = ""; while((i = zip_deflate_internal(buff, 0, buff.length)) > 0) { for(j = 0; j < i; j++) out += String.fromCharCode(buff[j]); } zip_deflate_data = null; // G.C. return out; } return zip_deflate; };2d:T514,{ const form = html` `; form.oninput = () => (viewof plantuml_config.value = form.value = { cache: form.cache.checked, server: form.server.value, panAndZoom: form.panAndZoom.checked, maxWidth: form.maxWidth.valueAsNumber, maxHeight: form.maxHeight.valueAsNumber }); form.maxWidth.style.server = "auto"; form.maxWidth.style.width = "60px"; form.maxHeight.style.width = "60px"; //form.oninput(); const update = function() { form.value = viewof plantuml_config.value; console.log(form.value); form.cache.checked = form.value.cache; form.server.value = form.value.server; form.maxWidth.value = form.value.maxWidth; form.maxHeight.value = form.value.maxHeight; form.panAndZoom.checked = form.value.panAndZoom; }; viewof plantuml_config.addEventListener("input", update); invalidation.then(() => viewof plantuml_config.removeEventListener("input", update) ); return update(), form; }2e:T4601,plantuml` ${{ config: { maxWidth: 10000, panAndZoom: true , format: svg} }} @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml title Archimate Model Elements with Open Exchange Format naming conventions 'LAYOUT_AS_SKETCH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Strategy_Resource(Resource,"a resource") Strategy_Capability(Capability,"a capability") Strategy_CourseOfAction(Course_Of_Action,"a course-of-action") Business_Actor(Actor,"a actor") Business_Role(Business_Role,"a business_role") Business_Collaboration(Business_Collaboration,"a business-collaboration") Business_Interface(Business_Interface,"a business-interface") Business_Process(Business_Process,"a business-process") Business_Function(Business_Function,"a business-function") Business_Interaction(Business_Interaction,"a business-interaction") Business_Event(Business_Event,"a business-event") Business_Service(Business_Service,"a business-service") Business_Object(Business_Object,"a business-object") Business_Contract(Contract,"a contract") Business_Representation(Representation,"a representation") Business_Product(Product,"a product") Application_Component(Application_Component,"a application-component") Application_Collaboration(Application_Collaboration,"a application-collaboration") Application_Interface(Application_Interface,"a application-interface") Application_Function(Application_Function,"a application-function") Application_Interaction(Application_Interaction,"a application-interaction") Application_Process(Application_Process,"a application-process") Application_Event(Application_Event,"a application-event") Application_Service(Application_Service,"a application-service") Application_DataObject(Data_Object,"a data-object") Technology_Node(Node,"a node") Technology_Device(Device,"a device") Technology_SystemSoftware(System_Software,"a system-software") Technology_Collaboration(Technology_Collaboration,"a technology-collaboration") Technology_Interface(Technology_Interface,"a technology-interface") Technology_Path(Path,"a path") Technology_CommunicationNetwork(Communication_Network,"a communication-network") Technology_Function(Technology_Function,"a technology_function") Technology_Process(Technology_Process,"a technology-process") Technology_Interaction(Technology_Interaction,"a technology-interaction") Technology_Event(Technology_Event,"a technology-event") Technology_Service(Technology_Service,"a technology-service") Technology_Artifact(Artifact,"a artifact") Physical_Equipment(Equipment,"a equipment") Physical_Facility(Facility,"a facility") Physical_DistributionNetwork(Distribution_Network,"a distribution-network") Physical_Material(Material,"a material") Motivation_Stakeholder(Stakeholder,"a stakeholder") Motivation_Driver(Driver,"a driver") Motivation_Assessment(Assessment,"a assessment") Motivation_Goal(Goal,"a goal") Motivation_Outcome(Outcome,"a outcome") Motivation_Principle(Principle,"a principle") Motivation_Requirement(Requirement,"a requirement") Motivation_Constraint(Constraint,"a constraint") Motivation_Meaning(Meaning,"a meaning") Motivation_Value(Value,"a value") Implementation_WorkPackage(WorkPackage,"a work-package") Implementation_Deliverable(Deliverable,"a deliverable") Implementation_Event(Implementation_Event,"a implementation-event") Implementation_Plateau(Plateau,"a plateau") Implementation_Gap(Gap,"a gap") Other_Location(Location,"a location") Grouping(Grouping,"a grouping") Junction_And(Junction_And,"a Junction_And") Rel_Access(Business_Actor,Business_Object,"a") Rel_Access(Business_Actor,Business_Contract,"a") Rel_Access(Business_Actor,Business_Representation,"a") Rel_Access(Business_Actor,Application_DataObject,"a") Rel_Access(Business_Actor,Technology_Artifact,"a") Rel_Access(Business_Actor,Physical_Material,"a") Rel_Access(Business_Actor,Grouping,"a") Rel_Access(Business_Actor,Junction_And,"a") Rel_Access(Business_Role,Business_Object,"a") Rel_Access(Business_Role,Business_Contract,"a") Rel_Access(Business_Role,Business_Representation,"a") Rel_Access(Business_Role,Application_DataObject,"a") Rel_Access(Business_Role,Technology_Artifact,"a") Rel_Access(Business_Role,Physical_Material,"a") Rel_Access(Business_Role,Grouping,"a") Rel_Access(Business_Role,Junction_And,"a") Rel_Access(Business_Collaboration,Business_Object,"a") Rel_Access(Business_Collaboration,Business_Contract,"a") Rel_Access(Business_Collaboration,Business_Representation,"a") Rel_Access(Business_Collaboration,Application_DataObject,"a") Rel_Access(Business_Collaboration,Technology_Artifact,"a") Rel_Access(Business_Collaboration,Physical_Material,"a") Rel_Access(Business_Collaboration,Grouping,"a") Rel_Access(Business_Collaboration,Junction_And,"a") Rel_Access(Business_Interface,Business_Object,"a") Rel_Access(Business_Interface,Business_Contract,"a") Rel_Access(Business_Interface,Business_Representation,"a") Rel_Access(Business_Interface,Application_DataObject,"a") Rel_Access(Business_Interface,Technology_Artifact,"a") Rel_Access(Business_Interface,Physical_Material,"a") Rel_Access(Business_Interface,Grouping,"a") Rel_Access(Business_Interface,Junction_And,"a") Rel_Access(Business_Process,Business_Object,"a") Rel_Access(Business_Process,Business_Contract,"a") Rel_Access(Business_Process,Business_Representation,"a") Rel_Access(Business_Process,Application_DataObject,"a") Rel_Access(Business_Process,Technology_Artifact,"a") Rel_Access(Business_Process,Physical_Material,"a") Rel_Access(Business_Process,Grouping,"a") Rel_Access(Business_Process,Junction_And,"a") Rel_Access(Business_Function,Business_Object,"a") Rel_Access(Business_Function,Business_Contract,"a") Rel_Access(Business_Function,Business_Representation,"a") Rel_Access(Business_Function,Application_DataObject,"a") Rel_Access(Business_Function,Technology_Artifact,"a") Rel_Access(Business_Function,Physical_Material,"a") Rel_Access(Business_Function,Grouping,"a") Rel_Access(Business_Function,Junction_And,"a") Rel_Access(Business_Interaction,Business_Object,"a") Rel_Access(Business_Interaction,Business_Contract,"a") Rel_Access(Business_Interaction,Business_Representation,"a") Rel_Access(Business_Interaction,Application_DataObject,"a") Rel_Access(Business_Interaction,Technology_Artifact,"a") Rel_Access(Business_Interaction,Physical_Material,"a") Rel_Access(Business_Interaction,Grouping,"a") Rel_Access(Business_Interaction,Junction_And,"a") Rel_Access(Business_Event,Business_Object,"a") Rel_Access(Business_Event,Business_Contract,"a") Rel_Access(Business_Event,Business_Representation,"a") Rel_Access(Business_Event,Grouping,"a") Rel_Access(Business_Event,Junction_And,"a") Rel_Access(Business_Service,Business_Object,"a") Rel_Access(Business_Service,Business_Contract,"a") Rel_Access(Business_Service,Business_Representation,"a") Rel_Access(Business_Service,Application_DataObject,"a") Rel_Access(Business_Service,Technology_Artifact,"a") Rel_Access(Business_Service,Physical_Material,"a") Rel_Access(Business_Service,Grouping,"a") Rel_Access(Business_Service,Junction_And,"a") Rel_Access(Business_Product,Business_Object,"a") Rel_Access(Business_Product,Business_Contract,"a") Rel_Access(Business_Product,Business_Representation,"a") Rel_Access(Business_Product,Application_DataObject,"a") Rel_Access(Business_Product,Technology_Artifact,"a") Rel_Access(Business_Product,Physical_Material,"a") Rel_Access(Business_Product,Grouping,"a") Rel_Access(Business_Product,Junction_And,"a") Rel_Access(Application_Component,Business_Object,"a") Rel_Access(Application_Component,Business_Contract,"a") Rel_Access(Application_Component,Business_Representation,"a") Rel_Access(Application_Component,Application_DataObject,"a") Rel_Access(Application_Component,Technology_Artifact,"a") Rel_Access(Application_Component,Physical_Material,"a") Rel_Access(Application_Component,Grouping,"a") Rel_Access(Application_Component,Junction_And,"a") Rel_Access(Application_Collaboration,Business_Object,"a") Rel_Access(Application_Collaboration,Business_Contract,"a") Rel_Access(Application_Collaboration,Business_Representation,"a") Rel_Access(Application_Collaboration,Application_DataObject,"a") Rel_Access(Application_Collaboration,Technology_Artifact,"a") Rel_Access(Application_Collaboration,Physical_Material,"a") Rel_Access(Application_Collaboration,Grouping,"a") Rel_Access(Application_Collaboration,Junction_And,"a") Rel_Access(Application_Interface,Business_Object,"a") Rel_Access(Application_Interface,Business_Contract,"a") Rel_Access(Application_Interface,Business_Representation,"a") Rel_Access(Application_Interface,Application_DataObject,"a") Rel_Access(Application_Interface,Technology_Artifact,"a") Rel_Access(Application_Interface,Physical_Material,"a") Rel_Access(Application_Interface,Grouping,"a") Rel_Access(Application_Interface,Junction_And,"a") Rel_Access(Application_Function,Business_Object,"a") Rel_Access(Application_Function,Business_Contract,"a") Rel_Access(Application_Function,Business_Representation,"a") Rel_Access(Application_Function,Application_DataObject,"a") Rel_Access(Application_Function,Technology_Artifact,"a") Rel_Access(Application_Function,Physical_Material,"a") Rel_Access(Application_Function,Grouping,"a") Rel_Access(Application_Function,Junction_And,"a") Rel_Access(Application_Interaction,Business_Object,"a") Rel_Access(Application_Interaction,Business_Contract,"a") Rel_Access(Application_Interaction,Business_Representation,"a") Rel_Access(Application_Interaction,Application_DataObject,"a") Rel_Access(Application_Interaction,Technology_Artifact,"a") Rel_Access(Application_Interaction,Physical_Material,"a") Rel_Access(Application_Interaction,Grouping,"a") Rel_Access(Application_Interaction,Junction_And,"a") Rel_Access(Application_Process,Business_Object,"a") Rel_Access(Application_Process,Business_Contract,"a") Rel_Access(Application_Process,Business_Representation,"a") Rel_Access(Application_Process,Application_DataObject,"a") Rel_Access(Application_Process,Technology_Artifact,"a") Rel_Access(Application_Process,Physical_Material,"a") Rel_Access(Application_Process,Grouping,"a") Rel_Access(Application_Process,Junction_And,"a") Rel_Access(Application_Event,Business_Object,"a") Rel_Access(Application_Event,Business_Contract,"a") Rel_Access(Application_Event,Application_DataObject,"a") Rel_Access(Application_Event,Grouping,"a") Rel_Access(Application_Event,Junction_And,"a") Rel_Access(Application_Service,Business_Object,"a") Rel_Access(Application_Service,Business_Contract,"a") Rel_Access(Application_Service,Business_Representation,"a") Rel_Access(Application_Service,Application_DataObject,"a") Rel_Access(Application_Service,Technology_Artifact,"a") Rel_Access(Application_Service,Physical_Material,"a") Rel_Access(Application_Service,Grouping,"a") Rel_Access(Application_Service,Junction_And,"a") Rel_Access(Technology_Node,Business_Object,"a") Rel_Access(Technology_Node,Business_Contract,"a") Rel_Access(Technology_Node,Business_Representation,"a") Rel_Access(Technology_Node,Application_DataObject,"a") Rel_Access(Technology_Node,Technology_Artifact,"a") Rel_Access(Technology_Node,Physical_Material,"a") Rel_Access(Technology_Node,Grouping,"a") Rel_Access(Technology_Node,Junction_And,"a") Rel_Access(Technology_Device,Business_Object,"a") Rel_Access(Technology_Device,Business_Contract,"a") Rel_Access(Technology_Device,Business_Representation,"a") Rel_Access(Technology_Device,Application_DataObject,"a") Rel_Access(Technology_Device,Technology_Artifact,"a") Rel_Access(Technology_Device,Physical_Material,"a") Rel_Access(Technology_Device,Grouping,"a") Rel_Access(Technology_Device,Junction_And,"a") Rel_Access(Technology_SystemSoftware,Business_Object,"a") Rel_Access(Technology_SystemSoftware,Business_Contract,"a") Rel_Access(Technology_SystemSoftware,Business_Representation,"a") Rel_Access(Technology_SystemSoftware,Application_DataObject,"a") Rel_Access(Technology_SystemSoftware,Technology_Artifact,"a") Rel_Access(Technology_SystemSoftware,Physical_Material,"a") Rel_Access(Technology_SystemSoftware,Grouping,"a") Rel_Access(Technology_SystemSoftware,Junction_And,"a") Rel_Access(Technology_Collaboration,Business_Object,"a") Rel_Access(Technology_Collaboration,Business_Contract,"a") Rel_Access(Technology_Collaboration,Business_Representation,"a") Rel_Access(Technology_Collaboration,Application_DataObject,"a") Rel_Access(Technology_Collaboration,Technology_Artifact,"a") Rel_Access(Technology_Collaboration,Physical_Material,"a") Rel_Access(Technology_Collaboration,Grouping,"a") Rel_Access(Technology_Collaboration,Junction_And,"a") Rel_Access(Technology_Interface,Business_Object,"a") Rel_Access(Technology_Interface,Business_Contract,"a") Rel_Access(Technology_Interface,Business_Representation,"a") Rel_Access(Technology_Interface,Application_DataObject,"a") Rel_Access(Technology_Interface,Technology_Artifact,"a") Rel_Access(Technology_Interface,Physical_Material,"a") Rel_Access(Technology_Interface,Grouping,"a") Rel_Access(Technology_Interface,Junction_And,"a") Rel_Access(Technology_Path,Business_Object,"a") Rel_Access(Technology_Path,Business_Contract,"a") Rel_Access(Technology_Path,Business_Representation,"a") Rel_Access(Technology_Path,Application_DataObject,"a") Rel_Access(Technology_Path,Technology_Artifact,"a") Rel_Access(Technology_Path,Physical_Material,"a") Rel_Access(Technology_Path,Grouping,"a") Rel_Access(Technology_Path,Junction_And,"a") Rel_Access(Technology_CommunicationNetwork,Business_Object,"a") Rel_Access(Technology_CommunicationNetwork,Business_Contract,"a") Rel_Access(Technology_CommunicationNetwork,Business_Representation,"a") Rel_Access(Technology_CommunicationNetwork,Application_DataObject,"a") Rel_Access(Technology_CommunicationNetwork,Technology_Artifact,"a") Rel_Access(Technology_CommunicationNetwork,Physical_Material,"a") Rel_Access(Technology_CommunicationNetwork,Grouping,"a") Rel_Access(Technology_CommunicationNetwork,Junction_And,"a") Rel_Access(Technology_Function,Business_Object,"a") Rel_Access(Technology_Function,Business_Contract,"a") Rel_Access(Technology_Function,Business_Representation,"a") Rel_Access(Technology_Function,Application_DataObject,"a") Rel_Access(Technology_Function,Technology_Artifact,"a") Rel_Access(Technology_Function,Physical_Material,"a") Rel_Access(Technology_Function,Grouping,"a") Rel_Access(Technology_Function,Junction_And,"a") Rel_Access(Technology_Process,Business_Object,"a") Rel_Access(Technology_Process,Business_Contract,"a") Rel_Access(Technology_Process,Business_Representation,"a") Rel_Access(Technology_Process,Application_DataObject,"a") Rel_Access(Technology_Process,Technology_Artifact,"a") Rel_Access(Technology_Process,Physical_Material,"a") Rel_Access(Technology_Process,Grouping,"a") Rel_Access(Technology_Process,Junction_And,"a") Rel_Access(Technology_Interaction,Business_Object,"a") Rel_Access(Technology_Interaction,Business_Contract,"a") Rel_Access(Technology_Interaction,Business_Representation,"a") Rel_Access(Technology_Interaction,Application_DataObject,"a") Rel_Access(Technology_Interaction,Technology_Artifact,"a") Rel_Access(Technology_Interaction,Physical_Material,"a") Rel_Access(Technology_Interaction,Grouping,"a") Rel_Access(Technology_Interaction,Junction_And,"a") Rel_Access(Technology_Event,Business_Object,"a") Rel_Access(Technology_Event,Business_Contract,"a") Rel_Access(Technology_Event,Business_Representation,"a") Rel_Access(Technology_Event,Application_DataObject,"a") Rel_Access(Technology_Event,Technology_Artifact,"a") Rel_Access(Technology_Event,Physical_Material,"a") Rel_Access(Technology_Event,Grouping,"a") Rel_Access(Technology_Event,Junction_And,"a") Rel_Access(Technology_Service,Business_Object,"a") Rel_Access(Technology_Service,Business_Contract,"a") Rel_Access(Technology_Service,Business_Representation,"a") Rel_Access(Technology_Service,Application_DataObject,"a") Rel_Access(Technology_Service,Technology_Artifact,"a") Rel_Access(Technology_Service,Physical_Material,"a") Rel_Access(Technology_Service,Grouping,"a") Rel_Access(Technology_Service,Junction_And,"a") Rel_Access(Motivation_Requirement,Implementation_Deliverable,"a") Rel_Access(Motivation_Requirement,Grouping,"a") Rel_Access(Motivation_Requirement,Junction_And,"a") Rel_Access(Motivation_Meaning,Implementation_Deliverable,"a") Rel_Access(Motivation_Meaning,Grouping,"a") Rel_Access(Motivation_Meaning,Junction_And,"a") Rel_Access(Implementation_Deliverable,Business_Object,"a") Rel_Access(Implementation_Deliverable,Business_Contract,"a") Rel_Access(Implementation_Deliverable,Business_Representation,"a") Rel_Access(Implementation_Deliverable,Application_DataObject,"a") Rel_Access(Implementation_Deliverable,Technology_Artifact,"a") Rel_Access(Implementation_Deliverable,Physical_Material,"a") Rel_Access(Implementation_Deliverable,Grouping,"a") Rel_Access(Implementation_Deliverable,Junction_And,"a") Rel_Access(Implementation_Event,Business_Object,"a") Rel_Access(Implementation_Event,Business_Contract,"a") Rel_Access(Implementation_Event,Business_Representation,"a") Rel_Access(Implementation_Event,Application_DataObject,"a") Rel_Access(Implementation_Event,Technology_Artifact,"a") Rel_Access(Implementation_Event,Physical_Material,"a") Rel_Access(Implementation_Event,Implementation_Deliverable,"a") Rel_Access(Implementation_Event,Grouping,"a") Rel_Access(Implementation_Event,Junction_And,"a") Rel_Access(Implementation_Plateau,Business_Object,"a") Rel_Access(Implementation_Plateau,Business_Contract,"a") Rel_Access(Implementation_Plateau,Business_Representation,"a") Rel_Access(Implementation_Plateau,Application_DataObject,"a") Rel_Access(Implementation_Plateau,Technology_Artifact,"a") Rel_Access(Implementation_Plateau,Physical_Material,"a") Rel_Access(Implementation_Plateau,Implementation_Deliverable,"a") Rel_Access(Implementation_Plateau,Grouping,"a") Rel_Access(Implementation_Plateau,Junction_And,"a") @enduml `2f:T874,plantuml` @startuml !pragma revision 1 !includeurl https://raw.githubusercontent.com/RicardoNiepel/C4-PlantUML/master/C4_Container.puml !define AzurePuml https://raw.githubusercontent.com/RicardoNiepel/Azure-PlantUML/master/dist !includeurl AzurePuml/AzureCommon.puml !includeurl AzurePuml/AzureC4Integration.puml !includeurl AzurePuml/Compute/AzureFunction.puml !includeurl AzurePuml/Analytics/AzureStreamAnalytics.puml !includeurl AzurePuml/Analytics/AzureEventHub.puml !includeurl AzurePuml/Databases/AzureCosmosDb.puml !includeurl AzurePuml/Storage/AzureBlobStorage.puml !includeurl AzurePuml/InternetOfThings/AzureIoTHub.puml LAYOUT_LEFT_RIGHT System(devices, "Devices") AzureIoTHub(iotHub, "IoT Hub", "Standard S1", "Ingress point for all telemetry, using built-in IoT Hub Routes for routing") AzureEventHub(eventHubTelemetry, "Device Telemetry", "Standard, 5 TUs, 4 Partitions", "In addition to the built-in 'Receive device-to-cloud messages' from IoT Hub") AzureFunction(telemetryFunction, "Telemetry Processing", "v1, App Service plan P3v2, C#", "transform it into a different format, e.g. joining external information") AzureCosmosDb(warmStorageCosmos, "Warm Storage", "2,000 RUs", "for consumption, e.g. display on a dashboard") AzureStreamAnalytics(streamAnalytics, "Stream Analytics", "6 SUs", "apply complex queries over time periods, tolerates late (up to 21 days) and out-of-order (up to one hour) events") AzureFunction(alertingFunction, "Alerting", "v2, Consumption plan, JS") AzureBlobStorage(coldBlobStorage, "Cold Storage", "General Purpose v2, Cool, RA-GRS", "all incoming data records are archived indefinitely at low cost, and are easily accessible for batch processing") Rel(devices, iotHub, "Send telemetry to") Rel(iotHub, eventHubTelemetry, "Routes all telemetry to") Rel_Back(iotHub, streamAnalytics, "Analyzes each event from") Rel(iotHub, coldBlobStorage, "Routes all telemetry to") Rel_Back(eventHubTelemetry, telemetryFunction, "Processes each event from") Rel(streamAnalytics, alertingFunction, "Triggers for output batches to") Rel(telemetryFunction, warmStorageCosmos, "Writes all transformed events to") @enduml `30:Teb2,plantuml` @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml skinparam titleBorderRoundCorner 15 skinparam titleBorderThickness 2 skinparam titleFontSize 30 title Archimate Overview 'LAYOUT_AS_SKETCH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Grouping(M_Group,"Motivation"){ Motivation_Stakeholder(MStakeholder, "Stakeholder") Motivation_Assessment(MAssessment, "Assessment") Motivation_Driver(MDriver, "Driver") Motivation_Goal(MGoal, "Goal") Motivation_Outcome(MOutcome,"Outcome") Motivation_Principle(MPrinciple,"Principle") Motivation_Constraint(MConstraint,"Constraint") Motivation_Requirement(MRequirement,"Requirement") Motivation_Meaning(MMeaning,"Meaning") Motivation_Value(MValue,"Value") } Grouping(B_Group,"Business"){ Business_Object(BObject, "Business Object") Business_Representation(BRepresentation, "Representation") Business_Contract(BContract, "Contract") Business_Product(BProduct, "Product") Business_Service(BService, "Business Service") Business_Function(BFunction, "Business Function") Business_Process(BProcess, "Business Process") Business_Event(BEvent, "Business Event") Business_Interaction(BInteraction, "Business Interaction") Business_Role(BRole,"Business Role") Business_Actor(BActor,"Business Actor") Business_Collaboration(BCollaboration, "Business Collaboration") Business_Interface(BInterface, "Business Interface") } Grouping(A_Group, "Application"){ Application_DataObject(ADataObject, "Data Object") Application_Service(AService,"Application Service") Application_Function(AFunction, "Application Function") Application_Process(AProcess, "Application Process") Application_Event(AEvent, "Application Event") Application_Interaction(AInteraction, "Application Interaction") Application_Component(AComponent, "Application Component") Application_Component(AComponent, "Application Component") Application_Collaboration(ACollaboration, "Application Collaboration") Application_Interface(AInterface, "Application Interface") } Grouping(T_Group, "Technology"){ Technology_Artifact(TArtifact, "Artifact") Technology_Service(TService, "Technology Service") Technology_Function(TFunction, "Technology Function") Technology_Process(TProcess, "Technology Process") Technology_Event(TEvent, "Technology Event") Technology_Interaction(TInteraction, "Technology Interaction") Technology_Node(TNode, "Technology Node") Technology_SystemSoftware(TSystemSoftware, "System Software") Technology_Device(TDevice,"Technology Device") Technology_Interface(TInterface, "Technology Interface") Technology_Collaboration(TCollaboration, "Technology Collaboration") Technology_CommunicationNetwork(TCommunicationNetwork, "Communication Network") Technology_Path(TPath, "Technology Path") } Grouping(I_Group, "Implementation"){ Implementation_Deliverable(IDeliverable, "Deliverable") Implementation_Gap(IGap, "Gap") Implementation_WorkPackage(IWorkPackage, "Work Package") Implementation_Event(IEvent, "Implementation Event") Implementation_Plateau(IPlateau,"Plateau") } Grouping(S_Group,"Strategy"){ Strategy_Resource(SResource,"Resource") Strategy_Capability(SCapability,"Capability") } Grouping(C_Group, "Composite"){ Other_Location(CLocation,"Location") } Grouping(P_Group, "Physical"){ Physical_Material(PMaterial, "Material") Physical_Facility(PFacility, "Facility") Physical_Equipment(PEquipment, "Equipment") Physical_DistributionNetwork(PDistributionNetwork, "Distribution Network") } @enduml `31:Tfd1,plantuml` @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml skinparam titleBorderRoundCorner 15 skinparam titleBorderThickness 2 skinparam titleFontSize 15 title =**Archimate Model Elements with Open Exchange Format naming conventions** 'LAYOUT_AS_SKETCH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Strategy_Resource(Strategy_Resource,"a Resource") Strategy_Capability(Strategy_Capability,"a Capability") Strategy_CourseOfAction(Strategy_CourseOfAction,"a CourseOfAction") Business_Actor(Business_Actor,"a BusinessActor") Business_Role(Business_Role,"a BusinessRole") Business_Collaboration(Business_Collaboration,"a BusinessCollaboration") Business_Interface(Business_Interface,"a BusinessInterface") Business_Process(Business_Process,"a BusinessProcess") Business_Function(Business_Function,"a BusinessFunction") Business_Interaction(Business_Interaction,"a BusinessInteraction") Business_Event(Business_Event,"a BusinessEvent") Business_Service(Business_Service,"a BusinessService") Business_Object(Business_Object,"a BusinessObject") Business_Contract(Business_Contract,"a Contract") Business_Representation(Business_Representation,"a Representation") Business_Product(Business_Product,"a Product") Application_Component(Application_Component,"a ApplicationComponent") Application_Collaboration(Application_Collaboration,"a ApplicationCollaboration") Application_Interface(Application_Interface,"a ApplicationInterface") Application_Function(Application_Function,"a ApplicationFunction") Application_Interaction(Application_Interaction,"a ApplicationInteraction") Application_Process(Application_Process,"a ApplicationProcess") Application_Event(Application_Event,"a ApplicationEvent") Application_Service(Application_Service,"a ApplicationService") Application_DataObject(Application_DataObject,"a DataObject") Technology_Node(Technology_Node,"a Node") Technology_Device(Technology_Device,"a Device") Technology_SystemSoftware(Technology_SystemSoftware,"a SystemSoftware") Technology_Collaboration(Technology_Collaboration,"a TechnologyCollaboration") Technology_Interface(Technology_Interface,"a TechnologyInterface") Technology_Path(Technology_Path,"a Path") Technology_CommunicationNetwork(Technology_CommunicationNetwork,"a CommunicationNetwork") Technology_Function(Technology_Function,"a TechnologyFunction") Technology_Process(Technology_Process,"a TechnologyProcess") Technology_Interaction(Technology_Interaction,"a TechnologyInteraction") Technology_Event(Technology_Event,"a TechnologyEvent") Technology_Service(Technology_Service,"a TechnologyService") Technology_Artifact(Technology_Artifact,"a Artifact") Physical_Equipment(Physical_Equipment,"a Equipment") Physical_Facility(Physical_Facility,"a Facility") Physical_DistributionNetwork(Physical_DistributionNetwork,"a DistributionNetwork") Physical_Material(Physical_Material,"a Material") Motivation_Stakeholder(Motivation_Stakeholder,"a Stakeholder") Motivation_Driver(Motivation_Driver,"a Driver") Motivation_Assessment(Motivation_Assessment,"a Assessment") Motivation_Goal(Motivation_Goal,"a Goal") Motivation_Outcome(Motivation_Outcome,"a Outcome") Motivation_Principle(Motivation_Principle,"a Principle") Motivation_Requirement(Motivation_Requirement,"a Requirement") Motivation_Constraint(Motivation_Constraint,"a Constraint") Motivation_Meaning(Motivation_Meaning,"a Meaning") Motivation_Value(Motivation_Value,"a Value") Implementation_WorkPackage(Implementation_WorkPackage,"a WorkPackage") Implementation_Deliverable(Implementation_Deliverable,"a Deliverable") Implementation_Event(Implementation_Event,"a ImplementationEvent") Implementation_Plateau(Implementation_Plateau,"a Plateau") Implementation_Gap(Implementation_Gap,"a Gap") Other_Location(Other_Location,"a Location") Grouping(Grouping,"a Grouping") Junction_Or(Junction_Or,"a OrJunction") Junction_And(Junction_And,"a AndJunction") Rel_Association(Other_Location,Business_Collaboration,"o") Rel_Triggering(Other_Location,Business_Collaboration,"t") @enduml `32:Tf71,plantuml` @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml skinparam titleBorderRoundCorner 15 skinparam titleBorderThickness 2 skinparam titleFontSize 15 title =**Archimate Model Elements with Relationships matrix naming conventions** 'LAYOUT_AS_SKETCH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Strategy_Resource(Strategy_Resource,"a Resource") Strategy_Capability(Strategy_Capability,"a Capability") Strategy_CourseOfAction(Strategy_CourseOfAction,"a Course_Of_Action") Business_Actor(Business_Actor,"a Actor") Business_Role(Business_Role,"a Business_Role") Business_Collaboration(Business_Collaboration,"a Business_Collaboration") Business_Interface(Business_Interface,"a Business_Interface") Business_Process(Business_Process,"a Business_Process") Business_Function(Business_Function,"a Business_Function") Business_Interaction(Business_Interaction,"a Business_Interaction") Business_Event(Business_Event,"a Business_Event") Business_Service(Business_Service,"a Business_Service") Business_Object(Business_Object,"a Business_Object") Business_Contract(Business_Contract,"a Contract") Business_Representation(Business_Representation,"a Representation") Business_Product(Business_Product,"a Product") Application_Component(Application_Component,"a Application_Component") Application_Collaboration(Application_Collaboration,"a Application_Collaboration") Application_Interface(Application_Interface,"a Application_Interface") Application_Function(Application_Function,"a Application_Function") Application_Interaction(Application_Interaction,"a Application_Interaction") Application_Process(Application_Process,"a Application_Process") Application_Event(Application_Event,"a Application_Event") Application_Service(Application_Service,"a Application_Service") Application_DataObject(Application_DataObject,"a Data_Object") Technology_Node(Technology_Node,"a Node") Technology_Device(Technology_Device,"a Device") Technology_SystemSoftware(Technology_SystemSoftware,"a System_Software") Technology_Collaboration(Technology_Collaboration,"a Technology_Collaboration") Technology_Interface(Technology_Interface,"a Technology_Interface") Technology_Path(Technology_Path,"a Path") Technology_CommunicationNetwork(Technology_CommunicationNetwork,"a Communication_Network") Technology_Function(Technology_Function,"a Technology_Function") Technology_Process(Technology_Process,"a Technology_Process") Technology_Interaction(Technology_Interaction,"a Technology_Interaction") Technology_Event(Technology_Event,"a Technology_Event") Technology_Service(Technology_Service,"a Technology_Service") Technology_Artifact(Technology_Artifact,"a Artifact") Physical_Equipment(Physical_Equipment,"a Equipment") Physical_Facility(Physical_Facility,"a Facility") Physical_DistributionNetwork(Physical_DistributionNetwork,"a Distribution_Network") Physical_Material(Physical_Material,"a Material") Motivation_Stakeholder(Motivation_Stakeholder,"a Stakeholder") Motivation_Driver(Motivation_Driver,"a Driver") Motivation_Assessment(Motivation_Assessment,"a Assessment") Motivation_Goal(Motivation_Goal,"a Goal") Motivation_Outcome(Motivation_Outcome,"a Outcome") Motivation_Principle(Motivation_Principle,"a Principle") Motivation_Requirement(Motivation_Requirement,"a Requirement") Motivation_Constraint(Motivation_Constraint,"a Constraint") Motivation_Meaning(Motivation_Meaning,"a Meaning") Motivation_Value(Motivation_Value,"a Value") Implementation_WorkPackage(Implementation_WorkPackage,"a WorkPackage") Implementation_Deliverable(Implementation_Deliverable,"a Deliverable") Implementation_Event(Implementation_Event,"a Implementation_Event") Implementation_Plateau(Implementation_Plateau,"a Plateau") Implementation_Gap(Implementation_Gap,"a Gap") Other_Location(Other_Location,"a Location") Grouping(Grouping,"a Grouping") Junction_Or(Junction_Or,"a Junction") Junction_And(Junction_And,"a Junction") @enduml `33:Tf59,plantuml` !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml skinparam titleBorderRoundCorner 15 skinparam titleBorderThickness 2 skinparam titleFontSize 15 title =**Archimate Model Elements with jArchi naming conventions** 'LAYOUT_AS_SKETCH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Strategy_Resource(Strategy_Resource,"a resource") Strategy_Capability(Strategy_Capability,"a capability") Strategy_CourseOfAction(Strategy_CourseOfAction,"a course-of-action") Business_Actor(Business_Actor,"a actor") Business_Role(Business_Role,"a business_role") Business_Collaboration(Business_Collaboration,"a business-collaboration") Business_Interface(Business_Interface,"a business-interface") Business_Process(Business_Process,"a business-process") Business_Function(Business_Function,"a business-function") Business_Interaction(Business_Interaction,"a business-interaction") Business_Event(Business_Event,"a business-event") Business_Service(Business_Service,"a business-service") Business_Object(Business_Object,"a business-object") Business_Contract(Business_Contract,"a contract") Business_Representation(Business_Representation,"a representation") Business_Product(Business_Product,"a product") Application_Component(Application_Component,"a application-component") Application_Collaboration(Application_Collaboration,"a application-collaboration") Application_Interface(Application_Interface,"a application-interface") Application_Function(Application_Function,"a application-function") Application_Interaction(Application_Interaction,"a application-interaction") Application_Process(Application_Process,"a application-process") Application_Event(Application_Event,"a application-event") Application_Service(Application_Service,"a application-service") Application_DataObject(Application_DataObject,"a data-object") Technology_Node(Technology_Node,"a node") Technology_Device(Technology_Device,"a device") Technology_SystemSoftware(Technology_SystemSoftware,"a system-software") Technology_Collaboration(Technology_Collaboration,"a technology-collaboration") Technology_Interface(Technology_Interface,"a technology-interface") Technology_Path(Technology_Path,"a path") Technology_CommunicationNetwork(Technology_CommunicationNetwork,"a communication-network") Technology_Function(Technology_Function,"a technology_function") Technology_Process(Technology_Process,"a technology-process") Technology_Interaction(Technology_Interaction,"a technology-interaction") Technology_Event(Technology_Event,"a technology-event") Technology_Service(Technology_Service,"a technology-service") Technology_Artifact(Technology_Artifact,"a artifact") Physical_Equipment(Physical_Equipment,"a equipment") Physical_Facility(Physical_Facility,"a facility") Physical_DistributionNetwork(Physical_DistributionNetwork,"a distribution-network") Physical_Material(Physical_Material,"a material") Motivation_Stakeholder(Motivation_Stakeholder,"a stakeholder") Motivation_Driver(Motivation_Driver,"a driver") Motivation_Assessment(Motivation_Assessment,"a assessment") Motivation_Goal(Motivation_Goal,"a goal") Motivation_Outcome(Motivation_Outcome,"a outcome") Motivation_Principle(Motivation_Principle,"a principle") Motivation_Requirement(Motivation_Requirement,"a requirement") Motivation_Constraint(Motivation_Constraint,"a constraint") Motivation_Meaning(Motivation_Meaning,"a meaning") Motivation_Value(Motivation_Value,"a value") Implementation_WorkPackage(Implementation_WorkPackage,"a work-package") Implementation_Deliverable(Implementation_Deliverable,"a deliverable") Implementation_Event(Implementation_Event,"a implementation-event") Implementation_Plateau(Implementation_Plateau,"a plateau") Implementation_Gap(Implementation_Gap,"a gap") Other_Location(Other_Location,"a location") Grouping(Grouping,"a grouping") Junction_Or(Junction_Or,"a junction") Junction_And(Junction_And,"a junction") @enduml ` 34:T445,plantuml ` @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml 'LAYOUT_AS_SKETH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Grouping(id_c18b700a1ba743fcbca35c0c8dbdbf7b,"Other alternative studied solutions") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_e99b9de3987a41a2b04620034dc89035,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_5586913d47ef4cf6860b8f301b67a8e1,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_3bbe6bca57564a5f91a9363837aaab52,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_ca64f983db784cc6b6df6c6a9732be19,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_795fd88d01d04aacb5e5bd6156397603,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_0e588a034d8c4bb8a330dec47d6e84fe,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_40c311c426344f5eb3bb94a6017cc93b,"") Rel_Composition(id_c18b700a1ba743fcbca35c0c8dbdbf7b,id_5a7e50f4a72449a198aa7439ac0e0bca,"") Rel_Aggregation(id_5586913d47ef4cf6860b8f301b67a8e1,id_ca64f983db784cc6b6df6c6a9732be19,"") @enduml `35:T6f4,plantuml ` @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml 'LAYOUT_AS_SKETH 'LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Grouping(id_25cfdd3f6d924726b9e0393e00c58737,"Other alternative studied solutions"){ Business_Product(id_578583dba86248729fd8213d428ef1a6,"Materialize 0.1") Business_Product(id_3d7e2eeef9684dd4986c743bdfd5d2fa,"Skeleton 2") Business_Product(id_111cb05ec73448d5b113fcd011badb71,"Foundation 6.4") Business_Product(id_d51c07c152004e8ea84c6152127192c1,"vue v2") Business_Product(id_65f20ae83b1243e188b747f4b1934320,"SemanticUI v 2.2 ") Group(id_25cfdd3f6d924726b9e0393e00c58734,"Other alternative studied solutions"){ Business_Product(id_f64e954b5be942abaea33b4f98b0eb29,"React v16") Business_Product(id_0a1fc49b6b274a08a16bacc3824a9a3d,"HTML5 Boilerplate v6") Business_Product(id_0f912af3a21f480bb0cba3eb3014e016,"Element 1.4") } } Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_65f20ae83b1243e188b747f4b1934320,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_0f912af3a21f480bb0cba3eb3014e016,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_3d7e2eeef9684dd4986c743bdfd5d2fa,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_d51c07c152004e8ea84c6152127192c1,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_f64e954b5be942abaea33b4f98b0eb29,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_111cb05ec73448d5b113fcd011badb71,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_578583dba86248729fd8213d428ef1a6,"") Rel_Composition(id_25cfdd3f6d924726b9e0393e00c58737,id_0a1fc49b6b274a08a16bacc3824a9a3d,"") Rel_Aggregation(id_0f912af3a21f480bb0cba3eb3014e016,id_d51c07c152004e8ea84c6152127192c1,"") @enduml `36:T1ee8,plantuml ` ${{ config: { maxWidth: 1000, panAndZoom: true , format: svg} }} @startuml !includeurl https://raw.githubusercontent.com/ebbypeter/Archimate-PlantUML/master/Archimate.puml LAYOUT_AS_SKETCH() LAYOUT_LEFT_RIGHT 'LAYOUT_TOP_DOWN Grouping(id-64d5822565204610b5a4bc4f9ceec9f2,"Implementing Cisco Networking Solutions ArchiMate view from Archi generated with plantuml.ajs"){ Grouping(id_656496f890944a57b70c6aa1e85e17db,"Implementing Cisco Networking Solutions.txt") Grouping(id_cb51105f26e64b45832da2fbe00b57b1,"Implementing Cisco Networking Solutions") Grouping(id_7da6318b40cb437799f2459d2940fd16,"1- Network Building Essentials") Grouping(id_358db89d604c4e3c8368f7b6eaa8c4af,"Network Building Essentials") Grouping(id_cf2aa7e2186f4d55a1b843cdeaaf1f30,"Introduction to networks") Grouping(id_d875c47c66804bebad0466311eb79aa9,"The OSI model and the TCP/IP stack") Grouping(id_c38142ae6f9e4489abcc1e06be10d7b4,"Building a network") Grouping(id_31b635e666d24dbfa4cff3bad8e09ed0,"Summary") Grouping(id_4ffb48e6072d4fad81db2319ff06717d,"2- Networks for Digital Enterprises") Grouping(id_3293d2944cc840678a049800a0f7acb8,"Networks for Digital Enterprises") Grouping(id_ef38ecffed7a4d919be8b8e1cbc703d1,"The impact of technology on business") Grouping(id_6b0a511c97bd40219490515deb2c2c3a,"A digital-ready infrastructure") Grouping(id_2b1e23e740e947cd97f9436845458bb4,"Facets of a digital infrastructure") Grouping(id_c3aaf47ac1a247ac9eba4e57e1f90575,"Cisco Digital Network Architecture") Grouping(id_d1b16751a4714e52a55b9f76dbfeff7e,"Summary") Grouping(id_c8eeae46dc224edabd8deaefa986ea44,"3-Components of the Enterprise Network") Grouping(id_8350891cbecc4244821a03a5b530982d,"Components of the Enterprise Network") Grouping(id_0c54e97ccb184e00bdf667db8a9138a9,"Networking devices and their functions") Grouping(id_088b992bf5874054a3491bfed6cfbdb5,"Introduction to Cisco IOS") Grouping(id_a84324ff236449389cb20f5a926382b2,"Places in the network") Grouping(id_5feeb72160ef4bc99ee08ae6de8c8eb7,"Summary") Grouping(id_897be6dda6fd44afa2b3a61d3338c645,"4-Understanding and Configuring Campus Network Technologies") Grouping(id_f0768da185de4e3497b71d6f138e1f5c,"Understanding and Configuring Campus Network Technologies") Grouping(id_463b61fa58cd41a9bb2f9216a59b6ea1,"Campus network technologies") Grouping(id_823d522f46a442bd85f8cc5f3d9b8667,"Campus LAN design considerations") Grouping(id_2cb3a966142c4991a71425523a716971,"A sample network") Grouping(id_b85aca9618054db28bc38f2799dcadbc,"Summary") Grouping(id_a46b4c8540fd49438d09dc64a58ce326,"5-Understanding and Configuring Wireless Access Technologies") Grouping(id_8b56cc12d43545869fe215b460ca9064,"Understanding and Configuring Wireless Access Technologies") Grouping(id_4c9bb591c0e74cbcaaf04bb8dae9b6db,"Benefits of wireless networks") Grouping(id_d909c4036398452380c2a50af57d583e,"Wireless fundamentals") Grouping(id_7a588ab98d47496fb56e93c502ec6aa8,"Configuring the WLAN") Grouping(id_79c9545b660645ba8d229f00f3077c57,"Summary") Grouping(id_ebc3aa26bb45483492e84b4ab78fd42c,"6-Understanding and Configuring WAN Technologies") Grouping(id_ce43810f355740158c6064813e0481b1,"Understanding and Configuring WAN Technologies") Grouping(id_2a0a549b75a241eba2033e4476ef6cd4,"Considerations for a WAN design") Grouping(id_9a3eee6947e44a2ebfecbcd1b0f41039,"WAN technology choices") Grouping(id_114dd57092a546109d2d4099c6ae4987,"Virtual private networks") Grouping(id_e9bf4107405a4da2b71e866104e8c83a,"Connecting to the internet") Grouping(id_4733cd7007944013b158ec59c4a91274,"Encrypting and securing the WAN") Grouping(id_0d8f3a6271de46939c1f091bc20c2f6c,"Optimizing the WAN") Grouping(id_13748bf8966c4b9c9a6cd9404986776a,"Summary") Grouping(id_22248a2316b7493d866da34b1409135b,"7-Understanding and Configuring Data Center Technologies") Grouping(id_3f11c45f5e8547ed8e7742421bbeb264,"Understanding and Configuring Data Center Technologies") Grouping(id_3c2d87cc2e7b45f6beef7edcab4fbfc1,"Functions of a data center") Grouping(id_7cb5c608a05d44c3b240153086a41854,"Evolution of the DC") Grouping(id_ccfac9e6a32e4644b1b70bcdd78fcbc2,"Design of a DC") Grouping(id_ae42f3002d0c436c9ebc1f40a35b5874,"Designing a sample DC") Grouping(id_5bae1848c90443d5935f5a47bad351a1,"Providing remote access to the DC") Grouping(id_c01acda9ea674b2f935d40379624a67a,"Summary") Grouping(id_8962b77a2cfb448599f256a426ad53d8,"8-Understanding and Configuring Network Security") Grouping(id_e5c4115c19b7415e813f27df0ad627d7,"Understanding and Configuring Network Security") Grouping(id_113d7e3d5d5d4ff3bab2e3336e84e9d5,"Security landscape") Grouping(id_0896783b0797499f882fb5cfbe91fc65,"Elements of enterprise security") Grouping(id_1b3eebe06bff4683b7ff92623c6d2141,"Securing network infrastructure") Grouping(id_dda63722547f4062bbf04217a0017fb1,"Security beyond the network devices") Grouping(id_eba8f35ec35943708a341d48980eca41,"Summary") Grouping(id_aa48ca9fc8bd41d48e074b6a1c71aac6,"9-Understanding and Configuring Quality of Service") Grouping(id_18f361f938a345f4b4730fd27def1002,"Understanding and Configuring Quality of Service") Grouping(id_ab84ff5eb3b3443b8d936f829a98d297,"The need for QoS") Grouping(id_f781c53cdcc740118f488e46ffb4c4cc,"Network impact on traffic") Grouping(id_ee691d1081774024b36632594355a820,"QoS models") Grouping(id_be67c33b0af247fbbf494c6ca44a08e5,"QoS tools") Grouping(id_b9dbc2ee606b481c896365089ff21c9b,"QoS design for an enterprise") Grouping(id_f0623b9be8924f688384cf8cc63a60f8,"QoS in a hybrid model with service provider WAN") Grouping(id_3492ea39b0704bbbaba74e05b869548b,"Summary") Grouping(id_d0f5c284012d484aa28ffe2f061dbfaf,"10- A Systematic Approach to Network Management") Grouping(id_a8b22d6ad1ce40c09827e9e23c70ac60,"A Systematic Approach to Network Management") Grouping(id_41feca8f6fed4d42928bde1fbc9df35c,"Frameworks related to network management") Grouping(id_6ed73a51361040b88f496a13c0ad3cab,"Network management planning") Grouping(id_cd6eeec148b84fc98e172215aaa3f551,"Network operations systems components") Grouping(id_34fc161fbf7c4853b3bae0fc290356c2,"Cisco Prime Infrastructure") Grouping(id_061520a898fc4bd98f3b5f2757d8c85c,"Implementing the network management strategy") Grouping(id_75ec96b846a242658c032bb39b09ec51,"Summary") Grouping(id_f301bf3578f44dc4b35b361c5b3e4691,"11- Basic Troubleshooting Skills and Techniques") Grouping(id_248f87004c3647aea70d9f9905d51428,"Basic Troubleshooting Skills and Techniques") Grouping(id_b4ed20ccd94d4f81b1f5dea96e490469,"A framework for structured troubleshooting") Grouping(id_44e18829fe7d4d09aadae22c1ae59469,"Establishing the normal and detecting deviations") Grouping(id_109a0852a2754e8fb66da0c89074bffb,"Network troubleshooting commands") Grouping(id_29182fce0a854e4888d56083e4979639,"Troubleshooting the network") Grouping(id_245efee4af8b49459c670a6c92c0dd11,"Summary") } Rel_Composition(id_656496f890944a57b70c6aa1e85e17db,id_cb51105f26e64b45832da2fbe00b57b1,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_7da6318b40cb437799f2459d2940fd16,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_4ffb48e6072d4fad81db2319ff06717d,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_c8eeae46dc224edabd8deaefa986ea44,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_897be6dda6fd44afa2b3a61d3338c645,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_a46b4c8540fd49438d09dc64a58ce326,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_ebc3aa26bb45483492e84b4ab78fd42c,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_22248a2316b7493d866da34b1409135b,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_8962b77a2cfb448599f256a426ad53d8,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_aa48ca9fc8bd41d48e074b6a1c71aac6,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_d0f5c284012d484aa28ffe2f061dbfaf,"") Rel_Composition(id_cb51105f26e64b45832da2fbe00b57b1,id_f301bf3578f44dc4b35b361c5b3e4691,"") @enduml `37:T533,plantuml` skinparam titleBorderRoundCorner 15 skinparam titleBorderThickness 2 skinparam titleFontSize 15 Title The objects considered by jArchi @startuml Class Selection Collection <|-- Selection Collection o-- Object Selection *-- Filter Class Collection Class Filter Class Object { delete() documentation id model name type prop() removeProp() } Object <|-- Model Object <|-- Element Object <|-- Relationship Object <|-- Folder Object <|-- View Object <|-- VisualObject Object <|-- VisualConnection Class Model { copy() createArchimateView() createCanvasView() createElement() createRelationship() createSketchView() getPath() openInUI() purpose save() setAsCurrent() } Class Element { merge } Class Relationship { accessType associationDirected influenceStrength source target } Class Folder { add() createFolder() } Class View { add(element) add(relationship) createObject() createViewReference() isAllowedConceptForViewpoint() viewpoint } Class VisualObject { add(element) bounds borderType concept createObject() createViewReference() figureType fillColor fontColor fontName fontSize fontStyle lineColor opacity outlineOpacity text textAlignment textPosition view } Class VisualConnection { addRelativeBendpoint() deleteAllBendpoints() deleteBendpoint() labelVisible lineWidth relativeBendpoints source target } @enduml `38:T6d7,plantuml` @startuml(id=viewListOfVets) title Web Application - Dynamic caption Shows how the "view list of vets" feature works. skinparam { shadowing false arrowFontSize 10 defaultTextAlignment center wrapWidth 200 maxMessageSize 100 } hide stereotype skinparam rectangle<<11>> { BackgroundColor #d4f3c0 FontColor #000000 BorderColor #94AA86 } skinparam rectangle<<2>> { BackgroundColor #519823 FontColor #ffffff BorderColor #386A18 } skinparam rectangle<<13>> { BackgroundColor #6cb33e FontColor #000000 BorderColor #4B7D2B } skinparam database<<5>> { BackgroundColor #91d366 FontColor #ffffff BorderColor #659347 } skinparam rectangle<<17>> { BackgroundColor #95d46c FontColor #000000 BorderColor #68944B } rectangle "==Clinic Employee\n[Person]\n\nAn employee of the clinic" <<2>> as 2 rectangle "==VetController\n[Component: Spring MVC Controller]" <<11>> as 11 rectangle "==ClinicService\n[Component: Spring Service]\n\nMostly used as a facade so all controllers have a single point of entry" <<13>> as 13 rectangle "==VetRepository\n[Component: Spring Repository]\n\nRepository class for Vet domain objects All method names are compliant with Spring Data naming conventions so this interface can easily be extende..." <<17>> as 17 database "==Database\n[Container: Relational Database Schema]\n\nStores information regarding the veterinarians, the clients, and their pets." <<5>> as 5 2 .[#707070].> 11 : "1. Requests list of vets from /vets\n[HTTP]" 11 .[#707070].> 13 : "2. Calls findVets" 13 .[#707070].> 17 : "3. Calls findAll" 17 .[#707070].> 5 : "4. select * from vets\n[JDBC]" @enduml `39:T11ad,plantuml` @startuml skinparam DefaultTextAlignment center skinparam arrowColor #000000 skinparam rectangleBackgroundColor #CFE2F3 skinparam fileBackgroundColor #CFE2F3 skinparam databaseBackgroundColor #CFE2F3 skinparam defaultFontSize 18 title ActionFPS portal architecture package "log collection" as p1 { rectangle "syslog\nmultiple servers" <<"<&layers>">> as syslog rectangle "Log lines\n(Syslog server)" <<"<&layers>">> as loglines file "flat file" as flatfile1 syslog -> loglines loglines -> flatfile1 } package "Games, Clanwars, Achivements, Ranks" as p2 { file "flat file" as flatFile2 rectangle "Log\nlines" <<"<&layers>">> as logLines2 rectangle "Game\nparser" <<"<&layers>">> as gameParser rectangle "Add countries" as addCountries rectangle "join with\nusers" as joinWithUsers rectangle "Determine\nachievement" as determineAchievement rectangle "join with\nclans" as joinWithClans rectangle "Determine\nclanwar" as determineClanwar database "Rich game\nrepository" as richGameRepository flatFile2 -> logLines2 logLines2 -> gameParser gameParser -> addCountries addCountries -> joinWithUsers joinWithUsers -> determineAchievement determineAchievement -> joinWithClans joinWithClans -> determineClanwar determineClanwar -> richGameRepository rectangle "GeoIP" as geoIp loglines -[hidden]-> geoIp geoIp --> addCountries database "User\nrepository" as userRepository file "users csv" as users.csv file "Nicknames csv" as nicknames.csv joinWithUsers --> userRepository userRepository <-- users.csv userRepository <-- nicknames.csv rectangle "User\nachievements" <<"<&layers>">> as userAchievements #D9D2E9 rectangle "Hall of fame" as hallOfFame determineAchievement --> userAchievements userAchievements --> hallOfFame rectangle "Generate\nclanwars" <<"<&layers>">> as generateClanwars database "Clanwar\nrepository" as clanwarRepository rectangle "Clan ranks" as clanRanks rectangle "Challange Publish" as challangePublish #D9EAD3 rectangle "Player ranks" as playerRanks rectangle "User statistics" <<"<&layers>">> as userStatistics #D9D2E9 rectangle "Challange Publish" as challangePublish2 #D9EAD3 rectangle "EventSource\nendpoint for new\ngames" as eventSourceEndpoint #D9EAD3 joinWithClans --> generateClanwars determineClanwar --> generateClanwars generateClanwars --> clanwarRepository clanwarRepository -> clanRanks clanwarRepository --> challangePublish richGameRepository --> clanRanks richGameRepository --> playerRanks richGameRepository --> userStatistics richGameRepository -> challangePublish2 eventSourceEndpoint <-- richGameRepository } @enduml @startuml skinparam DefaultTextAlignment center skinparam arrowColor #000000 skinparam rectangleBackgroundColor #CFE2F3 skinparam fileBackgroundColor #CFE2F3 skinparam databaseBackgroundColor #CFE2F3 skinparam defaultFontSize 18 package "Pinger (Live games)" as p3 { rectangle "Game\nservers" <<"<&layers>">> as gameServers rectangle "UDP server\nstatus updates" <<"<&layers>">> as udpServer rectangle "Status parser" <<"<&layers>">> as statusParser rectangle "EventSource\nendpoint for\nstatus updates" as eventSourceEndpoint2 #D9EAD3 gameServers -> udpServer udpServer -> statusParser statusParser -> eventSourceEndpoint2 } package "Ladder" as p4 { file "SSH log file" as sshLogFile rectangle "Log lines" <<"<&layers>">> as logLines3 rectangle "join with users" as joinWithUsers2 rectangle "User ladder\nstatistics" <<"<&layers>">> as userLadderStatistics #D9D2E9 database "User\nrepository" as userRepository2 sshLogFile -> logLines3 logLines3 -> joinWithUsers2 joinWithUsers2 -> userLadderStatistics joinWithUsers2 <-- userRepository2 } p3 -[hidden]-> p4 package "Inters" as p5 { database "User\nrepository" as userRepository3 file "flat file" as flatFile3 rectangle "Log\nlines" <<"<&layers>">> as logLines4 rectangle "join with users" as joinWithUsers3 rectangle "EventSource\nendpoint" as eventSourceEndpoint3 #D9EAD3 userRepository3 --> joinWithUsers3 flatFile3 -> logLines4 logLines4 -> joinWithUsers3 joinWithUsers3 -> eventSourceEndpoint3 } p4 -[hidden]> p5 @enduml`3a:[{"id":"5a599dc027eee316f90bd582a7c115766683739ade96a057ab1de8dc1a7128c1426785b482eef7ca003b8d0e5b3214594f771e1160b96681dc573b96b83dd55b","href":"https://static.observableusercontent.com/files/5a599dc027eee316f90bd582a7c115766683739ade96a057ab1de8dc1a7128c1426785b482eef7ca003b8d0e5b3214594f771e1160b96681dc573b96b83dd55b","name":"About the Matrixes in ArchiMateCG.docx","type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","lastModified":1671804902010.031,"size":191264}] 29:{"id":"1587a6ecc96a41d2","slug":"playing-with-plantuml-in-observable/2","title":"Playing with PlantUML in Observable","thumbnail":"88e402ee1a79dbde3afbde1b056d5dea5d6260c182bcd9455bda8d8c1e336c70","access_level":"public","create_time":"$D2020-11-18T09:03:27.401Z","update_time":"$D2022-11-30T13:54:48.594Z","view_time":null,"first_public_time":"$D2020-11-18T09:03:40.616Z","fork":true,"stars":7,"starred":false,"owner":{"type":"team","id":"37f7a7f77e187b5e","login":"nfigay","name":"Figay","avatar_url":"https://avatars-next.observableusercontent.com/071fc1ce1d8fbec71d4409987642a0c881b8a3651627b51e2cdaa7fcde295a10","tier":"starter_2024"},"version":422,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"71983294fb89ee80","login":"nfigay","name":"Figay","avatar_url":"https://avatars-next.observableusercontent.com/604017b640b1f50c2b41a96fcf316faa227738b7b2b4d0f6221ace789ebbfd42","tier":null}],"members":[{"type":"individual","id":"71983294fb89ee80","login":"nfigay","name":"Figay","avatar_url":"https://avatars-next.observableusercontent.com/604017b640b1f50c2b41a96fcf316faa227738b7b2b4d0f6221ace789ebbfd42","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":4,"collection":null,"type":"notebook","body":{"title":"Playing with PlantUML in Observable","cells":[{"id":0,"value":"md`\n# Playing with PlantUML in Observable\n+ It is first needed to import plantuml the following way\n~~~js \nimport {plantuml} from \"@karlerasmus/plantuml-in-observable\"\n~~~\n+ Then just start a plantuml tag in a cell with the textual description of you model\n\nIf willing to take advantage creating the config view applicable to all the diagrams in the page, you have to insert plantuml, zip_deflate and d3 requires inside you notebook, and not to include config in the created views. In this page, a config is created just for the firt diagram which is quite huge.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":217,"value":"$2b","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":220,"value":"$2c","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":223,"value":"d3 = require(\"d3@5\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":204,"value":"import { View } from \"@mbostock/synchronized-views\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":200,"value":"viewof plantuml_config = new View({\n server: \"https://www.plantuml.com/plantuml\",\n cache: true,\n maxWidth: width,\n maxHeight: Math.min((width * 3) / 4, 720),\n panAndZoom: true\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":202,"value":"$2d","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":240,"value":"md`\nSo you can produce ArchiMate diagrams by relying on plantuml-archimate, as shown in this first diagram also illustrating the need to provide a specific config for the maximum width (not changed with the global options behind).\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":229,"value":"$2e","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":33,"value":"md`\nYou can produce UML diagrams, eventually with some hyperlinks (let's try them for accessing the article about Reactive technologies).\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":402,"value":"plantuml`\n@startuml\n:user2: as Admin\n(Utilise l'application) as (Use)\n\nUser -> (Début)\nUser --> (Use)\n\nAdmin ---> (Use)\n\nnote right of Admin : Cela est une exemple.\n\nnote right of (Use)\n Une note peut\n également être sur plusieurs lignes\nend note\n\nnote \"Cette note est connectée\\nà plusieurs objets.\" as N2\n(Début) .. N2\nN2 .. (Use)\n@enduml\n\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":414,"value":"nom = \"nicolas\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":43,"value":"plantuml`\n@startuml\nactor Follower\nactor \"[[https://www.linkedin.com/in/nfigay/ Nicolas]]\" as Nicolas\nFollower -> Nicolas [[https://www.linkedin.com/in/nfigay/]] : Request\nnote left [[https://www.linkedin.com/pulse/emerging-landscape-reactive-technologies-why-does-matter-figay/]]\n a request\nend note\nNicolas -> Follower : Response with [[https://www.linkedin.com/pulse/emerging-landscape-reactive-technologies-why-does-matter-figay/{Tooltip for message} some link]]\nnote right [[https://www.linkedin.com/pulse/emerging-landscape-reactive-technologies-why-does-matter-figay/]] : Link to the article\nnote left of Nicolas\nYou can access [[https://www.linkedin.com/pulse/emerging-landscape-reactive-technologies-why-does-matter-figay/ the article]] .\nend note\n@enduml\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":35,"value":"md`\nYou can produce C4 diagrams\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":3,"value":"$2f","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":48,"value":"md`\nYou can produce ArchiMate diagrams\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":51,"value":"$30","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":114,"value":"md`\nHowever let's pay attention to the following points:\n* The used naming convention for names of elements or relationships is not the same than for Archi or Open Exchange Format for ArchiMate (coding issue as you have to deal with these differences for import/export functions),\n* ArchiMate-PlantUML distinquishes Business_Location and Other_Location, when only \"Location\" is specified for ArchiMate,\n* If Grouping is an ArchiMate model element, it is not the case for Group which is only a visual element,\n* The following diagram reflects the naming convention used with the Open Exchange Format (Caps, neither \"_\" or \"-\" used for the name.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":107,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":120,"value":"md`\nLet's note that naming conventions are also different within the ArchiMate specifications, e.g. referring to the ArchiMate relationships matrix (also available in Archi) or for jArchi, as illustrated by the two following diagrams.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":123,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":132,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":258,"value":"md`\nWhen creating diagrams with plantuml-archimate, if the nodes referenced by a relationship are not defined, a node with the id is created in the diagram, as illustrated by the following one.\n`\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":246,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":253,"value":"md`\nWhen the same diagram includes visual containment definition, it gives the following results. Here arcs representing the same composition relation for the group are also drawn (Archi hides them systematically).\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":250,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":338,"value":"$36","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":262,"value":"$37","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":54,"value":"md`\nYou can produce Ganttdiagrams\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":61,"value":"plantuml`\n@startuml\n[Task1] lasts 10 days\nthen [Task2] lasts 4 days\n-- Phase Two --\nthen [Task3] lasts 5 days\nthen [Task4] lasts 6 days\n@enduml\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":283,"value":"plantuml`\n@startuml\n\nclass Aircraft << (I,#FF7700) Singleton>><>\nAircraft --> Definition\nComponent Definition << (D,orchid)>> {\nComponent Date << (D,orchid)>> {\nclass Foo {\n**Bar(Model)**\n|_ prop\n|_ **Bom(Model)**\n |_ prop2\n |_ prop3\n |_ prop3.1\n|_ prop4\n--\n}\n}\n}\n@enduml\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":190,"value":"$38","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":335,"value":"$39","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":63,"value":"md`\nYou can produce Kubernetes sprites\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":65,"value":"plantuml`\n@startuml\n!include \npackage \"Infrastructure\" {\n component \"<$master>\\nmaster\" as master\n component \"<$etcd>\\netcd\" as etcd\n component \"<$node>\\nnode\" as node\n}\n@enduml\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":74,"value":"md`\nNothing prevents having nested objects.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":81,"value":"plantuml`\n@startuml\n\npackage \"Some Group\" {\n HTTP - [First Component]\n [Another Component]\n}\n\nnode \"Other Groups\" {\n FTP - [Second Component]\n [First Component] --> FTP\n}\n\ncloud {\n [Example 1]\n}\n\n\ndatabase \"MySql\" {\n folder \"This is my folder\" {\n [Folder 3]\n }\n frame \"Foo\" {\n [Frame 4]\n }\n}\n\n\n[Another Component] --> [Example 1]\n[Example 1] --> [Folder 3]\n[Folder 3] --> [Frame 4]\n\n@enduml\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":326,"value":"md`\nYou can include icons by mean of the common plantuml plugin at https://github.com/tupadr3/plantuml-icon-font-sprites\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":330,"value":"plantuml`\n@startuml\n\nskinparam defaultTextAlignment center\n\n!define ICONURL https://raw.githubusercontent.com/tupadr3/plantuml-icon-font-sprites/v2.2.0\n\n!includeurl ICONURL/common.puml\n!includeurl ICONURL/devicons/mysql.puml\n!includeurl ICONURL/font-awesome/server.puml\n!includeurl ICONURL/font-awesome-5/database.puml\n\ntitle Styling example\n\nFA_SERVER(web1,WEB1) #Green\nFA_SERVER(web2,WEB1) #Yellow\nFA_SERVER(web3,WEB1) #Blue\nFA_SERVER(web4,WEB1) #YellowGreen\n\nFA5_DATABASE(db1,LIVE,database,white) #RoyalBlue\nDEV_MYSQL(db2,SPARE,database) #Red\n\ndb1 <--> db2\n\nweb1 <--> db1\nweb2 <--> db1\nweb3 <--> db1\nweb4 <--> db1\n\n@enduml\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":242,"value":"md`\nOne of the issue with plantuml: it remains a drawing tool, which can't replace a visual modeling platform sur as Papyrus (for UML) or Archi (for ArchiMate).\nFor generating documentation from such modeling platform and include them e.g. in an Observable Notebook, ones can create some exports. For Archi, it can be realized with jArchi. The target should be plantuml-archimate. However, it can be interesting deriving some UML diagrams, e.g. for dynamic diagrams such as sequence diagrams, in order to details some collaboration scenarios. But this is another topic.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W3a","stdlib":"1","titling":"auto"}} 2a:"$29:body"