anchor.diff:  		 Visited,
   		 [],
   		 []),
  -
       Missing1 = NotFnd1 ++ NotFnd2 ++ Missing,
       case Uses ++ Incs of
           [] ->
  
positive.code:                               [make_set(Circular), make_set(Missing)]).
  
  find_all(CheckingApp, [Name | Names], Apps, Visited, Found, NotFound) ->
      case lists:keysearch(Name, #app.name, Apps) of
          {value, #app{info = Info} = App} ->
              %% It is OK to have a dependecy like
              %% X includes Y, Y uses X.
              case lists:member(CheckingApp, Info#app_info.incl_apps) of
                  true ->
  
negative.code:             %% The apps in L must be started before the app.
              %% Check if we have already taken care of some app in L,
              %% in that case we have a circular dependency.
              NewCircular = [N || #app{name = N} <- L, N2 <- Visited, N =:= N2],
              Circular1 = case NewCircular of
                              [] -> Circular;
                              _ -> [Name | NewCircular] ++ Circular
  