11761-1-2

boolean isNCNameStart(int c) { return c < 0x10000 && (CHARS[c] & MASK_NCNAME_START) != 0; } // isNCNameStart(int):boolean /** * Returns true if the specified character is a valid NCName * character as defined by production [5] in Namespaces in XML * recommendation. * * @param c The character to check. */ public static boolean isNCName(int c) { return c < 0x10000 && (CHARS[c] & MASK_NCNAME) != 0; } // isNCName(int):boolean /** * Returns true if the specified character is a valid Pubid * character as defined by production [13] in the XML 1.0 * specification. * * @param c The character to check. */ public static boolean isPubid(int c) { return c < 0x10000 && (CHARS[c] & MASK_PUBID) != 0; }
boolean isNameStart(int c) { return c < 0x10000 && (CHARS[c] & MASK_NAME_START) != 0; } // isNameStart(int):boolean /** * Returns true if the specified character is a valid name * character as defined by production [4] in the XML 1.0 * specification. * * @param c The character to check. */ public static boolean isName(int c) { return c < 0x10000 && (CHARS[c] & MASK_NAME) != 0; } // isName(int):boolean /** * Returns true if the specified character is a valid NCName start * character as defined by production [4] in Namespaces in XML * recommendation. * * @param c The character to check. */ public static boolean isNCNameStart(int c) { return c < 0x10000 && (CHARS[c] & MASK_NCNAME_START) != 0; }

Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/DataValue.java |  | File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/DataValue.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    boolean isNCNameStart(int c) {↵

1

    boolean isNameStart(int c) {↵

2

             return c < 0x10000 && (CHARS[c] & MASK_NCNAME_START) != 0;↵

2

             return c < 0x10000 && (CHARS[c] & MASK_NAME_START) != 0;↵

3

         } // isNCNameStart(int):boolean↵

3

         } // isNameStart(int):boolean↵

4

         /**↵

4

         /**↵

5

          * Returns true if the specified character is a valid NCName↵

5

          * Returns true if the specified character is a valid name↵

6

          * character as defined by production [5] in Namespaces in XML↵

6

          * character as defined by production [4] in ↵

7

          * recommend↵

7

    the XML 1.0↵

8

    ation.↵

8

          * specification.↵

9

          *↵

9

          *↵

10

          * @param c The character to check.↵

10

          * @param c The character to check.↵

11

          */↵

11

          */↵

12

         public static boolean isNCName(int c) {↵

12

         public static boolean isName(int c) {↵

13

             return c < 0x10000 && (CHARS[c] & MASK_NCNAME) != 0;↵

13

             return c < 0x10000 && (CHARS[c] & MASK_NAME) != 0;↵

14

         } // isNCName(int):boolean↵

14

         } // isName(int):boolean↵

15

         /**↵

15

         /**↵

16

          * Returns true if the specified character is a valid Pubid↵

16

          * Returns true if the specified character is a valid NCName start↵

17

          * character as defined by production [13] in the XML 1.0↵

17

          * character as defined by production [4] in ↵

18

          * specific↵

18

    Namespaces in XML↵

19

    ation.↵

19

          * recommendation.↵

20

          *↵

20

          *↵

21

          * @param c The character to check.↵

21

          * @param c The character to check.↵

22

          */↵

22

          */↵

23

         public static boolean isPubid(int c) {↵

23

         public static boolean isNCNameStart(int c) {↵

24

             return c < 0x10000 && (CHARS[c] & MASK_PUBID) != 0;↵

24

             return c < 0x10000 && (CHARS[c] & MASK_NCNAME_START) != 0;↵

25

         }

25

         }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 0
Number of refactorable cases | 0
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0
Clones location |
Number of node comparisons | 0