{"id":31,"date":"2014-05-26T12:06:23","date_gmt":"2014-05-26T12:06:23","guid":{"rendered":"http:\/\/vkrastev1blog.com\/?p=31"},"modified":"2014-05-26T15:36:27","modified_gmt":"2014-05-26T15:36:27","slug":"java-generics-explained-in-short-form-with-examples","status":"publish","type":"post","link":"https:\/\/vkrastev1blog.com\/2014\/05\/26\/java-generics-explained-in-short-form-with-examples\/","title":{"rendered":"Java generika vysv\u011btlen\u00e1 v kr\u00e1tk\u00e9 form\u011b s p\u0159\u00edklady"},"content":{"rendered":"<p>Dal\u0161\u00ed informace naleznete v tomto FAQ:<\/p>\n<p><a href=\"http:\/\/www.angelikalanger.com\/GenericsFAQ\/JavaGenericsFAQ.html#SECTION1\" rel=\"nofollow\">http:\/\/www.angelikalanger.com\/GenericsFAQ\/JavaGenericsFAQ.html#SECTION1<\/a><\/p>\n<p>Zde ve zkratce n\u011bkter\u00e9 d\u016fle\u017eit\u00e9 body z tohoto FAQ.<\/p>\n<p>P\u0159\u00edklad (obecn\u00e9ho typu):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Pair&lt;X,Y&gt; {\u00a0<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 X prvn\u00ed;<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e1 Y sekunda;<\/tt><tt> \u00a0 public Pair(X a1, Y a2) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 prvn\u00ed = a1;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 druh\u00fd = a2;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 public X getFirst() { return first; }<\/tt><br \/>\n<tt> \u00a0 public Y getSecond() { return second; }<\/tt><br \/>\n<tt> \u00a0 public void setFirst(X arg)\u00a0 { first = arg; }<\/tt><br \/>\n<tt> \u00a0 public void setSecond(Y arg) { sekunda = arg; }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>T\u0159\u00edda <tt> P\u00e1r<\/tt> m\u00e1 dva parametry typu <tt> X <\/tt> a <tt> Y<\/tt> .\u00a0 P\u0159i generick\u00e9m typu jsou nahrazeny argumenty typu <tt> P\u00e1r<\/tt> je vytvo\u0159ena instance. Nap\u0159\u00edklad v prohl\u00e1\u0161en\u00ed <tt> Pair&lt;String, Date&gt;<\/tt> parametr typu <tt> X<\/tt> je nahrazen argumentem typu <tt> \u0158et\u011bzec<\/tt> a <tt> Y<\/tt> je nahrazeno\u00a0 <tt> Datum<\/tt> .<br \/>\nRozsah identifik\u00e1tor\u016f <tt> X <\/tt> a <tt> Y<\/tt> je<b> <i> <\/i> <\/b> celou definici t\u0159\u00eddy.\u00a0 V tomto rozsahu dva parametry typu <tt> X <\/tt> a <tt> Y<\/tt> se pou\u017e\u00edvaj\u00ed jako by byly typy (s ur\u010dit\u00fdmi omezen\u00edmi). Ve v\u00fd\u0161e uveden\u00e9m p\u0159\u00edkladu jsou parametry typu pou\u017eity jako argument a n\u00e1vratov\u00fd typ metod instance a typy pol\u00ed instance.<br \/>\nParametry typu lze deklarovat s mezemi. Meze umo\u017e\u0148uj\u00ed p\u0159\u00edstup k metod\u00e1m nezn\u00e1m\u00e9ho typu, kter\u00fd zastupuje parametr type. V na\u0161em p\u0159\u00edkladu nevyvol\u00e1me \u017e\u00e1dn\u00e9 metody nezn\u00e1m\u00e9ho typu <tt> X <\/tt> a <tt> Y<\/tt> . Z tohoto d\u016fvodu jsou tyto dva parametry typu neomezen\u00e9.<\/p>\n<p>P\u0159\u00edklad (konkr\u00e9tn\u00edho parametrizovan\u00e9ho typu):<\/p>\n<blockquote><p><tt> public void printPair(<b> <span style=\"color:#000099;\"> Pair&lt;String,Long&gt;<\/span> <\/b> p\u00e1r) {<\/tt><br \/>\n<tt> \u00a0 System.out.println(\"(\"+pair.getFirst()+\",\"+pair.getSecond()+\")\");<\/tt><br \/>\n<tt> }<\/tt><tt> <b> <span style=\"color:#000099;\"> Pair&lt;String,Long&gt;<\/span> <\/b> limit = nov\u00fd <b> <span style=\"color:#000099;\"> Pair&lt;String,Long&gt;<\/span> <\/b> (\"maximum\", 1024L);<\/tt><br \/>\n<tt> printPair(limit);<\/tt><\/p><\/blockquote>\n<p>P\u0159\u00edklad (z\u00e1stupn\u00e9ho parametrizovan\u00e9ho typu):<\/p>\n<blockquote>\n<blockquote><p><tt> public void printPair(<b> <span style=\"color:#000099;\"> Pair&lt;?,?&gt;<\/span> <\/b> p\u00e1r) {<\/tt><br \/>\n<tt> \u00a0 System.out.println(\"(\"+pair.getFirst()+\",\"+pair.getSecond()+\")\");<\/tt><br \/>\n<tt> }<\/tt><tt> <b> <span style=\"color:#000099;\"> Pair&lt;?,?&gt;<\/span> <\/b> limit = nov\u00fd <b> <span style=\"color:#000099;\"> Pair&lt;String,Long&gt;<\/span> <\/b> (\"maximum\", 1024L);<\/tt><br \/>\n<tt> printPair(limit);<\/tt><\/p><\/blockquote>\n<\/blockquote>\n<p>V\u0161echny instance obecn\u00e9ho typu sd\u00edlej\u00ed stejnou reprezentaci runtime typu, konkr\u00e9tn\u011b reprezentaci nezpracovan\u00e9ho typu. Nap\u0159\u00edklad konkretizace obecn\u00e9ho typu <tt> Seznam<\/tt> , jako nap\u0159 <tt> Seznam&lt;Datum&gt;<\/tt> , <tt> Seznam&lt;String&gt;<\/tt> , <tt> List&lt;Long&gt;<\/tt> , atd. maj\u00ed r\u016fzn\u00e9 statick\u00e9 typy v dob\u011b kompilace, ale stejn\u00fd dynamick\u00fd typ <tt> Seznam <\/tt> za b\u011bhu.<\/p>\n<p>Obsazen\u00ed se skl\u00e1d\u00e1 ze dvou \u010d\u00e1st\u00ed:<\/p>\n<ul>\n<li>statick\u00e1 kontrola typu prov\u00e1d\u011bn\u00e1 kompil\u00e1torem v dob\u011b kompilace a<\/li>\n<li>dynamick\u00e1 kontrola typu prov\u00e1d\u011bn\u00e1 virtu\u00e1ln\u00edm po\u010d\u00edta\u010dem za b\u011bhu.<\/li>\n<\/ul>\n<p>Statick\u00e1 \u010d\u00e1st vyt\u0159\u00edd\u00ed nesmysln\u00e1 obsazen\u00ed, kter\u00e1 nemohou usp\u011bt, jako nap\u0159\u00edklad obsazen\u00ed z <tt> \u0158et\u011bzec<\/tt> \u017ee <tt> Datum<\/tt> nebo od <tt> Seznam&lt;String&gt;<\/tt> \u017ee <tt> Seznam&lt;Datum&gt;<\/tt> .<\/p>\n<p>Dynamick\u00e1 \u010d\u00e1st pou\u017e\u00edv\u00e1 informace o typu b\u011bhu a prov\u00e1d\u00ed kontrolu typu za b\u011bhu.\u00a0 Zvy\u0161uje a <tt> ClassCastException<\/tt> pokud dynamick\u00fd typ objektu nen\u00ed c\u00edlov\u00fdm typem (nebo podtypem c\u00edlov\u00e9ho typu) p\u0159etypov\u00e1n\u00ed. P\u0159\u00edklady odlitk\u016f s dynamickou \u010d\u00e1st\u00ed jsou odlitky z <tt> Objekt<\/tt> \u017ee <tt> \u0158et\u011bzec<\/tt> nebo od <tt> Objekt<\/tt> \u017ee <tt> Seznam&lt;String&gt;<\/tt> .\u00a0 Jedn\u00e1 se o takzvan\u00e9 downcasty, od supertypu a\u017e po podtyp.<\/p>\n<p>P\u0159\u00edklady konkr\u00e9tn\u00edch parametrizovan\u00fdch typ\u016f jsou <tt> Seznam&lt;String&gt;<\/tt> , <tt> Mapa&lt;String,Datum&gt;<\/tt> , ale ne <tt> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/tt> nebo <tt> Mapa&lt;String,?&gt;<\/tt> .<\/p>\n<p>N\u011bkdy se o\u010dek\u00e1v\u00e1, \u017ee a <tt> Seznam&lt;OObjekt&gt;<\/tt> by byl supertypem a <tt> Seznam&lt;String&gt;<\/tt> , proto\u017ee <tt> Objekt<\/tt> je supertypem <tt> \u0158et\u011bzec<\/tt> .\u00a0 Toto o\u010dek\u00e1v\u00e1n\u00ed vych\u00e1z\u00ed ze skute\u010dnosti, \u017ee takov\u00fd typ vztahu existuje pro pole:\u00a0 <tt> Objekt[]<\/tt> je supertypem <tt> \u0159et\u011bzec[]<\/tt> , proto\u017ee <tt> Objekt<\/tt> je supertypem <tt> \u0158et\u011bzec<\/tt> . (Tento typ vztahu je zn\u00e1m\u00fd jako <i> kovariance<\/i> .) Vztah superpodtyp\u016f typ\u016f komponent se roz\u0161i\u0159uje do odpov\u00eddaj\u00edc\u00edch typ\u016f pol\u00ed. \u017d\u00e1dn\u00fd takov\u00fd vztah typu neexistuje pro konkretizace generick\u00fdch typ\u016f. (Parametrizovan\u00e9 typy jsou <i> ne<\/i> kovariantn\u00ed.)<\/p>\n<p>Absence vztahu nad podtypy mezi instancemi stejn\u00e9ho generick\u00e9ho typu m\u00e1 r\u016fzn\u00e9 d\u016fsledky.\u00a0 Zde je p\u0159\u00edklad.<\/p>\n<p>P\u0159\u00edklad:<\/p>\n<p><tt> void printAll(ArrayList&lt;Object&gt; c) {<\/tt><br \/>\n<tt> \u00a0 pro (Objekt o: c)\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 System.out.println(o);<\/tt><br \/>\n<tt> }<\/tt><tt> ArrayList&lt;String&gt; seznam = new ArrayList&lt;String&gt;();<\/tt><br \/>\n<tt> ... vyplnit seznam ...<\/tt><br \/>\n<tt> printAll(seznam);\u00a0\u00a0 \/\/ chyba<\/tt><\/p>\n<p>A <tt> ArrayList&lt;String&gt;<\/tt> objekt nelze p\u0159edat jako argument metod\u011b, kter\u00e1 po\u017eaduje a <tt> ArrayList&lt;Oobject&gt;<\/tt> proto\u017ee tyto dva typy jsou instancemi stejn\u00e9ho obecn\u00e9ho typu, ale pro <i> jin\u00fd<\/i> argumenty typu a z tohoto d\u016fvodu nejsou vz\u00e1jemn\u011b kompatibiln\u00ed.<\/p>\n<p>Konkr\u00e9tn\u00ed parametrizovan\u00e9 typy jsou konkr\u00e9tn\u00ed konkretizace obecn\u00e9ho typu.\u00a0 Jsou t\u00e9m\u011b\u0159 jako typy; existuje jen n\u011bkolik omezen\u00ed.\u00a0 NELZE je pou\u017e\u00edt pro n\u00e1sleduj\u00edc\u00ed \u00fa\u010dely:<\/p>\n<ul>\n<li>pro vytv\u00e1\u0159en\u00ed pol\u00ed<\/li>\n<li>p\u0159i zpracov\u00e1n\u00ed v\u00fdjimek<\/li>\n<li>ve t\u0159\u00eddn\u00edm doslovu<\/li>\n<li>v an <tt> instanceof<\/tt> v\u00fdraz<\/li>\n<\/ul>\n<p>Pole dr\u017e\u00edc\u00ed prvky, jejich\u017e typ je konkr\u00e9tn\u00edm parametrizovan\u00fdm typem, jsou nez\u00e1konn\u00e1.<\/p>\n<p>P\u0159\u00edklad (neleg\u00e1ln\u00edho typu pole):<\/p>\n<p><tt> static void test() {<\/tt><br \/>\n<tt> \u00a0 <b> <span style=\"color:#660000;\"> Pair&lt;Integer,Integer&gt;[]<\/span> <\/b> intPairArr = nov\u00fd <b> <span style=\"color:#660000;\"> P\u00e1r&lt;Integer,Integer&gt;[10]<\/span> <\/b> ; <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 addElements(intPairArr);\u00a0<\/tt><br \/>\n<tt> \u00a0 Pair&lt;Integer,Integer&gt; pair = intPairArr[1];<\/tt><br \/>\n<tt> \u00a0 Cel\u00e9 \u010d\u00edslo i = pair.getFirst();<\/tt><br \/>\n<tt> \u00a0 pair.setSecond(i);<\/tt><br \/>\n<tt> }<\/tt><br \/>\n<tt> statick\u00e9 void addElements(<b> Objekt[]<\/b> objArr) {<\/tt><br \/>\n<tt> \u00a0 objArr[0] = new Pair&lt;Integer,Integer&gt;(0,0);<\/tt><br \/>\n<tt> \u00a0 objArr[1] = nov\u00fd Pair&lt;String,String&gt;(\"\",\"\");\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ by m\u011bl selhat s ArrayStoreException<\/tt><br \/>\n<tt> }<\/tt><\/p>\n<p>Kompil\u00e1tor zakazuje vytv\u00e1\u0159en\u00ed pol\u00ed, jejich\u017e typ komponenty je konkr\u00e9tn\u00ed parametrizovan\u00fd typ, nap\u0159 <tt> Pair&lt;Integer,Integer&gt;<\/tt> v na\u0161em p\u0159\u00edkladu.\u00a0 V p\u0159edchoz\u00edm z\u00e1znamu jsme diskutovali, pro\u010d je rozumn\u00e9, aby kompil\u00e1tor kvalifikoval a<span style=\"color:#000000;\"> <tt> Pair&lt;Integer,Integer&gt;[]<\/tt> <\/span> jako neleg\u00e1ln\u00ed.\u00a0 Kl\u00ed\u010dov\u00fdm probl\u00e9mem je, \u017ee kompil\u00e1tor a runtime syst\u00e9m mus\u00ed zajistit, \u017ee pole je a <i> homogenn\u00ed<\/i> posloupnost prvk\u016f stejn\u00e9ho typu.\u00a0 Jedna z typov\u00fdch kontrol, konkr\u00e9tn\u011b kontrola pole-store-check prov\u00e1d\u011bn\u00e1 virtu\u00e1ln\u00edm strojem za b\u011bhu, nedok\u00e1\u017ee detekovat problematick\u00e9 vlo\u017een\u00ed ciz\u00edho prvku. V p\u0159\u00edkladu druh\u00e9 vlo\u017een\u00ed do <tt> addElements<\/tt> metoda by m\u011bla selhat, proto\u017ee p\u0159id\u00e1vali p\u00e1r \u0159et\u011bzc\u016f do pole integr\u00e1ln\u00edch hodnot, ale nesel\u017ee podle o\u010dek\u00e1v\u00e1n\u00ed. D\u016fvody byly diskutov\u00e1ny v p\u0159edchoz\u00edm p\u0159\u00edsp\u011bvku.<\/p>\n<p>Pokud nem\u016f\u017eeme pou\u017e\u00edt pole obsahuj\u00edc\u00ed prvky, jejich\u017e typ je konkr\u00e9tn\u00ed parametrizovan\u00fd typ, co pou\u017eijeme jako \u0159e\u0161en\u00ed?<\/p>\n<p>Zva\u017eme 3 mysliteln\u00e1 \u0159e\u0161en\u00ed:<\/p>\n<ul>\n<li>\u0159ada syrov\u00fdch typ\u016f<\/li>\n<li>pole neomezen\u00e9ho z\u00e1stupn\u00e9ho parametrizovan\u00e9ho typu<\/li>\n<li>kolekce m\u00edsto pole<\/li>\n<\/ul>\n<p>Zat\u00edmco pole konkr\u00e9tn\u00edch parametrizovan\u00fdch typ\u016f jsou neleg\u00e1ln\u00ed, kolekce konkr\u00e9tn\u00edch parametrizovan\u00fdch typ\u016f jsou povoleny.<\/p>\n<p>Z\u00e1stupn\u00fd parametrizovan\u00fd typ je instanc\u00ed obecn\u00e9ho typu, kde alespo\u0148 jeden argument typu je z\u00e1stupn\u00fd znak.\u00a0 P\u0159\u00edklady typ\u016f parametrizovan\u00fdch z\u00e1stupn\u00fdmi znaky jsou <tt> Kolekce&lt;?&gt;<\/tt> , <tt> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/tt> , <tt> Srovn\u00e1va\u010d&lt;? Super String&gt;<\/tt> a <tt> Pair&lt;String,?&gt;<\/tt> . Z\u00e1stupn\u00fd parametrizovan\u00fd typ ozna\u010duje rodinu typ\u016f obsahuj\u00edc\u00ed konkr\u00e9tn\u00ed konkretizace obecn\u00e9ho typu.\u00a0 Druh pou\u017eit\u00e9ho z\u00e1stupn\u00e9ho znaku ur\u010duje, kter\u00e9 konkr\u00e9tn\u00ed parametrizovan\u00e9 typy pat\u0159\u00ed do rodiny.\u00a0 Nap\u0159\u00edklad parametrizovan\u00fd typ z\u00e1stupn\u00e9ho znaku <tt> Kolekce&lt;?&gt;<\/tt> ozna\u010duje rodinu v\u0161ech instanc\u00ed <tt> Sb\u00edrka<\/tt> rozhran\u00ed bez ohledu na argument typu.\u00a0 Z\u00e1stupn\u00fd parametrizovan\u00fd typ <tt> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/tt> ozna\u010duje rodinu v\u0161ech typ\u016f seznam\u016f, kde je typ prvku podtypem\u00a0 <tt> \u010c\u00edslo<\/tt> .\u00a0 Z\u00e1stupn\u00fd parametrizovan\u00fd typ <tt> Srovn\u00e1va\u010d&lt;? Super String&gt;<\/tt> je rodina v\u0161ech instanc\u00ed <tt> Kompar\u00e1tor<\/tt> rozhran\u00ed pro typy argument\u016f typu, kter\u00e9 jsou nadtypy <tt> \u0158et\u011bzec.<\/tt><\/p>\n<p><strong><em>Z\u00e1stupn\u00fd parametrizovan\u00fd typ nen\u00ed typ v b\u011b\u017en\u00e9m smyslu (odli\u0161n\u00fd od neparametrizovan\u00e9 t\u0159\u00eddy\/rozhran\u00ed nebo surov\u00e9ho typu).<\/em> <\/strong><\/p>\n<p>Typy parametrizovan\u00e9 z\u00e1stupn\u00fdmi znaky lze pou\u017e\u00edt pro psan\u00ed (jako neparametrizovan\u00e9 t\u0159\u00eddy a rozhran\u00ed):<\/p>\n<ul>\n<li>jako argument a n\u00e1vratov\u00e9 typy metod<\/li>\n<li>jako typ pole nebo lok\u00e1ln\u00ed referen\u010dn\u00ed prom\u011bnn\u00e9<\/li>\n<li>jako typ komponenty argumentu typu poleas jin\u00fdch parametrizovan\u00fdch typ\u016f<\/li>\n<li>jako c\u00edlov\u00fd typ v obsazen\u00ed<\/li>\n<\/ul>\n<p>Nejen typy mohou b\u00fdt obecn\u00e9, ale i metody mohou b\u00fdt obecn\u00e9. Statick\u00e9 a nestatick\u00e9 metody a tak\u00e9 konstruktory mohou m\u00edt parametry typu. Syntaxe pro deklaraci parametr\u016f form\u00e1ln\u00edho typu je podobn\u00e1 syntaxi pro generick\u00e9 typy. \u010c\u00e1st parametru typu je ohrani\u010dena lomen\u00fdmi z\u00e1vorkami a zobrazuje se p\u0159ed n\u00e1vratov\u00fdm typem metody. Jeho syntaxe a v\u00fdznam je shodn\u00fd se seznamem parametr\u016f typu generick\u00e9ho typu.<\/p>\n<p>Zde je p\u0159\u00edklad generika <tt> max<\/tt> metoda, kter\u00e1 po\u010d\u00edt\u00e1 nejv\u011bt\u0161\u00ed hodnotu v kolekci prvk\u016f nezn\u00e1m\u00e9ho typu <tt> A<\/tt> .<\/p>\n<p>P\u0159\u00edklad (obecn\u00e9 metody):<\/p>\n<blockquote><p><tt> class Collections {<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e1 statika <b> <span style=\"color:#000099;\"> &lt;A roz\u0161i\u0159uje Comparable&lt;A&gt;&gt; A<\/span> <\/b> max (Kolekce&lt;<b> <span style=\"color:#000099;\"> A<\/span> <\/b> &gt; xs) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 Iter\u00e1tor&lt;<b> <span style=\"color:#000099;\"> A<\/span> <\/b> &gt; xi = xs.iterator();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 <b> <span style=\"color:#000099;\"> A<\/span> <\/b> w = xi.dal\u0161\u00ed();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 while (xi.hasNext()) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#000099;\"> A<\/span> <\/b> x = xi.dal\u0161\u00ed();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 if (w.compareTo(x) &lt; 0) w = x;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 n\u00e1vrat w;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }\u00a0<\/tt><\/p><\/blockquote>\n<p>The <tt> max<\/tt> metoda m\u00e1 jeden parametr typu s n\u00e1zvem<tt> A<\/tt> .\u00a0 Je to z\u00e1stupn\u00fd symbol pro typ prvku kolekce, na kter\u00e9m metoda funguje. Parametr type m\u00e1 vazbu; mus\u00ed to b\u00fdt typ, kter\u00fd je podtypem <tt> Srovnateln\u00e9&lt;A&gt;<\/tt><\/p>\n<p>P\u0159\u00edklad (tentokr\u00e1t stejn\u00e9ho obecn\u00e9ho typu <i> s<\/i> meze):<\/p>\n<blockquote><p><tt> ve\u0159ejn\u00e9 rozhran\u00ed Porovnateln\u00e9&lt;T&gt; {<\/tt><br \/>\n<tt> \u00a0 public int CompareTo(T arg);<\/tt><br \/>\n<tt> }<\/tt><br \/>\n<tt> ve\u0159ejn\u00e1 t\u0159\u00edda TreeMap&lt;Key <b> <span style=\"color:#000066;\"> roz\u0161i\u0159uje Comparable&lt;Key&gt;<\/span> <\/b> ,Data&gt;{<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e1 statick\u00e1 t\u0159\u00edda Entry&lt;K,V&gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 K kl\u00ed\u010d;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 V hodnota;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Vstup&lt;K,V&gt; vlevo = null;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Vstup&lt;K,V&gt; vpravo = null;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Vstup&lt;K,V&gt; rodi\u010d;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 soukrom\u00fd p\u0159echodn\u00fd Entry&lt;Key,Data&gt; root = null;<\/tt><br \/>\n<tt> \u00a0 ...<\/tt><br \/>\n<tt> \u00a0 private Entry&lt;Key,Data&gt; getEntry(kl\u00ed\u010d kl\u00ed\u010de) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Entry&lt;Key,Data&gt; p = ko\u0159en;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Kl\u00ed\u010d k = kl\u00ed\u010d;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 while (p != null) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int cmp = k.<b> <span style=\"color:#990000;\"> porovnatTo (p.key)<\/span> <\/b> ;\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (cmp == 0)<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 vr\u00e1tit p;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 jinak if (cmp &lt; 0)<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 p = p.vlevo;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 jin\u00fd\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 p = p.vpravo;\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 return null;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 public boolean obsahujeKey(kl\u00ed\u010d kl\u00ed\u010de) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 return getEntry(kl\u00ed\u010d) != null;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 ...<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Ve v\u00fd\u0161e uveden\u00e9m p\u0159\u00edkladu parametr type <tt> Kl\u00ed\u010d<\/tt> m\u00e1 v\u00e1z\u00e1no <tt> Srovnateln\u00e9&lt;Key&gt;<\/tt> .\u00a0 Specifikace vazby m\u00e1 dva \u00fa\u010dinky:<\/p>\n<ul>\n<li><i> Umo\u017e\u0148uje p\u0159\u00edstup k metod\u00e1m, kter\u00e9 vazba specifikuje<\/i> .\u00a0 V p\u0159\u00edkladu v\u00e1zan\u00fd <tt> Srovnateln\u00e9&lt;Key&gt; <\/tt> umo\u017e\u0148uje p\u0159\u00edstup k <tt> srovn\u00e1n\u00edTo<\/tt> metoda, kterou chceme pou\u017e\u00edt p\u0159i implementaci na\u0161eho <tt> Stromov\u00e1 mapa<\/tt> t\u0159\u00edda.<\/li>\n<\/ul>\n<ul>\n<li><i> Pro konkretizaci obecn\u00e9ho typu lze pou\u017e\u00edt pouze typy \u201ev r\u00e1mci mez\u00ed\u201c.<\/i> \u00a0 V p\u0159\u00edkladu je parametrizovan\u00fd typ jako nap\u0159 <tt> Stromov\u00e1 mapa&lt;\u010c\u00edslo,String&gt;<\/tt> by byl zam\u00edtnut, proto\u017ee typ <tt> \u010c\u00edslo<\/tt> nen\u00ed podtypem <tt> Srovnateln\u00e9&lt;\u010c\u00edslo&gt;<\/tt> .\u00a0 Parametrizovan\u00fd typ jako <tt> Stromov\u00e1 mapa&lt;String,String&gt;<\/tt> by bylo p\u0159ijato, proto\u017ee typ String je v mez\u00edch, tj. je podtypem <tt> Srovnateln\u00e9&lt;String&gt;<\/tt> .<\/li>\n<\/ul>\n<p>V\u0161echny t\u0159\u00eddy, rozhran\u00ed a typy v\u00fd\u010dt\u016f lze pou\u017e\u00edt jako v\u00e1zan\u00e9 parametry typu, v\u010detn\u011b vno\u0159en\u00fdch a vnit\u0159n\u00edch typ\u016f.\u00a0 Ani primitivn\u00ed typy, ani typy pol\u00ed nelze pou\u017e\u00edt jako vazbu s parametrem typu.<\/p>\n<p>P\u0159\u00edklady (hranice parametr\u016f typu):<\/p>\n<blockquote><p><tt> t\u0159\u00edda X0 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> int<\/span> <\/b> &gt; { ... }\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> t\u0159\u00edda X1 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Objekt[]<\/span> <\/b> &gt; { ... } <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> t\u0159\u00edda X2 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> \u010c\u00edslo<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X3 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> \u0158et\u011bzec<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X4 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Spustiteln\u00fd<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X5 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Z\u00e1vit.Stav<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X6 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Seznam<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X7 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Seznam&lt;String&gt;<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X8 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X9 &lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Srovnateln\u00e9&lt;? super \u010d\u00edslo&gt;<\/span> <\/b> &gt; { ... }<\/tt><br \/>\n<tt> t\u0159\u00edda X10&lt;T prodlu\u017euje <b> <span style=\"color:#000099;\"> Mapa.Vstup&lt;?,?&gt;<\/span> <\/b> &gt; { ... }<\/tt><\/p><\/blockquote>\n<p>Uk\u00e1zka k\u00f3du ukazuje, \u017ee primitivn\u00ed typy jako nap\u0159 <tt> int<\/tt> a typy pol\u00ed jako nap\u0159 <tt> Objekt[] <\/tt> nejsou povoleny jako v\u00e1zan\u00e9 na parametr typu.<\/p>\n<p>Typy t\u0159\u00edd, jako nap\u0159 <tt> \u010c\u00edslo<\/tt> nebo <tt> \u0158et\u011bzec<\/tt> a typy rozhran\u00ed, jako nap\u0159 <tt> Spustiteln\u00fd<\/tt> , jsou povoleny jako v\u00e1zan\u00e9 na parametr typu.<\/p>\n<p>V\u00fd\u010dtov\u00e9 typy, jako nap\u0159 <tt> Z\u00e1vit.Stav<\/tt> jsou tak\u00e9 povoleny jako v\u00e1zan\u00e9 na parametr typu. <tt> Z\u00e1vit.Stav<\/tt> je p\u0159\u00edklad vno\u0159en\u00e9ho typu pou\u017eit\u00e9ho jako v\u00e1zan\u00fd parametr typu.\u00a0 Jsou povoleny i nestatick\u00e9 vnit\u0159n\u00ed typy.<\/p>\n<p>Nezpracovan\u00e9 typy jsou povoleny jako v\u00e1zan\u00e9 na parametr typu; <tt> <span style=\"color:#000000;\"> Seznam<\/span> <\/tt> je p\u0159\u00edkladem.<\/p>\n<p>Parametrizovan\u00e9 typy jsou povoleny jako v\u00e1zan\u00e9 na parametry typu, v\u010detn\u011b konkr\u00e9tn\u00edch parametrizovan\u00fdch typ\u016f, jako jsou nap\u0159 <tt> Seznam&lt;String&gt;<\/tt> , ohrani\u010den\u00e9 z\u00e1stupn\u00e9 parametrizovan\u00e9 typy jako nap\u0159 <tt> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/tt> a <tt> Srovnateln\u00e9&lt;? super Long&gt;<\/tt> , a neomezen\u00e9 z\u00e1stupn\u00e9 parametrizovan\u00e9 typy, jako je <tt> Mapa.Vstup&lt;?,?&gt;<\/tt> .\u00a0 Vazba, kter\u00e1 je z\u00e1stupn\u00fdm parametrizovan\u00fdm typem, umo\u017e\u0148uje jako argument typu v\u0161echny typy, kter\u00e9 pat\u0159\u00ed do rodiny typ\u016f, kterou z\u00e1stupn\u00fd znak ozna\u010duje.\u00a0 Vazba parametrizovan\u00e9ho typu se z\u00e1stupn\u00fdmi znaky poskytuje pouze omezen\u00fd p\u0159\u00edstup k pol\u00edm a metod\u00e1m; omezen\u00ed z\u00e1vis\u00ed na druhu z\u00e1stupn\u00e9ho znaku.<\/p>\n<p>P\u0159\u00edklad (z\u00e1stupn\u00e9ho parametrizovan\u00e9ho typu jako v\u00e1zan\u00e9ho na parametr typu):<\/p>\n<blockquote><p><tt> t\u0159\u00edda X&lt;<b> <span style=\"color:#000099;\"> T roz\u0161i\u0159uje List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/span> <\/b> &gt; {<\/tt><br \/>\n<tt> \u00a0 public void someMethod(T t) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 t.add(new Long(0L));\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 \u010c\u00edslo n = t.remove(0);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><br \/>\n<tt> t\u0159\u00edda Test {<\/tt><br \/>\n<tt> \u00a0 public static void main(String[] args) {<\/tt><br \/>\n<tt> <b> <span style=\"color:#660000;\"> \u00a0\u00a0\u00a0\u00a0 <\/span> <\/b> <span style=\"color:#000000;\"> X&lt;ArrayList&lt;<\/span> <b> <span style=\"color:#000099;\"> Dlouho<\/span> <\/b> <span style=\"color:#000000;\"> &gt;&gt; x1 = new X&lt;ArrayList&lt;Long&gt;&gt;();\u00a0<\/span> <\/tt><br \/>\n<tt> <span style=\"color:#000000;\"> \u00a0\u00a0\u00a0\u00a0 X&lt;ArrayList&lt;<\/span> <b> <span style=\"color:#000099;\"> \u0158et\u011bzec<\/span> <\/b> <span style=\"color:#000000;\"> &gt;&gt; x2 = nov\u00e9 X&lt;ArrayList&lt;String&gt;&gt;(); <\/span> <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Referen\u010dn\u00ed prom\u011bnn\u00e9 typu<tt> T <\/tt> (parametr typu) se zach\u00e1z\u00ed jako s referen\u010dn\u00edmi prom\u011bnn\u00fdmi typu z\u00e1stupn\u00e9ho znaku (vazba parametru typu).\u00a0 V na\u0161em p\u0159\u00edkladu to m\u00e1 za n\u00e1sledek, \u017ee kompil\u00e1tor odm\u00edtne vyvol\u00e1n\u00ed metod, kter\u00e9 p\u0159eb\u00edraj\u00ed argument typu \u201enezn\u00e1m\u00fd\u201c, kter\u00fd zastupuje parametr type, jako nap\u0159. <tt> Seznam.p\u0159idat<\/tt> , proto\u017ee vazba je parametrizovan\u00fd typ z\u00e1stupn\u00fdm znakem s horn\u00ed hranic\u00ed.<br \/>\nZ\u00e1rove\u0148 v\u00e1zan\u00fd <tt> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/tt> ur\u010duje typy, kter\u00e9 lze pou\u017e\u00edt jako argumenty typu. Kompil\u00e1tor p\u0159ij\u00edm\u00e1 v\u0161echny argumenty typu, kter\u00e9 pat\u0159\u00ed do rodiny typ\u016f <tt> List&lt;? roz\u0161i\u0159uje \u010c\u00edslo&gt;<\/tt> , tedy v\u0161echny podtypy <tt> Seznam<\/tt> s argumentem typu, kter\u00fd je podtypem <tt> \u010c\u00edslo<\/tt> .<\/p>\n<p>Parametr typu lze pou\u017e\u00edt jako vazbu jin\u00e9ho parametru typu.<\/p>\n<p>P\u0159\u00edklad (parametru typu pou\u017eit\u00e9ho jako vazba parametru typu):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Triple<b> &lt;T&gt;<\/b> {<\/tt><br \/>\n<tt> \u00a0 soukrom\u00fd T fst, snd, trd;<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e9 &lt;<b> U<\/b> <b> <span style=\"color:#000099;\"> prodlu\u017euje T<\/span> <\/b> , <b> PROTI <span style=\"color:#000099;\"> prodlu\u017euje T<\/span> <\/b> , <b> W <span style=\"color:#000099;\"> prodlu\u017euje T<\/span> <\/b> &gt; Triple(U arg1, V arg2, W arg3) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 fst = arg1;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 snd = arg2;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 trd = arg3;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>V tomto p\u0159\u00edkladu parametr type <tt> T<\/tt> parametrizovan\u00e9 t\u0159\u00eddy se pou\u017e\u00edv\u00e1 jako vazba parametr\u016f typu <tt> U<\/tt> ,\u00a0 <tt> PROTI<\/tt> a <tt> W<\/tt> parametrizovan\u00e9 metody instance t\u00e9to t\u0159\u00eddy.<\/p>\n<p>Dal\u0161\u00ed p\u0159\u00edle\u017eitosti pro pou\u017eit\u00ed parametr\u016f typu jako hranic jin\u00fdch parametr\u016f typu zahrnuj\u00ed situace, kdy je vno\u0159en\u00fd typ definov\u00e1n uvnit\u0159 generick\u00e9ho typu nebo je definov\u00e1na m\u00edstn\u00ed t\u0159\u00edda uvnit\u0159 generick\u00e9 metody.\u00a0 Je dokonce povoleno pou\u017e\u00edt typov\u00fd parametr jako vazbu na jin\u00fd typov\u00fd parametr ve stejn\u00e9 sekci typov\u00fdch parametr\u016f.<\/p>\n<p>Vazba, kter\u00e1 je t\u0159\u00eddou, poskytuje p\u0159\u00edstup ke v\u0161em sv\u00fdm ve\u0159ejn\u00fdm \u010dlen\u016fm, tedy ve\u0159ejn\u00fdm pol\u00edm, metod\u00e1m a vno\u0159en\u00fdm typ\u016fm. Nejsou zp\u0159\u00edstupn\u011bny pouze konstruktory, proto\u017ee neexistuje \u017e\u00e1dn\u00e1 z\u00e1ruka, \u017ee podt\u0159\u00edda v\u00e1zan\u00fdch m\u00e1 stejn\u00e9 konstruktory jako v\u00e1zan\u00e1.<\/p>\n<p>P\u0159\u00edklad (t\u0159\u00eddy pou\u017eit\u00e9 jako vazba parametru typu):<\/p>\n<blockquote><p><tt> ve\u0159ejn\u00e1 t\u0159\u00edda <span style=\"color:#000000;\"> Supert\u0159\u00edda<\/span> {<\/tt><tt> \u00a0\u00a0\u00a0 \/\/ statick\u00e9 \u010dleny<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ve\u0159ejn\u00fd v\u00fd\u010det EnumType {THIS, THAT}<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public static Object staticField;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public static void staticMethod() { ... }<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0 \/\/ nestatick\u00e9 \u010dleny<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public class InnerClass { ... }<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public Object nonStaticField;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public void nonStaticMethod() { ... }<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0 \/\/ konstruktory<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public SuperClass() { ... }<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0 \/\/ soukrom\u00ed \u010dlenov\u00e9<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 private Object privateField;\u00a0<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0 ...<\/tt><br \/>\n<tt> }<\/tt><\/p>\n<p><tt> ve\u0159ejn\u00e1 fin\u00e1lov\u00e1 t\u0159\u00edda SomeClass&lt;T prodlu\u017euje <b> <span style=\"color:#006600;\"> Supert\u0159\u00edda<\/span> <\/b> &gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 soukrom\u00fd T objekt;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public SomeClass(T t) { object = t; }\u00a0<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0 public String toString() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 n\u00e1vrat<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \"static vno\u0159en\u00fd typ\u00a0\u00a0\u00a0 : \"+T.EnumType.class+\"\\n\"\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"statick\u00e9 pole\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : \"+T.staticField+\"\\n\"<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"statick\u00e1 metoda\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : \"+T.staticMethod()+\"\\n\"<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"nestatick\u00fd vno\u0159en\u00fd typ: \"+T.InnerClass.class+\"\\n\"<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"nestatick\u00e9 pole\u00a0\u00a0\u00a0\u00a0\u00a0 : \"+object.nonStaticField+\"\\n\"<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"nestatick\u00e1 metoda\u00a0\u00a0\u00a0\u00a0 : \"+object.nonStaticMethod()+\"\\n\"<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"constructor\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : \"+(nov\u00e9 T())+\"\\n\"\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ chyba<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 +\"soukrom\u00fd \u010dlen\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : \"+object.privateField+\"\\n\"\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ chyba\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>V\u00e1zan\u00fd <tt> Supert\u0159\u00edda<\/tt> poskytuje p\u0159\u00edstup ke sv\u00fdm vno\u0159en\u00fdm typ\u016fm, statick\u00fdm pol\u00edm a metod\u00e1m a nestatick\u00fdm pol\u00edm a metod\u00e1m.\u00a0 Pouze konstruktor nen\u00ed p\u0159\u00edstupn\u00fd.\u00a0 Je to proto, \u017ee konstruktory se ned\u011bd\u00ed. Ka\u017ed\u00e1 podt\u0159\u00edda definuje sv\u00e9 vlastn\u00ed konstruktory a nemus\u00ed podporovat konstruktory sv\u00e9 nadt\u0159\u00eddy.\u00a0 Proto neexistuje \u017e\u00e1dn\u00e1 z\u00e1ruka, \u017ee podt\u0159\u00edda <tt> Supert\u0159\u00edda<\/tt> bude m\u00edt stejn\u00fd konstruktor jako jeho nadt\u0159\u00edda.<\/p>\n<p>Kontext, ve kter\u00e9m<tt> Enum&lt;E roz\u0161i\u0159uje Enum&lt;E&gt;&gt;<\/tt> \u201c se objev\u00ed deklarace <tt> Enum<\/tt> t\u0159\u00edda v bal\u00ed\u010dku <tt> java.lang<\/tt> :<\/p>\n<blockquote><p><tt> ve\u0159ejn\u00e1 abstraktn\u00ed t\u0159\u00edda <b> Enum&lt;E roz\u0161i\u0159uje Enum&lt;E&gt;&gt;<\/b> {<\/tt><br \/>\n<tt> \u00a0 ...<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Typ <tt> Enum<\/tt> je spole\u010dn\u00e1 z\u00e1kladn\u00ed t\u0159\u00edda v\u0161ech typ\u016f v\u00fd\u010dtu.\u00a0 V Jav\u011b je typ v\u00fd\u010dtu jako nap\u0159 <tt> Barva<\/tt> je p\u0159elo\u017een do t\u0159\u00eddy <tt> Barva<\/tt> kter\u00e1 se roz\u0161i\u0159uje <tt> Enum&lt;Color&gt;<\/tt> . \u00da\u010del nadt\u0159\u00eddy <tt> Enum<\/tt> je poskytovat funkce, kter\u00e9 jsou spole\u010dn\u00e9 pro v\u0161echny typy v\u00fd\u010dt\u016f.<\/p>\n<p>Zde je n\u00e1\u010drt t\u0159\u00eddy <tt> Enum<\/tt> :<\/p>\n<blockquote><p><tt> ve\u0159ejn\u00e1 abstraktn\u00ed t\u0159\u00edda <b> Enum&lt;<span style=\"color:#000099;\"> E<\/span> roz\u0161i\u0159uje Enum&lt;E&gt;&gt;<\/b> implementuje Comparable&lt;<b> <span style=\"color:#000099;\"> E<\/span> <\/b> &gt;, serializovateln\u00fd {<\/tt><br \/>\n<tt> \u00a0 soukrom\u00fd kone\u010dn\u00fd N\u00e1zev \u0159et\u011bzce;<\/tt><br \/>\n<tt> \u00a0 public final String name() { ... }<\/tt><tt> \u00a0 private final int ordinal;<\/tt><br \/>\n<tt> \u00a0 public final int ordinal() { ... }<\/tt><\/p>\n<p><tt> \u00a0 protected Enum(n\u00e1zev \u0159et\u011bzce, int po\u0159adov\u00e9 \u010d\u00edslo) { ... }<\/tt><\/p>\n<p><tt> \u00a0 public String\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 toString() { ... }<\/tt><br \/>\n<tt> \u00a0 public final boolean equals(Object other) { ... }<\/tt><br \/>\n<tt> \u00a0 public final int hashCode() { ... }<\/tt><br \/>\n<tt> \u00a0 protected final Object clone() vyvol\u00e1 CloneNotSupportedException { ... }<\/tt><br \/>\n<tt> \u00a0 public final int CompareTo(<b> <span style=\"color:#000099;\"> E<\/span> <\/b> o) { ... }<\/tt><\/p>\n<p><tt> \u00a0 ve\u0159ejn\u00e9 fin\u00e1le Class&lt;<b> <span style=\"color:#000099;\"> E<\/span> <\/b> &gt; getDeclaringClass() { ... }<\/tt><br \/>\n<tt> \u00a0 public static &lt;T roz\u0161i\u0159uje Enum&lt;T&gt;&gt; T valueOf(Class&lt;T&gt; enumType, String name) { ... }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>P\u0159ekvapiv\u00e1 vlastnost v prohl\u00e1\u0161en\u00ed &#8220;<tt> Enum&lt;E roz\u0161i\u0159uje Enum&lt;E&gt;&gt;<\/tt> \u201c je skute\u010dnost, \u017ee nov\u011b definovan\u00e1 t\u0159\u00edda <tt> Enum<\/tt> a jeho nov\u011b definovan\u00fd parametr typu <tt> E <\/tt> se objev\u00ed v mez parametru stejn\u00e9ho typu.\u00a0 Znamen\u00e1 to, \u017ee <tt> Enum<\/tt> typ mus\u00ed b\u00fdt vytvo\u0159en pro jeden z jeho podtyp\u016f.\u00a0 Abyste pochopili, pro\u010d to d\u00e1v\u00e1 smysl, zva\u017ete, \u017ee ka\u017ed\u00fd typ v\u00fd\u010dtu je p\u0159elo\u017een do podtypu <tt> Enum<\/tt> .<\/p>\n<p>Zde je vykonstruovan\u00fd typ v\u00fd\u010dtu <tt> Barva<\/tt> :<\/p>\n<blockquote><p><tt> enum <b> Barva<\/b> {\u010cERVEN\u00c1, MODR\u00c1, ZELEN\u00c1}<\/tt><\/p><\/blockquote>\n<p>Kompil\u00e1tor jej p\u0159elo\u017e\u00ed do n\u00e1sleduj\u00edc\u00ed t\u0159\u00eddy:<\/p>\n<blockquote><p><tt> ve\u0159ejn\u00e1 z\u00e1v\u011bre\u010dn\u00e1 t\u0159\u00edda <b> Barva<\/b> roz\u0161i\u0159uje <b> Enum&lt;Color&gt;<\/b> {<\/tt><br \/>\n<tt> \u00a0 public static final Color[] values() { return (Color[])$VALUES.clone(); }<\/tt><br \/>\n<tt> \u00a0 public static Hodnota barvyOf(n\u00e1zev \u0159et\u011bzce) { ... }<\/tt><tt> \u00a0 private Color(String s, int i) { super(s, i); }<\/tt><\/p>\n<p><tt> \u00a0 ve\u0159ejn\u00e1 statick\u00e1 fin\u00e1ln\u00ed Barva \u010cERVEN\u00c1;<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e1 statick\u00e1 fin\u00e1ln\u00ed Barva MODR\u00c1;<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e1 statick\u00e1 fin\u00e1ln\u00ed Barva ZELEN\u00c1;<\/tt><\/p>\n<p><tt> \u00a0 soukrom\u00e9 statick\u00e9 kone\u010dn\u00e9 Barva $VALUES[];<\/tt><\/p>\n<p><tt> \u00a0 statick\u00e9 {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 \u010cERVEN\u00c1 = nov\u00e1 barva(\"\u010cERVEN\u00c1\", 0);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 MODR\u00c1 = new Color(\"BLUE\", 1);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ZELEN\u00c1 = nov\u00e1 barva(\"ZELEN\u00c1\", 2);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 $VALUES = (nov\u00e1 barva[] { \u010cERVEN\u00c1, MODR\u00c1, ZELEN\u00c1 });<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>D\u011bdi\u010dnost m\u00e1 za n\u00e1sledek, \u017ee <tt> Barva<\/tt> typ zd\u011bd\u00ed v\u0161echny metody implementovan\u00e9 v <tt> Enum&lt;Color&gt;<\/tt> .\u00a0 Mezi nimi je <tt> srovn\u00e1n\u00edTo<\/tt> metoda.\u00a0 The <tt> Barva. srovn\u00e1n\u00edTo<\/tt> metoda by pravd\u011bpodobn\u011b m\u011bla trvat a <tt> Barva<\/tt> jako argument.\u00a0 Aby se to stalo t\u0159 <tt> Enum<\/tt> je generick\u00fd a <tt> Enum.compareTo<\/tt> metoda trv\u00e1 <tt> Enum<\/tt> parametr typu &#8216;s <tt> E <\/tt> jako argument.\u00a0 V d\u016fsledku toho zadejte <tt> Barva<\/tt> odvozen\u00e9 z <tt> Enum&lt;Color&gt;<\/tt> zd\u011bd\u00ed a <tt> srovn\u00e1n\u00edTo<\/tt> metoda, kter\u00e1 vy\u017eaduje a <tt> Barva<\/tt> jak a argumentovat, p\u0159esn\u011b jak m\u00e1.<br \/>\nPokud rozebereme prohl\u00e1\u0161en\u00ed &#8220;<tt> Enum&lt;E roz\u0161i\u0159uje Enum&lt;E&gt;&gt;<\/tt> \u201c m\u016f\u017eeme vid\u011bt, \u017ee tento vzor m\u00e1 n\u011bkolik aspekt\u016f.<\/p>\n<p>Za prv\u00e9 je tu skute\u010dnost, \u017ee parametr typu bound je samotn\u00fd typ: &#8220;<tt> <b> Enum<\/b> &lt;E se prodlu\u017euje <b> Enum<\/b> &lt;E&gt;&gt;<\/tt> Zaji\u0161\u0165uje, \u017ee pouze podtypy typu <tt> Enum<\/tt> jsou povoleny jako argumenty typu. (Teoreticky napi\u0161te <tt> Enum<\/tt> mohla b\u00fdt vytvo\u0159ena sama o sob\u011b, jako v <tt> Enum&lt;Enum&gt;<\/tt> , ale to rozhodn\u011b nen\u00ed zam\u00fd\u0161leno a je t\u011b\u017ek\u00e9 si p\u0159edstavit situaci, ve kter\u00e9 by byla takov\u00e1 konkretizace u\u017eite\u010dn\u00e1.)<\/p>\n<p>Za druh\u00e9 je zde skute\u010dnost, \u017ee typ v\u00e1zan\u00fd na parametr je parametrizovan\u00fd typ <tt> Enum<b> &lt;E&gt;<\/b> <\/tt> , kter\u00fd pou\u017e\u00edv\u00e1 parametr type <tt> E<\/tt> jako argument typu vazby. Tato deklarace zaji\u0161\u0165uje, \u017ee vztah d\u011bdi\u010dnosti mezi podtypem a konkretizac\u00ed <tt> Enum<\/tt> je ve form\u011b<tt> X roz\u0161i\u0159uje Enum&lt;X&gt;<\/tt> &#8220;. Podtyp jako &#8220;<tt> X roz\u0161i\u0159uje Enum&lt;Y&gt;<\/tt> &#8221; nelze deklarovat kv\u016fli argumentu typu <tt> Y<\/tt> nebude v mez\u00edch; pouze podtypy <tt> Enum&lt;X&gt;<\/tt> jsou v mez\u00edch.<\/p>\n<p>Za t\u0159et\u00ed je tu skute\u010dnost, \u017ee <tt> Enum<\/tt> je na prvn\u00edm m\u00edst\u011b generick\u00fd.\u00a0 Znamen\u00e1 to, \u017ee n\u011bkter\u00e9 z metod t\u0159 <tt> Enum<\/tt> vz\u00edt argument nebo vr\u00e1tit hodnotu nezn\u00e1m\u00e9ho typu (nebo jinak z\u00e1viset na nezn\u00e1m\u00e9m typu). Jak ji\u017e v\u00edme, tento nezn\u00e1m\u00fd typ bude pozd\u011bji podtypem <tt> X<\/tt> z <tt> Enum&lt;X&gt;<\/tt> .\u00a0 Tedy v parametrizovan\u00e9m typu <tt> Enum&lt;X&gt;<\/tt> , tyto metody zahrnuj\u00ed podtyp <tt> X<\/tt> , a jsou zd\u011bd\u011bny do podtypu <tt> X<\/tt> .\u00a0 The <tt> srovn\u00e1n\u00edTo<\/tt> metoda je p\u0159\u00edkladem takov\u00e9 metody; je zd\u011bd\u011bna z nadt\u0159\u00eddy do ka\u017ed\u00e9 podt\u0159\u00eddy a v ka\u017ed\u00e9m p\u0159\u00edpad\u011b m\u00e1 podpis specifick\u00fd pro podt\u0159\u00eddu.<\/p>\n<p>Abych to shrnul, prohl\u00e1\u0161en\u00ed &#8220;<tt> Enum&lt;E roz\u0161i\u0159uje Enum&lt;E&gt;&gt;<\/tt> \u201c lze de\u0161ifrovat jako: <tt> Enum<\/tt> je generick\u00fd typ, kter\u00fd lze konkretizovat pouze pro jeho podtypy, a tyto podtypy zd\u011bd\u00ed n\u011bkter\u00e9 u\u017eite\u010dn\u00e9 metody, z nich\u017e n\u011bkter\u00e9 p\u0159eb\u00edraj\u00ed argumenty specifick\u00e9 pro podtyp (nebo jinak z\u00e1vis\u00ed na podtypu).<\/p>\n<p><b>Doln\u00ed mez Typ Parametry t\u0159\u00edd<\/b><\/p>\n<p>Parametry typu mohou m\u00edt n\u011bkolik mez\u00ed, jako nap\u0159 <tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {...}<\/tt> . Ale parametr typu nem\u016f\u017ee m\u00edt \u017e\u00e1dnou spodn\u00ed hranici, to znamen\u00e1 konstrukt jako nap\u0159 <tt> t\u0159\u00edda Box&lt;T <b> velk\u00fd<\/b> \u010c\u00edslo&gt; {...}<\/tt> nen\u00ed povoleno.\u00a0 Pro\u010d ne?\u00a0 Odpov\u011b\u010f zn\u00ed: je to zbyte\u010dn\u00e9, proto\u017ee by v\u00e1m to nic nekoupilo, kdyby to bylo povoleno.\u00a0 Pod\u00edvejme se, pro\u010d jsou parametry typu doln\u00ed meze t\u0159\u00edd matouc\u00ed, kdy\u017e prozkoum\u00e1me, co znamen\u00e1 horn\u00ed mez parametru typu.<\/p>\n<p>Horn\u00ed mez parametru typu m\u00e1 t\u0159i \u00fa\u010dinky:<\/p>\n<ol>\n<ol>\n<li><b> <i> Omezen\u00e1 instance.<\/i> <\/b> Horn\u00ed hranice omezuje sadu typ\u016f, kter\u00e9 lze pou\u017e\u00edt pro konkretizaci generick\u00e9ho typu.\u00a0 Pokud prohl\u00e1s\u00edme a <tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {...} <\/tt> pak by kompil\u00e1tor zajistil, \u017ee pouze podtypy <tt> \u010c\u00edslo<\/tt> lze pou\u017e\u00edt jako argument typu.\u00a0 To znamen\u00e1, a <tt> Box&lt;\u010c\u00edslo&gt;<\/tt> nebo a <tt> Box&lt;Long&gt;<\/tt> je povoleno, ale a <tt> Box&lt;OObject&gt;<\/tt> nebo <tt> Box&lt;String&gt;<\/tt> by bylo odm\u00edtnuto<\/li>\n<\/ol>\n<\/ol>\n<p>P\u0159\u00edklad (omezen\u00e9 konkretizace kv\u016fli horn\u00ed hranici parametru typu):<br \/>\n<tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e1 hodnota T;\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public Box(T t) { hodnota = t; }\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> }\u00a0<\/tt><tt> t\u0159\u00edda Test {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public static void main(String[] args) {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Box&lt;Long&gt; boxOfLong = nov\u00fd Box&lt;Long&gt;(0L);\u00a0\u00a0 <b> \/\/ dob\u0159e<\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Box&lt;String&gt; boxOfString = new Box&lt;String&gt;(\"\"); <b> <span style=\"color:#330000;\"> \/\/ chyba: \u0158et\u011bzec nen\u00ed v mez\u00edch<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p>\n<ol>\n<li><b> <i> P\u0159\u00edstup k nestatick\u00fdm \u010dlen\u016fm. <\/i> <\/b> Horn\u00ed hranice umo\u017e\u0148uje p\u0159\u00edstup ke v\u0161em ve\u0159ejn\u00fdm nestatick\u00fdm metod\u00e1m a pol\u00edm horn\u00ed hranice.\u00a0 P\u0159i realizaci na\u0161eho <tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {...}<\/tt> m\u016f\u017eeme vyvolat v\u0161echny ve\u0159ejn\u00e9 nestatick\u00e9 metody definovan\u00e9 ve t\u0159\u00edd\u011b <tt> \u010c\u00edslo<\/tt> , jako nap\u0159 <tt> intValue()<\/tt> nap\u0159\u00edklad.\u00a0 Bez horn\u00ed hranice by kompil\u00e1tor jak\u00e9koli takov\u00e9 vyvol\u00e1n\u00ed odm\u00edtl. P\u0159\u00edklad (p\u0159\u00edstupu k nestatick\u00fdm \u010dlen\u016fm kv\u016fli horn\u00ed hranici parametru typu):<\/li>\n<\/ol>\n<p><tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e1 hodnota T;\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public Box(T t) { hodnota = t; }\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public int increment() { return value.intValue()+1; } <b> \/\/ &lt;= by bez vazby na \u010d\u00edslo byla chyba<\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> }\u00a0<\/tt><\/p>\n<ol>\n<ol>\n<li><b> <i> Typ Erasure. <\/i> <\/b> Horn\u00ed mez vlevo se pou\u017e\u00edv\u00e1 pro vymaz\u00e1n\u00ed typu a nahrazuje parametr typu v bajtov\u00e9m k\u00f3du.\u00a0 V na\u0161em <tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {...}<\/tt> v\u0161echny v\u00fdskyty <tt> T<\/tt> bude nahrazena horn\u00ed hranic\u00ed <tt> \u010c\u00edslo<\/tt> .\u00a0 Nap\u0159\u00edklad pokud t\u0159\u00edda <tt> Krabice<\/tt> m\u00e1 soukrom\u00e9 pole typu <tt> T<\/tt> a zp\u016fsob <tt> neplatn\u00e1 sada (obsah T) <\/tt> pro nastaven\u00ed tohoto soukrom\u00e9ho pole by pole bylo typu <tt> \u010c\u00edslo<\/tt> po vymaz\u00e1n\u00ed typu a metoda by byla p\u0159evedena na metodu <tt> void set (\u010d\u00edslo obsahu)<\/tt> .<\/li>\n<\/ol>\n<\/ol>\n<p>P\u0159\u00edklad (pou\u017eit\u00ed horn\u00ed hranice u parametru typu p\u0159i maz\u00e1n\u00ed typu &#8211; <i> p\u0159ed<\/i> typ maz\u00e1n\u00ed):<br \/>\n<tt> t\u0159\u00eddy Box&lt;<b> T roz\u0161i\u0159uje \u010d\u00edslo<\/b> &gt; {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 <b> T<\/b> hodnota;\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejn\u00e1 schr\u00e1nka (<b> T<\/b> t) { hodnota = t; }\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> }\u00a0<\/tt><\/p>\n<ol>\n<ol>P\u0159\u00edklad (pou\u017eit\u00ed horn\u00ed hranice u parametru typu p\u0159i maz\u00e1n\u00ed typu &#8211;<\/ol>\n<\/ol>\n<p><i> po<\/i><\/p>\n<ol>\n<ol>typ maz\u00e1n\u00ed):<\/ol>\n<\/ol>\n<p>&nbsp;<\/p>\n<p><tt> t\u0159\u00edda Box {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 <b> \u010c\u00edslo<\/b> hodnota;\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejn\u00e1 schr\u00e1nka (<b> \u010c\u00edslo<\/b> t) { hodnota = t; }\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> }<\/tt><\/p>\n<ol>Krom\u011b toho se horn\u00ed mez nejv\u00edce vlevo objev\u00ed na dal\u0161\u00edch m\u00edstech, jako jsou automaticky vlo\u017een\u00e9 odlitky a metody mostu.<\/ol>\n<p>Pokud by byly povoleny doln\u00ed meze pro parametry typu, jak\u00e9 vedlej\u0161\u00ed \u00fa\u010dinky by m\u011bly nebo m\u011bly m\u00edt? Pokud konstrukce jako nap\u0159 <tt> t\u0159\u00edda Box&lt;T <b> velk\u00fd<\/b> \u010c\u00edslo&gt; {...} <\/tt> byly povoleny, co by to znamenalo?\u00a0 Co by znamenaly 3 vedlej\u0161\u00ed \u00fa\u010dinky hranice parametru horn\u00edho typu \u2013 omezen\u00e1 konkretizace, p\u0159\u00edstup k nestatick\u00e9mu \u010dlenu, vymaz\u00e1n\u00ed typu \u2013 pro doln\u00ed hranici?<\/p>\n<p><i> Omezen\u00e9 instance. <\/i> Kompil\u00e1tor by mohl omezit sadu typ\u016f, kter\u00e9 lze pou\u017e\u00edt pro konkretizaci obecn\u00e9ho typu s parametrem typu s doln\u00ed mez\u00ed.\u00a0 Kompil\u00e1tor m\u016f\u017ee nap\u0159\u00edklad povolit vytv\u00e1\u0159en\u00ed instanc\u00ed, jako je nap\u0159 <tt> Box&lt;\u010c\u00edslo&gt;<\/tt> a <tt> Box&lt;OObject&gt;<\/tt> od a <tt> Box&lt;T <b> velk\u00fd<\/b> \u010c\u00edslo&gt; <\/tt> a odm\u00edtnout instance jako nap\u0159 <tt> Box&lt;Long&gt;<\/tt> nebo <tt> Box&lt;Short&gt;<\/tt> .\u00a0 To by byl \u00fa\u010dinek v souladu s omezuj\u00edc\u00edm vedlej\u0161\u00edm \u00fa\u010dinkem popsan\u00fdm pro horn\u00ed hranice parametr\u016f.<\/p>\n<p><i> P\u0159\u00edstup k nestatick\u00fdm \u010dlen\u016fm. <\/i> Ni\u017e\u0161\u00ed mez parametru typu ned\u00e1v\u00e1 p\u0159\u00edstup k \u017e\u00e1dn\u00fdm konkr\u00e9tn\u00edm metod\u00e1m krom\u011b t\u011bch, kter\u00e9 jsou zd\u011bd\u011bny ze t\u0159\u00eddy <tt> Objekt<\/tt> . V p\u0159\u00edkladu <tt> Box&lt;T <b> velk\u00fd<\/b> \u010c\u00edslo&gt; <\/tt> supertypy <tt> \u010c\u00edslo<\/tt> nemaj\u00ed nic spole\u010dn\u00e9ho, \u200b\u200bkrom\u011b toho, \u017ee se jedn\u00e1 o referen\u010dn\u00ed typy, a tedy jejich podtypy <tt> Objekt<\/tt> .\u00a0 Kompil\u00e1tor nem\u016f\u017ee p\u0159edpokl\u00e1dat, \u017ee pole typu <tt> T<\/tt> je typu <tt> \u010c\u00edslo<\/tt> nebo jeho podtyp.\u00a0 M\u00edsto toho pole typu <tt> T<\/tt> m\u016f\u017ee b\u00fdt jak\u00e9hokoli supertypu <tt> \u010c\u00edslo<\/tt> , jako nap\u0159 <tt> Serializovateln\u00e9<\/tt> nebo <tt> Objekt<\/tt> .\u00a0 Vyvol\u00e1n\u00ed metody jako je nap\u0159 <tt> intValue()<\/tt> ji\u017e nen\u00ed typov\u011b bezpe\u010dn\u00fd a kompil\u00e1tor by jej musel odm\u00edtnout. V d\u016fsledku toho by ni\u017e\u0161\u00ed mez parametru typu neposkytla p\u0159\u00edstup k nestatick\u00fdm \u010dlen\u016fm nad r\u00e1mec t\u011bch, kter\u00e9 jsou definov\u00e1ny ve t\u0159\u00edd\u011b <tt> Objekt<\/tt> a m\u00e1 tedy stejn\u00fd \u00fa\u010dinek jako \u201ebez vazby\u201c.<\/p>\n<p><i> Typ Erasure<\/i> .\u00a0 Podle t\u00e9to logick\u00e9 linie nem\u00e1 smysl nahrazovat v\u00fdskyty parametru type jeho doln\u00ed hranic\u00ed zcela vlevo.\u00a0 Deklarov\u00e1n\u00ed metody jako konstruktoru <tt> Krabice(<b> T<\/b> t) <\/tt> jako konstrukt\u00e9r <tt> Krabice(<b> \u010c\u00edslo<\/b> t)<\/tt> vzhledem k tomu ned\u00e1v\u00e1 smysl <tt> T<\/tt> je nahrazen nadtypem <tt> \u010c\u00edslo<\/tt> .\u00a0 An <tt> Objekt<\/tt> m\u016f\u017ee b\u00fdt spr\u00e1vn\u011b p\u0159ed\u00e1n konstruktoru v instanciaci <tt> Box&lt;OObject&gt;<\/tt> a konstrukt\u00e9r by to odm\u00edtl.\u00a0 To by bylo smrteln\u011b \u0161patn\u011b.\u00a0\u00a0 Vymaz\u00e1n\u00ed typu by tedy nahradilo v\u0161echny v\u00fdskyty prom\u011bnn\u00e9 typu<tt> T<\/tt> podle typu <tt> Objekt<\/tt> , a ne jeho spodn\u00ed hranic\u00ed.\u00a0 Op\u011bt plat\u00ed, \u017ee doln\u00ed mez by m\u011bla stejn\u00fd \u00fa\u010dinek jako \u201ebez meze\u201c.<\/p>\n<p>Chcete zjistit, co by to znamenalo, kdyby oba ni\u017e\u0161\u00ed <i> _a_<\/i> byly povoleny horn\u00ed hranice?\u00a0\u00a0 Osobn\u011b na to nechci ani myslet a rad\u011bji bych to za\u0159adil pod &#8220;nezvl\u00e1dnuteln\u00e9&#8221;, pokud dovol\u00edte.<\/p>\n<p>Se\u010dteno a podtr\u017eeno: v\u0161e, co \u201e<tt> velk\u00fd<\/tt> \u201eV\u00e1zan\u00fd by t\u011b koupil je omezen\u00ed, kter\u00e9 plat\u00ed pouze pro supertypy <tt> \u010c\u00edslo<\/tt> lze pou\u017e\u00edt jako argumenty typu.\u00a0 A i to je \u010dasto nepochopeno.\u00a0 NEZNAMENALO by to <tt> t\u0159\u00edda Box&lt;T super \u010d\u00edslo&gt; {...}<\/tt> obsahuje pouze instance supertyp\u016f <tt> \u010c\u00edslo<\/tt> .\u00a0 P\u0159esn\u011b naopak \u2013 jak ukazuje p\u0159\u00edklad n\u00ed\u017ee!<\/p>\n<p>P\u0159\u00edklad (pou\u017eit\u00ed horn\u00ed hranice u parametru typu p\u0159i maz\u00e1n\u00ed typu &#8211; <i> p\u0159ed<\/i> typ maz\u00e1n\u00ed):<\/p>\n<div style=\"margin-left:40px;\">\n<blockquote><p><tt> t\u0159\u00eddy Box&lt;<b> T super \u010d\u00edslo<\/b> &gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 <b> T<\/b> hodnota;<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejn\u00e1 schr\u00e1nka (<b> T<\/b> t) { hodnota = t; }<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<\/div>\n<p>P\u0159\u00edklad (pou\u017eit\u00ed horn\u00ed hranice u parametru typu p\u0159i maz\u00e1n\u00ed typu &#8211; <i> po<\/i> typ maz\u00e1n\u00ed):<\/p>\n<div style=\"margin-left:40px;\">\n<blockquote><p><tt> t\u0159\u00edda Box {<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 <b> Objekt<\/b> hodnota;<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejn\u00e1 schr\u00e1nka (<b> Objekt<\/b> t) { hodnota = t; }<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<\/div>\n<p>A <tt> t\u0159\u00edda Box&lt;T <b> velk\u00fd<\/b> \u010c\u00edslo&gt; {...} <\/tt> by se p\u0159elo\u017eilo podle typu maz\u00e1n\u00ed na a <tt> Krabice<\/tt> obsahuj\u00edc\u00ed an <tt> Objekt<\/tt> pole a jeho konstruktor by byl p\u0159elo\u017een do <tt> Box (Objekt t)<\/tt> . To se z\u00e1sadn\u011b li\u0161\u00ed od a <tt> t\u0159\u00edda Box&lt;T <b> roz\u0161i\u0159uje<\/b> \u010c\u00edslo&gt; {...}<\/tt> , co\u017e by bylo p\u0159elo\u017eeno do a <tt> Krabice<\/tt> obsahuj\u00edc\u00ed a <tt> \u010c\u00edslo<\/tt> pole a jeho konstruktor by byl p\u0159elo\u017een do <tt> Box (\u010d\u00edslo t)<\/tt> . V d\u016fsledku toho a <tt> Box&lt;\u010c\u00edslo&gt;<\/tt> vytvo\u0159en\u00e9 z a<tt> t\u0159\u00edda Box&lt;T roz\u0161i\u0159uje \u010c\u00edslo&gt; {...}<\/tt> by se li\u0161il od a <tt> Box&lt;\u010c\u00edslo&gt;<\/tt> instance z a <tt> t\u0159\u00edda Box&lt;T super \u010d\u00edslo&gt; {...}<\/tt> , co\u017e pravd\u011bpodobn\u011b zp\u016fsob\u00ed zmatek.\u00a0 Z tohoto d\u016fvodu ned\u00e1vaj\u00ed doln\u00ed meze u typov\u00fdch parametr\u016f t\u0159\u00edd smysl.<\/p>\n<p>&nbsp;<\/p>\n<hr width=\"100%\" \/>\n<p>&nbsp;<\/p>\n<p><b>Parametry metod typu s doln\u00ed hranic\u00ed<\/b><\/p>\n<p>Ve spojen\u00ed s metodami a jejich typy argument\u016f m\u016f\u017ee b\u00fdt p\u0159\u00edle\u017eitostn\u011b u\u017eite\u010dn\u00fd parametr typu s doln\u00ed hranic\u00ed.<\/p>\n<p>P\u0159\u00edklad (metody, kter\u00e1 by t\u011b\u017eila z parametru typu s doln\u00ed hranic\u00ed):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Pair&lt;X,Y&gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 X prvn\u00ed;<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e1 Y sekunda;<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejn\u00e9 &lt;<b> Super X<\/b> ,<b> B super Y<\/b> &gt; B addToMap(Map&lt;A,B&gt; mapa) { \/\/ chyba: parametr typu nem\u016f\u017ee m\u00edt spodn\u00ed hranici<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 return map.put(prvn\u00ed, druh\u00fd);<\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><br \/>\n<tt> t\u0159\u00edda Test {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public static void main(String[] args) {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Pair&lt;String,Long&gt; pair = new Pair&lt;&gt;(\"ABC\",42L);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Map&lt;CharSequence, Number&gt; mapa = HashMap&lt;CharSequence, Number&gt;();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 \u010c\u00edslo \u010d\u00edslo = pair.addToMap(map);<\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>The <tt> addToMap()<\/tt> metoda p\u0159id\u00e1 obsah dvojice do mapy.\u00a0 Jak\u00e1koli mapa, kter\u00e1 m\u016f\u017ee obsahovat supertypy <tt> X<\/tt> a <tt> Y<\/tt> by ud\u011blal.\u00a0 Mapa je <tt> d\u00e1t()<\/tt> metoda vrac\u00ed hodnotu nalezenou v map\u011b pro dan\u00fd kl\u00ed\u010d, pokud ji\u017e pro kl\u00ed\u010d v map\u011b existuje polo\u017eka p\u00e1ru kl\u00ed\u010d\u2013hodnota.\u00a0 N\u00e1vratov\u00e1 hodnota mapy <tt> d\u00e1t()<\/tt> metoda se vr\u00e1t\u00ed z <tt> addToMap()<\/tt> metoda.\u00a0 Za t\u011bchto okolnost\u00ed bychom cht\u011bli deklarovat metodu, jak je uk\u00e1z\u00e1no v\u00fd\u0161e: Mapa je parametrizov\u00e1na pomoc\u00ed supertyp\u016f parametr\u016f typu dvojice a <tt> addToMap()<\/tt> n\u00e1vratov\u00fd typ metody je typ hodnoty mapy.<\/p>\n<p>Proto\u017ee kompil\u00e1tor neumo\u017e\u0148uje doln\u00ed meze parametr\u016f typu, pot\u0159ebujeme to obej\u00edt.<\/p>\n<p>Jedn\u00edm z \u0159e\u0161en\u00ed, kter\u00e9 p\u0159ich\u00e1z\u00ed na mysl, je pou\u017eit\u00ed z\u00e1stupn\u00e9ho znaku, proto\u017ee z\u00e1stupn\u00e9 znaky mohou m\u00edt spodn\u00ed hranici.\u00a0 Zde je \u0159e\u0161en\u00ed pomoc\u00ed z\u00e1stupn\u00e9ho znaku.<\/p>\n<p>P\u0159\u00edklad (obch\u00e1zen\u00ed p\u0159edchoz\u00edho p\u0159\u00edkladu pomoc\u00ed z\u00e1stupn\u00fdch znak\u016f):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Pair&lt;X,Y&gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 X prvn\u00ed;<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e1 Y sekunda;<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejnost <b> Objekt<\/b> addToMap(Map&lt;<b> ? Super X<\/b> , <b> ? super Y<\/b> mapa &gt;) {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 return map.put(prvn\u00ed, druh\u00fd);<\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><br \/>\n<tt> t\u0159\u00edda Test {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public static void main(String[] args) {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Pair&lt;String,Long&gt; pair = new Pair&lt;&gt;(\"ABC\",42L);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Map&lt;CharSequence, Number&gt; mapa = HashMap&lt;CharSequence, Number&gt;();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 \u010c\u00edslo \u010d\u00edslo = <b> (\u010c\u00edslo)<\/b> pair.addToMap(mapa);<\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Funguje to, a\u017e na to, \u017ee neexistuje zp\u016fsob, jak deklarovat n\u00e1vratov\u00fd typ jako po\u017eadovan\u00fd.\u00a0 Byl by to supertyp <tt> Y<\/tt> kter\u00fd kompil\u00e1tor zachyt\u00ed z typu mapy, ale neexistuje \u017e\u00e1dn\u00e1 syntaxe pro jeho specifikaci.\u00a0 Nesm\u00edme deklarovat n\u00e1vratov\u00fd typ a &#8220;<tt> ? super Y<\/tt> &#8220;, proto\u017ee&#8221;<tt> ? super Y<\/tt> &#8221; je z\u00e1stupn\u00fd znak, nikoli typ, a proto nen\u00ed povolen jako n\u00e1vratov\u00fd typ. Nem\u00e1me na v\u00fdb\u011br a mus\u00edme ho pou\u017e\u00edt <tt> Objekt<\/tt> m\u00edsto toho jako n\u00e1vratov\u00fd typ na\u0161\u00ed metody.\u00a0 Tento pon\u011bkud nespecifick\u00fd n\u00e1vratov\u00fd typ zase nut\u00ed volaj\u00edc\u00ed <tt> addToMap()<\/tt> metodou p\u0159etypov\u00e1n\u00ed n\u00e1vratov\u00e9 hodnoty dol\u016f z <tt> Objekt<\/tt> na jeho skute\u010dn\u00fd typ.\u00a0 To nen\u00ed p\u0159esn\u011b to, co jsme m\u011bli na mysli.<\/p>\n<p>Dal\u0161\u00edm \u0159e\u0161en\u00edm je pou\u017eit\u00ed statick\u00fdch metod.\u00a0 Zde je \u0159e\u0161en\u00ed se statickou nam\u00edsto nestatickou metodou.<\/p>\n<p>P\u0159\u00edklad (obch\u00e1zen\u00ed p\u0159edchoz\u00edho p\u0159\u00edkladu pomoc\u00ed statick\u00e9 metody):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Pair&lt;X,Y&gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e9 X prvn\u00ed;<\/tt><br \/>\n<tt> \u00a0\u00a0 soukrom\u00e1 Y sekunda;<\/tt><br \/>\n<tt> \u00a0\u00a0 ...<\/tt><br \/>\n<tt> \u00a0\u00a0 ve\u0159ejnost <b> statick\u00fd<\/b> &lt;<b> A<\/b> ,<b> B<\/b> ,X <b> roz\u0161i\u0159uje A<\/b> ,Y <b> roz\u0161i\u0159uje B<\/b> &gt; B addToMap(Pair&lt;X,Y&gt; pair, Map&lt;<b> A<\/b> ,<b> B<\/b> mapa &gt;) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 return map.put(p\u00e1r.prvn\u00ed,p\u00e1r.druh\u00fd);<\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><br \/>\n<tt> t\u0159\u00edda Test {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0 public static void main(String[] args) {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Pair&lt;String,Long&gt; pair = new Pair&lt;&gt;(\"ABC\",42L);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 Map&lt;CharSequence, Number&gt; mapa = HashMap&lt;CharSequence, Number&gt;();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0 \u010c\u00edslo \u010d\u00edslo = <b> P\u00e1r<\/b> .addToMap(<b> p\u00e1r<\/b> ,mapa);<\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Obecn\u00fd <tt> addToMap()<\/tt> metoda m\u00e1 \u010dty\u0159i parametry typu: dva z\u00e1stupn\u00e9 symboly <tt> X<\/tt> a <tt> Y<\/tt> pro typ dvojice a dva z\u00e1stupn\u00e9 symboly <tt> A<\/tt> a <tt> B <\/tt> pro typ mapy. <tt> A<\/tt> a <tt> B<\/tt> jsou supertypy <tt> X<\/tt> a <tt> Y<\/tt> , proto\u017ee <tt> X<\/tt> a <tt> Y<\/tt> \u00a0 jsou prohl\u00e1\u0161eny s <tt> A<\/tt> a <tt> B<\/tt> jako jejich horn\u00ed hranice. (V\u0161imn\u011bte si, \u017ee parametry typu obecn\u00e9 metody <tt> X<\/tt> a <tt> Y<\/tt> nemaj\u00ed s t\u00edm nic spole\u010dn\u00e9ho <tt> P\u00e1r<\/tt> t\u0159\u00eddy <tt> X<\/tt> a <tt> Y<\/tt> parametry.\u00a0 Jm\u00e9na <tt> X<\/tt> a <tt> Y<\/tt> jsou znovu pou\u017eity pro generickou metodu, aby byly snadno rozpoznateln\u00e9 jako parametry typu p\u00e1ru. Pomoc\u00ed \u010dty\u0159 typov\u00fdch parametr\u016f m\u016f\u017eeme deklarovat p\u0159esn\u00fd n\u00e1vratov\u00fd typ podle pot\u0159eby: je to stejn\u00fd typ jako hodnotov\u00fd typ mapy.<\/p>\n<p>P\u0159\u00edklad (neopr\u00e1vn\u011bn\u00e9ho pou\u017eit\u00ed parametru typu ve statick\u00e9m kontextu generick\u00e9 t\u0159\u00eddy):<\/p>\n<blockquote><p><tt> t\u0159\u00edda SomeClass<b> <span style=\"color:#000099;\"> &lt;T&gt;<\/span> <\/b> {<\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> statick\u00fd inicializ\u00e1tor, statick\u00e9 pole, statick\u00e1 metoda<\/i><br \/>\n<tt> \u00a0 <b> statick\u00fd<\/b> {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 N\u011bkter\u00e9 t\u0159\u00eddy&lt;<b> <span style=\"color:#000099;\"> T<\/span> <\/b> Test &gt; = novinka SomeClass&lt;<b> <span style=\"color:#000099;\"> T<\/span> <\/b> &gt;(); <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 <b> statick\u00fd<\/b> <b> <span style=\"color:#000099;\"> T<\/span> <\/b> globalInfo;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 ve\u0159ejnost\u00a0 <b> statick\u00fd<\/b> <b> <span style=\"color:#000099;\"> T <\/span> <\/b> getGlobalInfo() {\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 vr\u00e1tit globalInfo;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> nestatick\u00fd inicializ\u00e1tor, nestatick\u00e9 pole, nestatick\u00e1 metoda<\/i><br \/>\n<tt> \u00a0 {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 N\u011bkter\u00e9 t\u0159\u00eddy&lt;<b> <span style=\"color:#000099;\"> T<\/span> <\/b> Test &gt; = novinka SomeClass&lt;<b> <span style=\"color:#000099;\"> T<\/span> <\/b> &gt;();<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#000099;\"> T<\/span> <\/b> localInfo;<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejnost\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getLocalInfo() {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 vr\u00e1tit localInfo;<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> statick\u00e9 vno\u0159en\u00e9 typy<\/i><br \/>\n<tt> \u00a0 ve\u0159ejnost <b> statick\u00fd<\/b> <b> t\u0159\u00edda<\/b> Selh\u00e1n\u00ed prodlu\u017euje v\u00fdjimku {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 soukrom\u00e9 fin\u00e1le <b> <span style=\"color:#000099;\"> T<\/span> <\/b> info;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ve\u0159ejn\u00e9 selh\u00e1n\u00ed (<b> <span style=\"color:#000099;\"> T<\/span> <\/b> t) { info = t; }\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getInfo() { return info; }\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 <b> rozhran\u00ed<\/b> Kop\u00edrovateln\u00e9 {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 <b> <span style=\"color:#000099;\"> T<\/span> <\/b> kopie();\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 <b> enum<\/b> st\u00e1t {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 PLATN\u00dd, NEPLATN\u00dd;<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 soukrom\u00e9 <b> <span style=\"color:#000099;\"> T<\/span> <\/b> info; \/\/ chyba<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 public void setInfo(<b> <span style=\"color:#000099;\"> T<\/span> <\/b> t) { info = t; } <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getInfo() { return info; }\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> nestatick\u00e9 vno\u0159en\u00e9 typy<\/i><br \/>\n<tt> \u00a0 ve\u0159ejnost <b> t\u0159\u00edda<\/b> Accessor {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getInfo() { return localInfo; }<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>P\u0159\u00edklad ukazuje, \u017ee parametr typu nelze pou\u017e\u00edt ve statick\u00e9m kontextu generick\u00e9 t\u0159\u00eddy.\u00a0 Tak\u00e9 ukazuje, \u017ee vno\u0159en\u00e1 rozhran\u00ed a typy v\u00fd\u010dtu jsou pova\u017eov\u00e1ny za statick\u00e9 \u010dleny t\u0159\u00eddy.\u00a0 Pouze vnit\u0159n\u00ed t\u0159\u00eddy, tedy nestatick\u00e9 vno\u0159en\u00e9 t\u0159\u00eddy, mohou pou\u017e\u00edvat parametr typu obklopuj\u00edc\u00ed generick\u00e9 t\u0159\u00eddy.<\/p>\n<p>Rozsah parametru typu rozhran\u00ed je cel\u00e1 definice rozhran\u00ed s v\u00fdjimkou pol\u00ed nebo vno\u0159en\u00fdch typ\u016f.\u00a0 Je to proto, \u017ee pole a vno\u0159en\u00e9 typy definovan\u00e9 v rozhran\u00ed jsou implicitn\u011b statick\u00e9.<\/p>\n<p>P\u0159\u00edklad (neopr\u00e1vn\u011bn\u00e9ho pou\u017eit\u00ed parametru typu v generick\u00e9m rozhran\u00ed):<\/p>\n<blockquote><p><tt> rozhran\u00ed SomeInterface<b> <span style=\"color:#000099;\"> &lt;T&gt;<\/span> <\/b> {<\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> pole<\/i><br \/>\n<tt> \u00a0 N\u011bkter\u00e9 t\u0159\u00eddy&lt;<b> <span style=\"color:#000099;\"> T<\/span> <\/b> Hodnota &gt; = nov\u00e1 SomeClass&lt;<b> <span style=\"color:#000099;\"> T<\/span> <\/b> &gt;();\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> vno\u0159en\u00fd typ<\/i><br \/>\n<tt> \u00a0 <b> t\u0159\u00edda<\/b> Accessor {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T <\/span> <\/b> getInfo() {\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <b> <span style=\"color:#660000;\"> \/\/ chyba<\/span> <\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 return value.getGlobalInfo();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 \/\/ <\/tt> <i> metody<\/i><br \/>\n<tt> \u00a0 <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getValue();<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>P\u0159\u00edklad ukazuje, \u017ee pole rozhran\u00ed jsou implicitn\u011b statick\u00e1, tak\u017ee parametr typu nelze pou\u017e\u00edt nikde v deklaraci pole obecn\u00e9ho rozhran\u00ed.\u00a0 Podobn\u011b je vno\u0159en\u00e1 t\u0159\u00edda pova\u017eov\u00e1na za statickou vno\u0159enou t\u0159\u00eddu, nikoli za vnit\u0159n\u00ed t\u0159\u00eddu, a z tohoto d\u016fvodu je pou\u017eit\u00ed parametru type kdekoli ve vno\u0159en\u00e9 t\u0159\u00edd\u011b nez\u00e1konn\u00e9.<\/p>\n<p><b> <i> \u0158e\u0161en\u00ed pro vno\u0159en\u00e9 statick\u00e9 t\u0159\u00eddy a rozhran\u00ed:<\/i> <\/b><\/p>\n<p>V p\u0159\u00edpad\u011b statick\u00fdch vno\u0159en\u00fdch t\u0159\u00edd a rozhran\u00ed to nen\u00ed velk\u00e1 pohroma.\u00a0 Jako \u0159e\u0161en\u00ed m\u016f\u017eeme vygenerovat samotnou statickou t\u0159\u00eddu nebo rozhran\u00ed.<\/p>\n<p>P\u0159\u00edklad (\u0159e\u0161en\u00ed \u2013 vygenerujte vno\u0159en\u00fd statick\u00fd typ):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Wrapper<b> <span style=\"color:#000099;\"> &lt;T&gt;<\/span> <\/b> {<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 fin\u00e1le <b> <span style=\"color:#000099;\"> T<\/span> <\/b> theObject;<\/tt><\/p><\/blockquote>\n<blockquote><p><tt> \u00a0 ve\u0159ejn\u00fd obal (<b> <span style=\"color:#000099;\"> T<\/span> <\/b> t) { theObject = t; }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getWrapper() { return theObject; }<\/tt><tt> \u00a0 ve\u0159ejn\u00fd Nem\u011bnn\u00fd<b> &lt;T&gt;<\/b> makeImmutable() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 vr\u00e1tit nov\u00fd Immutable<b> &lt;T&gt;<\/b> (Objekt);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e9 prom\u011bnliv\u00e9<b> &lt;T&gt;<\/b> makeMutable() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 vr\u00e1tit nov\u00fd Mutable<b> &lt;T&gt;<\/b> (Objekt);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 private static &lt;A&gt; A makeClone(A theObject) { ... }<\/tt><\/p>\n<p><tt> \u00a0 public static final class Immutable<b> &lt;A&gt;<\/b> { <b> \/\/ je nyn\u00ed generick\u00e1 t\u0159\u00edda<\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 soukrom\u00e9 fin\u00e1le <b> A<\/b> theObject;<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ve\u0159ejn\u00fd nem\u011bnn\u00fd(<b> A<\/b> arg) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 theObject = makeClone(arg);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ve\u0159ejnost <b> A<\/b> getWrappedItem() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return makeClone(theObject);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e1 statick\u00e1 t\u0159\u00edda Mutable<b> &lt;A&gt;<\/b> {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ... podobn\u00e9 ...<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Pro vno\u0159en\u00e9 typy v\u00fd\u010dtu neexistuje \u017e\u00e1dn\u00e9 takov\u00e9 \u0159e\u0161en\u00ed, proto\u017ee nemohou b\u00fdt obecn\u00e9.<\/p>\n<p><b> <i> \u0158e\u0161en\u00ed pro vno\u0159en\u00e9 statick\u00e9 t\u0159\u00eddy:<\/i> <\/b><\/p>\n<p>Pokud je vno\u0159en\u00fdm statick\u00fdm typem t\u0159\u00edda, alternativn\u00edm \u0159e\u0161en\u00edm by bylo p\u0159eveden\u00ed statick\u00e9 t\u0159\u00eddy na nestatickou vnit\u0159n\u00ed t\u0159\u00eddu.<\/p>\n<p>P\u0159\u00edklad (\u0159e\u0161en\u00ed \u2013 pou\u017eijte vnit\u0159n\u00ed t\u0159\u00eddu):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Wrapper<b> <span style=\"color:#000099;\"> &lt;T&gt;<\/span> <\/b> {<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 fin\u00e1le <b> <span style=\"color:#000099;\"> T<\/span> <\/b> theObject;<\/tt><\/p><\/blockquote>\n<blockquote><p><tt> \u00a0 ve\u0159ejn\u00fd obal (<b> <span style=\"color:#000099;\"> T<\/span> <\/b> t) { theObject = t; }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getWrapper() { return theObject; }<\/tt><tt> \u00a0 public Prom\u011bnliv\u00e9 makeMutable() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 n\u00e1vrat <b> tento.<\/b> new Mutable(theObject);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 public Immutable makeImmutable() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 n\u00e1vrat <b> tento.<\/b> new Immutable(theObject);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 private static &lt;A&gt; A makeClone(A theObject) { ... }<\/tt><\/p>\n<p><tt> \u00a0 public final class Immutable {\u00a0 <b> \/\/ ji\u017e nen\u00ed statick\u00e1 t\u0159\u00edda<\/b> <\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 soukrom\u00e9 fin\u00e1le <b> T<\/b> theObject;<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0\u00a0\u00a0 ve\u0159ejn\u00fd nem\u011bnn\u00fd(<b> T<\/b> arg) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 theObject = makeClone(arg);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 ve\u0159ejnost <b> T<\/b> getWrappedItem() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return makeClone(theObject);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00e1 t\u0159\u00edda Prom\u011bnliv\u00fd\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ... podobn\u00e9 ...<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Toto z\u00e1stupn\u00e9 \u0159e\u0161en\u00ed je spojeno s ur\u010ditou re\u017ei\u00ed, proto\u017ee v\u0161echny vnit\u0159n\u00ed t\u0159\u00eddy maj\u00ed skryt\u00fd odkaz na instanci vn\u011bj\u0161\u00edho typu, kterou v tomto p\u0159\u00edkladu nepot\u0159ebuj\u00ed ani nevyu\u017e\u00edvaj\u00ed; skryt\u00e1 reference je jen zavazadlo.\u00a0 Vnit\u0159n\u00ed t\u0159\u00eddy jsou \u010dasto kombinov\u00e1ny s rozhran\u00edmi, aby vnit\u0159n\u00ed t\u0159\u00edda z\u016fstala soukrom\u00fdm detailem implementace obklopuj\u00edc\u00ed t\u0159\u00eddy.\u00a0 Tot\u00e9\u017e m\u016f\u017eeme ud\u011blat zde.<\/p>\n<p>P\u0159\u00edklad (up\u0159esn\u011bno p\u0159edchoz\u00ed \u0159e\u0161en\u00ed):<\/p>\n<blockquote><p><tt> t\u0159\u00edda Wrapper<b> <span style=\"color:#000099;\"> &lt;T&gt;<\/span> <\/b> {<\/tt><br \/>\n<tt> \u00a0 soukrom\u00e9 fin\u00e1le <b> <span style=\"color:#000099;\"> T<\/span> <\/b> theObject;<\/tt><\/p><\/blockquote>\n<blockquote><p><tt> \u00a0 ve\u0159ejn\u00fd obal (<b> <span style=\"color:#000099;\"> T<\/span> <\/b> t) { theObject = t; }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejnost <b> <span style=\"color:#000099;\"> T<\/span> <\/b> getWrapper() { return theObject; }<\/tt><tt> \u00a0 ve\u0159ejn\u00e9 prom\u011bnliv\u00e9<b> &lt;T&gt;<\/b> makeMutable() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 return this.new Mutable(theObject);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 ve\u0159ejn\u00fd Nem\u011bnn\u00fd<b> &lt;T&gt;<\/b> makeImmutable() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 return this.new Immutable(theObject);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 private static &lt;A&gt; A makeClone(A theObject) { ... }<\/tt><\/p>\n<p><tt> \u00a0 <b> ve\u0159ejn\u00e9 rozhran\u00ed <\/b> Immutable&lt;S&gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 S getWrappedItem();<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 <b> ve\u0159ejn\u00e9 rozhran\u00ed <\/b> Mutable&lt;S&gt; {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 S getWrappedItem();<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 void setWrappedItem(S arg);<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 <b> soukrom\u00e9<\/b> z\u00e1v\u011bre\u010dn\u00e1 t\u0159\u00edda ImmutableImplementation <b> implementuje Immutable&lt;T&gt;<\/b> {\u00a0<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0\u00a0\u00a0 soukrom\u00e9 fin\u00e1le T theObject;<\/tt><\/p>\n<p><tt> \u00a0\u00a0\u00a0\u00a0\u00a0 public ImmutableImplementation(T arg) {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 theObject = makeClone(arg);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 public T getWrappedItem() {<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return makeClone(theObject);<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0 }<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> \u00a0 <b> soukrom\u00e9<\/b> t\u0159\u00edda MutableImplementation <b> implementuje Mutable&lt;T&gt;<\/b> {\u00a0<\/tt><br \/>\n<tt> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ... podobn\u00e9 ...<\/tt><br \/>\n<tt> \u00a0 }<\/tt><br \/>\n<tt> }<\/tt><\/p><\/blockquote>\n<p>Jak vid\u00edte, vno\u0159en\u00e1 ve\u0159ejn\u00e1 rozhran\u00ed mus\u00ed b\u00fdt generick\u00e1, zat\u00edmco vnit\u0159n\u00ed soukrom\u00e9 t\u0159\u00eddy mohou pou\u017e\u00edvat parametr typu obklopuj\u00edc\u00ed t\u0159\u00eddy.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<table width=\"100%\" cellpadding=\"10\">\n<tbody>\n<tr valign=\"TOP\">\n<td colspan=\"2\" width=\"68%\"><b>\u00a0<\/b><\/td>\n<\/tr>\n<tr>\n<td colspan=\"2\"><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Dal\u0161\u00ed informace naleznete v tomto FAQ: <a href=\"http:\/\/www.angelikalanger.com\/GenericsFAQ\/JavaGenericsFAQ.html#SECTION1\" rel=\"nofollow\">http:\/\/www.angelikalanger.com\/GenericsFAQ\/JavaGenericsFAQ.html#SECTION1<\/a> Zde ve kratce n\u011bkter\u00e9 d\u016fle\u017eit\u00e9 org\u00e1ny z tohoto FAQ. P\u0159\u00edklad (obecn\u00e9ho typu): t\u0159\u00edda Pair&lt;X,Y&gt; {\u00a0 \u00a0 private X first; \u00a0 soukrom\u00e1 Y secunda; \u00a0 public Pair(X a1, Y a2) { \u00a0\u00a0\u00a0 first = a1; \u00a0\u00a0\u00a0 druh\u00fd = a2; \u00a0 } \u00a0 public X getFirst() { return first; } [&hellip;]<\/p>\n","protected":false},"author":65283547,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_coblocks_attr":"","_coblocks_dimensions":"","_coblocks_responsive_height":"","_coblocks_accordion_ie_support":"","_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_wpcom_ai_launchpad_first_post":false,"_jetpack_hide_featured_image":false,"_jetpack_featured_image_duplicate_dismissed":0,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"Generics in short form","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[1017],"tags":[18369,2549795,6280762],"class_list":["post-31","post","type-post","status-publish","format-standard","hentry","category-java","tag-generika","tag-java","tag-java-generika"],"jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p4CoHV-v","jetpack-related-posts":[],"jetpack_likes_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/posts\/31","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/users\/65283547"}],"replies":[{"embeddable":true,"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/comments?post=31"}],"version-history":[{"count":8,"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/posts\/31\/revisions"}],"predecessor-version":[{"id":42,"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/posts\/31\/revisions\/42"}],"wp:attachment":[{"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/media?parent=31"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/categories?post=31"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/vkrastev1blog.com\/wp-json\/wp\/v2\/tags?post=31"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}