►
From YouTube: Rust Lang Meetup - November 2018
Description
No description was provided for this meeting.
If this is YOUR meeting, an easy way to fix this is to add a description to your video, wherever mtngs.io found it (probably YouTube).
A
A
Yes,
it
really
depends
on
what
kind
of
programming
paradigm
that
you
are
into
so
as
long
as
it
works,
it
really
doesn't
really
matter
so
the
next
one
is
saddle.
Point
saddle
point
is
finding
a
point
in
the
matrix
where
all
the
entry
itself
is
the
greatest
between
all
the
elements
in
the
rows,
but
it
tastes
the
smallest
within
the
cell.
The
columns.
A
B
B
A
So
that's
a
lot
of
discussions
going
on,
so
I
was
told
about,
for
instance,
how
flat
map
can
be
used
to
simplify
the
sum
of
my
code
by
camber
here.
A
filter
of
the
map,
which
is
usually
can
be
simplified
with
a
flat
map,
so
in
the
end,
chocolate
in
the
end.
The
whole
thing
looks
like
this
is
a
lot
shorter.
C
A
Because
if
the
only
way
you
can
manipulate
a
mess
of
things
that
we
don't
see,
we
know
they
nestle
already
or
whatever.
But
if
you
have
a
list
of
things
that
you
want
to
manipulate,
you
want
to
add
in
entries
to
the
list.
The
best
way
to
do
it
is
by
vector,
because
array
is
immutable
by
default.
So
it's
station
since
I.
B
A
Not
to
fill
pala
what
I
know
is
is
lazy,
so
if
you
really
want
the
result,
you
have
to
go
call
collect
otherwise
it
you
won't
get
a
result
and
if
you
don't
collect
your
result,
you
have
lifetime
problem
when
it
comes
to
when
you
need
to
use
it
later,
because
if
you
don't
collect
it,
it
will
be
drop.
Then,
when,
when
you
want
to
use
it,
then
it's
not
there
anymore.
A
A
C
A
A
A
B
A
B
A
A
But
sooner
or
later,
as
time
goes
on,
then,
whenever
the
compiler
shows
you
our
problem
on
our
own
commercial
internet,
you
kind
of
feel
some
kind
of
intuition
on
how
to
really
solve
it.
I
can't
really
tell
you
and
every
time
like
why
it
happens,
but-
and
this
like
at
the
current
stage
I
can
like
oh
I
know
this
may
be
a
ownership
problem
like
let
them
lengthening
the
time.
It
leaves
a
probably
solve
the
problem,
but
I
cannot
believe.
A
A
A
A
A
B
A
If
you
want
to
do
it
in
one
goal,
this
is
what
you
do,
so
you
remember
eight
and
you
will
need
about
special
ones.
Then,
in
the
end,
you
sum
up.
Everything
together
is
an
easy
problem:
let's
not
spend
too
much
remodeling,
so
the
max
is
a
batch.
Cipher
also
is
a
very
boring
cipher,
which
practically
you
put
the
first
letter
into
the
last
letter
A
to
Z,
then
B
Y
C
to
acts
as
a
trance
or
also
boxes.
A
So
if
you,
if
you
think
again,
then
ciphering
and
deciphering,
is
writing
the
same
process
just
that
the
only
additional
requirement
is
that
you
break
the
cipher
text
in
so
you
add
a
space
after
every
5th
character,
I
think
yeah,
that's
that's.
What
is
required
in
the
unit
has
so
speaking
of
unicast.
A
B
A
B
B
A
B
A
A
B
A
A
A
So
the
reason
why
I
talk
about
concat
yourself
so
because
a
concat
is
practically
I
told
one
side
effects
will
happen,
so
I
want
a
new
copy
of
things
when
within
happens.
So
if
I
really
want
that
to
happen
in
Russ,
then
I
need
to
write
a
lot
of
code
to
do
that.
A
lot
of
concat
a
lot
of
cloning
love
this
and
that
so
in
this
one
is
practically
parentheses.
Matching
exercise.
B
A
A
A
A
A
A
A
A
A
A
C
A
A
A
A
B
A
B
B
A
Very,
very
nice:
there
are
a
lot
of
quality
of
life
kind
of
method
in
the
ring.
The
only
problem
is
that
you
don't
actually
expected
discount
things,
so
you
don't
actively
look
for
them
unless
you
read
the
whole
thing
whenever
you
like
Google,
there's
a
lot
of
quality
of
lighting
in
the
standard
wheel.
That's
why
I
can
tell
so
the
next
one
is
a
lot
more
complicated.
It's
not
hard!
A
B
B
C
A
B
B
A
B
A
A
A
A
A
A
A
A
A
I'm
a
Graham
come
so
I
do
a
lot
of
searching
at
work.
So
anagram
to
me
is
just
like
an
indexing
document
problem,
so
I
ask
where
it
assumed
a
bag
of
words
model.
So
what
it
means
is
that
two
documents,
with
the
same
word
in
different
order.
It
has
the
same
resulting
vector.
So
anagram
is
also
the
same
thing
to
me.
So
two
words
as
long
as
it
has
the
same
set
of
alphabets
in
different
order,
and
it
is
anagram.
So
these
two
bubbles
are
similar
to
me.
A
B
A
A
A
B
B
A
A
That's
a
way
there's
a
way
to
do
it.
I,
don't
remember
how
I
did
it
is
explained
in
documentation,
so
I
did
yeah
I
did
what
the
documentation
say,
sir,
if
you
want
me
to
explain
what
the
code
does,
I
am
probably
don't
remember
it's
just.
You
need
to
reassemble
everything
together.
So
instead
of
building
a
vector
of
practice,
I
build
a
rack
of
string
where
the
string
is
actually
one
complete
unity,
unicode
character.
A
A
A
A
A
A
A
A
C
B
A
A
A
B
A
B
B
A
B
B
A
A
C
A
B
A
A
B
A
B
B
A
B
B
B
B
A
B
B
A
A
You
know
you
should
the
past
exists
not
pass
on
that
machine.
That's
all.
It
should
be
pasta,
so
the
last
one
is
interpreter
for
this
mini
language.
So
there
are
reload.
We
wrote
a
couple
times.
Yes,
yes,
a
lot
of
references,
a
lot
of
mutation,
it
gets
very
hairy
and
you
have
a
lot
of
this,
so
it's
not
really
fun
to
really
so
practically.
What
it
does
is
a
new
tokenized
thing
into
rust
objects.
Then
you
believe
evaluate
from
the
left
right.
That's
all
nothing
too.
Fancy
is
happening
here.
A
So
this
is
the
latest
version.
This
12
revision
I
think
this
is
the
most
I've
done
for
any
of
the
exercise.
So
far
so
sorry
I
see
which
where's
our
reference
counting
opens
counter.
So
in
some
cases
where
you
there
are
certain
things
that
you
cannot
clone,
then,
if
you
relieved
once
it
will
be
clone,
then
you
can
use
hacia,
our
pointer.
A
A
So
this
is
what
happens
if
you
want
to
submit
a
different
crate
into
solution,
so
in
this
case
I
don't
use
an
extra
cream,
but
I
use
a
newer
addition
of
brass,
so
I
need
to
submit
on
patent.
Oh
I,
don't
know
so
when
you
submit
the
configuration
up
so
then
the
mentor
can
have
the
same
configuration
as
I.
I
have
to
run
the
code.
A
A
A
B
B
A
A
B
B
B
B
C
B
D
B
D
D
B
D
B
D
D
B
B
D
B
B
D
B
B
B
D
B
B
C
B
B
D
B
B
B
D
B
D
D
D
D
D
D
There's
no
color
option.
You
know
like
last
year,
I
there
are
a
lot
of
deaf,
quite
no
color
something
some
new
wearables
they're
called
Oh
color.
Hope
people
do
one
color
that
just
enabled
by
this
very
useful,
because
they
will
show
you,
which
line
like
nine
line,
number
that
one
can
see
this.
This
thing
this
arrows
were
used
to
when
sometimes
you
have
lifetime
issue
that
your
point
out.
Where
is
the
last
time
you
should
issue?
D
B
B
D
D
D
B
D
D
D
D
D
D
D
B
D
D
D
C
C
C
D
D
D
D
D
C
D
C
B
C
D
D
Familia,
so
this
the
first
one
will
be
the
the
program
visit
our
unique
make
sure
everything
the
same
maximize
I
got
some
before
here
when
I
reduce
the
library
he
originally
when
this
thing
right
is
actually
very
confusing,
come
back,
he
can
be.
Somebody
can
be
silent
ago,
but
yeah
library
that
can
be
used
as
a
hashmap
when
I
can
use
it
after
a
week.
D
D
D
C
C
C
D
D
C
C
D
C
D
D
D
D
D
D
D
B
B
D
D
D
D
D
D
B
D
D
If
project
one
I
can
try
this
again,
we
don't
quite
come
together
as
one,
so
you
can
do
two
one
I
already
knew.
No
other.
You
do
ID
CID
for
a
fool.
B
D
D
D
C
D
I
will
continue
on
that
side.
Okay,
all
right
I
saw
my
I
will
call
out
so
hot.