void setBeanShellReplace(boolean beanshell) { if(beanshell == SearchAndReplace.beanshell) return; SearchAndReplace.beanshell = beanshell; EditBus.send(new SearchSettingsChanged(null)); } //}}} //{{{ getBeanShellReplace() method /** * Returns the state of the BeanShell replace flag. * @return True if the replace string is a BeanShell expression * @since jEdit 3.2pre2 */ public static boolean getBeanShellReplace() { return beanshell; } //}}} //{{{ setAutoWrap() method /** * Sets the state of the auto wrap around flag. * @param wrap If true, the 'continue search from start' dialog * will not be displayed * @since jEdit 3.2pre2 */ public static void setAutoWrapAround(boolean wrap) { if(wrap == SearchAndReplace.wrap) return; SearchAndReplace.wrap = wrap; EditBus.send(new SearchSettingsChanged(null)); }
void setReverseSearch(boolean reverse) { if(reverse == SearchAndReplace.reverse) return; SearchAndReplace.reverse = reverse; EditBus.send(new SearchSettingsChanged(null)); } //}}} //{{{ getReverseSearch() method /** * Returns the state of the reverse search flag. * @return True if searches should go backwards, * false otherwise */ public static boolean getReverseSearch() { return reverse; } //}}} //{{{ setBeanShellReplace() method /** * Sets the state of the BeanShell replace flag. * @param beanshell True if the replace string is a BeanShell expression * @since jEdit 3.2pre2 */ public static void setBeanShellReplace(boolean beanshell) { if(beanshell == SearchAndReplace.beanshell) return; SearchAndReplace.beanshell = beanshell; EditBus.send(new SearchSettingsChanged(null)); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/SearchAndReplace.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/SearchAndReplace.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void setBeanShellReplace(boolean beanshell)
1
void setReverseSearch(boolean reverse)
2
	{
2
	{
3
		if(beanshell == SearchAndReplace.beanshell)
3
		if(reverse == SearchAndReplace.reverse)
4
			return;
4
			return;
5
		SearchAndReplace.beanshell = beanshell;
5
		SearchAndReplace.reverse = reverse;
6
		EditBus.send(new SearchSettingsChanged(null));
6
		EditBus.send(new SearchSettingsChanged(null));
7
	} //}}}
7
	} //}}}
8
	//{{{ getBeanShellReplace() method
8
	//{{{ getReverseSearch() method
9
	/**
9
	/**
10
	 * Returns the state of the BeanShell replace flag.
10
	 * Returns the state of the reverse search flag.
11
	 * @return True if the replace string is a BeanShell expression
11
	 * @return True if 
12
	 * @since jEdit 3.2pre2
12
searches should go backwards,
13
	 * false otherwise
13
	 */
14
	 */
14
	public static boolean getBeanShellReplace()
15
	public static boolean getReverseSearch()
15
	{
16
	{
16
		return beanshell;
17
		return reverse;
17
	} //}}}
18
	} //}}}
18
	//{{{ setAutoWrap() method
19
	//{{{ setBeanShellReplace() method
19
	/**
20
	/**
20
	 * Sets the state of the auto wrap around flag.
21
	 * Sets the state of the BeanShell replace flag.
21
	 * @param wrap If true, the 'continue search from start' dialog
22
	 * @param 
22
	 * will not be displayed
23
beanshell True if the replace string is a BeanShell expression
23
	 * @since jEdit 3.2pre2
24
	 * @since jEdit 3.2pre2
24
	 */
25
	 */
25
	public static void setAutoWrapAround(boolean wrap)
26
	public static void setBeanShellReplace(boolean beanshell)
26
	{
27
	{
27
		if(wrap == SearchAndReplace.wrap)
28
		if(beanshell == SearchAndReplace.beanshell)
28
			return;
29
			return;
29
		SearchAndReplace.wrap = wrap;
30
		SearchAndReplace.beanshell = beanshell;
30
		EditBus.send(new SearchSettingsChanged(null));
31
		EditBus.send(new SearchSettingsChanged(null));
31
	}
32
	}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0