[김태훈]

이 테셋은 StringSetQQ(혹은 StringQQ)이 들어오려는 StringSetQ(혹은 StringQ).queue가 이미 있는지 없는지를 잘 검사하는지를 테스트해보는 용도로 만든 간단한 테스트셋입니다.

ex2

input

let a=StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"11"),"22");;
let a1 = StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(a,"33"),"44"),"66");;
let b,c=StringSetQ.deq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"aa"),"bb"),"11"));;
let c4 = StringSetQ.enq(c,"22")
let c6 = (StringSetQ.enq(c4,"33"))
let c61,c62 =StringSetQ.deq c6
let c7 = StringSetQ.enq(StringSetQ.enq(c62,"44"),"66")
let d,e=StringSetQQ.deq(StringSetQQ.enq(StringSetQQ.enq(StringSetQQ.emptyq,a1),c7));;
let f,g =StringSetQQ.deq e;;

output

val a : StringSetQ.queue = <abstr>

val a1 : StringSetQ.queue = <abstr>

val b : StringSetQ.element = "aa"

val c : StringSetQ.queue = <abstr>

val c4 : StringSetQ.queue = <abstr>

val c6 : StringSetQ.queue = <abstr>

val c61 : StringSetQ.element = "bb"

val c62 : StringSetQ.queue = <abstr>

val c7 : StringSetQ.queue = <abstr>

val d : StringSetQQ.element = <abstr>

val e : StringSetQQ.queue = <abstr>

Exception: StringSetQQ.EMPTY_Q.




input

let a=StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"11"),"22");;
let a1 = StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(a,"33"),"44"),"55");;
let b,c=StringSetQ.deq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"aa"),"bb"),"11"));;
let c4 = StringSetQ.enq(c,"22")
let c6 = (StringSetQ.enq(c4,"33"))
let c61,c62 =StringSetQ.deq c6
let c7 = StringSetQ.enq(StringSetQ.enq(c62,"44"),"66")
let d,e=StringSetQQ.deq(StringSetQQ.enq(StringSetQQ.enq(StringSetQQ.emptyq,a1),c7));;
let f,g =StringSetQQ.deq e;;
let h = StringSetQQ.deq g;;

output

val a : StringSetQ.queue = <abstr>

val a1 : StringSetQ.queue = <abstr>

val b : StringSetQ.element = "aa"

val c : StringSetQ.queue = <abstr>

val c4 : StringSetQ.queue = <abstr>

val c6 : StringSetQ.queue = <abstr>

val c61 : StringSetQ.element = "bb"

val c62 : StringSetQ.queue = <abstr>

val c7 : StringSetQ.queue = <abstr>

val d : StringSetQQ.element = <abstr>

val e : StringSetQQ.queue = <abstr>

val f : StringSetQQ.element = <abstr>

val g : StringSetQQ.queue = <abstr>

Exception: StringSetQQ.EMPTY_Q.


input

let a=StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"11"),"22");;
let a1 = StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(a,"33"),"44"),"55");;
let b,c=StringSetQ.deq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"aa"),"bb"),"11"));;
let c4 = StringSetQ.enq(c,"22")
let c6 = (StringSetQ.enq(c4,"33"))
let c61,c62 =StringSetQ.deq c6
let c7 = StringSetQ.enq(StringSetQ.enq(c62,"44"),"66")
let d,e=StringSetQQ.deq(StringSetQQ.enq(StringSetQQ.enq(StringSetQQ.emptyq,a1),c7));;
let f,g =StringSetQQ.deq e;;
let h = StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"11"),"22"),"33"),"44"),"66");;
let i = StringSetQQ.enq((StringSetQQ.enq(StringSetQQ.enq(StringSetQQ.emptyq,a1),c7)),h);;
let j,k=StringSetQQ.deq i;;
let l,m = StringSetQQ.deq k;;
let n = StringSetQQ.deq m;;

output

val a : StringSetQ.queue = <abstr>

val a1 : StringSetQ.queue = <abstr>

val b : StringSetQ.element = "aa"

val c : StringSetQ.queue = <abstr>

val c4 : StringSetQ.queue = <abstr>

val c6 : StringSetQ.queue = <abstr>

