View Javadoc

1   /**
2    * Copyright (c) 2002-2011 "Neo Technology,"
3    * Network Engine for Objects in Lund AB [http://neotechnology.com]
4    *
5    * This file is part of Neo4j.
6    *
7    * Neo4j is free software: you can redistribute it and/or modify
8    * it under the terms of the GNU General Public License as published by
9    * the Free Software Foundation, either version 3 of the License, or
10   * (at your option) any later version.
11   *
12   * This program is distributed in the hope that it will be useful,
13   * but WITHOUT ANY WARRANTY; without even the implied warranty of
14   * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15   * GNU General Public License for more details.
16   *
17   * You should have received a copy of the GNU General Public License
18   * along with this program.  If not, see <http://www.gnu.org/licenses/>.
19   */
20  package org.neo4j.server.plugins;
21  
22  import org.neo4j.graphdb.DynamicRelationshipType;
23  import org.neo4j.graphdb.RelationshipType;
24  import org.neo4j.kernel.AbstractGraphDatabase;
25  import org.neo4j.server.rest.repr.BadInputException;
26  
27  class RelationshipTypeTypeCaster extends TypeCaster
28  {
29      @Override
30      Object get( AbstractGraphDatabase graphDb, ParameterList parameters, String name )
31              throws BadInputException
32      {
33          String typeName = parameters.getString( name );
34          if ( typeName == null ) return null;
35          return DynamicRelationshipType.withName( typeName );
36      }
37  
38      @Override
39      Object[] getList( AbstractGraphDatabase graphDb, ParameterList parameters, String name )
40              throws BadInputException
41      {
42          String[] strings = parameters.getStringList( name );
43          if ( strings == null ) return null;
44          RelationshipType[] result = new RelationshipType[strings.length];
45          for ( int i = 0; i < result.length; i++ )
46          {
47              result[i] = DynamicRelationshipType.withName( strings[i] );
48          }
49          return result;
50      }
51  }