Added public modifiers to functions.

StarlangSoftware · Aug 27, 2020 · 683ffe3 · 683ffe3
1 parent 600ed8f
commit 683ffe3
Show file tree

Hide file tree

Showing 4 changed files with 22 additions and 22 deletions.
diff --git a/Sources/DataStructure/Cache/CacheLinkedList.swift b/Sources/DataStructure/Cache/CacheLinkedList.swift
@@ -22,7 +22,7 @@ public class CacheLinkedList<K, T>{
 
     - Parameter cacheNode : CacheNode type input to remove.
     */
-    func removeGiven(cacheNode: CacheNode<K, T>){
+    public func removeGiven(cacheNode: CacheNode<K, T>){
         let previous : CacheNode<K, T>? = cacheNode.getPrevious()
         let next : CacheNode<K, T>? = cacheNode.getNext()
         if previous != nil{
@@ -43,7 +43,7 @@ public class CacheLinkedList<K, T>{
 
     - Parameter cacheNode : CacheNode type input to add to the doubly list.
     */
-    func add(cacheNode: CacheNode<K, T>){
+    public func add(cacheNode: CacheNode<K, T>){
         cacheNode.setPrevious(previous: nil)
         if self.head != nil{
             cacheNode.setNext(next: self.head!)
@@ -61,7 +61,7 @@ public class CacheLinkedList<K, T>{
 
     - Returns: CacheNode type output tail which is removed from doubly list.
     */
-    func remove() -> CacheNode<K, T>{
+    public func remove() -> CacheNode<K, T>{
         let removed : CacheNode<K, T> = self.tail!
         self.tail = self.tail!.getPrevious()
         if self.tail == nil{

diff --git a/Sources/DataStructure/Cache/CacheNode.swift b/Sources/DataStructure/Cache/CacheNode.swift
@@ -33,7 +33,7 @@ public class CacheNode<K, T>{
 
     - Returns: data value.
     */
-    func getData() -> T{
+    public func getData() -> T{
         return self.data
     }
 
@@ -42,7 +42,7 @@ public class CacheNode<K, T>{
 
     - Returns: key value.
     */
-    func getKey() -> K{
+    public func getKey() -> K{
         return self.key
     }
 
@@ -51,7 +51,7 @@ public class CacheNode<K, T>{
 
     - Returns: previous CacheNode.
     */
-    func getPrevious() -> CacheNode?{
+    public func getPrevious() -> CacheNode?{
         return self.previous
     }
 
@@ -60,7 +60,7 @@ public class CacheNode<K, T>{
 
     - Returns: next CacheNode.
     */
-    func getNext() -> CacheNode?{
+    public func getNext() -> CacheNode?{
         return self.next
     }
 
@@ -69,7 +69,7 @@ public class CacheNode<K, T>{
 
     - Parameter previous : previous CacheNode.
     */
-    func setPrevious(previous: CacheNode?){
+    public func setPrevious(previous: CacheNode?){
         self.previous = previous
     }
 
@@ -78,7 +78,7 @@ public class CacheNode<K, T>{
 
     - Parameter: next : next CacheNode.
     */
-    func setNext(next: CacheNode){
+    public func setNext(next: CacheNode){
         self.next = next
     }
 

diff --git a/Sources/DataStructure/Cache/LRUCache.swift b/Sources/DataStructure/Cache/LRUCache.swift
@@ -17,7 +17,7 @@ public class LRUCache<K: Hashable, T>{
     A constructor of LRUCache class which takes cacheSize as input. It creates new CacheLinkedList and
     HashMap.
 
-    - Parameter cacheSize : Integer input funcining cache size.
+    - Parameter cacheSize : Integer input public funcining cache size.
     */
     init(cacheSize: Int){
         self.cacheSize = cacheSize
@@ -33,7 +33,7 @@ public class LRUCache<K: Hashable, T>{
 
     - Returns: true if the HashMap has the given key, false otherwise.
     */
-    func contains(key: K) -> Bool{
+    public func contains(key: K) -> Bool{
         return self.map[key] != nil
     }
 
@@ -47,7 +47,7 @@ public class LRUCache<K: Hashable, T>{
 
     - Returns: data value if the dictionary has the given key, None otherwise.
     */
-    func get(key: K) -> T?{
+    public func get(key: K) -> T?{
         if self.map[key] != nil{
             let cacheNode : CacheNode<K, T> = self.map[key]!
             self.cache.removeGiven(cacheNode: cacheNode)
@@ -68,7 +68,7 @@ public class LRUCache<K: Hashable, T>{
         - key : object type input.
         - data : object type input
     */
-    func add(key: K, data: T){
+    public func add(key: K, data: T){
         if self.map.count == self.cacheSize{
             let removed : CacheNode<K, T> = self.cache.remove()
             self.map[removed.getKey()] = nil

diff --git a/Sources/DataStructure/CounterHashMap.swift b/Sources/DataStructure/CounterHashMap.swift
@@ -22,7 +22,7 @@ public class CounterHashMap<K : Hashable>{
 
      - Parameter key : key to put.
     */
-    func put(key: K){
+    public func put(key: K){
         if data[key] != nil{
             data[key] = data[key]! + 1
         } else{
@@ -39,7 +39,7 @@ public class CounterHashMap<K : Hashable>{
         - key : key to put.
         - N : to increment value.
     */
-    func putNTimes(key: K, N: Int){
+    public func putNTimes(key: K, N: Int){
         if data[key] != nil{
             data[key]! += N
         } else{
@@ -55,15 +55,15 @@ public class CounterHashMap<K : Hashable>{
 
     - Returns: the value corresponding given key, 0 if it is not mapped.
     */
-    func count(key: K) -> Int{
+    public func count(key: K) -> Int{
         if data[key] != nil{
             return data[key]!
         } else {
             return 0
         }
     }
 
-    func size() -> Int{
+    public func size() -> Int{
         return data.count
     }
 
@@ -72,7 +72,7 @@ public class CounterHashMap<K : Hashable>{
 
     - Returns: accumulated counts.
     */
-    func sumOfCounts() -> Int{
+    public func sumOfCounts() -> Int{
         var total : Int = 0
         for key in data.keys{
             total += data[key]!
@@ -91,7 +91,7 @@ public class CounterHashMap<K : Hashable>{
 
     - Returns: object type maxKey if greater than the given threshold, None otherwise.
     */
-    func max(threshold: Double = 0.0) -> K?{
+    public func max(threshold: Double = 0.0) -> K?{
         var maxCount : Int = 0
         var total : Int = 0
         var maxKey : K? = nil
@@ -114,7 +114,7 @@ public class CounterHashMap<K : Hashable>{
 
     - Parameter toBeAdded : CounterHashMap to be added to this counterHashMap.
     */
-    func add(toBeAdded: CounterHashMap){
+    public func add(toBeAdded: CounterHashMap){
         for value in toBeAdded.data.keys{
             self.putNTimes(key: value, N: toBeAdded.data[value]!)
         }
@@ -125,11 +125,11 @@ public class CounterHashMap<K : Hashable>{
     mappings contained in this map and adds each entry to the result list. Then sort this list
     according to their values and returns a list which is a sublist of result with N elements.
 
-    - Parameter N : nteger value for funcining size of the sublist.
+    - Parameter N : nteger value for public funcining size of the sublist.
 
     - Returns: a sublist of N element.
     */
-    func topN(N: Int) -> Array<(item:K, count:Int)>{
+    public func topN(N: Int) -> Array<(item:K, count:Int)>{
         var result : Array<(item:K, count:Int)> = []
         for key in data.keys{
             result.append((key, data[key]!))