RestDiffHunk

extends RestMapEntity

java.lang.Object
↳	java.util.AbstractMap<K, V>
	↳	java.util.HashMap<K, V>
		↳	java.util.LinkedHashMap<K, V>
			↳	com.atlassian.bitbucket.rest.RestMapEntity
				↳	com.atlassian.bitbucket.rest.content.RestDiffHunk

Summary

Fields
public static final RestDiffHunk	HUNK_EXAMPLE
public static final RestDiffHunk	HUNK_EXAMPLE_COMMENTED
public static final Function<DiffHunk, RestDiffHunk>	REST_TRANSFORM

Public Constructors
	RestDiffHunk()
	RestDiffHunk(DiffHunk hunk)

Inherited Methods

From class com.atlassian.bitbucket.rest.RestMapEntity

boolean	getBoolProperty(String arg0)
boolean	getBoolProperty(String arg0, boolean arg1)
<T extends Enum<T>> T	getEnumProperty(String arg0, Class<T> arg1, T arg2)
<T extends Enum<T>> T	getEnumProperty(String arg0, Class<T> arg1)
int	getIntProperty(String arg0)
long	getLongProperty(String arg0)
RestPath	getPathProperty(String arg0)
String	getStringProperty(String arg0)
void	putIfNotEmpty(String arg0, Map<?, ?> arg1)
void	putIfNotEmpty(String arg0, Iterable<?> arg1)
void	putIfNotEmpty(String arg0, Collection<?> arg1)
void	putIfNotNull(String arg0, Object arg1)
static <F, T> Set<T>	transform(Set<F> arg0, Function<F, T> arg1)
static <F, T> List<T>	transform(Iterable<F> arg0, Function<F, T> arg1)

void	clear()
Object	clone()
V	compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
V	computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1)
V	computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
boolean	containsKey(Object arg0)
boolean	containsValue(Object arg0)
Set<Entry<K, V>>	entrySet()
void	forEach(BiConsumer<? super K, ? super V> arg0)
V	get(Object arg0)
V	getOrDefault(Object arg0, V arg1)
boolean	isEmpty()
Set<K>	keySet()
V	merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2)
V	put(K arg0, V arg1)
void	putAll(Map<? extends K, ? extends V> arg0)
V	putIfAbsent(K arg0, V arg1)
boolean	remove(Object arg0, Object arg1)
V	remove(Object arg0)
boolean	replace(K arg0, V arg1, V arg2)
V	replace(K arg0, V arg1)
void	replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
int	size()
Collection<V>	values()

void	clear()
Object	clone()
boolean	containsKey(Object arg0)
boolean	containsValue(Object arg0)
abstract Set<Entry<K, V>>	entrySet()
boolean	equals(Object arg0)
V	get(Object arg0)
int	hashCode()
boolean	isEmpty()
Set<K>	keySet()
V	put(K arg0, V arg1)
void	putAll(Map<? extends K, ? extends V> arg0)
V	remove(Object arg0)
int	size()
String	toString()
Collection<V>	values()

From class java.lang.Object

From interface java.util.Map

void	clear()
V	compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
V	computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1)
V	computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
boolean	containsKey(Object arg0)
boolean	containsValue(Object arg0)
Set<Entry<K, V>>	entrySet()
boolean	equals(Object arg0)
void	forEach(BiConsumer<? super K, ? super V> arg0)
V	get(Object arg0)
V	getOrDefault(Object arg0, V arg1)
int	hashCode()
boolean	isEmpty()
Set<K>	keySet()
V	merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2)
V	put(K arg0, V arg1)
void	putAll(Map<? extends K, ? extends V> arg0)
V	putIfAbsent(K arg0, V arg1)
boolean	remove(Object arg0, Object arg1)
V	remove(Object arg0)
boolean	replace(K arg0, V arg1, V arg2)
V	replace(K arg0, V arg1)
void	replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
int	size()
Collection<V>	values()