Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Maven | Exclude non-exported packages from Javadocs #988

Merged
merged 1 commit into from
Mar 13, 2019
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions pom.xml
Original file line number Diff line number Diff line change
Expand Up @@ -407,6 +407,7 @@
<version>3.0.0</version>
<configuration>
<failOnError>true</failOnError>
<excludePackageNames>mssql.googlecode.*</excludePackageNames>
</configuration>
<executions>
<execution>
Expand Down
27 changes: 27 additions & 0 deletions src/main/java/mssql/googlecode/concurrentlinkedhashmap/Linked.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
package mssql.googlecode.concurrentlinkedhashmap;

import java.util.Deque;

/**
* An element that is linked on the {@link Deque}.
*/
interface Linked<T extends Linked<T>> {

/**
* Retrieves the previous element or <tt>null</tt> if either the element is
* unlinked or the first element on the deque.
*/
T getPrevious();

/** Sets the previous element or <tt>null</tt> if there is no link. */
void setPrevious(T prev);

/**
* Retrieves the next element or <tt>null</tt> if either the element is
* unlinked or the last element on the deque.
*/
T getNext();

/** Sets the next element or <tt>null</tt> if there is no link. */
void setNext(T next);
}
Original file line number Diff line number Diff line change
Expand Up @@ -434,27 +434,3 @@ public void remove() {
abstract E computeNext();
}
}

/**
* An element that is linked on the {@link Deque}.
*/
interface Linked<T extends Linked<T>> {

/**
* Retrieves the previous element or <tt>null</tt> if either the element is
* unlinked or the first element on the deque.
*/
T getPrevious();

/** Sets the previous element or <tt>null</tt> if there is no link. */
void setPrevious(T prev);

/**
* Retrieves the next element or <tt>null</tt> if either the element is
* unlinked or the last element on the deque.
*/
T getNext();

/** Sets the next element or <tt>null</tt> if there is no link. */
void setNext(T next);
}