►
From YouTube: NGS weekly meeting #2 - 2021-10-17
Description
Next Generation Shell is a modern programming language for DevOps.
This episode is a status update on recently done and upcoming work on NGS.
A
A
Okay,
okay,
so
yeah,
maybe
I'll
also
show
something
so
previously.
On
this
channel,
I
was
working
on
the
tr
facilities.
That's
the
deep
data
structures,
manipulation.
It
looks
like
I'm
near
the
end
of
this
facility.
What
I'll
be
doing
in
the
next
week
or
two
I'll
be
comparing
to
what
we've
got
versus
the
design
document,
see
that
nothing
was
missed
and
if
something
was
missed,
is
it
critical
or
we
can
move
on
for
now
and
implement
that
later?
A
I
feel
that
it's
pretty
complete.
I
think
it's
already
useful.
So
maybe
we
can
skip
if
there's
some
left
over
so
regarding
a
site
review,
pull
request
from
ricardo,
so
ricardo
updated
the
site
and
it's
now
exist
as
a
pull
request.
I
started
looking
into
that.
Unfortunately,
I
have
not
finished
yet
it
might
take
some
time.
A
So
what
else
in
my
records
here
our
next
milestone,
so
this
apr
facility
for
the
deep
data
structures
was
part
of
the
milestone.
This
milestone
was
called
deep
data
structures
that
is
0
2
13
release.
That's
where
it
all
goes.
It
has
couple
of
other
things
in
it,
which
I
intend
to
finish
real
soon
now,
and
the
next
milestone
would
be
allowing
next
generation
shell
to
run
inside
lambda
and
after
that.
B
B
A
A
B
A
B
A
A
A
A
B
A
B
B
B
A
B
B
A
B
B
You
have
here
an
ngs
example
that,
if
you
click
on
that
it
already
has
the
things
that
you
have
to
run.
Okay,
so
actually
this.
This
is
like
our
job
jupiter
installation
script,
and
this
thing
this
does
two
things:
it
checks
if
ngs
is
installed,
if
it's
not,
is
it
and
then
it
installs
the
extension,
so
ngs
is
already
installed
inside
the
image,
so
that
step
we
can
leave
it
outside,
and
this
is
just
basically
getting
the
extension
and
putting
it
in
on
the
ring
on
the
right
place.
B
B
B
A
A
A
Okay,
yes,
so
our
previous
meeting
started
at
what
happens.
If
you
tell
tr
to
skip
the
item
at
the
top
level,
so
I
decided
it's
an
exception.
So
if
you
have
a
deep
data
structure
and
you
have
a
pattern
which
matches
at
the
top
label-
and
it
says,
remove
the
object.
Well,
you
cannot
do
that
because
it's
top
label
so
well.
It
will
throw
an
exception
other
than
that
we
have
like
this
example.
A
A
How
is
it
more
complicated?
This
shows
that
the
extra
items
which
are
not
matching
they
are
left,
as
is
that's
the
intention
and
also
here
inside.
If
you
don't
have
a
match
everything
just
left
us
is
so
this
facility
already
traverses
the
data
structures
top
down.
Whenever
you
have
a
match,
you
can
decide
what
you
want
to
do
with
that.
A
That
means
you
either
return
a
new
data
structure
instead
of
the
old
one
or
you
tell
to
skip
the
match
or
it's
not
or
actually
it's
more
extension
into
the
new
data
structures
that
you
return.
For
example,
if
you
had
an
array-
and
you
want
to
prepend
and
append
an
element,
but
you
also
want
to
keep
the
old
elements.
A
You
have
a
function
which
you
can
use
in
your
callback
to
descend
into
the
original
data
structures.
That's
how
you
can,
for
example,
wrap
any
array
and
have
additional
elements
at
start
at
the
end,
so
just
to
show
how
this
works
just
copy
paste.
This
example
run
it
okay,
so
any
area
we
had
here
now
has
two
additional
elements,
one
in
front
one
in
the
back,
and
this
is
how
it
looks
like
and
it's
recursive
because
of
descent.
A
A
The
implementation
itself
is
not
very
big.
I
thought
it
will
be
bigger.
It's
like
200
something
lines
right
now.
I
expected
it
to
be
bigger,
but
it's
somehow
short.
Maybe
there
are
things
missing,
but
I'll,
be
looking
at
this
design
document
and
see
if
there's
anything
missing
and
either
implementing
or
designing
to
postpo
deciding
to
postpone.
A
B
A
I'll
stop
recording
now,
thanks
for
listening
and
watching,
see
you
next
week
or
if
it's
very
problematic,
maybe
in
two
weeks
we
need
to
decide
we'll
keep
you
posted
guys
and
girls
about
what
we
decide
about
scheduling
as
the
original
plan
was
weekly.
But
let's
see,
if
you
have
enough
content
for
that
see
you.