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
|
|
@ -0,0 +1,154 @@
|
|||
/* ARM assembly Raspberry PI */
|
||||
/* program orderlist.s */
|
||||
|
||||
/* Constantes */
|
||||
.equ STDOUT, 1 @ Linux output console
|
||||
.equ EXIT, 1 @ Linux syscall
|
||||
.equ WRITE, 4 @ Linux syscall
|
||||
|
||||
/*********************************/
|
||||
/* Initialized data */
|
||||
/*********************************/
|
||||
.data
|
||||
szMessResult1: .asciz "List1 < List2 \n" @ message result
|
||||
szMessResult2: .asciz "List1 => List2 \n" @ message result
|
||||
szCarriageReturn: .asciz "\n"
|
||||
|
||||
iTabList1: .int 1,2,3,4,5
|
||||
.equ NBELEMENTS1, (. - iTabList1) /4
|
||||
iTabList2: .int 1,2,1,5,2,2
|
||||
.equ NBELEMENTS2, (. - iTabList2) /4
|
||||
iTabList3: .int 1,2,3,4,5
|
||||
.equ NBELEMENTS3, (. - iTabList3) /4
|
||||
iTabList4: .int 1,2,3,4,5,6
|
||||
.equ NBELEMENTS4, (. - iTabList4) /4
|
||||
/*********************************/
|
||||
/* UnInitialized data */
|
||||
/*********************************/
|
||||
.bss
|
||||
/*********************************/
|
||||
/* code section */
|
||||
/*********************************/
|
||||
.text
|
||||
.global main
|
||||
main: @ entry of program
|
||||
ldr r0,iAdriTabList1
|
||||
mov r1,#NBELEMENTS1
|
||||
ldr r2,iAdriTabList2
|
||||
mov r3,#NBELEMENTS2
|
||||
bl listeOrder
|
||||
cmp r0,#0 @ false ?
|
||||
beq 1f @ yes
|
||||
ldr r0,iAdrszMessResult1 @ list 1 < list 2
|
||||
bl affichageMess @ display message
|
||||
b 2f
|
||||
1:
|
||||
ldr r0,iAdrszMessResult2
|
||||
bl affichageMess @ display message
|
||||
|
||||
2:
|
||||
ldr r0,iAdriTabList1
|
||||
mov r1,#NBELEMENTS1
|
||||
ldr r2,iAdriTabList3
|
||||
mov r3,#NBELEMENTS3
|
||||
bl listeOrder
|
||||
cmp r0,#0 @ false ?
|
||||
beq 3f @ yes
|
||||
ldr r0,iAdrszMessResult1 @ list 1 < list 2
|
||||
bl affichageMess @ display message
|
||||
b 4f
|
||||
3:
|
||||
ldr r0,iAdrszMessResult2
|
||||
bl affichageMess @ display message
|
||||
4:
|
||||
ldr r0,iAdriTabList1
|
||||
mov r1,#NBELEMENTS1
|
||||
ldr r2,iAdriTabList4
|
||||
mov r3,#NBELEMENTS4
|
||||
bl listeOrder
|
||||
cmp r0,#0 @ false ?
|
||||
beq 5f @ yes
|
||||
ldr r0,iAdrszMessResult1 @ list 1 < list 2
|
||||
bl affichageMess @ display message
|
||||
b 6f
|
||||
5:
|
||||
ldr r0,iAdrszMessResult2
|
||||
bl affichageMess @ display message
|
||||
6:
|
||||
100: @ standard end of the program
|
||||
mov r0, #0 @ return code
|
||||
mov r7, #EXIT @ request to exit program
|
||||
svc #0 @ perform the system call
|
||||
iAdriTabList1: .int iTabList1
|
||||
iAdriTabList2: .int iTabList2
|
||||
iAdriTabList3: .int iTabList3
|
||||
iAdriTabList4: .int iTabList4
|
||||
iAdrszMessResult1: .int szMessResult1
|
||||
iAdrszMessResult2: .int szMessResult2
|
||||
iAdrszCarriageReturn: .int szCarriageReturn
|
||||
/******************************************************************/
|
||||
/* display text with size calculation */
|
||||
/******************************************************************/
|
||||
/* r0 contains the address of list 1 */
|
||||
/* r1 contains list 1 size */
|
||||
/* r2 contains the address of list 2 */
|
||||
/* r3 contains list 2 size */
|
||||
/* r0 returns 1 if list1 < list2 */
|
||||
/* r0 returns 0 else */
|
||||
listeOrder:
|
||||
push {r1-r7,lr} @ save registres
|
||||
cmp r1,#0 @ list 1 size = zero ?
|
||||
moveq r0,#-1 @ yes -> error
|
||||
beq 100f
|
||||
cmp r3,#0 @ list 2 size = zero ?
|
||||
moveq r0,#-2 @ yes -> error
|
||||
beq 100f
|
||||
mov r4,#0 @ index list 1
|
||||
mov r5,#0 @ index list 2
|
||||
1:
|
||||
ldr r6,[r0,r4,lsl #2] @ load list 1 element
|
||||
ldr r7,[r2,r5,lsl #2] @ load list 2 element
|
||||
cmp r6,r7 @ compar
|
||||
movgt r0,#0 @ list 1 > list 2 ?
|
||||
bgt 100f
|
||||
beq 2f @ list 1 = list 2
|
||||
add r4,#1 @ increment index 1
|
||||
cmp r4,r1 @ end list ?
|
||||
movge r0,#1 @ yes -> ok list 1 < list 2
|
||||
bge 100f
|
||||
b 1b @ else loop
|
||||
2:
|
||||
add r4,#1 @ increment index 1
|
||||
cmp r4,r1 @ end list ?
|
||||
bge 3f @ yes -> verif size
|
||||
add r5,#1 @ else increment index 2
|
||||
cmp r5,r3 @ end list 2 ?
|
||||
movge r0,#0 @ yes -> list 2 < list 1
|
||||
bge 100f
|
||||
b 1b @ else loop
|
||||
3:
|
||||
cmp r1,r3 @ compar size
|
||||
movge r0,#0 @ list 2 < list 1
|
||||
movlt r0,#1 @ list 1 < list 2
|
||||
100:
|
||||
pop {r1-r7,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
|
||||
|
|
@ -1,5 +1,4 @@
|
|||
integer
|
||||
ordl(list a, list b)
|
||||
ordl(list a, b)
|
||||
{
|
||||
integer i, l, o;
|
||||
|
||||
|
|
@ -14,10 +13,9 @@ ordl(list a, list b)
|
|||
i += 1;
|
||||
}
|
||||
|
||||
return i < l ? o : ~a <= ~b;
|
||||
i < l ? o : ~a <= ~b;
|
||||
}
|
||||
|
||||
integer
|
||||
main(void)
|
||||
{
|
||||
o_(ordl(list(1, 2), list(1, 2)), "\n");
|
||||
|
|
@ -26,5 +24,5 @@ main(void)
|
|||
o_(ordl(list(.5, 4), list(.5, 2)), "\n");
|
||||
o_(ordl(list(1, 4, 2, 3), list(1, 4, 2.1, 3)), "\n");
|
||||
|
||||
return 0;
|
||||
0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -0,0 +1,14 @@
|
|||
(define (lexorder a b)
|
||||
(cond
|
||||
((null? b) #false)
|
||||
((null? a) #true)
|
||||
((< (car a) (car b)) #true)
|
||||
((> (car a) (car b)) #false)
|
||||
(else
|
||||
(lexorder (cdr a) (cdr b)))))
|
||||
|
||||
(print (lexorder '(1 2 3) '(1 2 3 4))) ; => true
|
||||
(print (lexorder '(1 2 4) '(1 2 3))) ; => false
|
||||
(print (lexorder '(1 2 3) '(1 2))) ; => false
|
||||
(print (lexorder '(1 2 3) '(1 2 3))) ; => false
|
||||
(print (lexorder '(1 2 3) '(1 2 8))) ; => true
|
||||
|
|
@ -1,23 +1,24 @@
|
|||
/*REXX pgm determines if a list < previous list, & returns true | false*/
|
||||
@. =
|
||||
@.1 = 1 2 1 5 2
|
||||
@.2 = 1 2 1 5 2 2
|
||||
@.3 = 1 2 3 4 5
|
||||
@.4 = 1 2 3 4 5 /* [↓] compare list to previous.*/
|
||||
do j=2 while @.j\==''; p=j-1 /*P is the previous.*/
|
||||
answer=FNorder(@.p, @.j) /*obtain the answer.*/
|
||||
if answer=='true' then is= ' < ' /*convert from true */
|
||||
else is= ' ≥ ' /*convert from false*/
|
||||
say right('['@.p"]", 40) is '['@.j"]"; say
|
||||
end /*i*/ /* [↑] display (+ a blank line)*/
|
||||
exit /*stick a fork in it, we're done.*/
|
||||
/*──────────────────────────────────FNORDER subroutine──────────────────*/
|
||||
FNorder: procedure; parse arg x,y; wx=words(x); wy=words(y)
|
||||
|
||||
do k=1 for min(wx,wy)
|
||||
a=word(x,k); b=word(y,k)
|
||||
if a<b then return 'true'
|
||||
else if a>b then return 'false'
|
||||
end /*k*/
|
||||
if wx<wy then return 'true'
|
||||
return 'false'
|
||||
/*REXX program determines if a list < previous list, and returns true or false. */
|
||||
@.=; @.1 = 1 2 1 5 2
|
||||
@.2 = 1 2 1 5 2 2
|
||||
@.3 = 1 2 3 4 5
|
||||
@.4 = 1 2 3 4 5
|
||||
/* [↓] compare a list to previous list*/
|
||||
do j=2 while @.j\==''; p= j - 1 /*P: points to previous value in list.*/
|
||||
if FNorder(@.p, @.j)=='true' then is= " < " /*use a more familiar glyph.*/
|
||||
else is= " ≥ " /* " " " " " */
|
||||
say
|
||||
say right('['@.p"]", 40) is '['@.j"]"
|
||||
end /*i*/
|
||||
exit /*stick a fork in it, we're all done. */
|
||||
/*──────────────────────────────────────────────────────────────────────────────────────*/
|
||||
FNorder: procedure; parse arg x,y
|
||||
wx= words(x); wy= words(y)
|
||||
do k=1 for min(wx, wy)
|
||||
a= word(x, k) /*get a value from X. */
|
||||
b= word(y, k) /* " " " " Y. */
|
||||
if a<b then return 'true'
|
||||
else if a>b then return 'false'
|
||||
end /*k*/
|
||||
if wx<wy then return 'true' /*handle case of equal (so far). */
|
||||
return 'false' /* " " " " " " */
|
||||
|
|
|
|||
|
|
@ -0,0 +1 @@
|
|||
vec![1, 2, 1, 3, 2] < vec![1, 2, 0, 4, 4, 0, 0, 0]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
Private Function order(list1 As Variant, list2 As Variant) As Boolean
|
||||
i = 1
|
||||
Do While list1(i) <= list2(i)
|
||||
i = i + 1
|
||||
If i > UBound(list1) Then
|
||||
order = True
|
||||
Exit Function
|
||||
End If
|
||||
If i > UBound(list2) Then
|
||||
order = False
|
||||
Exit Function
|
||||
End If
|
||||
Loop
|
||||
order = False
|
||||
End Function
|
||||
Public Sub main()
|
||||
Debug.Print order([{1, 2, 3, 4}], [{1,2,0,1,2}])
|
||||
Debug.Print order([{1, 2, 3, 4}], [{1,2,3}])
|
||||
Debug.Print order([{1, 2, 3}], [{1,2,3,4}])
|
||||
End Sub
|
||||
Loading…
Add table
Add a link
Reference in a new issue