Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceReintegration/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/Interfaces/ISpacePartitioningTree.cs @ 14929

Last change on this file since 14929 was 14929, checked in by gkronber, 7 years ago

#2520 fixed unit tests for new persistence: loading & storing all samples

File size: 1.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab 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 * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using HeuristicLab.Common;
23using HeuristicLab.Persistence;
24
25namespace HeuristicLab.Algorithms.DataAnalysis {
26  [StorableType("f7b06152-ce4e-493b-9e0a-5851f20ad83e")]
27  public interface ISpacePartitioningTree {
28
29    int GetDepth();
30    bool Insert(int newIndex);
31    void Subdivide();
32    bool IsCorrect();
33    void GetAllIndices(int[] indices);
34    int GetAllIndices(int[] indices, int loc);
35    void ComputeNonEdgeForces(int pointIndex, double theta, double[] negF, ref double sumQ);
36    void ComputeEdgeForces(int[] rowP, int[] colP, double[] valP, int n, double[,] posF);
37
38  }
39}
Note: See TracBrowser for help on using the repository browser.