⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 gp.test.list

📁 标准的GP源代码,由Andy Singleton维护
💻 LIST
📖 第 1 页 / 共 2 页
字号:
GPtests 1000	%list $Revision: 1.31 $ stop_on 1029	%stop on loop_too_nested_error|recurse_error|stop_on_errorseed 1		%Revision history at endrandomstart 0		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 0makenul r1	%check empty listprtlistscorep 0breakend_testseed 2randomstart 101	%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 1makenul r1	%check one item listinsert d1 r1prtlistscorep 1 d1breakend_testseed 3randomstart 0		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 2makenul r1	%Initialise list	Makenulend r2		%Insert 9 items, chosen at randomInto sequential locations (nbscoreq r2 r1	%use END to choose insert position)break		%check contents of list after each using Printlist.insert d1 r1prtlistscorep 1 d1breakend r2insert d2 r2prtlistscorep 2 d1 d2breakend r3insert d3 r3prtlist	scorep 3 d1 d2 d3%breakend r4insert d4 r4prtlist	scorep 4 d1 d2 d3 d4%breakend r5insert d5 r5prtlist	scorep 5 d1 d2 d3 d4 d5%breakend r6insert d6 r6prtlist	scorep  6 d1 d2 d3 d4 d5 d6%breakend r7insert d7 r7prtlist	scorep  7d1 d2 d3 d4 d5 d6 d7%breakend r8insert d8 r8prtlist	scorep  8 d1 d2 d3 d4 d5 d6 d7 d8breakend r9prev r8 r9insert d9 r8prtlist	scorep  9 d1 d2 d3 d4 d5 d6 d7 d9 d8breakset_ok prtlistend_testseed 4randomstart 103	%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 3makenul r1	%Same again but insert at begining of listfirst r2	%Insert 9 items, chosen at randomInto sequential locations (nbscoreq r2 r1	%use first to choose insert position)break		%check contents of list after each using Printlist.insert d1 r1prtlistscorep 1 d1%breakfirst r2insert d2 r2prtlistscorep 2 d2 d1breakfirst r3insert d3 r3prtlist	scorep 3 d3 d2 d1breakfirst r4insert d4 r4prtlist	scorep 4 d4 d3 d2 d1%breakfirst r5insert d5 r5prtlist	scorep 5 d5 d4 d3 d2 d1%break%set_ok firstfirst r6insert d6 r6prtlist	scorep  6 d6 d5 d4 d3 d2 d1%breakfirst r7insert d7 r7prtlist	scorep  7 d7 d6 d5 d4 d3 d2 d1%breakfirst r8insert d8 r8prtlist	scorep  8 d8 d7 d6 d5 d4 d3 d2 d1breakfirst r9next r8 r9insert d9 r8prtlist	scorep  9 d8 d9 d7 d6 d5 d4 d3 d2 d1breakset_ok firstset_ok prtlistend_testseed 5randomstart 0		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  seq 4makenul r1      %Initialise listfirst r2        %Insert items, choose location at random (from those in use) scoreq r2 r1    %break     	%Use NEXT, PREVIOUS and END to choose positionsinsert d1 r1	%and update.  Keep going to there are nine elements infirst r1	%the list.  check contents of list after each insertprtlist		%using Printlist.  scorep 1 d1breakfirst r1insert d2 r1prtlistscorep 2 d2 d1breakfirst r1next r2 r1insert d3 r2prtlistscorep 3 d2 d3 d1breakfirst r1next r2 r1insert d4 r2prtlistscorep 4 d2 d4 d3 d1breakfirst r1next r2 r1next r2 r2insert d5 r2prtlistscorep 5 d2 d4 d5 d3 d1breakfirst r1next r2 r1next r2 r2next r2 r2insert d6 r2prtlistscorep 6 d2 d4 d5 d6 d3 d1breakfirst r1next r2 r1next r2 r2next r2 r2next r2 r2next r2 r2insert d7 r2prtlistscorep 7 d2 d4 d5 d6 d3 d7 d1breakfirst r1next r2 r1next r2 r2next r2 r2next r2 r2next r2 r2next r2 r2next r2 r2insert d8 r2prtlistscorep 8 d2 d4 d5 d6 d3 d7 d1 d8breakfirst r1insert d9 r1prtlistscorep 9 d9 d2 d4 d5 d6 d3 d7 d1 d8breakset_ok firstset_ok nextset_ok prtlistset_ok insertend_testseed 12randomstart 0			%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 11makenul r1		%Retriev. 2 Feb 1995insert d1 r1		%insert random item. check can retrive it.retriev r2 r1 scoreq r2 d1breakend_testseed 13randomstart 112		% seq 12 insert random item. check can retrive it.makenul r1insert u1 r1 retriev r2 r1 scoreq r2 u1breakend_testseed 14randomstart 0		% seq 13 insert nine random items, in randomish order. makenul r1	%check can retrive all of them.insert d1 r1retriev r0 r1 scoreq r0 d1breakend r1insert d2 r1			%d1 d2retriev r0 r1 scoreq r0 d2breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d1breaknext r2 r1retriev r0 r2scoreq r0 d2breaknext r0 r2end r1scoreq r0 r1			%first/next/end consistentbreakinsert d3 r2			%d1 d3 d2retriev r0 r2 scoreq r0 d3breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d1breaknext r2 r1retriev r0 r2scoreq r0 d3breaknext r3 r2retriev r0 r3scoreq r0 d2breaknext r4 r3end r9scoreq r9 r4			%first/next/end consistentbreakinsert d4 r1			%d4 d1 d3 d2retriev r0 r1 scoreq r0 d4breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d4breaknext r2 r1retriev r0 r2scoreq r0 d1breaknext r3 r2retriev r0 r3scoreq r0 d3breaknext r4 r3retriev r0 r4scoreq r0 d2breaknext r5 r4end r9scoreq r9 r5			%first/next/end consistentbreakinsert d5 r1			%d5 d4 d1 d3 d2retriev r0 r1 scoreq r0 d5breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d5breaknext r2 r1retriev r0 r2scoreq r0 d4breaknext r3 r2retriev r0 r3scoreq r0 d1breaknext r4 r3retriev r0 r4scoreq r0 d3breaknext r5 r4retriev r0 r5scoreq r0 d2breaknext r6 r5end r9scoreq r9 r6			%first/next/end consistentbreakinsert d6 r2			%d5 d6 d4 d1 d3 d2 retriev r0 r2 scoreq r0 d6breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d5breaknext r2 r1retriev r0 r2scoreq r0 d6breaknext r3 r2retriev r0 r3scoreq r0 d4breaknext r4 r3retriev r0 r4scoreq r0 d1breaknext r5 r4retriev r0 r5scoreq r0 d3breaknext r6 r5retriev r0 r6scoreq r0 d2breaknext r7 r6end r9scoreq r9 r7			%first/next/end consistentbreakinsert d7 r3			%d5 d6 d7 d4 d1 d3 d2retriev r0 r3 scoreq r0 d7breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d5breaknext r2 r1retriev r0 r2scoreq r0 d6breaknext r3 r2retriev r0 r3scoreq r0 d7breaknext r4 r3retriev r0 r4scoreq r0 d4breaknext r5 r4retriev r0 r5scoreq r0 d1breaknext r6 r5retriev r0 r6scoreq r0 d3breaknext r7 r6retriev r0 r7scoreq r0 d2breaknext r8 r7end r9scoreq r9 r8			%first/next/end consistentbreakinsert d8 r7			%d5 d6 d7 d4 d1 d3 d8 d2retriev r0 r7 scoreq r0 d8breakfirst r1retriev r0 r1 			%is orginal data still there?scoreq r0 d5breaknext r2 r1retriev r0 r2scoreq r0 d6breaknext r3 r2retriev r0 r3scoreq r0 d7breaknext r4 r3retriev r0 r4scoreq r0 d4breaknext r5 r4retriev r0 r5scoreq r0 d1breaknext r6 r5retriev r0 r6scoreq r0 d3breaknext r7 r6retriev r0 r7scoreq r0 d8breaknext r8 r7retriev r0 r8scoreq r0 d2breaknext r9 r8end r0scoreq r0 r9			%first/next/end consistentbreakprev r1 r0scoreq r1 r8breakinsert d9 r8			%d5 d6 d7 d4 d1 d3 d8 d9 d2retriev r0 r8 scoreq r0 d9breakfirst r1		%%%%%%%%%%%%%%%retriev r0 r1 scoreq r0 d5breaknext r1 r1retriev r0 r1 scoreq r0 d6breaknext r1 r1retriev r0 r1 scoreq r0 d7breaknext r1 r1retriev r0 r1 scoreq r0 d4breaknext r1 r1retriev r0 r1 scoreq r0 d1breaknext r1 r1retriev r0 r1 scoreq r0 d3breaknext r1 r1retriev r0 r1 scoreq r0 d8breaknext r1 r1retriev r0 r1 scoreq r0 d9breaknext r1 r1retriev r0 r1 scoreq r0 d2breakset_ok nextset_ok retrievend_testseed 15randomstart 114		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 14makenul r0              %Next. 2 Feb 1995insert u1 r0    	%Insert eight items in the list.insert u2 r0insert u3 r0insert u4 r0insert u5 r0insert u6 r0insert u7 r0insert u8 r0prtlistscorep 8 u8 u7 u6 u5 u4 u3 u2 u1break			%ensure insert is workingfirst r0 		%start from first, end r9			%check next points to each in turn correctly.next r7 r0	%u7next r6 r7	%u6next r5 r6	%u5next r4 r5	%u4next r3 r4	%u3next r2 r3	%u2next r1 r2	%u1next r8 r1	%endscoreq r8 r9scorneq 9 r0 r1 r2 r3 r4 r5 r6 r7 r9breakend_test%set_ok next%set_ok endseed 16randomstart 0			%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 15makenul r1              %prev. 2 Feb 1995insert u1 r1    	%Insert eight items in the list.insert u2 r1		%see also seq 18 and 19insert u3 r1insert u4 r1insert u5 r1insert u6 r1insert u7 r1insert u8 r1prtlistscorep 8 u8 u7 u6 u5 u4 u3 u2 u1break			%ensure insert is workingfirst r9 		%start from first, end r0			%check prev points to each in turn correctly.prev r1 r0	%u1prev r2 r1	%u2prev r3 r2	%u3prev r4 r3	%u4prev r5 r4	%u5prev r6 r5	%u6prev r7 r6	%u7prev r8 r7	%u8scoreq r8 r9scorneq 9 r0 r1 r2 r3 r4 r5 r6 r7 r8break%set_ok prev%set_ok end%set_ok firstend_testseed 17randomstart 116	%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% seq 16 3 Feb 1995makenul r1	%Makenul Run Insert tests but replacing initialise memory prtlist		%by break IE test seq 0 to 4 inclusivescorep 0breakmakenul r1	%check one item listinsert d1 r1prtlistscorep 1 d1breakmakenul r1	%Initialise list	Makenulend r2		%Insert 9 items, chosen at randomInto sequential locations (nbscoreq r2 r1	%use END to choose insert position)break		%check contents of list after each using Printlist.insert d1 r1prtlistscorep 1 d1breakend r2insert d2 r2prtlistscorep 2 d1 d2breakend r3insert d3 r3prtlist	scorep 3 d1 d2 d3%breakend r4insert d4 r4prtlist	scorep 4 d1 d2 d3 d4%breakend r5insert d5 r5prtlist	scorep 5 d1 d2 d3 d4 d5%breakend r6insert d6 r6prtlist	scorep  6 d1 d2 d3 d4 d5 d6%breakend r7insert d7 r7prtlist	scorep  7d1 d2 d3 d4 d5 d6 d7%breakend r8insert d8 r8prtlist	scorep  8 d1 d2 d3 d4 d5 d6 d7 d8breakend r9prev r8 r9insert d9 r8prtlist	scorep  9 d1 d2 d3 d4 d5 d6 d7 d9 d8breakset_ok prtlistmakenul r1	%Same again but insert at begining of listfirst r2	%Insert 9 items, chosen at randomInto sequential locations (nbscoreq r2 r1	%use first to choose insert position)break		%check contents of list after each using Printlist.insert d1 r1prtlistscorep 1 d1%break

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -