blob: 59ca905ff6dc89b9597f7aaf9b5c30554a4bb457 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
#
# Copyright (C) 2013-14 Stephane Galland <galland@arakhne.org>
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; see the file COPYING. If not, write to
# the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
# Boston, MA 02111-1307, USA.
#---------------------------------
# IMPORTS
#---------------------------------
# Import standard python libs
from gi.repository import Gtk
#---------------------------------
# GLOBAL FUNCTIONS
#---------------------------------
# Compute and replies the insertion index in
# a Gtk list store, according to a dichotomic
# insertion heuristic.
# This method uses the natural order of the data.
# @param list_store - the Gtk list store to parse.
# @param column - index of the column to consider in the given list store.
# @param data - data to insert.
def get_insert_index_dichotomic(list_store, column, data):
f = 0
l = list_store.iter_n_children(None) - 1
while l >= f:
c = (f+l) / 2
path = Gtk.TreePath(c)
d = list_store[path][column]
cmpt = (data > d) - (data < d)
if cmpt == 0:
return -1
elif cmpt < 0:
l = c-1
else:
f = c+1
return f
|