Flag 🏳️🏴
.
Log in to post a comment.
const type = 2; //min=0 max=3 step=1 (HorizontalBanner, VerticalBanner, NordicCross, CenterCircle)
const banners = 2; //min=1 max=13 step=1
const color1 = 1; //min=1 max=9 step=1 (Blue,Red,Yellow,Green,Orange,Purple,White,Grey,Black)
const color2 = 7; //min=1 max=9 step=1 (Blue,Red,Yellow,Green,Orange,Purple,White,Grey,Black)
const color3 = 2; //min=0 max=9 step=1 (None (repeat),Blue,Red,Yellow,Green,Orange,Purple,White,Grey,Black)
const color4 = 0; //min=0 max=9 step=1 (None (repeat),Blue,Red,Yellow,Green,Orange,Purple,White,Grey,Black)
const color5 = 0; //min=0 max=9 step=1 (None (repeat),Blue,Red,Yellow,Green,Orange,Purple,White,Grey,Black)
const nordicBorder = 1; //min=0 max=1 step=1 (No, Yes);
const poleSidedTriangle = 0; //min=0 max=1 step=1 (No, Yes);
// You can find the Turtle API reference here: https://turtletoy.net/syntax
Canvas.setpenopacity(-1);
const left = -70;
const right = 80;
const top = -60;
const bottom = 40;
const width = right - left;
const height = bottom - top;
const colors = [[.3, .8], [1.3, .7], [.5, .5], [1, .75], [1.2, .6], [.2, .75], [0, .2], [0, .4], [0, 100]];
const useColors = [colors[color1 - 1], colors[color2 - 1]];
if(color3 > 0) { useColors.push(colors[color3 - 1]); }
if(color4 > 0) { useColors.push(colors[color4 - 1]); }
if(color5 > 0) { useColors.push(colors[color5 - 1]); }
function Wave(f, a) { return p => [p[0], p[1]+Math.sin(p[0]*f)*a* Math.min(1, (p[0] + (width / 2)) / width) ]; }
// Global code will be evaluated once.
const turtle = new Turtle();
const tortoise = new Tortoise().addTransform(Wave(.08,10));//new Turtle();
const polygons = new Polygons();
// The walk function will be called until it returns false.
function walk(i) {
if(poleSidedTriangle == 1) {
let p = polygons.create();
p.addPoints(
[left, top],
[left + (width / 2), top + (height / 2)],
[left, bottom]);
p.addHatching(...useColors[useColors.length - 1]);
polygons.draw(tortoise, p);
}
switch(type) {
case 0: //horizontal banner
let bannerHeight = height/banners;
for(let j = 0; j < banners; j++) {
let p = polygons.create();
p.addPoints(
[left, top + (j * bannerHeight)],
[right, top + (j * bannerHeight)],
[right, top + ((j+1) * bannerHeight)],
[left, top + ((j+1) * bannerHeight)]);
p.addHatching(...useColors[j % useColors.length]);
polygons.draw(tortoise, p);
}
break;
case 1: //vertical banner
let bannerWidth = width/banners;
for(let j = 0; j < banners; j++) {
let p = polygons.create();
p.addPoints(
[left + (j * bannerWidth), top],
[left + ((j+1) * bannerWidth), top],
[left + ((j+1) * bannerWidth), bottom],
[left + (j * bannerWidth), bottom]);
p.addHatching(...useColors[j % useColors.length]);
polygons.draw(tortoise, p);
}
break;
case 2: //nordicCross
let lint = height / 5;
if(nordicBorder == 1) {
let p = polygons.create();
p.addPoints(
[left + (lint*2) + (lint/4), top],
[left + (lint*3) - (lint/4), top],
[left + (lint*3) - (lint/4), bottom],
[left + (lint*2) + (lint/4), bottom]
)
p.addHatching(...useColors[2 % useColors.length]);
polygons.draw(tortoise, p);
p = polygons.create();
p.addPoints(
[left, top + (lint*2) + (lint/4)],
[left, top + (lint*3) - (lint/4)],
[right, top + (lint*3) - (lint/4)],
[right, top + (lint*2) + (lint/4)]
)
p.addHatching(...useColors[2 % useColors.length]);
polygons.draw(tortoise, p);
}
if(true) { //need closure
let p = polygons.create();
p.addPoints(
[left + (lint*2), top],
[left + (lint*3), top],
[left + (lint*3), bottom],
[left + (lint*2), bottom]
)
p.addHatching(...useColors[1 % useColors.length]);
polygons.draw(tortoise, p);
p = polygons.create();
p.addPoints(
[left, top + (lint*2)],
[left, top + (lint*3)],
[right, top + (lint*3)],
[right, top + (lint*2)]
)
p.addHatching(...useColors[1 % useColors.length]);
polygons.draw(tortoise, p);
p = polygons.create();
p.addPoints(
[left, top],
[right, top],
[right, bottom],
[left, bottom]
)
p.addHatching(...useColors[0]);
polygons.draw(tortoise, p);
}
break;
case 3:
if(true) { //need closure
let p = polygons.create();
for(let j = 0; j < 40; j++) {
p.addPoints([left + (width / 2) + (Math.cos((j/20) * Math.PI) * height / 4), top + (height / 2) + (Math.sin((j/20) * Math.PI) * height / 4)]);
}
p.addHatching(...useColors[1]);
polygons.draw(tortoise, p);
p = polygons.create();
p.addPoints(
[left, top],
[right, top],
[right, bottom],
[left, bottom]
)
p.addHatching(...useColors[0]);
polygons.draw(tortoise, p);
}
}
drawPole();
}
function drawPole() {
let p = polygons.create();
p.addPoints([-70, -62], [-75, -62], [-75, 101], [-70, 101]);
p.addHatching(.5, .15);
polygons.draw(turtle, p);
for(let r = 0; r < 6; r+=.1) {
turtle.jump(-72.5, -67 - r);
turtle.circle(r);
}
}
////////////////////////////////////////////////////////////////
// Polygon Clipping utility code - Created by Reinder Nijhoff 2019
// (Polygon binning by Lionel Lemarie 2021)
// https://turtletoy.net/turtle/a5befa1f8d
////////////////////////////////////////////////////////////////
function Polygons(){const t=[],s=25,e=Array.from({length:s**2},t=>[]),n=class{constructor(){this.cp=[],this.dp=[],this.aabb=[]}addPoints(...t){let s=1e5,e=-1e5,n=1e5,h=-1e5;(this.cp=[...this.cp,...t]).forEach(t=>{s=Math.min(s,t[0]),e=Math.max(e,t[0]),n=Math.min(n,t[1]),h=Math.max(h,t[1])}),this.aabb=[s,n,e,h]}addSegments(...t){t.forEach(t=>this.dp.push(t))}addOutline(){for(let t=0,s=this.cp.length;t<s;t++)this.dp.push(this.cp[t],this.cp[(t+1)%s])}draw(t){for(let s=0,e=this.dp.length;s<e;s+=2)t.jump(this.dp[s]),t.goto(this.dp[s+1])}addHatching(t,s){const e=new n;e.cp.push([-1e5,-1e5],[1e5,-1e5],[1e5,1e5],[-1e5,1e5]);const h=Math.sin(t)*s,o=Math.cos(t)*s,a=200*Math.sin(t),i=200*Math.cos(t);for(let t=.5;t<150/s;t++)e.dp.push([h*t+i,o*t-a],[h*t-i,o*t+a]),e.dp.push([-h*t+i,-o*t-a],[-h*t-i,-o*t+a]);e.boolean(this,!1),this.dp=[...this.dp,...e.dp]}inside(t){let s=0;for(let e=0,n=this.cp.length;e<n;e++)this.segment_intersect(t,[.1,-1e3],this.cp[e],this.cp[(e+1)%n])&&s++;return 1&s}boolean(t,s=!0){const e=[];for(let n=0,h=this.dp.length;n<h;n+=2){const h=this.dp[n],o=this.dp[n+1],a=[];for(let s=0,e=t.cp.length;s<e;s++){const n=this.segment_intersect(h,o,t.cp[s],t.cp[(s+1)%e]);!1!==n&&a.push(n)}if(0===a.length)s===!t.inside(h)&&e.push(h,o);else{a.push(h,o);const n=o[0]-h[0],i=o[1]-h[1];a.sort((t,s)=>(t[0]-h[0])*n+(t[1]-h[1])*i-(s[0]-h[0])*n-(s[1]-h[1])*i);for(let n=0;n<a.length-1;n++)(a[n][0]-a[n+1][0])**2+(a[n][1]-a[n+1][1])**2>=.001&&s===!t.inside([(a[n][0]+a[n+1][0])/2,(a[n][1]+a[n+1][1])/2])&&e.push(a[n],a[n+1])}}return(this.dp=e).length>0}segment_intersect(t,s,e,n){const h=(n[1]-e[1])*(s[0]-t[0])-(n[0]-e[0])*(s[1]-t[1]);if(0===h)return!1;const o=((n[0]-e[0])*(t[1]-e[1])-(n[1]-e[1])*(t[0]-e[0]))/h,a=((s[0]-t[0])*(t[1]-e[1])-(s[1]-t[1])*(t[0]-e[0]))/h;return o>=0&&o<=1&&a>=0&&a<=1&&[t[0]+o*(s[0]-t[0]),t[1]+o*(s[1]-t[1])]}};return{list:()=>t,create:()=>new n,draw:(n,h,o=!0)=>{reducedPolygonList=function(n){const h={},o=200/s;for(var a=0;a<s;a++){const c=a*o-100,r=[0,c,200,c+o];if(!(n[3]<r[1]||n[1]>r[3]))for(var i=0;i<s;i++){const c=i*o-100;r[0]=c,r[2]=c+o,n[0]>r[2]||n[2]<r[0]||e[i+a*s].forEach(s=>{const e=t[s];n[3]<e.aabb[1]||n[1]>e.aabb[3]||n[0]>e.aabb[2]||n[2]<e.aabb[0]||(h[s]=1)})}}return Array.from(Object.keys(h),s=>t[s])}(h.aabb);for(let t=0;t<reducedPolygonList.length&&h.boolean(reducedPolygonList[t]);t++);h.draw(n),o&&function(n){t.push(n);const h=t.length-1,o=200/s;e.forEach((t,e)=>{const a=e%s*o-100,i=(e/s|0)*o-100,c=[a,i,a+o,i+o];c[3]<n.aabb[1]||c[1]>n.aabb[3]||c[0]>n.aabb[2]||c[2]<n.aabb[0]||t.push(h)})}(h)}}}
////////////////////////////////////////////////////////////////
// Tortoise utility code. Created by Reinder Nijhoff 2019
// https://turtletoy.net/turtle/102cbd7c4d
////////////////////////////////////////////////////////////////
function Tortoise(x, y) {class Tortoise extends Turtle {constructor(x, y) {super(x, y);this.ps = Array.isArray(x) ? [...x] : [x || 0, y || 0];this.transforms = [];}addTransform(t) {this.transforms.push(t);this.jump(this.ps);return this;}applyTransforms(p) {if (!this.transforms) return p;let pt = [...p];this.transforms.map(t => { pt = t(pt); });return pt;}goto(x, y) {const p = Array.isArray(x) ? [...x] : [x, y];const pt = this.applyTransforms(p);if (this.isdown() && (this.pt[0]-pt[0])**2 + (this.pt[1]-pt[1])**2 > 4) {this.goto((this.ps[0]+p[0])/2, (this.ps[1]+p[1])/2);this.goto(p);} else {super.goto(pt);this.ps = p;this.pt = pt;}}position() { return this.ps; }}return new Tortoise(x,y);}