Vol. 40 No Journal of Jiangxi Normal University Natural Science Jan. 2016

Transcription

1 40 1 Vol 40 No Journal of Jiangxi Normal UniversityNatural Science Jan Java * Java Java Kleen Java Java Java TP 311 A DOI /j cnki issn Doug Mcllroy Ada Apla Java Apla Java 1 2 C Apla ML Java Aplaabstract programming language Apla 3 PAR 6-9 Apla C + + Java BAB

2 Apla 2 class i Apla sometype iijava Java program sometype static final Apla program new T extends super ii Apla func proc T iiijava Apla procedure function = sometype publicinterface proc func procedure function new iv Java List Apla String Apla List Java extends T Sun JDK5 0 super T Java Java Java Java Java Java 15 ijava i ObjectT object = new T T T ii T

3 1 Java 79 elements = new T capacity i Apla Java Object public void maincall Apla Java Apla this BubbleSorta n program BubbleSortProgsometypebasetype constn = 9 var aarray 0 9 basetypex iinteger procedure BubbleSort var aarray0 9 basetype ninteger public static void mainstring args BubbleSortProg Integer aco _ int = new Bubble- SortProg Integer aco_int maincall begin program int_bubblesortprogramnew BubbleSort- Prog integer end Apla Java i Java Apla ii iii T ii const Java public static iii var iv List int int T Integer iv procedure v function public Java i T Java v maincall ii vi Java main main iii maincall Java Java Java iv Apla Java import public classbubblesortprog T public static int n = 9 2 Java int x i T a = T new Object n Java BubbleSortProg T public T BubbleSortT a int n iii

4 min $ public begin % writeln" " foreach i j k1 i j k < numc1 i j= maxnums= iv 0 c1 1 3= 11c1 3 1= 3c1 1 2= 4 maincall v c1 2 1= 6c1 2 3= 2 begin procedure c1 1= 0c1 2= 0c1 3= 0 function new floydnum c1 writeln" " c2 1 1= falsec2 1 2= truec2 1 3= falsec2 2 1= truec2 2 vimaincall main 2= falsec2 2 3= truec2 3 1= falsec2 3 maincall 2= falsec2 3= false close_setnum c2 2 2 Apla Kleene writeln" " foreachi j1 i j numc3 i j= max- c3 1 3= 11c3 3 1= 3c3 1 2= Apla Java num 3 4c3 2 1= 6 Apla c3 2 3= 2c3 1 1= 0c3 2 2= 0c3 3= 0 program Kleen const maxnum = 99999num = 3 var i j k sinteger capcitynum c3 end 1 c1 c3array 1 num array 1 num integer elem 2 c2array 1 num array 1 num boolean procedure kleenesometype elemfunc a 2 belem elemnintegercarray 1 num array 1 num elem! va ri j kinteger begin k= 1 do k n foreachi j1 i j nc i j= c i j c i k c k j k= k + 1od i= 1 doi n j= 1 do j n writec i j " " j= j + 1od i= i + 1 od end procedurefloydnew kleeneintegermin+ " procedure close _ setnew kleene boolean # procedure capcitynew kleene integermax begin 3 Java Java Kleen Java Kleen public class Kleen abstract class kleene T public abstract T BigMultiT a T b public abstract T BigPlusT a T b public void genericrunint n T c fork = 1k < = nk + + fori = 1i < = ni + + forj = 1j < = nj + + ci j= BigMulti c i j BigPlus

5 1 Java 81 c i k c k j System out printlnc i j+ " " class floyd T extend skleene T public T BigMultiT a T b Java Kleen Apla Java Java Java return Math mina b public T BigPlusT a T b return a + b 3 class close_set T extend skleene T public T BigMultiT a T b return a b public T BigPlusT a T b return a && b class capcity T extend skleene T public T BigMultiT a T b return Math maxa b Apla Java public T BigPlusT a T b return Math mina b public void maincall Apla floyd Integer floydproc = new floyd Integer floydproc genericrunnum c1 public static void mainstring args Kleenaco = newkleen Java Apla Apla Java aco maincall Java Kleen Java Java Kleen 2 genericrun 4 1McIlroy D Mass produced software components C GermischNATO 2 3 Sci Committee Apla Java Apla 2Li YunlinNovak G Generation of geometric programs Java PAR Java specified by diagrams C New YorkACM Press Java 3Xue Jinyun PAR method and its supporting platform Apla R MacaoUNU-IIST Java J Java JDK Java Java Kleene S C Representation of events in nerve nets and finite automata C PrincetonPrinceton University Press Java

6 Xue Jinyun Two new strategies for developing loop invariants and their applications J Journal of Computer Science and Technology Xue Jinyun A unified approach for developing efficient algorithm of programs J Journal of Computer Science and Technology J PAR J Wang Changjing Xue Jinyun Formal derivation of a hightrustworthy generic algorithmic program for solving a class of path problems C BerlinHeidelbergSpringer-Verlag Society Java J Daniel Liang Y Introduction to java programming M 9 th ed Armstrong Atlantic State University Raul Marticorena Carlos Lopez Refactoring generics in Javaa case study on extract method J IEEE Computer 14Adam Kiezun Frank Tip Refactoring for parameterizing Java classes C IEEE 29th International Conference on Software Engineering ICSE' J Apla-> Java D 2002 The Java-Based Novel Implementation for an Abstract Generic Mechanism Computer Engineering and Applications TIAN Fang SHI Haihe * ZUO Zhengkang WANG Changjing XUE Jinyun Provincial Key Laborary High Performance Computing Jiangxi Normal University Nanchang Jiangxi China AbstractGeneric programming has emerged as a paradigm for the development of highly reusable and reliable software components and highly abstract generic mechanism contributes to lowering the complexity of generic programming Core ideas and programming techniques of an abstract generic mechanism are presented corresponding Java mechanism is analyzed and transformation rules between them are extracted and further the automatic transformation from abstract generic program to Java program and Java program execution are implemented in our platform Finally through a Kleen algorithm the real application of abstract generic mechanism and its Java program generation is illustrated The novel implementation for this abstract generic mechanism based on Java reduces the design difficulty of algorithm component and improve its reliability as well as gives an effective solution to the design and description of generic component Key wordsabstract generic mechanismjava languagereusabilityalgorithm component