-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
TestSiteIndexExamples.java
277 lines (254 loc) · 9.7 KB
/
TestSiteIndexExamples.java
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
/*
* Copyright (c) 2002-2016 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j 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 3 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. If not, see <http://www.gnu.org/licenses/>.
*/
package examples;
import org.junit.ClassRule;
import org.junit.Test;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Date;
import java.util.GregorianCalendar;
import java.util.HashSet;
import java.util.Set;
import org.neo4j.graphdb.Direction;
import org.neo4j.graphdb.GraphDatabaseService;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.RelationshipType;
import org.neo4j.graphdb.Transaction;
import org.neo4j.graphmatching.CommonValueMatchers;
import org.neo4j.graphmatching.PatternMatch;
import org.neo4j.graphmatching.PatternMatcher;
import org.neo4j.graphmatching.PatternNode;
import org.neo4j.graphmatching.PatternRelationship;
import org.neo4j.graphmatching.ValueMatcher;
import org.neo4j.helpers.collection.IterableWrapper;
import org.neo4j.test.rule.EmbeddedDatabaseRule;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertNotNull;
import static org.junit.Assert.assertTrue;
/**
* Example code for the index page of the component site.
*
* @author Tobias Ivarsson
*/
public class TestSiteIndexExamples
{
@ClassRule
public static EmbeddedDatabaseRule graphDb = new EmbeddedDatabaseRule();
// START SNIPPET: findNodesWithRelationshipsTo
public static Iterable<Node> findNodesWithRelationshipsTo(
RelationshipType type, Node... nodes )
{
if ( nodes == null || nodes.length == 0 )
{
throw new IllegalArgumentException( "No nodes supplied" );
}
final PatternNode requested = new PatternNode();
PatternNode anchor = null;
for ( Node node : nodes )
{
PatternNode pattern = new PatternNode();
pattern.setAssociation( node );
pattern.createRelationshipTo( requested, type );
if ( anchor == null )
{
anchor = pattern;
}
}
PatternMatcher matcher = PatternMatcher.getMatcher();
Iterable<PatternMatch> matches = matcher.match( anchor, nodes[0] );
return new IterableWrapper<Node, PatternMatch>( matches )
{
@Override
protected Node underlyingObjectToObject( PatternMatch match )
{
return match.getNodeFor( requested );
}
};
}
// END SNIPPET: findNodesWithRelationshipsTo
// START SNIPPET: findFriends
private static final long MILLSECONDS_PER_DAY = 1000 * 60 * 60 * 24;
enum FriendshipTypes implements RelationshipType
{
FRIEND,
LIVES_IN
}
/**
* Find all friends the specified person has known for more than the
* specified number of years.
*
* @param me the node to find the friends of.
* @param livesIn The name of the place where the friends should live.
* @param knownForYears the minimum age (in years) of the friendship.
* @return all nodes that live in the specified place that the specified
* nodes has known for the specified number of years.
*/
public Iterable<Node> findFriendsSinceSpecifiedTimeInSpecifiedPlace(
Node me, String livesIn,
final int knownForYears )
{
PatternNode root = new PatternNode(), place = new PatternNode();
final PatternNode friend = new PatternNode();
// Define the friendship
PatternRelationship friendship = root.createRelationshipTo( friend,
FriendshipTypes.FRIEND, Direction.BOTH );
// Define the age of the friendship
friendship.addPropertyConstraint( "since", new ValueMatcher()
{
long now = new Date().getTime();
@Override
public boolean matches( Object value )
{
if ( value instanceof Long )
{
long ageInDays = ( now - (Long) value )
/ MILLSECONDS_PER_DAY;
return ageInDays > ( knownForYears * 365 );
}
return false;
}
} );
// Define the place where the friend lives
friend.createRelationshipTo( place, FriendshipTypes.LIVES_IN );
place.addPropertyConstraint( "name",
CommonValueMatchers.exact( livesIn ) );
// Perform the matching
PatternMatcher matcher = PatternMatcher.getMatcher();
Iterable<PatternMatch> matches = matcher.match( root, me );
// Return the result
return new IterableWrapper<Node, PatternMatch>( matches )
{
@Override
protected Node underlyingObjectToObject( PatternMatch match )
{
return match.getNodeFor( friend );
}
};
}
// END SNIPPET: findFriends
@Test
public void verifyFunctionalityOfFindNodesWithRelationshipsTo()
throws Exception
{
final RelationshipType type = RelationshipType.withName( "RELATED" );
Node[] nodes = createGraph( new GraphDefinition<Node[]>()
{
@Override
public Node[] create( GraphDatabaseService graphdb )
{
Node[] nodes = new Node[5];
for ( int i = 0; i < nodes.length; i++ )
{
nodes[i] = graphdb.createNode();
}
for ( int i = 0; i < 3; i++ )
{
Node node = graphdb.createNode();
for ( int j = 0; j < nodes.length; j++ )
{
nodes[j].createRelationshipTo( node, type );
}
}
return nodes;
}
} );
try ( Transaction tx = graphDb.getGraphDatabaseAPI().beginTx() )
{
assertEquals( 3, count( findNodesWithRelationshipsTo( type, nodes ) ) );
tx.success();
}
}
@Test
public void verifyFunctionalityOfFindFriendsSinceSpecifiedTimeInSpecifiedPlace()
throws Exception
{
Node root = createGraph( new GraphDefinition<Node>()
{
@Override
public Node create( GraphDatabaseService graphdb )
{
Node me = graphdb.createNode();
Node stockholm = graphdb.createNode(), gothenburg = graphdb.createNode();
stockholm.setProperty( "name", "Stockholm" );
gothenburg.setProperty( "name", "Gothenburg" );
Node andy = friend( me, graphdb.createNode(), "Andy", 10,
stockholm );
friend( me, graphdb.createNode(), "Bob", 5, stockholm );
Node cecilia = friend( me, graphdb.createNode(), "Cecilia", 2,
stockholm );
andy.createRelationshipTo( cecilia, FriendshipTypes.FRIEND ).setProperty(
"since", yearsAgo( 10 ) );
friend( me, graphdb.createNode(), "David", 10, gothenburg );
return me;
}
Node friend( Node me, Node friend, String name, int knownForYears,
Node place )
{
friend.setProperty( "name", name );
me.createRelationshipTo( friend, FriendshipTypes.FRIEND ).setProperty(
"since", yearsAgo( knownForYears ) );
friend.createRelationshipTo( place, FriendshipTypes.LIVES_IN );
return friend;
}
Calendar calendar = Calendar.getInstance();
long yearsAgo( int years )
{
return new GregorianCalendar( calendar.get( Calendar.YEAR )
- years,
calendar.get( Calendar.MONTH ),
calendar.get( Calendar.DATE ) ).getTime().getTime();
}
} );
Set<String> expected = new HashSet<>( Arrays.asList( "Andy", "Bob" ) );
Iterable<Node> friends = findFriendsSinceSpecifiedTimeInSpecifiedPlace( root, "Stockholm", 3 );
try ( Transaction transaction = graphDb.getGraphDatabaseAPI().beginTx() )
{
for ( Node friend : friends )
{
String name = (String) friend.getProperty( "name", null );
assertNotNull( name );
assertTrue( "Unexpected friend: " + name, expected.remove( name ) );
}
assertTrue( "These friends were not found: " + expected, expected.isEmpty() );
}
}
private int count( Iterable<?> objects )
{
int count = 0;
for ( Object ignore : objects )
{
count++;
}
return count;
}
private interface GraphDefinition<RESULT>
{
RESULT create( GraphDatabaseService graphdb );
}
private <T> T createGraph( GraphDefinition<T> definition )
{
try ( Transaction tx = graphDb.getGraphDatabaseAPI().beginTx() )
{
T result = definition.create( graphDb.getGraphDatabaseAPI() );
tx.success();
return result;
}
}
}