September Morn Update
This commit is contained in:
Ingy döt Net
parent
4e2d22a71d
commit
aac6731f2c
6856 changed files with 141342 additions and 21127 deletions
283
Task/Queue-Definition/ARM-Assembly/queue-definition.arm
Normal file
283
Task/Queue-Definition/ARM-Assembly/queue-definition.arm
Normal file
|
|
@ -0,0 +1,283 @@
|
|||
/* ARM assembly Raspberry PI */
|
||||
/* program defqueue.s */
|
||||
|
||||
/* Constantes */
|
||||
.equ STDOUT, 1 @ Linux output console
|
||||
.equ EXIT, 1 @ Linux syscall
|
||||
.equ WRITE, 4 @ Linux syscall
|
||||
|
||||
.equ NBMAXIELEMENTS, 100
|
||||
|
||||
/*******************************************/
|
||||
/* Structures */
|
||||
/********************************************/
|
||||
/* example structure for value of item */
|
||||
.struct 0
|
||||
value_ident: @ ident
|
||||
.struct value_ident + 4
|
||||
value_value1: @ value 1
|
||||
.struct value_value1 + 4
|
||||
value_value2: @ value 2
|
||||
.struct value_value2 + 4
|
||||
value_fin:
|
||||
/* example structure for queue */
|
||||
.struct 0
|
||||
queue_ptdeb: @ begin pointer of item
|
||||
.struct queue_ptdeb + 4
|
||||
queue_ptfin: @ end pointer of item
|
||||
.struct queue_ptfin + 4
|
||||
queue_stvalue: @ structure of value item
|
||||
.struct queue_stvalue + (value_fin * NBMAXIELEMENTS)
|
||||
queue_fin:
|
||||
|
||||
|
||||
/*********************************/
|
||||
/* Initialized data */
|
||||
/*********************************/
|
||||
.data
|
||||
szMessEmpty: .asciz "Empty queue. \n"
|
||||
szMessNotEmpty: .asciz "Not empty queue. \n"
|
||||
szMessError: .asciz "Error detected !!!!. \n"
|
||||
szMessResult: .ascii "Ident :" @ message result
|
||||
sMessIdent: .fill 11, 1, ' '
|
||||
.ascii " value 1 :"
|
||||
sMessValue1: .fill 11, 1, ' '
|
||||
.ascii " value 2 :"
|
||||
sMessValue2: .fill 11, 1, ' '
|
||||
.asciz "\n"
|
||||
|
||||
szCarriageReturn: .asciz "\n"
|
||||
/*********************************/
|
||||
/* UnInitialized data */
|
||||
/*********************************/
|
||||
.bss
|
||||
.align 4
|
||||
Queue1: .skip queue_fin @ queue memory place
|
||||
stItem: .skip value_fin @ value item memory place
|
||||
/*********************************/
|
||||
/* code section */
|
||||
/*********************************/
|
||||
.text
|
||||
.global main
|
||||
main: @ entry of program
|
||||
ldr r0,iAdrQueue1 @ queue structure address
|
||||
bl isEmpty
|
||||
cmp r0,#0
|
||||
beq 1f
|
||||
ldr r0,iAdrszMessEmpty
|
||||
bl affichageMess @ display message empty
|
||||
b 2f
|
||||
1:
|
||||
ldr r0,iAdrszMessNotEmpty
|
||||
bl affichageMess @ display message not empty
|
||||
2:
|
||||
@ init item 1
|
||||
ldr r0,iAdrstItem
|
||||
mov r1,#1
|
||||
str r1,[r0,#value_ident]
|
||||
mov r1,#11
|
||||
str r1,[r0,#value_value1]
|
||||
mov r1,#12
|
||||
str r1,[r0,#value_value2]
|
||||
|
||||
ldr r0,iAdrQueue1 @ queue structure address
|
||||
ldr r1,iAdrstItem
|
||||
bl pushQueue @ add item in queue
|
||||
cmp r0,#-1 @ error ?
|
||||
beq 99f
|
||||
@ init item 2
|
||||
ldr r0,iAdrstItem
|
||||
mov r1,#2
|
||||
str r1,[r0,#value_ident]
|
||||
mov r1,#21
|
||||
str r1,[r0,#value_value1]
|
||||
mov r1,#22
|
||||
str r1,[r0,#value_value2]
|
||||
|
||||
ldr r0,iAdrQueue1 @ queue structure address
|
||||
ldr r1,iAdrstItem
|
||||
bl pushQueue @ add item in queue
|
||||
cmp r0,#-1
|
||||
beq 99f
|
||||
ldr r0,iAdrQueue1 @ queue structure address
|
||||
bl isEmpty
|
||||
cmp r0,#0 @ not empty
|
||||
beq 3f
|
||||
ldr r0,iAdrszMessEmpty
|
||||
bl affichageMess @ display message empty
|
||||
b 4f
|
||||
3:
|
||||
ldr r0,iAdrszMessNotEmpty
|
||||
bl affichageMess @ display message not empty
|
||||
|
||||
4:
|
||||
ldr r0,iAdrQueue1 @ queue structure address
|
||||
bl popQueue @ return address item
|
||||
cmp r0,#-1 @ error ?
|
||||
beq 99f
|
||||
mov r2,r0 @ save item pointer
|
||||
ldr r0,[r2,#value_ident]
|
||||
ldr r1,iAdrsMessIdent @ display ident
|
||||
bl conversion10 @ decimal conversion
|
||||
ldr r0,[r2,#value_value1]
|
||||
ldr r1,iAdrsMessValue1 @ display value 1
|
||||
bl conversion10 @ decimal conversion
|
||||
ldr r0,[r2,#value_value2]
|
||||
ldr r1,iAdrsMessValue2 @ display value 2
|
||||
bl conversion10 @ decimal conversion
|
||||
ldr r0,iAdrszMessResult
|
||||
bl affichageMess @ display message
|
||||
b 4b @ loop
|
||||
|
||||
99:
|
||||
@ error
|
||||
ldr r0,iAdrszMessError
|
||||
bl affichageMess
|
||||
100: @ standard end of the program
|
||||
mov r0, #0 @ return code
|
||||
mov r7, #EXIT @ request to exit program
|
||||
svc #0 @ perform the system call
|
||||
|
||||
iAdrQueue1: .int Queue1
|
||||
iAdrstItem: .int stItem
|
||||
iAdrszMessError: .int szMessError
|
||||
iAdrszMessEmpty: .int szMessEmpty
|
||||
iAdrszMessNotEmpty: .int szMessNotEmpty
|
||||
iAdrszMessResult: .int szMessResult
|
||||
iAdrszCarriageReturn: .int szCarriageReturn
|
||||
iAdrsMessIdent: .int sMessIdent
|
||||
iAdrsMessValue1: .int sMessValue1
|
||||
iAdrsMessValue2: .int sMessValue2
|
||||
/******************************************************************/
|
||||
/* test if queue empty */
|
||||
/******************************************************************/
|
||||
/* r0 contains the address of queue structure */
|
||||
isEmpty:
|
||||
push {r1,r2,lr} @ save registres
|
||||
ldr r1,[r0,#queue_ptdeb] @ begin pointer
|
||||
ldr r2,[r0,#queue_ptfin] @ begin pointer
|
||||
cmp r1,r2
|
||||
moveq r0,#1 @ empty queue
|
||||
movne r0,#0 @ not empty
|
||||
pop {r1,r2,lr} @ restaur registers
|
||||
bx lr @ return
|
||||
/******************************************************************/
|
||||
/* add item in queue */
|
||||
/******************************************************************/
|
||||
/* r0 contains the address of queue structure */
|
||||
/* r1 contains the address of item */
|
||||
pushQueue:
|
||||
push {r1-r4,lr} @ save registres
|
||||
add r2,r0,#queue_stvalue @ address of values structure
|
||||
ldr r3,[r0,#queue_ptfin] @ end pointer
|
||||
add r2,r3 @ free address of queue
|
||||
ldr r4,[r1,#value_ident] @ load ident item
|
||||
str r4,[r2,#value_ident] @ and store in queue
|
||||
ldr r4,[r1,#value_value1] @ idem
|
||||
str r4,[r2,#value_value1]
|
||||
ldr r4,[r1,#value_value2]
|
||||
str r4,[r2,#value_value2]
|
||||
add r3,#value_fin
|
||||
cmp r3,#value_fin * NBMAXIELEMENTS
|
||||
moveq r0,#-1 @ error
|
||||
beq 100f
|
||||
str r3,[r0,#queue_ptfin] @ store new end pointer
|
||||
100:
|
||||
pop {r1-r4,lr} @ restaur registers
|
||||
bx lr @ return
|
||||
/******************************************************************/
|
||||
/* pop queue */
|
||||
/******************************************************************/
|
||||
/* r0 contains the address of queue structure */
|
||||
popQueue:
|
||||
push {r1,r2,lr} @ save registres
|
||||
mov r1,r0 @ control if empty queue
|
||||
bl isEmpty
|
||||
cmp r0,#1 @ yes -> error
|
||||
moveq r0,#-1
|
||||
beq 100f
|
||||
mov r0,r1
|
||||
ldr r1,[r0,#queue_ptdeb] @ begin pointer
|
||||
add r2,r0,#queue_stvalue @ address of begin values item
|
||||
add r2,r1 @ address of item
|
||||
add r1,#value_fin
|
||||
str r1,[r0,#queue_ptdeb] @ store nex begin pointer
|
||||
mov r0,r2 @ return pointer item
|
||||
100:
|
||||
pop {r1,r2,lr} @ restaur registers
|
||||
bx lr @ return
|
||||
/******************************************************************/
|
||||
/* display text with size calculation */
|
||||
/******************************************************************/
|
||||
/* r0 contains the address of the message */
|
||||
affichageMess:
|
||||
push {r0,r1,r2,r7,lr} @ save registres
|
||||
mov r2,#0 @ counter length
|
||||
1: @ loop length calculation
|
||||
ldrb r1,[r0,r2] @ read octet start position + index
|
||||
cmp r1,#0 @ if 0 its over
|
||||
addne r2,r2,#1 @ else add 1 in the length
|
||||
bne 1b @ and loop
|
||||
@ so here r2 contains the length of the message
|
||||
mov r1,r0 @ address message in r1
|
||||
mov r0,#STDOUT @ code to write to the standard output Linux
|
||||
mov r7, #WRITE @ code call system "write"
|
||||
svc #0 @ call systeme
|
||||
pop {r0,r1,r2,r7,lr} @ restaur registers */
|
||||
bx lr @ return
|
||||
/******************************************************************/
|
||||
/* Converting a register to a decimal */
|
||||
/******************************************************************/
|
||||
/* r0 contains value and r1 address area */
|
||||
.equ LGZONECAL, 10
|
||||
conversion10:
|
||||
push {r1-r4,lr} @ save registers
|
||||
mov r3,r1
|
||||
mov r2,#LGZONECAL
|
||||
1: @ start loop
|
||||
bl divisionpar10 @ r0 <- dividende. quotient ->r0 reste -> r1
|
||||
add r1,#48 @ digit
|
||||
strb r1,[r3,r2] @ store digit on area
|
||||
cmp r0,#0 @ stop if quotient = 0
|
||||
subne r2,#1 @ previous position
|
||||
bne 1b @ else loop
|
||||
@ end replaces digit in front of area
|
||||
mov r4,#0
|
||||
2:
|
||||
ldrb r1,[r3,r2]
|
||||
strb r1,[r3,r4] @ store in area begin
|
||||
add r4,#1
|
||||
add r2,#1 @ previous position
|
||||
cmp r2,#LGZONECAL @ end
|
||||
ble 2b @ loop
|
||||
mov r1,#' '
|
||||
3:
|
||||
strb r1,[r3,r4]
|
||||
add r4,#1
|
||||
cmp r4,#LGZONECAL @ end
|
||||
ble 3b
|
||||
100:
|
||||
pop {r1-r4,lr} @ restaur registres
|
||||
bx lr @return
|
||||
/***************************************************/
|
||||
/* division par 10 signé */
|
||||
/* Thanks to http://thinkingeek.com/arm-assembler-raspberry-pi/*
|
||||
/* and http://www.hackersdelight.org/ */
|
||||
/***************************************************/
|
||||
/* r0 dividende */
|
||||
/* r0 quotient */
|
||||
/* r1 remainder */
|
||||
divisionpar10:
|
||||
/* r0 contains the argument to be divided by 10 */
|
||||
push {r2-r4} @ save registers */
|
||||
mov r4,r0
|
||||
mov r3,#0x6667 @ r3 <- magic_number lower
|
||||
movt r3,#0x6666 @ r3 <- magic_number upper
|
||||
smull r1, r2, r3, r0 @ r1 <- Lower32Bits(r1*r0). r2 <- Upper32Bits(r1*r0)
|
||||
mov r2, r2, ASR #2 @ r2 <- r2 >> 2
|
||||
mov r1, r0, LSR #31 @ r1 <- r0 >> 31
|
||||
add r0, r2, r1 @ r0 <- r2 + r1
|
||||
add r2,r0,r0, lsl #2 @ r2 <- r0 * 5
|
||||
sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10)
|
||||
pop {r2-r4}
|
||||
bx lr @ return
|
||||
|
|
@ -1,63 +1,81 @@
|
|||
MODULE Queue;
|
||||
IMPORT StdLog,Boxes;
|
||||
|
||||
IMPORT
|
||||
Boxes;
|
||||
TYPE
|
||||
Queue* = POINTER TO RECORD
|
||||
first,last: LONGINT;
|
||||
queue: POINTER TO ARRAY OF Boxes.Object;
|
||||
END;
|
||||
|
||||
PROCEDURE NewQueue*(cap: LONGINT): Queue;
|
||||
VAR
|
||||
q: Queue;
|
||||
BEGIN
|
||||
NEW(q);q.first := 0; q.last := 0;
|
||||
NEW(q.queue,cap);
|
||||
RETURN q
|
||||
END NewQueue;
|
||||
|
||||
PROCEDURE (q: Queue) IsEmpty*(): BOOLEAN, NEW;
|
||||
VAR
|
||||
BEGIN
|
||||
RETURN (q.first = q.last)
|
||||
END IsEmpty;
|
||||
|
||||
PROCEDURE (q: Queue) Push*(o: Boxes.Object),NEW;
|
||||
VAR
|
||||
i,j,oldSize,newSize: LONGINT;
|
||||
queue: POINTER TO ARRAY OF Boxes.Object;
|
||||
BEGIN
|
||||
IF q.IsEmpty() THEN
|
||||
q.queue[q.last] := o;
|
||||
q.last := (q.last + 1) MOD LEN(q.queue)
|
||||
ELSE
|
||||
q.queue[q.last] := o;
|
||||
q.last := (q.last + 1) MOD LEN(q.queue);
|
||||
IF q.first = q.last THEN
|
||||
(* grow queue *)
|
||||
newSize := LEN(q.queue) + (LEN(q.queue) DIV 2);
|
||||
(* new queue*)
|
||||
NEW(queue,newSize);
|
||||
(* move data from old queue to new queue *)
|
||||
i := q.first; j := 0;oldSize := LEN(q.queue) - q.first + q.last;
|
||||
WHILE (j < oldSize ) & (j < LEN(queue) - 1) DO
|
||||
queue[j] := q.queue[i];
|
||||
i := (i + 1) MOD LEN(q.queue);INC(j)
|
||||
END;
|
||||
q.queue := queue;q.first := 0;q.last := j
|
||||
END
|
||||
END;
|
||||
END Push;
|
||||
|
||||
PROCEDURE (q: Queue) Pop*(): Boxes.Object, NEW;
|
||||
VAR
|
||||
o: Boxes.Object;
|
||||
BEGIN
|
||||
ASSERT(~q.IsEmpty());
|
||||
o := q.queue[q.first];
|
||||
q.queue[q.first] := NIL;
|
||||
q.first := (q.first + 1) MOD LEN(q.queue);
|
||||
RETURN o;
|
||||
END Pop;
|
||||
|
||||
Instance* = POINTER TO LIMITED RECORD
|
||||
size: LONGINT;
|
||||
first,last: LONGINT;
|
||||
_queue: POINTER TO ARRAY OF Boxes.Box;
|
||||
END;
|
||||
|
||||
PROCEDURE (self: Instance) Initialize(capacity: LONGINT),NEW;
|
||||
BEGIN
|
||||
self.size := 0;
|
||||
self.first := 0;
|
||||
self.last := 0;
|
||||
NEW(self._queue,capacity)
|
||||
END Initialize;
|
||||
|
||||
PROCEDURE New*(capacity: LONGINT): Instance;
|
||||
VAR
|
||||
aQueue: Instance;
|
||||
BEGIN
|
||||
NEW(aQueue);aQueue.Initialize(capacity);RETURN aQueue
|
||||
END New;
|
||||
|
||||
PROCEDURE (self: Instance) IsEmpty*(): BOOLEAN, NEW;
|
||||
BEGIN
|
||||
RETURN self.size = 0;
|
||||
END IsEmpty;
|
||||
|
||||
PROCEDURE (self: Instance) Capacity*(): LONGINT, NEW;
|
||||
BEGIN
|
||||
RETURN LEN(self._queue)
|
||||
END Capacity;
|
||||
|
||||
PROCEDURE (self: Instance) Size*(): LONGINT, NEW;
|
||||
BEGIN
|
||||
RETURN self.size
|
||||
END Size;
|
||||
|
||||
PROCEDURE (self: Instance) IsFull*(): BOOLEAN, NEW;
|
||||
BEGIN
|
||||
RETURN self.size = self.Capacity()
|
||||
END IsFull;
|
||||
|
||||
PROCEDURE (self: Instance) Push*(b: Boxes.Box), NEW;
|
||||
VAR
|
||||
i, j, newCapacity, oldSize: LONGINT;
|
||||
queue: POINTER TO ARRAY OF Boxes.Box;
|
||||
BEGIN
|
||||
INC(self.size);
|
||||
self._queue[self.last] := b;
|
||||
self.last := (self.last + 1) MOD self.Capacity();
|
||||
IF self.IsFull() THEN
|
||||
(* grow queue *)
|
||||
newCapacity := self.Capacity() + (self.Capacity() DIV 2);
|
||||
(* new queue *)
|
||||
NEW(queue,newCapacity);
|
||||
(* move data from old to new queue *)
|
||||
i := self.first; j := 0; oldSize := self.Capacity() - self.first + self.last;
|
||||
WHILE (j < oldSize) & (j < newCapacity - 1) DO
|
||||
queue[j] := self._queue[i];
|
||||
i := (i + 1) MOD newCapacity;INC(j)
|
||||
END;
|
||||
self._queue := queue;self.first := 0;self.last := j
|
||||
END
|
||||
END Push;
|
||||
|
||||
PROCEDURE (self: Instance) Pop*(): Boxes.Box, NEW;
|
||||
VAR
|
||||
b: Boxes.Box;
|
||||
BEGIN
|
||||
ASSERT(~self.IsEmpty());
|
||||
DEC(self.size);
|
||||
b := self._queue[self.first];
|
||||
self._queue[self.first] := NIL;
|
||||
self.first := (self.first + 1) MOD self.Capacity();
|
||||
RETURN b
|
||||
END Pop;
|
||||
|
||||
END Queue.
|
||||
|
|
|
|||
|
|
@ -1,14 +1,17 @@
|
|||
DEFINITION Queue;
|
||||
|
||||
IMPORT Boxes;
|
||||
IMPORT Boxes;
|
||||
|
||||
TYPE
|
||||
Queue = POINTER TO RECORD
|
||||
(q: Queue) IsEmpty (): BOOLEAN, NEW;
|
||||
(q: Queue) Pop (): Boxes.Object, NEW;
|
||||
(q: Queue) Push (o: Boxes.Object), NEW
|
||||
END;
|
||||
TYPE
|
||||
Instance = POINTER TO LIMITED RECORD
|
||||
(self: Instance) Capacity (): LONGINT, NEW;
|
||||
(self: Instance) IsEmpty (): BOOLEAN, NEW;
|
||||
(self: Instance) IsFull (): BOOLEAN, NEW;
|
||||
(self: Instance) Pop (): Boxes.Box, NEW;
|
||||
(self: Instance) Push (b: Boxes.Box), NEW;
|
||||
(self: Instance) Size (): LONGINT, NEW
|
||||
END;
|
||||
|
||||
PROCEDURE NewQueue (cap: LONGINT): Queue;
|
||||
PROCEDURE New (capacity: LONGINT): Instance;
|
||||
|
||||
END Queue.
|
||||
|
|
|
|||
|
|
@ -1,62 +1,63 @@
|
|||
import extensions.
|
||||
import extensions;
|
||||
|
||||
template queue :: type
|
||||
template queue<T>
|
||||
{
|
||||
array<type> theArray.
|
||||
int theTop.
|
||||
int theTale.
|
||||
T[] theArray;
|
||||
int theTop;
|
||||
int theTale;
|
||||
|
||||
explicit
|
||||
[
|
||||
theArray := type<>(8).
|
||||
theTop := 0.
|
||||
theTale := 0.
|
||||
]
|
||||
constructor()
|
||||
{
|
||||
theArray := new T[](8);
|
||||
theTop := 0;
|
||||
theTale := 0;
|
||||
}
|
||||
|
||||
bool empty
|
||||
= theTop == theTale.
|
||||
bool empty()
|
||||
= theTop == theTale;
|
||||
|
||||
push type:anObject
|
||||
[
|
||||
if (theTale > theArray length)
|
||||
[
|
||||
theArray := theArray reallocate(theTale).
|
||||
].
|
||||
push(T object)
|
||||
{
|
||||
if (theTale > theArray.Length)
|
||||
{
|
||||
theArray := theArray.reallocate(theTale)
|
||||
};
|
||||
|
||||
theArray[theTale] := anObject.
|
||||
theArray[theTale] := object;
|
||||
|
||||
theTale += 1.
|
||||
]
|
||||
theTale += 1
|
||||
}
|
||||
|
||||
type pop
|
||||
[
|
||||
T pop()
|
||||
{
|
||||
if (theTale == theTop)
|
||||
[ InvalidOperationException new:"Queue is empty"; raise ].
|
||||
{ InvalidOperationException.new:"Queue is empty".raise() };
|
||||
|
||||
type item := theArray[theTop].
|
||||
T item := theArray[theTop];
|
||||
|
||||
theTop += 1.
|
||||
theTop += 1;
|
||||
|
||||
^ item
|
||||
]
|
||||
}
|
||||
}
|
||||
|
||||
program =
|
||||
[
|
||||
queue<int> q := queue<int>().
|
||||
q push(1).
|
||||
q push(2).
|
||||
q push(3).
|
||||
console printLine(q pop).
|
||||
console printLine(q pop).
|
||||
console printLine(q pop).
|
||||
console printLine("a queue is ", q empty; iif("empty","not empty")).
|
||||
console print("Trying to pop:").
|
||||
try(q pop)
|
||||
public program()
|
||||
{
|
||||
queue<int> q := new queue<int>();
|
||||
q.push(1);
|
||||
q.push(2);
|
||||
q.push(3);
|
||||
console.printLine(q.pop());
|
||||
console.printLine(q.pop());
|
||||
console.printLine(q.pop());
|
||||
console.printLine("a queue is ", q.empty().iif("empty","not empty"));
|
||||
console.print("Trying to pop:");
|
||||
try
|
||||
{
|
||||
on(Exception e)
|
||||
[
|
||||
console printLine(e message)
|
||||
]
|
||||
q.pop()
|
||||
}
|
||||
].
|
||||
catch(Exception e)
|
||||
{
|
||||
console.printLine(e.Message)
|
||||
}
|
||||
}
|
||||
|
|
|
|||
21
Task/Queue-Definition/Free-Pascal/queue-definition.free
Normal file
21
Task/Queue-Definition/Free-Pascal/queue-definition.free
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
program queue;
|
||||
{$IFDEF FPC}{$MODE DELPHI}{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}{$ENDIF}
|
||||
{$ASSERTIONS ON}
|
||||
uses Generics.Collections;
|
||||
|
||||
var
|
||||
lQueue: TQueue<Integer>;
|
||||
begin
|
||||
lQueue := TQueue<Integer>.Create;
|
||||
try
|
||||
lQueue.EnQueue(1);
|
||||
lQueue.EnQueue(2);
|
||||
lQueue.EnQueue(3);
|
||||
Write(lQueue.DeQueue:2); // 1
|
||||
Write(lQueue.DeQueue:2); // 2
|
||||
Writeln(lQueue.DeQueue:2); // 3
|
||||
Assert(lQueue.Count = 0, 'Queue is not empty'); // should be empty
|
||||
finally
|
||||
lQueue.Free;
|
||||
end;
|
||||
end.
|
||||
19
Task/Queue-Definition/VBA/queue-definition.vba
Normal file
19
Task/Queue-Definition/VBA/queue-definition.vba
Normal file
|
|
@ -0,0 +1,19 @@
|
|||
Public queue As New Collection
|
||||
|
||||
Private Sub push(what As Variant)
|
||||
queue.Add what
|
||||
End Sub
|
||||
|
||||
Private Function pop() As Variant
|
||||
If queue.Count > 0 Then
|
||||
what = queue(1)
|
||||
queue.Remove 1
|
||||
Else
|
||||
what = CVErr(461)
|
||||
End If
|
||||
pop = what
|
||||
End Function
|
||||
|
||||
Private Function empty_()
|
||||
empty_ = queue.Count = 0
|
||||
End Function
|
||||
37
Task/Queue-Definition/VBScript/queue-definition.vb
Normal file
37
Task/Queue-Definition/VBScript/queue-definition.vb
Normal file
|
|
@ -0,0 +1,37 @@
|
|||
' Queue Definition - VBScript
|
||||
Option Explicit
|
||||
Dim queue, i, x
|
||||
Set queue = CreateObject("System.Collections.ArrayList")
|
||||
If Not empty_(queue) Then Wscript.Echo queue.Count
|
||||
push queue, "Banana"
|
||||
push queue, "Apple"
|
||||
push queue, "Pear"
|
||||
push queue, "Strawberry"
|
||||
Wscript.Echo "Count=" & queue.Count
|
||||
Wscript.Echo pull(queue) & " - Count=" & queue.Count '
|
||||
Wscript.Echo "Head=" & queue.Item(0)
|
||||
Wscript.Echo "Tail=" & queue.Item(queue.Count-1)
|
||||
Wscript.Echo queue.IndexOf("Pear", 0)
|
||||
For i=1 To queue.Count
|
||||
Wscript.Echo join(queue.ToArray(), ", ")
|
||||
x = pull(queue)
|
||||
Next 'i
|
||||
|
||||
Sub push(q, what)
|
||||
q.Add what
|
||||
End Sub 'push
|
||||
|
||||
Function pull(q)
|
||||
Dim what
|
||||
If q.Count > 0 Then
|
||||
what = q(0)
|
||||
q.RemoveAt 0
|
||||
Else
|
||||
what = ""
|
||||
End If
|
||||
pull = what
|
||||
End Function 'pull
|
||||
|
||||
Function empty_(q)
|
||||
empty_ = q.Count = 0
|
||||
End Function 'empty_
|
||||
Loading…
Add table
Add a link
Reference in a new issue