Commit ⋅ snorkel-team/snorkel

Showing 2 of 5 files from the diff.

96.38% 100.00% ø

snorkel/labeling/model/label_model.py changed.

100.00% 100.00% ø

snorkel/labeling/model/graph_utils.py changed.

Other files ignored by Codecov

test/labeling/model/test_label_model.py has changed.

requirements.txt has changed.

setup.py has changed.

@@ -198,7 +198,7 @@

Loading

                    [
                        j
                        for j in self.c_tree.nodes()
                        if i in self.c_tree.node[j]["members"]
                        if i in self.c_tree.nodes[j]["members"]
                    ]
                ),
            )

@@ -212,7 +212,7 @@

Loading

            L_aug = np.copy(L_ind)
            for item in chain(self.c_tree.nodes(), self.c_tree.edges()):
                if isinstance(item, int):
                    C = self.c_tree.node[item]
                    C = self.c_tree.nodes[item]
                elif isinstance(item, tuple):
                    C = self.c_tree[item[0]][item[1]]
                else:

@@ -8,7 +8,7 @@

Loading

    Given a set of int nodes i and edges (i,j), returns a clique tree.

    Clique tree is an object G for which:
    - G.node[i]['members'] contains the set of original nodes in the ith
    - G.nodes[i]['members'] contains the set of original nodes in the ith
        maximal clique
    - G[i][j]['members'] contains the set of original nodes in the seperator
        set between maximal cliques i and j

@@ -46,7 +46,7 @@

Loading

        G2.add_node(i, members=c)
    for i in G2.nodes:
        for j in G2.nodes:
            S = G2.node[i]["members"].intersection(G2.node[j]["members"])
            S = G2.nodes[i]["members"].intersection(G2.nodes[j]["members"])
            w = len(S)
            if w > 0:
                G2.add_edge(i, j, weight=w, members=S)

Files		•	•	•	Coverage
snorkel	2,163	2,105	28	30	97.32%
Project Totals (68 files)	2,163	2,105	28	30	97.32%

TRAVIS_PYTHON_VERSION=3.6
TRAVIS_OS_NAME=linux
TOXENV=coverage,complex,spark,doctest,type,check

View CI Build Download

coverage:
  status:
    project:
      default:
        target: 95%
    patch:
      default:
        threshold: 2%

comment:
  layout: "header, diff, flags, files"

Read the docs

Interact now

The inner-most circle is the entire project, moving away from the center are folders then, finally, a single file. The size and color of each slice is representing the number of statements and the coverage, respectively.

SVG

The top section represents the entire project. Proceeding with folders and finally individual files. The size and color of each slice is representing the number of statements and the coverage, respectively.

SVG

Each block represents a single file in the project. The size and color of each block is represented by the number of statements and the coverage, respectively.

SVG

Learn more about the coverage sunburst graph

198	198		[
199	199		j
200	200		for j in self.c_tree.nodes()
201		-	if i in self.c_tree.node[j]["members"]
	201	+	if i in self.c_tree.nodes[j]["members"]
202	202		]
203	203		),
204	204		)

212	212		L_aug = np.copy(L_ind)
213	213		for item in chain(self.c_tree.nodes(), self.c_tree.edges()):
214	214		if isinstance(item, int):
215		-	C = self.c_tree.node[item]
	215	+	C = self.c_tree.nodes[item]
216	216		elif isinstance(item, tuple):
217	217		C = self.c_tree[item[0]][item[1]]
218	218		else:

46	46		G2.add_node(i, members=c)
47	47		for i in G2.nodes:
48	48		for j in G2.nodes:
49		-	S = G2.node[i]["members"].intersection(G2.node[j]["members"])
	49	+	S = G2.nodes[i]["members"].intersection(G2.nodes[j]["members"])
50	50		w = len(S)
51	51		if w > 0:
52	52		G2.add_edge(i, j, weight=w, members=S)

Navigation	Overlay
`t` Navigate files	`h` Toggle hits
`y` Change url to tip of branch	`m` Toggle misses
`b / v` Jump to prev/next hit line	`p` Toggle partial
`z / x` Jump to prev/next missed or partial line	`1..9` Toggle flags
`shift + o` Open current page in GitHub	`a` Toggle all on
`/ or ?` Show keyboard shortcuts dialog	`c` Toggle context lines or commits

8	8		Given a set of int nodes i and edges (i,j), returns a clique tree.
9	9
10	10		Clique tree is an object G for which:
11		-	- G.node[i]['members'] contains the set of original nodes in the ith
	11	+	- G.nodes[i]['members'] contains the set of original nodes in the ith
12	12		maximal clique
13	13		- G[i][j]['members'] contains the set of original nodes in the seperator
14	14		set between maximal cliques i and j

1	coverage:
2	status:
3	project:
4	default:
5	target: 95%
6	patch:
7	default:
8	threshold: 2%
9
10	comment:
11	layout: "header, diff, flags, files"

Updating our web app