Scribd
Upload
26 views1 page

Unio-Holvan Adattípus: U Nioholvan ( (H S: U Nioholvan, X, Y: Elemtip, N1, N2: Nevtip

The document defines a set type called UnioHolvan consisting of subsets of a base set E such that any two subsets are disjoint. It lists operations on UnioHolvan sets including initialization, deletion, emptying, checking membership, merging two elements, counting total elements, counting elements in a subset, and iterating over elements or a subset.

Uploaded by

colosseum00
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views1 page

Unio-Holvan Adattípus: U Nioholvan ( (H S: U Nioholvan, X, Y: Elemtip, N1, N2: Nevtip

The document defines a set type called UnioHolvan consisting of subsets of a base set E such that any two subsets are disjoint. It lists operations on UnioHolvan sets including initialization, deletion, emptying, checking membership, merging two elements, counting total elements, counting elements in a subset, and iterating over elements or a subset.

Uploaded by

colosseum00
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Unio-Holvan adattpus

/
rtkhalmaz: UnioHolvan = {{H1 , . . . , Hk } : Hi E, i = 1, . . . , k, i 6= j Hi H j = 0}
Muveletek:

S : UnioHolvan, x, y : Elemtip, n1, n2 : NevTip

{Igaz}

Letesit(S, n)

{Igaz}

Letesit(S)

/
{S = 0}

{S = {{1}, . . . , {n}}}

{S = S}

Megszuntet(S)

{Igaz}

{S = S}

Uresit(S)

/
{S = 0}

{S = {H1 , . . . , Hk } x Hi }

Holvan(S, x)

}{= y (x Hi y Hi )}

{S = {H1 , . . . , Hk } x
/ Hi }

Holvan(S, x)

{= x S = Pre(S) {{x}}

{S = {H1 , . . . , Hk } n1 Hi n2 H j }

Unio(S, n1, n2)

{S = {H1 , . . . , Hk }}

Elemszam(S)

{S = {H1 , . . . , Hk }}

ReszElemszam(S, x)

{S = S}
{S = {H1 , . . . , Hk } (i)(x Hi )}

{S = Pre(S) Hi H j {Hi H j }}
{= k = |S| S = Pre(S)}
{= |Hi | x Hi S = Pre(S)}

Iterator(S)

{}

ReszIterator(S, x)

{}

You might also like