corrora & //apploc.dek

This is the title and icon free tkinter code for basic example, does run with one window an no logo or tk title.

 

from tkinter import *
from tkinter import ttk
import tempfile

ICON = (b'\x00\x00\x01\x00\x01\x00\x10\x10\x00\x00\x01\x00\x08\x00h\x05\x00\x00'
    b'\x16\x00\x00\x00(\x00\x00\x00\x10\x00\x00\x00 \x00\x00\x00\x01\x00'
    b'\x08\x00\x00\x00\x00\x00@\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00'
    b'\x00\x01\x00\x00\x00\x01') + b'\x00'*1282 + b'\xff'*64

_, ICON_PATH = tempfile.mkstemp()
with open(ICON_PATH, 'wb') as icon_file:
    icon_file.write(ICON)

root = Tk()
root.title(" ")
root.iconbitmap(default=ICON_PATH)

root.mainloop()

 

 

 

(d)irect

0000//// +-(O, A) +-((A, O) +-A, O))    unit 1

0000\\\\ +-(A, O) +-(A, A) +-(O, A).     unit 2

(s)tatic

0000//// +-(O, A +-A, O) +-(A, O)

0000\\\\ +-(A, O) +-(A, A) +-(O, A).

 

 

 

 

Test Results::

 

0000////cmd save, init.control

0000    prog: ,,A, O'' <> X: (in out O, A);

0000    cue "1" out '' then Y: (in out "00");

      -- recog ,,00" as split.trip

init: type load as boolean(1..3)

1cmd boolean is: (+A,O -A,O),

2assist exit when "OO" /n

3exit save /n; cmd "execute text.io"

 

0000 let last.command /=(A, A);

0000 when text.io is boolean.trip;

boolean: subtype trip;

boolean: +-(O, A + O, A) + (A, O)

declare i**2assist is null

recall boolean: subtype extend;

i=2(X); 

if boolean: subtype extend;

then extend aquire 2(X); begin loop;

when static.x is "00";

add i(extend, trip);

endif;

end;

declare split.trip

subtype split

inherit style;

style text.io as recall;

// --this above is the wrong way but works by force

   --then using (X, Y) is now (X, X)

 

0000\\\\cmd config, io.protoc, extend

0000 results: static is loop;

0000 prog: declare endif as static.y;

endif static.y is < (A, A);

0000 procedure static.y

Put static.y in out::(A, O + O, A);

 

endif;

end;...

\\ --then when loop, extract "static.y"

   --load geometry_Math

 

y(\(\(\()x=/ xy > Aa < xy: six-sided star=Aa > xy

   --check list: 6 points, equally.

 

con(s)/.5**2{&}

*2:: L(O) | ayo: x**2/.5

   --L for Angle...

&co(s); L(L)Aa >>

XAL(.5)=A(2): XXy > Aa

 

   --both angles are equal one is static

   --therefore y(\(\(\(x) is a part of Aa > xy because...

 

OYxA**2, y(\(\(\(M2) LL/\A

&a(I=O)00(r) | r2

&A{}r2.imperial

 

   --check again with cobra PL

   --|_\ <<\>>v.xyz are equal to x|a as..

 

x|0  +/aX

 

+a, -a, -a | 0000 from |aXaA/OAAX, AaXa

<xy:z()|00A{r}=aa, r|a  [ra, XX]

to...

xy/z > ayx(\(\(\() | o=ayo

oyXa & X | X=Aa(P): 0000, y(\(\(\()x  =/00|y>Aax

 

therefore...

 

a>a,x>a{}|x as x|x 0000 when polarity is this

and o|a < x<a,x<x|a,X

in universal point.

 

 

 

class geometry_Math

 

    var _read as String

    var _math as int

 

    cue init(read as String, math as int)

base.init

_read = property

_math = math

 

    def sayAg

 

print 'Math: [_math] and property is 

 

[_read].'

 

 

 

y()x =/ xy > Aa < xy: six-sided star = Aa > xy

   --check list: 6 points, equally.

 

con(s)/.5**2{&}

*2:: L(O) | ayo: x**2/.5

   --L for Angle...

&co(s); L(L)Aa >>

XAL(.5) = A(2): XXy > Aa

 

   --both angles are equal one is static

   --therefore y(x) is a part of Aa > xy 

 

because...

 

procedure CONSTANT_term

 

list: triangle, square, pentagon, star

task type 0_term

body

Get (X) out List_Angle: (

triangle.a

triangle.b

triangle.c

triangle.d

 

square.i

square.m )

-- the angles are now 

 

defined

when (X in: List_Angle)

return;

 

results:

 

OYxA**2, y(M2) LL/\A

&a(I=O)00(r) | r2

&A{}r2.imperial

 

integer {A^2}, y(a,o)

a(I=O) * (r)

when r**2 is not equal 

frame_point;

if a(I=O) * r then frame_point;

Get Point;imperial_point;

then r2.imperial is A{Xx, Xr, r};

Put triangle.d;

return; triangle_e is triangle.pointer

value: int(1) when pointer

return; List_Angle:

function (OY_term) is not equal

return r;

 

 

   --basically re-writing formula for 1/2(bh)

--for new triangle to reference points

   --check again with cobra PL

   --|_\ <<\>>v.xyz are equal to x|a as..

 

define

less than is divided by when less than

v.xyz is greater when equal

type NEW_TRIANGLE

function(Get NEW_TRIANGLE as 

 

pointer)

subtype is t.pointer

when /= to t.pointer, define 'parameter' as 

 

area;

 

 

x|0  +/aX

 

--now when there is a zero initiate, 

 

do this:

--when divided, add pointer to

Put(X) in Integer

return;

--Integer must remain 0; return will 

 

record --error therefore;

Put 2(X) in out Integer;

Integer: (0, 1)

 

--now reads formulation from A^2 and 

 

y(a,o)

 

+a, -a, -a | 0000 from |aXaA/OAAX, 

 

AaXa

<xy:z()|00A{r} = aa, r|a  [ra, XX]

to...

xy/z > ayx() | o = ayo

oyXa & X | X = Aa(P): 0000, y()x  

 

=/00|y>Aax

 

therefore...

 

a>a,x>a{}|x as x|x 0000 when polarity 

 

is this

and o|a < x<a,x<x|a,X

in universal point.

 

In all reason, any tangent or cos, sin and 

 

tan, can display the point in an accurate rate 

 

to focus on showing two triangles that are 

 

both right angles can also be displayed from 

 

reversing a third right triangle to form an 

 

exact recreation if tangents cross, will give 

 

the information of the polygons. Then can use 

 

shared area to define last tangent. The image

 

below is a color coded 1-15 pascal triangle that

 

no colors are adjacent to eachother or across.