val c61 : StringSetQ.element = "bb"

val c62 : StringSetQ.queue = <abstr>

val c7 : StringSetQ.queue = <abstr>

val d : StringSetQQ.element = <abstr>

val e : StringSetQQ.queue = <abstr>

val f : StringSetQQ.element = <abstr>

val g : StringSetQQ.queue = <abstr>

val h : StringSetQ.queue = <abstr>

val i : StringSetQQ.queue = <abstr>

val j : StringSetQQ.element = <abstr>

val k : StringSetQQ.queue = <abstr>

val l : StringSetQQ.element = <abstr>

val m : StringSetQQ.queue = <abstr>

Exception: StringSetQQ.EMPTY_Q.



input

let a=StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"11"),"22");;
let a1 = StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(a,"33"),"44"),"66");;
let b,c=StringSetQ.deq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"aa"),"bb"),"11"));;
let c4 = StringSetQ.enq(c,"22")
let c6 = (StringSetQ.enq(c4,"33"))
let c61,c62 =StringSetQ.deq c6
let c7 = StringSetQ.enq(StringSetQ.enq(c62,"44"),"66")
let d,e=StringSetQQ.deq(StringSetQQ.enq(StringSetQQ.enq(StringSetQQ.emptyq,a1),c7));;
let f,g =StringSetQQ.deq e;;
let h = StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.enq(StringSetQ.emptyq,"11"),"22"),"33"),"44"),"66");;
let i = StringSetQQ.enq((StringSetQQ.enq(StringSetQQ.enq(StringSetQQ.emptyq,a1),c7)),h);;
let j,k=StringSetQQ.deq i;;
let l,m = StringSetQQ.deq k;;
let n = StringSetQQ.deq m;;

output

val a : StringSetQ.queue = <abstr>

val a1 : StringSetQ.queue = <abstr>

val b : StringSetQ.element = "aa"

val c : StringSetQ.queue = <abstr>

val c4 : StringSetQ.queue = <abstr>

val c6 : StringSetQ.queue = <abstr>

val c61 : StringSetQ.element = "bb"

val c62 : StringSetQ.queue = <abstr>

val c7 : StringSetQ.queue = <abstr>

val d : StringSetQQ.element = <abstr>

val e : StringSetQQ.queue = <abstr>

Exception: StringSetQQ.EMPTY_Q.

val h : StringSetQ.queue = <abstr>

val i : StringSetQQ.queue = <abstr>

val j : StringSetQQ.element = <abstr>

val k : StringSetQQ.queue = <abstr>

Exception: StringSetQQ.EMPTY_Q.

Characters 25-26:

let n = StringSetQQ.deq m;;

^

Error: Unbound value m
--------------------------------------------------------

input에 따라 output에서 exception 발생 시점이 달라진 다는 점에 주목해서 테스트 하시면 됩니다.

ex3에서는 위의 input들에서 Set 들만 모두 지우시면 됩니다. 그러면 output에서도 Set이라는 단어들만 쭉 빠진다는 것만 빼고 비슷할 거에요 ㅎㅎ

[황창연]

e는 아직 empty가 아닌거 같네요...;;;

한번더 deq 해야 empty 되는거 아닌가요? ``;

[김태훈]

몇번째 테스트셋 얘기이신가요? ㅎ

첫번째 테스트셋이라면, d,e를 만들 때 deq하기 전에 enq된 두개의 StringQ(그러니까, a1이랑 c7)이 결국 같은 StringQ가 되기 때문에 d,e로 deq되기 직전의 큐는 원소가 하나뿐인게 맞고 거기서 deq를 해서 나온 StringQQ인 e는 emptyq인게 맞을거라고 생각됩니다 ㅎ

[서창옥]

먼저 테스트셋 제공에 인피니트한 감사를 드립니다


(_ _)


근데 제 생각에도 e는 한번 더 디큐해줘야 익셉션이 발생하는거 같은데 .. ㅎㅎ 고수님 나와주세요

[김찬민]

a1과 c7은 같습니다.
stringsetqq이기 때문에 먼저 들어간 것만 남아있는 큐이고, 저 데이터의 답은 맞는 것 같습니다.