aboutsummaryrefslogtreecommitdiff
path: root/website/features/Data.html
diff options
context:
space:
mode:
authorReinier Zwitserloot <reinier@tipit.to>2009-07-17 21:25:36 +0200
committerReinier Zwitserloot <reinier@tipit.to>2009-07-17 21:25:36 +0200
commit642dad3f0c13a8a900aac21fe26e1eb672fbb5a6 (patch)
tree8b7c7577ad569d430ffc0ce278abd19248e6c774 /website/features/Data.html
parent3bfe8d21610b7d92aa932685bc40abf011295328 (diff)
downloadlombok-642dad3f0c13a8a900aac21fe26e1eb672fbb5a6.tar.gz
lombok-642dad3f0c13a8a900aac21fe26e1eb672fbb5a6.tar.bz2
lombok-642dad3f0c13a8a900aac21fe26e1eb672fbb5a6.zip
Very minor typos in Data/GetterSetter, added an index page for the features overview, and increased transparancy on the pepper background.
Diffstat (limited to 'website/features/Data.html')
-rw-r--r--website/features/Data.html29
1 files changed, 16 insertions, 13 deletions
diff --git a/website/features/Data.html b/website/features/Data.html
index 3a9697cc..23f9cea8 100644
--- a/website/features/Data.html
+++ b/website/features/Data.html
@@ -41,6 +41,20 @@
instance. This way, javac will infer the variable name. Thus, by declaring like so: <code>@Data(staticConstructor="of") class Foo&lt;T&gt; { private T x;}</code>
you can create new instances of <code>Foo</code> by writing: <code>Foo.of(5);</code> instead of having to write: <code>new Foo&lt;Integer&gt;(5);</code>.
</p>
+ </div>
+ <div class="snippets">
+ <div class="pre">
+ <h3>With Lombok</h3>
+ <div class="snippet">@HTML_PRE@</div>
+ </div>
+ <div class="sep"></div>
+ <div class="post">
+ <h3>Vanilla Java</h3>
+ <div class="snippet">@HTML_POST@</div>
+ </div>
+ </div>
+ <div style="clear: left;"></div>
+ <div class="overview">
<h3>Small print</h3><div class="smallprint">
<p>
Arrays are 'deep' compared/printed/hashCoded, which means that arrays that contain themselves will result in <code>StackOverflowError</code>s. However,
@@ -49,7 +63,7 @@
You may safely presume that the hashCode implementation used will not change between versions of lombok, however this guarantee is not set in stone;
if there's a significant performance improvement to be gained from using an alternate hash algorithm, that will be substituted in a future version.
</p><p>
- For a general idea of how lombok generated the <code>equals</code>, <code>hashCode</code>, and <code>toString</code> methods, check the example below.
+ For a general idea of how lombok generated the <code>equals</code>, <code>hashCode</code>, and <code>toString</code> methods, check the example after.
</p><p>
For the purposes of equality, 2 <code>NaN</code> (not a number) values for floats and doubles are considered equal, eventhough 'NaN == NaN' would
return false. This is analogous to <code>java.lang.Double</code>'s equals method, and is in fact required to ensure that comparing an object
@@ -57,19 +71,8 @@
</p>
</div>
</div>
- <div class="snippets">
- <div class="pre">
- <h3>With Lombok</h3>
- <div class="snippet">@HTML_PRE@</div>
- </div>
- <div class="sep"></div>
- <div class="post">
- <h3>Vanilla Java</h3>
- <div class="snippet">@HTML_POST@</div>
- </div>
- </div>
<footer>
- <a href="features.html">Back to features</a> | <a href="GetterSetter.html">Previous feature (@Getter / @Setter)</a> | <a href="Cleanup.html">Next feature (@Cleanup)</a><br />
+ <a href="index.html">Back to features</a> | <a href="GetterSetter.html">Previous feature (@Getter / @Setter)</a> | <a href="Cleanup.html">Next feature (@Cleanup)</a><br />
<span class="copyright">Copyright &copy; 2009 Reinier Zwitserloot and Roel Spilker, licensed under the <a href="http://www.opensource.org/licenses/mit-license.php">MIT licence</a>.</span>
</footer>
<div style="clear: both;"></div>