| 1 | |
package org.jbehave.core.steps; |
| 2 | |
|
| 3 | |
import java.util.HashMap; |
| 4 | |
import java.util.Map; |
| 5 | |
|
| 6 | |
|
| 7 | |
|
| 8 | |
|
| 9 | |
|
| 10 | |
public class ChainedRow implements Row { |
| 11 | |
private final Row[] delegates; |
| 12 | |
|
| 13 | 24 | public ChainedRow(Row... delegates) { |
| 14 | 24 | this.delegates = delegates; |
| 15 | 24 | } |
| 16 | |
|
| 17 | |
|
| 18 | |
|
| 19 | |
|
| 20 | |
|
| 21 | |
|
| 22 | |
|
| 23 | |
public Map<String, String> values() { |
| 24 | 27 | Map<String, String> values = new HashMap<String, String>(); |
| 25 | 81 | for (Row each : delegates) { |
| 26 | 54 | for (String name : each.values().keySet()) { |
| 27 | 52 | if (!values.containsKey(name)) { |
| 28 | 51 | values.put(name, each.values().get(name)); |
| 29 | |
} |
| 30 | 52 | } |
| 31 | |
} |
| 32 | 27 | return values; |
| 33 | |
} |
| 34 | |
|
| 35 | |
} |