jro_apps/redmine Commit - r6349:aa35ef4be8b3

9

afinish = a.length-1

9

afinish = a.length-1

10

bfinish = b.length-1

10

bfinish = b.length-1

11

mvector = []

11

mvector = []

12

13

# First we prune off any common elements at the beginning

13

# First we prune off any common elements at the beginning

14

while (astart <= afinish && bstart <= afinish && a[astart] == b[bstart])

14

while (astart <= afinish && bstart <= afinish && a[astart] == b[bstart])

15

mvector[astart] = bstart

15

mvector[astart] = bstart

16

astart += 1

16

astart += 1

17

bstart += 1

17

bstart += 1

18

end

18

end

19

20

# now the end

20

# now the end

21

while (astart <= afinish && bstart <= bfinish && a[afinish] == b[bfinish])

21

while (astart <= afinish && bstart <= bfinish && a[afinish] == b[bfinish])

22

mvector[afinish] = bfinish

22

mvector[afinish] = bfinish

27

bmatches = b.reverse_hash(bstart..bfinish)

27

bmatches = b.reverse_hash(bstart..bfinish)

28

thresh = []

28

thresh = []

29

links = []

29

links = []

30

31

(astart..afinish).each { |aindex|

31

(astart..afinish).each { |aindex|

32

aelem = a[aindex]

32

aelem = a[aindex]

33

next unless bmatches.has_key? aelem

33

next unless bmatches.has_key? aelem

118

@difftype = diffs_or_a.class

118

@difftype = diffs_or_a.class

119

end

119

end

120

end

120

end

121

122

def match(ai, bi)

122

def match(ai, bi)

123

@diffs.push @curdiffs unless @curdiffs.empty?

123

@diffs.push @curdiffs unless @curdiffs.empty?

124

@curdiffs = []

124

@curdiffs = []

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

                   afinish = a.length-1
                   bfinish = b.length-1
                   mvector = []
                   # First we prune off any common elements at the beginning
                   while (astart <= afinish && bstart <= afinish && a[astart] == b[bstart])
                     mvector[astart] = bstart
                     astart += 1
                     bstart += 1
                   end
                   # now the end
                   while (astart <= afinish && bstart <= bfinish && a[afinish] == b[bfinish])
                     mvector[afinish] = bfinish
                   bmatches = b.reverse_hash(bstart..bfinish)
                   thresh = []
                   links = []
                   (astart..afinish).each { |aindex|
                     aelem = a[aindex]
                     next unless bmatches.has_key? aelem
                     @difftype = diffs_or_a.class
                   end
                 end
                 def match(ai, bi)
                   @diffs.push @curdiffs unless @curdiffs.empty?
                   @curdiffs = []